Graph-based synopses for relational selectivity estimation

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2006, Pages 205-216

  Spiegel, Joshua ^a   Polyzotis, Neoklis ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation; Relational; Selectivity; Synopses

Indexed keywords

STORAGE BUDGET; SYNOPSES; SYNTHETIC DATA;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; DATABASE SYSTEMS; QUERY PROCESSING;

GRAPH THEORY;

EID: 34250684642     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142473.1142497     Document Type: Conference Paper

References (17)

1. A. Aboulnaga and S. Chaudhuri. Self-Tuning Histograms: Building histograms without looking at data. In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, 1999.
2. S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy. Join Synopses for Approximate Query Answering. In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, 1999.
3. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, 1998.
4. N. Alon, Y. Matias, and M. Szegedy. The Space Complexity of Approximating the Frequency Moments. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 1996.
5. K. Chakrabarti, M. Garofalakis, R. Rastogi, and K. Shim. Approximate Query Processing Using Wavelets. In Proceedings of the 26th Intl. Conf. on Very Large Data Bases, 2000.
6. S. Chaudhuri, R. Motwani, and V. Narasayya. On Random Sampling over Joins. In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, 1999.
7. G. Cormode and S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. J. Algorithms, 55(1), 2005.
8. A. Deshpande, M. Garofalakis, and R. Rastogi. Independence is Good: Dependency-Based Histogram Synopses for High-Dimensional Data. In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, 2001.
9. A. Dobra, M. Garofalakis, J. Gehrke, and R. Rastogi. Processing Complex Aggregate Queries over Data Streams. In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, 2002.
10. S. Ganguly, P. B. Gibbons, Y. Matias, and A. Silberschatz. Bifocal Sampling for Skew-Resistant Join Size Estimation. In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, 1996.
11. L. Getoor, B. Taskar, and D. Koller. Selectivity Estimation using Probabilistic Models. In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, 2001.
12. R. J. Lipton, J. F. Naughton, D. A. Schneider, and S. Seshadri. Efficient sampling strategies for relational database operations. Theoretical Computer Science, 116(1 & 2), 1993.
13. Y. Matias, J. S. Vitter, and M. Wang. Wavelet-Based Histograms for Selectivity Estimation. In Proceedings of the 1998 ACM SIGMOD Intl. Conf. on Management of Data, 1998.
14. N. Polyzotis, M. Garofalakis, and Y. Ioannidis. Approximate XML Query Answers. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004.
15. V. Poosala, Y. E. Ioannidis, P. J. Haas, and E. J. Shekita. Improved Histograms for Selectivity Estimation of Range Predicates. In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, 1996.
16. J. Spiegel and N. Polyzotis. Graph-Based Synopses for Relational Selectivity Estimation. Technical report, Univ. of California Santa Cruz, 2006.
17. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases. In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, 1996.