Inverted indexes for phrases and strings
- 24 July 2011
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 34th international ACM SIGIR conference on Research and development in Information - SIGIR '11
- p. 555-564
- https://doi.org/10.1145/2009916.2009992
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Efficient index for retrieving top-k most frequent documentsJournal of Discrete Algorithms, 2010
- Engineering a compressed suffix tree implementationACM Journal of Experimental Algorithmics, 2009
- Faster entropy-bounded compressed suffix treesTheoretical Computer Science, 2009
- Compressed data structures: Dictionaries and data-aware measuresTheoretical Computer Science, 2007
- Inverted files for text search enginesACM Computing Surveys, 2006
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String MatchingSIAM Journal on Computing, 2005
- Fast phrase querying with combined indexesACM Transactions on Information Systems, 2004
- The Level Ancestor Problem simplifiedTheoretical Computer Science, 2004
- A Functional Approach to Data Structures and Its Use in Multidimensional SearchingSIAM Journal on Computing, 1988
- A Simple Algorithm for Merging Two Disjoint Linearly Ordered SetsSIAM Journal on Computing, 1972