New space/time tradeoffs for top-\(k\) document retrieval on sequences
From MaRDI portal
Publication:2015136
DOI10.1016/j.tcs.2014.05.005zbMath1317.68049OpenAlexW2112908352MaRDI QIDQ2015136
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
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (9)
Top-\(k\) term-proximity in succinct space ⋮ String indexing for top-\(k\) close consecutive occurrences ⋮ Ranked Document Retrieval with Forbidden Pattern ⋮ Compact Indexes for Flexible Top-$$k$$ Retrieval ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ Gapped indexing for consecutive occurrences ⋮ Inducing enhanced suffix arrays for string collections ⋮ Ranked document retrieval for multiple patterns ⋮ Ranked document selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colored range queries and document retrieval
- Space-efficient data-analysis queries on grids
- Top-\(k\) document retrieval in optimal space
- New algorithms on wavelet trees and applications to information retrieval
- Efficient index for retrieving top-\(k\) most frequent documents
- Succinct data structures for flexible text retrieval systems
- Time bounds for selection
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- Improved compressed indexes for full-text document retrieval
- Encodings for Range Selection and Top-k Queries
- Top-k Document Retrieval in External Memory
- Towards an Optimal Space-and-Query-Time Index for Top-k 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
- Alphabet-Independent Compressed Text Indexing
- Suffix Arrays: A New Method for On-Line String Searches
- An analysis of the Burrows—Wheeler transform
- Space-Efficient Algorithms for Document Retrieval
- Constructing Efficient Dictionaries in Close to Sorting Time
- Top-k Ranked Document Search in General Text Databases
- Optimal Trade-Offs for Succinct String Indexes
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Space-Efficient Framework for Top-k String Retrieval Problems
- Spaces, Trees, and Colors
- Practical Entropy-Compressed Rank/Select Dictionary
This page was built for publication: New space/time tradeoffs for top-\(k\) document retrieval on sequences
