Generalized substring selectivity estimation

Journal of Computer and System Sciences

Volumn 66, Issue 1, 2003, Pages 98-132

  Chen, Zhiyuan ^a   Korn, Flip ^b   Koudas, Nick ^b   Muthukrishnan, S ^b  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; ESTIMATION; PROBABILITY; QUERY LANGUAGES; WORLD WIDE WEB;

SELECTIVITY ESTIMATION;

RELATIONAL DATABASE SYSTEMS;

EID: 0038605881     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00031-4     Document Type: Article

References (29)

1. [BYRN99] R. Baeza-Yates, B. Ribeiro-Neto, Modern Information Retrieval, Addison-Wesley, Reading, MA, 1999
2. [Bro98] A. Broder, On the resemblance and containment of documents, IEEE Compression and Complexity of Sequences, Positano, Salerno, Italy, 1997, pp. 21-29.
3. [BCFM98] A. Broder, M. Charikar, A. Frieze, M. Mitzenmacher, Minwise independent permutations, Proceedings of STOC, Dallas, TX, 1998, pp. 327-336.
4. [CCT00] C. Clarke, G. Cormack, E.A. Tudhope, Relevance ranking for one to three term queries, Inf. Process, Manage, 36 (2) (2000) 291-311.
5. [Coh97] E. Cohen, Size-estimation framework with applications to transitive closure and reachability, J. Comput. System Sci. 55 (1997) 441-453.
6. [CDF 00] E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, C. Yang, Finding interesting associations without support pruning, Proceedings of the 16th Annual IEEE Conference on Data Engineering (ICDE 2000), San Diego, CA, February 2000, pp. 489-499.
7. [CKKM00] Z. Chen, F. Korn, N. Koudas, S. Muthukrishnan, Selectivity Estimation for Boolean Queries, ACM Principles of Database Systems (PODS). May 2000, Dallas, TX, 216-225.
8. [DD97] C.J. Date, H. Darwen, A Guide to the SQL Standard Addison-Wesley, New York, 1997.
9. [HHW97] J. Hellerstein, P. Haas, H. Wang, Online Aggregation, Proceedings of SIGMOD '97. Tueson, AZ, June 1997.
10. [IC93] Y. loannidis, S. Christodoulakis, Optimal histograms for limiting worst-case error propagation in the size of join results. ACM Trans. Database Systems 18 (4) (1993) 709-748.
11. [JKNS99] H.V. Jagadish, O. Kapitskaia, R. Ng. D. Srivastava, Multidimensional substring selectivity estimation, Proceedings of VLDB, Edinburgh, Scotland, September 1999, pp. 287-398.
12. [JKS00] H.V. Jagadish, N. Koudas, D. Srivastava, On effective multidimensional indexing for strings, Proceedings of ACM SIGMOD, Dallas, TX, May 2000, pp. 403-414.
13. [JNS99] H.V. Jagndish, R. Ng, D. Srivastava, Substring selectivity estimation, ACM Principles of Database Systems (PODS), Philadelphia, PA, June 1999, pp. 249-260.
14. [KT00] M. Kobayashi, K. Takeda, Information retrieval on the web: selected topics, IBM research, Tokyo Research Laboratory, IBM, 2000.
15. [KVI96] P. Krishnan, J.S. Vitter, B. lyer, Estimating alphanumeric selectivity in the presence of wildcards.Proceedings of SIGMOD, Montreal Canada, June 1996, pp. 282-293.
16. [Lov90] L. Lovasz, Communication complexity: a survey, in: B. Korte, L. Lovasz, H. Promel, A. Sehrijver (Eds.), Paths, Flows and VLSI Layout, Springer, Verlag, Berlin, 1990.
17. [MCC76] E.M. McCreight, A Space-economical suffix tree construction algorithm, J. ACM 23 (1976) 262-272.
18. [MMSZ98] Y. Matias, S. Muthukrishnan, S. Cenk Sahinalp, J. Ziv, Augmenting suffix trees, with applications, in: ESA '98, Sixth Annual European Symposium, August 1998.
19. [MD98] M. Muralikrishna, D.J. DeWitt, Equi-depth histograms for estimating selectivity factors for multidimensional queries, Proceedings of ACM SIGMOD, Chicago, IL, June 1988, pp. 28-36.
20. [MPS99] S. Muthukrishnan, V. Poosala, T. Suel, Partitioning two dimensional arrays: algorithms, complexity and applications, Proceedings of the International Conference on Database Theory, Jerusalem, Israel, 1999.
21. [PKF00] B.-U, Pagel, F. Korn, C. Faloutsos, Deflating the dimensionality curse using multiple fractal dimensions, in: Proceedings of ICDE 2000, San Diego, CA, February 2000, pp. 589-598.
22. [PI97] V. Poosala, Y. loannidis, Selectivity estimation without the attribute value independence assumption, Proceedings of VLDB, Athens, Greece, August 1997, pp. 486-495.
23. [PIHS96] V. Poosala, Y. loannidis, P. Haas, E. Shekita, Improved histograms for selectivity estimation of range predicates, Proceedings of ACM SIGMOD, Montreal, Canada, June 1996, pp. 294-305.
24. [ST94] A. Salminen, F.W. Tompa, PAT expressions: an algebra for text search, Acta Ling, Hung, 41 (4) (1994) 177-306.
25. [SM83] G. Salton, M.J. McGill, Introduction to Modern Information Retrieval, McGraw-Hill, New York, 1983.
26. [SHM98] C. Silverstein, M. Henzinger, H. Marais, Analysis of a very large altavista query log. Technical note #1998-014, Digital SRC, October 1998.
27. [TBS97] E. Tanin, R. Beigel, B. Shneiderman, Design and evaluation of incremental data structures and algorithms for dynamic query interfaces, in: Proceedings of IEEE InvoViz '97, Phoenix, AZ, October 1997.
28. [VWSG97] B. Vélez, R. Weiss, M. Sheldon, D. Gifford, Fast and effective query refinement, in: ACM SIGIR'97, Philadelphia, PA, July 1997.
29. [WVI97] M. Wang, J.S. Vitter, B. lyer, Selectivity estimation in the presence of alphanumeric correlations, Proceedings of ICDE, Birmingham, UK, 1997, pp. 169-180.