Top-k document retrieval in optimal time and linear space

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 1066-1077

  Navarro, Gonzalo ^a   Nekrich, Yakov ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ALPHABET SIZE; DOCUMENT RETRIEVAL; LINEAR SPACES; MINIMAL DISTANCE; OPTIMAL TIME; QUERY PATTERNS; RELEVANCE MEASURE; RELEVANT DOCUMENTS;

DATA STRUCTURES;

EID: 84860191488     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.84     Document Type: Conference Paper

References (39)

1. A. Andersson, M. Thorup, Dynamic Ordered Sets with Exponential Search Trees, Journal of the ACM 54(3), 13 (2007).
2. V. Anh and A. Moffat, Pruned Query Evaluation using Pre-computed Impacts, Proc. 29th SIGIR, 372-379 (2006).
3. R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval, 2nd edition, Addison-Wesley (2010).
4. D. Belazzougui and G. Navarro, Improved Compressed Indexes for Full-Text Document Retrieval, Proc. 18th SPIRE, 386-397 (2011).
5. D. Belazzougui and G. Navarro, Alphabet-Independent Compressed Text Indexing, Proc. 19th ESA, 748-759 (2011).
6. M. Bender and M. Farach-Colton, The LCA Problem Revisited, Proc. 4th LATIN, 88-94 (2000).
7. A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht, Complete Inverted Files for Efficient Text Retrieval and Analysis, Journal of the ACM 34 (1987).
8. G. S. Brodai, R. Fagerberg, M. Greve, A. Lopez-Ortiz, Online Sorted Range Reporting, Proc. 20th ISAAC, 173-182 (2009).
9. T. M. Chan, K. Larsen, M. Pǎ;traşcu, Orthogonal Range Searching on the RAM, Revisited, Proc. SoCG, 1-10 (2011).
10. B. Chazelle, A Functional Approach to Data Structures and its Use in Multidimensional Searching, SIAM Journal on Computing 17, 427-462 (1988).
11. S. Culpepper, G. Navarro, S. Puglisi, and A. Turpin. Top-k Ranked Document Search in General Text Databases, Proc. 18th ESA, 194-205 (part II) (2010).
12. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Compressed Representations of Sequences and Full-Text Indexes, ACM Transactions on Algorithms 3(2):article 20 (2007).
13. J. Fischer, Optimal Succinctness for Range Minimum Queries, Proc. 9th LATIN, 158-169 (2010).
14. H. N. Gabow, J. L. Bentley, R. E. Tarjan, Scaling and Related Techniques for Geometry Problems, Proc. 16th STOC, 135-143 (1984).
15. T. Gagie, G. Navarro, and S. J. Puglisi, Colored Range Queries and Document Retrieval, Proc. 17th SPIRE, 67-81 (2010).
16. T. Gagie, S. J. Puglisi, A. Turpin, Range Quantile Queries: Another Virtue of Wavelet Trees, Proc. 16th SPIRE, 1-6 (2009).
17. R. Grossi, A. Gupta, and J. S. Vitter, High-order Entropy-Compressed Text Indexes, Proc. 14th ACM-SIAM SODA, 841-850 (2003).
18. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, 1997.
19. W.-K. Hon, M. Patil, R. Shah, and S.-B. Wu, Efficient Index for Retrieving Top-k most Frequent Documents, Journal of Discrete Algorithms 8(4), 402-417 (2010).
20. W.-K. Hon, R. Shah, S. Thankachan, and J. Vitter, String Retrieval for Multi-pattern Queries. Proc. 17th SPIRE, 55-66 (2010).
21. W.-K. Hon, R. Shah, J. S. Vitter, Space-Efficient Framework for Top-k String Retrieval Problems, Proc. 50th IEEE FOCS, 713-722 (2009).
22. M. Karpinski and Y. Nekrich, Top-K Color Queries for Document Retrieval, Proc. 22nd ACM-SIAM SODA, 401-411 (2011).
23. D. Knuth, The Art of Computer Programming, Vol. 3. Reading, Massachusetts: Addison-Wesley (1973).
24. Y. Matias, S. Muthukrishnan, S. C. Sahinalp, and J. Ziv, Augmenting Suffix Trees, with Applications, Proc. 6th ESA, 67-78 (1998).
25. V. Mäkinen and G. Navarro, Rank and Select Revisited and Extended, Theoretical Computer Science, 387(3), 332-347 (2007).
26. I. Munro, Tables, Proc. 16th FSTTCS, 37-42 (1996).
27. S. Muthukrishnan, Efficient Algorithms for Document Retrieval Problems, Proc. 13th ACM-SIAM SODA, 657-666 (2002).
28. G. Navarro and S. Puglisi, Dual-Sorted Inverted Lists, Proc. 17th SPIRE, 310-322 (2010).
29. G. Navarro, S. J. Puglisi, and D. Valenzuela, Practical Compressed Document Retrieval, Proc. 10th SEA, 193-205 (2011).
30. G. Navarro and L. Russo, Space-Efficient Data-Analysis Queries on Grids, Proc. 22nd ISAAC, 321-330 (2011).
31. Y. Nekrich, A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries, International Journal of Computational Geometry and Applications 1-15 (2009).
32. M. Patil, S. Thankachan, R. Shah, W.-K. Hon, J. Vitter, and S. Chandrasekaran, Inverted Indexes for Phrases and Strings, Proc. 34th ACM SIGIR (2011).
33. M. Persin, J. Zobel, and R. Sacks-Davis, Filtered Document Retrieval with Frequency-Sorted Indexes, Journal of the American Society for Information Sience 47(10), 749-764 (1996).
34. K. Sadakane, Succinct Data Structures for Flexible Text Retrieval Systems, Journal of Discrete Algorithms, 5(1), 12-22 (2007).
35. K. Sadakane, Compressed Suffix Trees with Full Functionality, Theory of Computing Systems 41(4), 589-607 (2007).
36. W. Szpankowski, Probabilistic Analysis of Generalized Suffix Trees, Proc. 3rd CPM, 1-14 (1992).
37. N. Välimäki and V. Mäkinen, Space-Efficient Algorithms for Document Retrieval, Proc. 18th CPM, 205-215 (2007).
38. P. Weiner, Linear Pattern Matching Algorithms, Proc. 14th IEEE Symp. on Switching and Automata Theory, 1-11 (1973).
39. J. Zobel and A. Moffat, Inverted Files for Text Search Engines, ACM Computing Surveys 38(2), article 6 (2006).