Sourav Chatterji, Sai Surya Kiran Evani, Sumit Ganguly, Mahesh Datt Yemmanuru. On the Complexity of Approximate Query Optimization. In Lucian Popa, editor, Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, Madison, Wisconsin, USA. pages 282-292, ACM, 2002. [doi]
@inproceedings{ChatterjiEGY02,
title = {On the Complexity of Approximate Query Optimization},
author = {Sourav Chatterji and Sai Surya Kiran Evani and Sumit Ganguly and Mahesh Datt Yemmanuru},
year = {2002},
doi = {10.1145/543613.543650},
url = {http://doi.acm.org/10.1145/543613.543650},
tags = {optimization},
researchr = {https://researchr.org/publication/ChatterjiEGY02},
cites = {0},
citedby = {0},
pages = {282-292},
booktitle = {Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, Madison, Wisconsin, USA},
editor = {Lucian Popa},
publisher = {ACM},
}