Inverted indexes for phrases and strings

SIGIR'11 - Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval

Volumn , Issue , 2011, Pages 555-564

  Patil, Manish ^a   Thankachan, Sharma V ^a   Shah, Rahul ^a   Hon, Wing Kai ^b   Vitter, Jeffrey Scott ^c   Chandrasekaran, Sabrina ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^c University of Kansas   (United States)

Author keywords

Algorithms; Experimentation

Indexed keywords

ALGORITHMS; DATA STRUCTURES; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL;

COMPRESSION TECHNIQUES; DOCUMENT COLLECTION; EXPERIMENTATION; INVERTED INDICES; RELEVANCE METRICS; SPACE REQUIREMENTS; SPACE UTILIZATION; SUCCINCT DATA STRUCTURE;

DIGITAL STORAGE;

EID: 80052126396     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2009916.2009992     Document Type: Conference Paper

References (38)

1. V. Anh and A. Moffat. Pruned Query Evaluation using Pre-computed Impacts. In ACM SIGIR, pages 372-379, 2006.
2. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, 1999.
3. D. Bahle, H. E. Williams, and J. Zobel. Compaction Techniques for Nextword Indexes. In SPIRE, pages 33-45, 2001.
4. D. Bahle, H. E. Williams, and J. Zobel. Optimised Phrase Querying and Browsing of Large Text Databases. In ACSC, pages 11-19, 2001.
5. M. A. Bender and M. Farach-Colton. The Level Ancestor Problem Simplified. Theoretical Computer Science, 321(1):5-12, 2004.
6. R. Cánovas and G. Navarro. Practical Compressed Suffix Trees. In SEA, pages 94-105, 2010.
7. B. Chazelle. A Functional Approach to Data Structures and Its Use in Multidimensional Searching. SIAM Journal on Computing, 17(3):427-462, 1988.
8. J. S. Culpepper, G. Navarro, S. J. Puglisi, and A. Turpin. Top-k Ranked Document Search in General Text Databases. In ESA, pages 194-205, 2010.
9. J. Fischer and V. Heun. A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. In ESCAPE, pages 459-470, 2007.
10. J. Fischer, V. Heun, and H. M. Stühler. Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. In IEEE DCC, pages 272-281, 2008.
11. J. Fischer, V. Mäkinen, and G. Navarro. Faster Entropy-Bounded Compressed Suffix Trees. In Theoretical Computer Science, pages 5354-5364, 2009.
12. T. Gagie, G. Navarro, and S. J. Puglisi. Colored Range Queries and Document Retrieval. In SPIRE, pages 67-81, 2010.
13. R. Grossi, A. Gupta, and J. S. Vitter. High-Order Entropy-Compressed Text Indexes. In ACM-SIAM SODA, pages 841-850, 2003.
14. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM Journal on Computing, 35(2):378-407, 2005.
15. A. Gupta, W. K. Hon, R. Shah, and J. S. Vitter. Compressed Data Structures: Dictionaries and Data-Aware Measures. Theoretical Computer Science, 387(3):313-331, 2007. (Pubitemid 47633447)
16. W. K. Hon, M. Patil, R. Shah, and S. B. Wu. Efficient Index for Retrieving Top-k Most Frequent Documents. Journal on Discrete Algorithms, 8(4):402-417, 2010.
17. W. K. Hon, R. Shah, S. V. Thankachan, and J. S. Vitter. String Retrieval for Multi-pattern Queries. In SPIRE, pages 55-66, 2010.
18. W. K. Hon, R. Shah, and J. S. Vitter. Space-Efficient Framework for Top-k String Retrieval Problems. In IEEE FOCS, pages 713-722, 2009.
19. F. K. Hwang and S. Lin. A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal of Computing, 1(1):31-39, 1972.
20. M. Karpinski and Y. Nekrich. Top-K Color Queries for Document Retrieval. In ACM-SIAM SODA, pages 401-411, 2011.
21. Y. Matias, S. Muthukrishnan, S. C. Sahinalp, and J. Ziv. Augmenting Suffix Trees, with Applications. In ESA, pages 67-78, 1998. (Pubitemid 128117044)
22. J. I. Munro. Tables. In FSTTCS, pages 37-42, 1996.
23. J. I. Munro, V. Raman, and S. S. Rao. Space Efficient Suffix Trees. In FSTTCS, pages 186-196, 1998.
24. S. Muthukrishnan. Efficient Algorithms for Document Retrieval Problems. In ACM-SIAM SODA, pages 657-666, 2002.
25. G. Navarro and S. J. Puglisi. Dual-Sorted Inverted Lists. In SPIRE, pages 309-321, 2010.
26. E. Ohlebusch, J. Fischer, and S. Gog. CST++. In SPIRE, pages 322-333, 2010.
27. E. Ohlebusch and S. Gog. A Compressed Enhanced Suffix Array Supporting Fast String Matching. In SPIRE, pages 51-62, 2009.
28. M. Persin, J. Zobel, and R. S. Davis. Filtered Document Retrieval with Frequency-Sorted Indexes. Journal of the American Society for Information Science, 47(10):749-764, 1996. (Pubitemid 126607666)
29. R. Raman, V. Raman, and S. S. Rao. Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees and Multisets. In ACM-SIAM SODA, pages 233-242, 2002.
30. L. Russo, G. Navarro, and A. Oliveira. Fully-Compressed Suffix Trees. In LATIN, pages 362-373, 2008. (Pubitemid 351632202)
31. K. Sadakane. Space-Efficient Data Structures for Flexible Text Retrieval Systems. In ISAAC, pages 14-24, 2002.
32. K. Sadakane. Compressed Suffix Trees with Full Functionality. Theory of Computing Systems, pages 589-607, 2007.
33. N. Välimäki and V. Mäkinen. Space-Efficient Algorithms for Document Retrieval. In CPM, pages 205-215, 2007.
34. N. Välimäki, V. Mäkinen, W. Gerlach, and K. Dixit. Engineering a Compressed Suffix Tree Implementation. ACM Journal of Experimental Algorithmics, 14, 2009.
35. P. Weiner. Linear Pattern Matching Algorithms. In SWAT, pages 1-11, 1973.
36. H. E. Williams, J. Zobel, and P. Anderson. What's Next? Index Structures for Efficient Phrase Querying. In ADC, pages 141-152, 1999.
37. H. E. Williams, J. Zobel, and D. Bahle. Fast Phrase Querying with Combined Indexes. ACM Transactions on Information Systems, 22(4):573-594, 2004.
38. J. Zobel and A. Moffat. Inverted Files for Text Search Engines. ACM Computing Surveys, 38(2), 2006.