Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
New data structures for orthogonal range queries
SIAM Journal on Computing
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Filtering search: a new approach to query answering
SIAM Journal on Computing
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)
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Partial-Sum Queries in OLAP Data Cubes Using Covering Codes
IEEE Transactions on Computers
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
Multidimensional divide-and-conquer
Communications of the ACM
A unifying look at data structures
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
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
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
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
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Efficient Dynamic Range Searching using Data Replication
Efficient Dynamic Range Searching using Data Replication
Supporting mobile decision making with association rules and multi-layered caching
Decision Support Systems
Hierarchical bin buffering: Online local moments for dynamic external memory arrays
ACM Transactions on Algorithms (TALG)
Opportunistic data structures for range queries
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Hi-index | 0.00 |
We study the problem of pre-computing auxillary information to support on-line range queries for the sum and max functions on a datacube. For a d-dimensional datacube with size n in each dimension, we propose a dynamic range max data structure with O(αd(s,n)Ld) query time, O(αd(s, n)L2dnd/L) update time and O(sd) storage where L and s are parameters chosen by the user before the construction of the data structure such that L ∈ { 1,..., ⌈log n⌉ } and s is a non-negative multiple of n; and α(s, n) is the functional inverse of Ackermann's function. Moreover, the data structure can be initialized in time linear to its size. There are three major techniques employed in designing the data structure, namely, a technique for trading query and update times, a technique for trading query time and storage and a technique for extending one-dimensional data structures to d-dimensional ones. Our techniques are also applicable to range queries over any semigroup and group operation, such as min, sum and count.