Colored range queries and document retrieval
From MaRDI portal
Publication:390874
DOI10.1016/J.TCS.2012.08.004zbMATH Open1292.68045OpenAlexW2049204576MaRDI QIDQ390874FDOQ390874
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
Recommendations
Cites Work
- Linear-space data structures for range mode query in arrays
- 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
- Optimal Succinctness for Range Minimum Queries
- 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
- Title not available (Why is that?)
- Towards optimal range medians
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cell Probe Lower Bounds and Approximations for Range Mode
- Practical Entropy-Compressed Rank/Select Dictionary
- Title not available (Why is that?)
- A simple storage scheme for strings achieving entropy bounds
- Range mode and range median queries in constant time and sub-quadratic space
- Suffix Arrays: A New Method for On-Line String Searches
- Succinct data structures for flexible text retrieval systems
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Title not available (Why is that?)
- Space-Efficient Algorithms for Document Retrieval
- New algorithms on wavelet trees and applications to information retrieval
- Title not available (Why is that?)
- Approximate colored range and point enclosure queries
- Counting Colours in Compressed Strings
- Efficient Colored Orthogonal Range Counting
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Rank and select revisited and extended
- Optimal lower bounds for rank and select indexes
- On the Redundancy of Succinct Data Structures
- Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
- Compressed Text Indexes with Fast Locate
- Top-k Ranked Document Search in General Text Databases
- Optimal Trade-Offs for Succinct String Indexes
- Title not available (Why is that?)
- New text indexing functionalities of the compressed suffix arrays
- New upper bounds for generalized intersection searching problems
- Title not available (Why is that?)
- Bounding the inefficiency of length-restricted prefix codes
Cited In (19)
- Top-\(k\) document retrieval in optimal space
- Title not available (Why is that?)
- Linear-space data structures for range frequency queries on arrays and trees
- Querying Relational Event Graphs Using Colored Range Searching Data Structures
- Colored Range Searching in Linear Space
- Spaces, Trees, and Colors
- Space-efficient data-analysis queries on grids
- Cross-document pattern matching
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Locally compressed suffix arrays
- Title not available (Why is that?)
- Succinct Color Searching in One Dimension
- Time-Optimal Top-$k$ Document Retrieval
- Array Range Queries
- Bottom-\(k\) document retrieval
- General document retrieval in compact space
- The ring: worst-case optimal joins in graph databases using (almost) no extra space
- The longest common substring problem
- Querying relational event graphs using colored range searching data structures
Uses Software
This page was built for publication: Colored range queries and document retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390874)
