Dynamic orthogonal range queries in OLAP.
From MaRDI portal
Publication:1401285
DOI10.1016/S0304-3975(02)00741-7zbMath1045.68042MaRDI QIDQ1401285
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00741-7
68P05: Data structures
Related Items
OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS, On space efficient two dimensional range minimum data structures, Opportunistic data structures for range queries, Array Range Queries
Cites Work
- Unnamed Item
- Unnamed Item
- Multidimensional divide-and-conquer
- Efficient dynamic range searching using data replication
- Efficient worst-case data structures for range searching
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
- Quad trees: A data structure for retrieval by composite keys
- Fast Algorithms for Finding Nearest Common Ancestors
- Lower bounds for orthogonal range searching: I. The reporting case
- Lower bounds for orthogonal range searching: part II. The arithmetic model
- New Data Structures for Orthogonal Range Queries
- On the Complexity of Maintaining Partial Sums
- Filtering Search: A New Approach to Query-Answering
- Adding range restriction capability to dynamic data structures
- A unifying look at data structures
- A Lower Bound on the Complexity of Orthogonal Range Queries
- Optimal Retrieval Algorithms for Small Region Queries
- Multidimensional binary search trees used for associative searching
- Efficiency of a Good But Not Linear Set Union Algorithm
- Partial-sum queries in OLAP data cubes using covering codes
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
