Opportunistic data structures for range queries
From MaRDI portal
Publication:2498981
DOI10.1007/s10878-006-7122-0zbMath1130.90042OpenAlexW1968660856MaRDI QIDQ2498981
Chung Keung Poon, Wai Keung Yiu
Publication date: 14 August 2006
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-7122-0
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic orthogonal range queries in OLAP.
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Squeezing succinct data structures into entropy bounds
- Compression of individual sequences via variable-rate coding
- New text indexing functionalities of the compressed suffix arrays
- Algorithms and Computation
This page was built for publication: Opportunistic data structures for range queries
