![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Sourav Chatterji 1 Sourav Chatterji, Sai Surya Kiran Evani , Sumit Ganguly , Mahesh Datt Yemmanuru : On the Complexity of Approximate Query Optimization. PODS 2002 : 282-292 ![]() DiSC'03 © 2003 Association for Computing Machinery |