Colored range queries and document retrieval
From MaRDI portal
Publication:390874
DOI10.1016/j.tcs.2012.08.004zbMath1292.68045OpenAlexW2049204576MaRDI QIDQ390874
Juha Kärkkäinen, Travis Gagie, Simon J. Puglisi, Gonzalo Navarro
Publication date: 9 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.004
Related Items (14)
Space-efficient data-analysis queries on grids ⋮ Top-\(k\) document retrieval in optimal space ⋮ Cross-document pattern matching ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ The longest common substring problem ⋮ Spaces, Trees, and Colors ⋮ New space/time tradeoffs for top-\(k\) document retrieval on sequences ⋮ Locally Compressed Suffix Arrays ⋮ General Document Retrieval in Compact Space ⋮ Array Range Queries ⋮ Unnamed Item ⋮ Bottom-\(k\) document retrieval ⋮ Succinct Color Searching in One Dimension ⋮ Linear-space data structures for range frequency queries on arrays and trees
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New algorithms on wavelet trees and applications to information retrieval
- Towards optimal range medians
- A simple storage scheme for strings achieving entropy bounds
- Succinct data structures for flexible text retrieval systems
- Range mode and range median queries in constant time and sub-quadratic space
- Approximate colored range and point enclosure queries
- Rank and select revisited and extended
- Optimal lower bounds for rank and select indexes
- 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
- Counting Colours in Compressed Strings
- Alphabet Partitioning for Compressed Rank/Select and Applications
- Suffix Arrays: A New Method for On-Line String Searches
- An analysis of the Burrows—Wheeler transform
- Space-Efficient Algorithms for Document Retrieval
- Compressed Text Indexes with Fast Locate
- On the Redundancy of Succinct Data Structures
- Optimal Succinctness for Range Minimum Queries
- Top-k Ranked Document Search in General Text Databases
- Cell Probe Lower Bounds and Approximations for Range Mode
- Optimal Trade-Offs for Succinct String Indexes
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Efficient Colored Orthogonal Range Counting
- New text indexing functionalities of the compressed suffix arrays
- New upper bounds for generalized intersection searching problems
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Space-Efficient Framework for Top-k String Retrieval Problems
- Practical Entropy-Compressed Rank/Select Dictionary
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Bounding the inefficiency of length-restricted prefix codes
This page was built for publication: Colored range queries and document retrieval
