Range selection and predecessor queries in data aware space and time
DOI10.1016/J.JDA.2017.01.002zbMATH Open1407.68110OpenAlexW2586700818MaRDI QIDQ2397147FDOQ2397147
Authors: M. Oğuzhan Külekci, Sharma V. Thankachan 
Publication date: 29 May 2017
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2017.01.002
Recommendations
- Unit-time predecessor queries on massive data sets
- A new framework for addressing temporal range queries and some preliminary results
- Fast algorithms for a class of temporal range queries.
- Cache-oblivious iterated predecessor queries via range coalescing
- Time-space trade-offs for predecessor search
- Predecessor queries in dynamic integer sets
- Computing and Combinatorics
- Opportunistic data structures for range queries
- Space-Time Trade-Offs for Orthogonal Range Queries
- Query time versus redundancy trade-offs for range queries
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Quicksort
- Succinct representations of weighted trees supporting path queries
- Towards Optimal Range Medians
- Efficient Storage and Retrieval by Content and Address of Static Files
- Title not available (Why is that?)
- Towards optimal range medians
- Practical Entropy-Compressed Rank/Select Dictionary
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Wavelet trees for all
- Sorted range reporting
- New algorithms on wavelet trees and applications to information retrieval
- Title not available (Why is that?)
- Compressed Prefix Sums
- Compressed data structures: Dictionaries and data-aware measures
- Data structures for range median queries
- Efficient Data Structures for the Orthogonal Range Successor Problem
- Improved algorithms for the range next value problem and applications
- Range Predecessor and Lempel-Ziv Parsing
- Data Structures for Path Queries
- Adaptive and Approximate Orthogonal Range Counting
Cited In (1)
Uses Software
This page was built for publication: Range selection and predecessor queries in data aware space and time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397147)
