pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds

@inproceedings{Riedewald2000pCubeUO,
  title={pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds},
  author={Mirek Riedewald and Divyakant Agrawal and Amr El Abbadi},
  booktitle={SSDBM},
  year={2000}
}
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries as well as updates to the data cube becomes difficult. Another problem that arises with increased dimensionality is the sparseness of the data space. In this paper we develop a new data structure referred to as the pCube (data cube for progressive querying), to support efficient querying and updating of… CONTINUE READING

Similar Papers

Loading similar papers…