Hashed samples: Selectivity estimators for set similarity selection queries

Proceedings of the VLDB Endowment

Volumn 1, Issue 1, 2008, Pages 201-212

  Hadjieleftheriou, Marios ^a   Yu, Xiaohui ^b   Koudas, Nick ^c   Srivastava, Divesh ^a  

^a AT AND T LABS RESEARCH   (United States)

^b YORK UNIVERSITY   (Canada)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COSINE SIMILARITY; DISTINCT VALUE ESTIMATIONS; ORDERS OF MAGNITUDE; RANDOM SAMPLING; REAL-TIME SAMPLING; SELECTIVITY ESTIMATION; SELECTIVITY ESTIMATOR; SIMILARITY MEASURE;

QUERY PROCESSING;

EID: 70349659026     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453883     Document Type: Article

References (33)

1. N. Alon, M. Dietzfelbinger, P. B. Miltersen, E. Petrank, and G. Tardos. Linear hash functions. Journal of the ACM (JACM), 46(5):667-683, 1999.
2. A. Arasu, V. Ganti, and R. Kaushik. Efficient exact set-similarity joins. In Proc. of Very Large Data Bases (VLDB), pages 918-929, 2006.
3. AT&T Inc. Business listings from YellowPages.com. proprietary.
4. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, May 1999.
5. R. A. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127-158, 1999.
6. K. Beyer, P. J. Haas, B. Reinwald, Y. Sismanis, and R. Gemulla. On synopses for distinct-value estimation under multiset operations. In Proc. of ACM Management of Data (SIGMOD), pages 199-210, 2007.
7. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Learnability and the vapnik-chervonenkis dimension. Journal of the ACM (JACM), 36(4):929-965, 1989.
8. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143-154, 1979.
9. A. Chandel, O. Hassanzadeh, N. Koudas, M. Sadoghi, and D. Srivastava. Benchmarking declarative approximate selection predicates. In Proc. of ACM Management of Data (SIGMOD), pages 353-364, 2007.
10. M. Charikar, S. Chaudhuri, R. Motwani, and V. Narasayya. Towards estimation error guarantees for distinct values. In Proc. of ACM Symposium on Principles of Database Systems (PODS), pages 268-279, 2000.
11. S. Chaudhuri, G. Das, and U. Srivastava. Effective use of block-level sampling in statistics estimation. In Proc. of ACM Management of Data (SIGMOD), pages 287-298, 2004.
12. S. Chaudhuri, V. Ganti, and L. Gravano. Selectivity estimation for string predicates: Overcoming the underestimation problem. In Proc. of International Conference on Data Engineering (ICDE), pages 227-238, 2004.
13. S. Chaudhuri, V. Ganti, and R. Kaushik. A primitive operator for similarity joins in data cleaning. In Proc. of International Conference on Data Engineering (ICDE), page 5, 2006.
14. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31(2):182-209, 1985.
15. L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In Proc. of Very Large Data Bases (VLDB), pages 491-500, 2001.
16. S. Guha, N. Koudas, D. Srivastava, and X. Yu. Reasoning about approximate match query results. In Proc. of International Conference on Data Engineering (ICDE), pages 8-18, 2006.
17. P. J. Haas and C. König. A bi-level bernoulli scheme for database sampling. In Proc. of ACM Management of Data (SIGMOD), pages 275-286, 2004.
18. M. Hadjieleftheriou, A. Chandel, N. Koudas, and D. Srivastava. Fast indexes and algorithms for set similarity selection queries. In Proc. of International Conference on Data Engineering (ICDE), 2008.
19. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. In Proc. of Annual Symposium on Computational Geometry (SCG), pages 61-71, 1986.
20. IMDB. IMDB database. http://www.imdb.com/interfaces.
21. H. V. Jagadish, O. Kapitskaia, R. T. Ng, and D. Srivastava. One-dimensional and multi-dimensional substring selectivity estimation. The VLDB Journal, 9(3):214-230, 2000.
22. L. Jin and C. Li. Selectivity estimation for fuzzy string predicates in large data sets. In Proc. of Very Large Data Bases (VLDB), pages 397-408, 2005.
23. H. Lee, R. Ng, and K. Shim. Extending q-grams to estimate selectivity of string matching with low edit distance. In Proc. of Very Large Data Bases (VLDB), pages 195-205, 2007.
24. M. Ley. DBLP database. http://dblp.uni-trier.de/xml.
25. A. Mazeika, M. H. Böhlen, N. Koudas, and D. Srivastava. Estimating the selectivity of approximate string queries. ACM Transactions on Database Systems (TODS), 32(2):12, 2007.
26. F. Olken. Random sampling from databases. PhD thesis, University of California, Berkeley, CA, 1993.
27. V. Poosala, P. J. Haas, Y. E. Ioannidis, and E. J. Shekita. Improved histograms for selectivity estimation of range predicates. In Proc. of ACM Management of Data (SIGMOD), pages 294-305, 1996.
28. S. C. Sahinalp, M. Tasan, J. Macker, and Z. M. Özsoyoglu. Distance based indexing for string proximity search. In Proc. of International Conference on Data Engineering (ICDE), pages 125-136, 2003.
29. S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In Proc. of ACM Knowledge Discovery and Data Mining (SIGKDD), pages 269-278, 2002.
30. S. Sarawagi and A. Kirpal. Efficient set joins on similarity predicates. In Proc. of ACM Management of Data (SIGMOD), pages 743-754, 2004.
31. S. Tata and J. M. Patel. Estimating the selectivity of tf-idf based cosine similarity predicates. SIGMOD Record, 36(2):7-12, 2007.
32. V. N. Vapnik and A. Y. Chrervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. SIAM: Theory of Probability and its Applications (TPA), 16(2):264-280, 1971.
33. J. S. Vitter. Random sampling with a reservoir. ACM Transactions on Mathematical Software, 11(1):37-57, 1985