Colored range queries and document retrieval
From MaRDI portal
Publication:390874
DOI10.1016/J.TCS.2012.08.004zbMATH Open1292.68045OpenAlexW2049204576MaRDI QIDQ390874FDOQ390874
Authors: Travis Gagie, Juha Kärkkäinen, Gonzalo Navarro, Simon J. Puglisi 
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
- Top-\(K\) color queries for document retrieval
- Towards optimal range medians
- Fully-functional succinct trees
- Top-\(k\) document retrieval in optimal time and linear space
- Cell probe lower bounds and approximations for range mode
- Practical entropy-compressed rank/select dictionary
- Random access to grammar-compressed strings
- 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
- Succinct indexes for strings, binary relations and multi-labeled trees
- 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 (22)
- Top-\(k\) document retrieval in optimal space
- 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
- I/O-efficient data structures for colored range and prefix reporting
- Time-optimal top-\(k\) document retrieval
- Space-efficient data-analysis queries on grids
- Cross-document pattern matching
- Array range queries
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Top-\(K\) color queries for document retrieval
- Top-\(k\) document retrieval in optimal time and linear space
- Locally compressed suffix arrays
- Title not available (Why is that?)
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Color-distance oracles and snippets
- 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
- Succinct color searching in one dimension
- 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)
