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 selection is specified by providing ranges of values for numeric dimensions. Many application domains require that information provided by analysis tools be current or "near-current." Existing techniques for range sum queries on data cubes, however, can incur update costs on the order of the size of the data cube. Since the size of a data cube is exponential in the number of its dimensions, rebuilding the entire data cube can be very costly. We present an approach that achieves constant time range sum queries while constraining update costs. Our method reduces the overall complexity of the range sum problem.

• Type: Conference
• Year: 1999
• Where: ICDE
• Authors: Steven Geffner, Divyakant Agrawal, Amr El Abbadi, Terence R. Smith
• Keywords: Database, ICDE 1999, Range Sum Problem, Range Sum Queries, Range Sum Query