New space/time tradeoffs for top-k document retrieval on sequences
DOI10.1016/J.TCS.2014.05.005zbMATH Open1317.68049OpenAlexW2112908352MaRDI QIDQ2015136FDOQ2015136
Authors: Gonzalo Navarro, Sharma V. Thankachan 
Publication date: 23 June 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.005
Recommendations
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Database theory (68P15)
Cites Work
- Information retrieval. Implementing and evaluating search engines.
- Improved compressed indexes for full-text document retrieval
- New lower and upper bounds for representing sequences
- Compressed representations of sequences and full-text indexes
- Alphabet partitioning for compressed rank/select and applications
- An analysis of the Burrows-Wheeler transform
- Colored range queries and document retrieval
- Title not available (Why is that?)
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Title not available (Why is that?)
- Space-Efficient Framework for Top-k String Retrieval Problems
- Top-\(K\) color queries for document retrieval
- Fully-functional succinct trees
- Top-\(k\) document retrieval in optimal time and linear space
- Encodings for range selection and top-\(k\) queries
- Constructing Efficient Dictionaries in Close to Sorting Time
- Practical entropy-compressed rank/select dictionary
- Top-\(k\) document retrieval in external memory
- Alphabet-independent compressed text indexing
- Suffix Arrays: A New Method for On-Line String Searches
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Succinct data structures for flexible text retrieval systems
- Space-Efficient Algorithms for Document Retrieval
- Space-efficient data-analysis queries on grids
- New algorithms on wavelet trees and applications to information retrieval
- Time bounds for selection
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- Towards an optimal space-and-query-time index for top-\(k\) document retrieval
- Top-\(k\) ranked document search in general text databases
- Optimal trade-offs for succinct string indexes
- Top-\(k\) document retrieval in optimal space
- Efficient index for retrieving top-\(k\) most frequent documents
Cited In (20)
- Top-\(k\) document retrieval in optimal space
- Space-time trade-offs for some ranking and searching queries
- Compact indexes for flexible top-\(k\)
- Towards an optimal space-and-query-time index for top-\(k\) document retrieval
- Time-optimal top-\(k\) document retrieval
- The quantile index -- succinct self-index for top-\(k\) document retrieval
- Top-\(k\) document retrieval in compact space and near-optimal time
- Practical compact indexes for top-\(k\) document retrieval
- Ranked document retrieval with forbidden pattern
- Elias-Fano meets single-term top-\(k\) document retrieval
- Top-\(k\) document retrieval in optimal time and linear space
- Improved single-term top-\(k\) document retrieval
- Ranked document retrieval for multiple patterns
- Top-\(k\) term-proximity in succinct space
- String indexing for top-\(k\) close consecutive occurrences
- Ranked document selection
- Space-efficient frameworks for top-\(k\) string retrieval
- Top-\(k\) term-proximity in succinct space
- Gapped indexing for consecutive occurrences
- Inducing enhanced suffix arrays for string collections
Uses Software
This page was built for publication: New space/time tradeoffs for top-\(k\) document retrieval on sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015136)
