Indexing text data under space constraints

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2004, Pages 198-207

  Hore, Bijit ^a   Hacigumus, Hakan ^b   Mehrotra, Sharad ^a   Iyer, Bala ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

B tree; Index; Like queries; Q grams; SQL

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATABASE SYSTEMS; INDEXING (OF INFORMATION); QUERY LANGUAGES; SET THEORY;

B-TREE; INDEX; LIKE QUERIES; Q-GRAM; SQL;

TEXT PROCESSING;

EID: 18744405413     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1031171.1031212     Document Type: Conference Paper

References (28)

1. J. Cho and S. Rajagopalan. A Fast Regular Expression Indexing Engine. In Proc. of ICDE, 2002.
2. Digital Bibliography & Library Project. http://dblp.uni-trier.de/.
3. Khuller,S., Moss, A., and Naor, J. The Budgeted Maximum Coverage Problem. IPL, V 70. Num 1: 39-45, 1999.
4. E. Ukkonen. Online construction of Suffix-trees. Algorithmica, 1993.
5. L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, L. Pietarinen, and D. Srivastava. Using q-grams in a dbms for approximate string processing. IEEE Data Engineering Bulletin, 24(4):28-34, 2001.
6. 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 VLDB, pages 491-500, 2001.
7. Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H., Rivals, E., Vingron, M. q-gram based Database Searching Using Suffix Array (QUASAR) RECOMB, 1999, pp. 77-83.
8. Hore, B., Hacigumus, H., Iyer, B., Mehrotra, S. Indexing Text Data under Space Constraints TR-DB-04-08, www-db.ics.uci.edu/pages/publications/index.shtml
9. D. S. Hochbaum. Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems. Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, 1996.
10. D. S. Hochbaum and A. Pathria. Analysis of the Greedy Approach in Problems of Maximum k-Coverage. Naval Research Quarterly, (45):615-627, 1998.
11. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
12. S. Chaudhury. Compressing SQL Workloads. ACM SIGMOD 2002
13. Garey, M. R, Johnson, D. S. Computers and Intractability: A Guide to Theory of NP-Completeness. Freeman, San Francisco, 1979.
14. Bayer, R., and Unteraurer, K. Prefix B-trees ACM Trans. Database System. 2(19.77), pp 11-26.
15. Bayer, R., and McCreight, C. Organization and maintenance of large ordered indexes Acta Informatica, 1972, pp173-189.
16. Ferragina, P., and Grossi, R. A fully-dynamic data structure for external substring search. ACM STOC, 1995, pp 693-702.
17. Hopcroft, J., E., and Ullman, D. Introduction to automata theory, languages and computation. Addison-Wesley, 1979.
18. Baeza-Yates, R., and Gonnet, G, H. Fast text searching for regular expressions or automaton searching on Tries. JACM, Vol 43, 1996, pp. 915-936.
19. Crochemore, M., Hancart, C. Automata for Matching Patterns, Handbook of formal languages. Rosenberg, C., and Salaama, A. eds 2, Springer-Verlag, 1997, pp. 399-462
20. Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M., T., and Seiferas, J. The smallest automaton recognizing the subwords of a text. Theoretical computer science, 40(1), 1985, pp. 31-55.
21. Aho, A, V., and Corasick, M, J. Efficient String matching : an aid to bibliographic search. Comm. ACM. 1975, pp. 332-340.
22. McCreight, E., M. A space efficient suffix-tree construction algorithm. J. ACM 23, 1976, op. 262-272.
23. Manber, U., and Myers, G. suffix Arrays a new method for on-line string searches. Siam Journal on Computing 22, 1993, pp. 935-948.
24. Knuth, D., E. The Art of Computer Programming. Addison-Wesley, 1973 Vol 3: Sorting and Searching.
25. Salton, G. Automatic Text Processing. Addison-Wesley, 1989.
26. Chan, C., Y, and Ioannidis, Y., E. Bitmap Index Desing and Evaluation. ACM SIGMOD 1998. pp 355-366.
27. Gray, J., Reuters, A. Transaction Processing: Concepts and Techniques. Morgan Kaufmann Pub. 1993.
28. Chakrabarti, K., Mehrotra, S. Efficient Concurrency Control in Multidimensional Access methods. SIGMOD, 1999, pp 25-36.