Space-efficient data-analysis queries on grids
DOI10.1016/J.TCS.2012.11.031zbMATH Open1291.68155OpenAlexW2080990114MaRDI QIDQ390915FDOQ390915
Authors: Gonzalo Navarro, Yakov Nekrich, Luís M. S. Russo 
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.11.031
Recommendations
quantilemodedatabasessuccinct data structuresdynamic data structuresrange minimum queriesrange queriesalpha majorityorthogonal range queriespoint dominancerectangle visibilitystatistical database queriestop-\(k\)wavelet tree
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Database theory (68P15)
Cites Work
- Title not available (Why is that?)
- Linear-space data structures for range mode query in arrays
- Range Majority in Constant Time and Linear Space
- Optimal succinctness for range minimum queries
- Colored range queries and document retrieval
- Fully-functional succinct trees
- Time-space trade-offs for predecessor search
- Orthogonal range searching on the RAM, revisited
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Two-Dimensional Range Minimum Queries
- New algorithms on wavelet trees and applications to information retrieval
- Title not available (Why is that?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Dynamic entropy-compressed sequences and full-text indexes
- Rank/select on dynamic compressed sequences and applications
- Transposition invariant string matching
- New Data Structures for Orthogonal Range Queries
- Rank and select revisited and extended
- Compact rich-functional binary relation representations
- Orthogonal range searching in linear and almost-linear space
- On the Size of Succinct Indices
- Title not available (Why is that?)
- Time-optimal top-\(k\) document retrieval
- Dynamic Planar Range Maxima Queries
- Efficient top-\(k\) queries for orthogonal ranges
- Top-\(k\) ranked document search in general text databases
- Data structures for range median queries
- Title not available (Why is that?)
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
Cited In (17)
- Dualities in tree representations
- Time-optimal top-\(k\) document retrieval
- Fast construction of wavelet trees
- Document listing on repetitive collections with guaranteed performance
- Practical compact indexes for top-\(k\) document retrieval
- Dynamic range majority data structures
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Space-efficient data-analysis queries on grids
- The range 1 query (R1Q) problem
- Compact binary relation representations with rich functionality
- Lempel-Ziv compressed structures for document retrieval
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Compact and succinct data structures for multidimensional orthogonal range searching
- Title not available (Why is that?)
- Wavelet trees for all
- Improved range minimum queries
- Path queries on functions
This page was built for publication: Space-efficient data-analysis queries on grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390915)
