Space-efficient framework for top-k string retrieval problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 713-722

  Hon, Wing Kai ^a   Shah, Rahul ^b   Vitter, Jeffrey Scott ^c  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b Louisiana State University   (United States)

^c TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Document retrieval; Succinct data structures; Text indexing; Top k queries

Indexed keywords

DOCUMENT RETRIEVAL; FORMAL FRAMEWORK; INVERTED INDICES; LINEAR SPACES; OPTIMAL QUERY; QUERY PATTERNS; RELEVANT DOCUMENTS; SCORE FUNCTION; SPACE UTILIZATION; SUCCINCT DATA STRUCTURE; SUFFIX ARRAYS; SUFFIX-TREES; TEXT-INDEXING; TOP-K QUERY; TOTAL LENGTH;

COMPUTER SCIENCE; DATA STRUCTURES; FIBER OPTIC CHEMICAL SENSORS; INDEXING (OF INFORMATION); OPTIMIZATION; PATTERN MATCHING; TREES (MATHEMATICS);

INFORMATION RETRIEVAL;

EID: 77952349728     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.19     Document Type: Conference Paper

References (36)

1. N. Ailon, M. Charikar, and A. Newman, "Aggregating Inconsistent Information: Ranking and Clustering," in Proceedings of Symposium on Theory of Computing, 2005, pp. 684-693.
2. J. Barbay, M. He, J. I. Munro, and S. S. Rao, "Succinct Indexes for Strings, Binary Relations and Multi-labelled Trees," in Proceedings of Symposium on Discrete Algorithms, 2007, pp. 680-689.
3. M. A. Bender and M. Farach-Colton, "The LCA Problem Revisited," in Proceedings of Latin American Symposium on Theoretical Informatics, 2000, pp. 88-94.
4. I. Bialynicka-Birula and R. Grossi, "Rank-Sensitive Data Structures," in Proceedings of International Symposium on String Processing and Information Retrieval, 2005, pp. 79-90.
5. M. R. Brown and R. E. Tarjan, "A Fast Merging Algorithms," Journal of the ACM, vol. 26, no. 2, pp. 211-226, 1979.
6. M. Burrows and D. J. Wheeler, "A Block-sorting Lossless Data Compression Algorithm," Digital Equipment Corporation, Paolo Alto, CA, USA, Tech. Rep. 124, 1994.
7. S. Chakrabarti, K. Puniyani, and S. Das, "Optimizing Scoring Functions and Indexes for Proximity Search in Type-Annotated Corpora," in Proceedings of International Conference on World Wide Web, 2006, pp. 717-726.
8. B. Chazelle, "A Functional Approach to Data Structures and Its Use in Multidimensional Searching," SIAM Journal on Computing, vol. 17, no. 3, pp. 427-462, 1988.
9. R. Fagin, A. Lotem, and M. Naor, "Optimal Aggregation Algorithms for Middleware," in Proceedings of Symposium on Principles of Database Systems, 2001.
10. P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan, "Structuring Labeled Trees for Optimal Succinctness, and Beyond," in Proceedings of Symposium on Foundations of Computer Science, 2005, pp. 184-196.
11. P. Ferragina and G. Manzini, "Indexing Compressed Text," Journal of the ACM, vol. 52, no. 4, pp. 552-581, 2005, a preliminary version appears in FOCS'00.
12. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro, "Compressed Representations of Sequences and Full-Text Indexes," ACM Transactions on Algorithms, vol. 3, no. 2, 2007.
13. J. Fischer and V. Heun, "A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array," in Proceedings of Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, 2007, pp. 459-470.
14. J. Fischer, V. Heun, and H. M. Stühler, "Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries," in Proceedings of Data Compression Conference, 2008, pp. 272-281.
15. J. Fischer, V. Mäkinen, and N. Välimäki, "Space Efficient String Mining under Frequency Constraints," in Proceedings of International Conference on Data Mining, 2008, pp. 193-202.
16. H. Gabow, J. L. Bentley, and R. E. Tarjan, "Scaling and Related Techniques for Geometry Problems," in Proceedings of Symposium on Theory of Computing, 1984, pp. 135-143.
17. R. Grossi and J. S. Vitter, "Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching," SIAM Journal on Computing, vol. 35, no. 2, pp. 378-407, 2005, a preliminary version appears in STOC'00.
18. I. F. Ilyas, G. Beskales, and M. A. Soliman, "A Survey of Top-K Query Processing Techniques in Relational Database Systems," ACM Computing Surveys, vol. 40, no. 4, 2008.
19. D. E. Knuth, J. H. Morris, and V. B. Pratt, "Fast Pattern Matching in Strings," SIAM Journal on Computing, vol. 6, no. 2, pp. 323-350, 1977.
20. V. Mäkinen, G. Navarro, J. Siren, and N. Välimäki, "Storage and Retrieval of Individual Genomes," in Proceedings of International Conference on Computational Molecular Biology, 2009.
21. U. Manber and G. Myers, "Suffix Arrays: A New Method for On-Line String Searches," SIAM Journal on Computing, vol. 22, no. 5, pp. 935-948, 1993.
22. Y. Matias, S. Muthukrishnan, S. C. Sahinalp, and J. Ziv, "Augmenting Suffix Trees, with Applications," in Proceedings of European Symposium on Algorithms, 1998, pp. 67-78.
23. E. M. McCreight, "A Space-economical Suffix Tree Construction Algorithm," Journal of the ACM, vol. 23, no. 2, pp. 262-272, 1976.
24. -, "Priority Search Trees," SIAM Journal on Computing, vol. 14, no. 2, pp. 257-276, 1985.
25. S. Muthukrishnan, "Efficient Algorithms for Document Retrieval Problems," in Proceedings of Symposium on Discrete Algorithms, 2002, pp. 657-666.
26. G. Navarro and V. Mäkinen, "Compressed Full-Text Indexes," ACM Computing Surveys, vol. 39, no. 1, 2007.
27. L. Page, S. Brin, R. Motwani, and T. Winograd, "The PageR-ank Citation Ranking: Bringing Order to the Web," Stanford InfoLab, Technical Report 1999-66, November 1999.
28. S. J. Puglisi, W. F. Smyth, and A. Turpin, "Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory," in Proceedings of International Symposium on String Processing and Information Retrieval, 2006, pp. 122-133.
29. K. Sadakane, "New text indexing functionalities of the compressed suffix arrays," Journal of Algorithms, vol. 48, no. 2, pp. 294-313, 2003, a preliminary version appears in ISAAC 2000.
30. -, "Compressed Suffix Trees with Full Functionality," Theory of Computing Systems, pp. 589-607, 2007.
31. -, "Succinct Data Structures for Flexible Text Retrieval Systems," Journal of Discrete Algorithms, vol. 5, no. 1, pp. 12-22, 2007.
32. K. Schnaitter and N. Polyzotis, "Evaluating Rank Joins with Optimal Cost," in Proceedings of Symposium on Principles of Database Systems, 2008, pp. 43-52.
33. R. Shah and M. Farach-Colton, "Undiscretized Dynamic Programming: Faster Algorithms for Facility Location and Related Problems on Trees," in Proceedings of Symposium on Discrete Algorithms, 2002, pp. 108-115.
34. N. Välimäki and V. Mäkinen, "Space-Efficient Algorithms for Document Retrieval," in Proceedings of Symposium on Combinatorial Pattern Matching, 2007, pp. 205-215.
35. P. Weiner, "Linear Pattern Matching Algorithms," in Proceedings of Symposium on Switching and Automata Theory, 1973, pp. 1-11.
36. I. Witten, A. Moffat, and T. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images. Los Altos, CA, USA: Morgan Kaufmann Publishers, 1999.