Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes

@inproceedings{Geffner1999RelativePS,
  title={Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes},
  author={Steven Geffner and Divyakant Agrawal and Amr El Abbadi and Terence R. Smith},
  booktitle={ICDE},
  year={1999}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
52 Citations
6 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Providing OLAP (on-line analytical processing) to user-analysts: an IT mandate

  • E. F. Codd
  • Technical report, E.F. Codd and Associates,
  • 1993
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…