Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Computing partial sums in multidimensional arrays
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
Lower bounds for orthogonal range searching: part II. The arithmetic model
Journal of the ACM (JACM)
OLAP, relational, and multidimensional database systems
ACM SIGMOD Record
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
An efficient processing of range-MIN/MAX queries over data cube
Information Sciences: an International Journal
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
Multidimensional divide-and-conquer
Communications of the ACM
Progressive approximate aggregate queries with a multi-resolution tree structure
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Modeling Multidimensional Databases
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Orthogonal Range Queries in OLAP
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Hierarchical Prefix Cubes for Range-Sum Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Hierarchical Compact Cube for Range-Max Queries
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Dynamic Update Cube for Range-sum Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Space-Efficient Data Cubes for Dynamic Environments
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Flexible Data Cubes for Online Aggregation
ICDT '01 Proceedings of the 8th International Conference on Database Theory
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
We present a new data structure to support orthogonal range max queries on a datacube. For a d-dimensional datacube with size n in each dimension where d 驴 c3 log log n/ log(log* n), our structure requires O(c1d) query time and O((c2n)d) storage where c1, c2 and c3 are constants independent of d and n; and log* n is the minimum number of repeated logarithms it takes to reduce the value n to at most 2. Hence our data structure is asymptotically optimal when d is fixed, i.e., a constant independent of n.