{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T05:12:31Z","timestamp":1734066751098,"version":"3.30.2"},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0022-0000(02)00031-4","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T01:27:43Z","timestamp":1049506063000},"page":"98-132","source":"Crossref","is-referenced-by-count":7,"title":["Generalized substring selectivity estimation"],"prefix":"10.1016","volume":"66","author":[{"given":"Zhiyuan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Flip","family":"Korn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Koudas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1999","series-title":"Modern Information Retrieval","author":"Baeza-Yates","key":"10.1016\/S0022-0000(02)00031-4_BIBBYRN99"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBBRO98","unstructured":"A. Broder, On the resemblance and containment of documents, IEEE Compression and Complexity of Sequences, Positano, Salerno, Italy, 1997, pp. 21\u201329."},{"key":"10.1016\/S0022-0000(02)00031-4_BIBBCFM98","doi-asserted-by":"crossref","unstructured":"A. Broder, M. Charikar, A. Frieze, M. Mitzenmacher, Minwise independent permutations, Proceedings of STOC, Dallas, TX, 1998, pp. 327\u2013336.","DOI":"10.1145\/276698.276781"},{"issue":"2","key":"10.1016\/S0022-0000(02)00031-4_BIBCCT00","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0306-4573(99)00017-5","article-title":"Relevance ranking for one to three term queries","volume":"36","author":"Clarke","year":"2000","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/S0022-0000(02)00031-4_BIBCOH97","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1006\/jcss.1997.1534","article-title":"Size-estimation framework with applications to transitive closure and reachability","volume":"55","author":"Cohen","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(02)00031-4_BIBCDF00","doi-asserted-by":"crossref","unstructured":"E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, C. Yang, Finding interesting associations without support prunning, Proceedings of the 16th Annual IEEE Conference on Data Engineering (ICDE 2000), San Diego, CA, February 2000, pp. 489\u2013499.","DOI":"10.1109\/ICDE.2000.839448"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBCKKM00","doi-asserted-by":"crossref","unstructured":"Z. Chen, F. Korn, N. Koudas, S. Muthukrishnan, Selectivity Estimation for Boolean Queries, ACM Principles of Database Systems (PODS), May 2000, Dallas, TX, 216\u2013225.","DOI":"10.1145\/335168.335225"},{"year":"1997","series-title":"A Guide to the SQL Standard","author":"Date","key":"10.1016\/S0022-0000(02)00031-4_BIBDD97"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBHHW97","doi-asserted-by":"crossref","unstructured":"J. Hellerstein, P. Haas, H. Wang, Online Aggregation, Proceedings of SIGMOD \u201997, Tucson, AZ, June 1997.","DOI":"10.1145\/253260.253291"},{"issue":"4","key":"10.1016\/S0022-0000(02)00031-4_BIBIC93","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1145\/169725.169708","article-title":"Optimal histograms for limiting worst-case error propagation in the size of join results","volume":"18","author":"Ioannidis","year":"1993","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBJKNS99","unstructured":"H.V. Jagadish, O. Kapitskaia, R. Ng, D. Srivastava, Multidimensional substring selectivity estimation, Proceedings of VLDB, Edinburgh, Scotland, September 1999, pp. 287\u2013398."},{"key":"10.1016\/S0022-0000(02)00031-4_BIBJKS00","doi-asserted-by":"crossref","unstructured":"H.V. Jagadish, N. Koudas, D. Srivastava, On effective multidimensional indexing for strings, Proceedings of ACM SIGMOD, Dallas, TX, May 2000, pp. 403\u2013414.","DOI":"10.1145\/335191.335434"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBJNS99","doi-asserted-by":"crossref","unstructured":"H.V. Jagadish, R. Ng, D. Srivastava, Substring selectivity estimation, ACM Principles of Database Systems (PODS), Philadelphia, PA, June 1999, pp. 249\u2013260.","DOI":"10.1145\/303976.304001"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBKT00","unstructured":"M. Kobayashi, K. Takeda, Information retrieval on the web: selected topics, IBM research, Tokyo Research Laboratory, IBM, 2000."},{"key":"10.1016\/S0022-0000(02)00031-4_BIBKVI96","doi-asserted-by":"crossref","unstructured":"P. Krishnan, J.S. Vitter, B. Iyer, Estimating alphanumeric selectivity in the presence of wildcards, Proceedings of SIGMOD, Montreal Canada, June 1996, pp. 282\u2013293.","DOI":"10.1145\/233269.233341"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBLOV90","series-title":"Paths, Flows and VLSI Layout","article-title":"Communication complexity: a survey","author":"Lovasz","year":"1990"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBMCC76","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A Space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBMMSZ98","doi-asserted-by":"crossref","unstructured":"Y. Matias, S. Muthukrishnan, S. Cenk Sahinalp, J. Ziv, Augmenting suffix trees, with applications, in: ESA \u201998, Sixth Annual European Symposium, August 1998.","DOI":"10.1007\/3-540-68530-8_6"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBMD98","doi-asserted-by":"crossref","unstructured":"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\u201336.","DOI":"10.1145\/971701.50205"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBMPS99","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-49257-7_16"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBPKF00","doi-asserted-by":"crossref","unstructured":"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\u2013598.","DOI":"10.1109\/ICDE.2000.839457"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBPI97","unstructured":"V. Poosala, Y. Ioannidis, Selectivity estimation without the attribute value independence assumption, Proceedings of VLDB, Athens, Greece, August 1997, pp. 486\u2013495."},{"key":"10.1016\/S0022-0000(02)00031-4_BIBPIHS96","doi-asserted-by":"crossref","unstructured":"V. Poosala, Y. Ioannidis, P. Haas, E. Shekita, Improved histograms for selectivity estimation of range predicates, Proceedings of ACM SIGMOD, Montreal, Canada, June 1996, pp. 294\u2013305.","DOI":"10.1145\/233269.233342"},{"issue":"4","key":"10.1016\/S0022-0000(02)00031-4_BIBST94","first-page":"177","article-title":"PAT expressions","volume":"41","author":"Salminen","year":"1994","journal-title":"Acta Ling. Hung."},{"year":"1983","series-title":"Introduction to Modern Information Retrieval","author":"Salton","key":"10.1016\/S0022-0000(02)00031-4_BIBSM83"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBSHM98","unstructured":"C. Silverstein, M. Henzinger, H. Marais, Analysis of a very large altavista query log, Technical note #1998-014, Digital SRC, October 1998."},{"key":"10.1016\/S0022-0000(02)00031-4_BIBTBS97","doi-asserted-by":"crossref","unstructured":"E. Tanin, R. Beigel, B. Shneiderman, Design and evaluation of incremental data structures and algorithms for dynamic query interfaces, in: Proceedings of IEEE InvoViz \u201997, Phoenix, AZ, October 1997.","DOI":"10.1109\/INFVIS.1997.636790"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBVWSG97","doi-asserted-by":"crossref","unstructured":"B. V\u00e9lez, R. Weiss, M. Sheldon, D. Gifford, Fast and effective query refinement, in: ACM SIGIR\u201997, Philadelphia, PA, July 1997.","DOI":"10.1145\/258525.258528"},{"key":"10.1016\/S0022-0000(02)00031-4_BIBWVI97","doi-asserted-by":"crossref","unstructured":"M. Wang, J.S. Vitter, B. Iyer, Selectivity estimation in the presence of alphanumeric correlations, Proceedings of ICDE, Birmingham, UK, 1997, pp. 169\u2013180.","DOI":"10.1109\/ICDE.1997.581750"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000314?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000314?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:19:39Z","timestamp":1733980779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000002000314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0022000002000314"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(02)00031-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}