Sciweavers

COCOON
2005
Springer
13 years 10 months ago
Opportunistic Data Structures for Range Queries
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
Chung Keung Poon, Wai Keung Yiu
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
14 years 5 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...