PnP: sequential, external memory, and parallel iceberg cube computation

@article{Chen2007PnPSE,
  title={PnP: sequential, external memory, and parallel iceberg cube computation},
  author={Ying Chen and Frank Dehne and Todd Eavis and Andrew Rau-Chaplin},
  journal={Distributed and Parallel Databases},
  year={2007},
  volume={23},
  pages={99-126}
}
We present “Pipe ’n Prune” (PnP), a new hybrid method for iceberg-cube query computation. The novelty of our method is that it achieves a tight integration of top-down piping for data aggregation with bottom-up a priori data pruning. A particular strength of PnP is that it is efficient for all of the following scenarios: (1) Sequential iceberg-cube queries, (2) External memory iceberg-cube queries, and (3) Parallel iceberg-cube queries on shared-nothing PC clusters with multiple disks. We… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Iceberg-cube computation with PC clusters

SIGMOD Conference • 2001
View 4 Excerpts
Highly Influenced

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

E. F. Codd
Technical report, E.F. Codd and Associates • 1993
View 5 Excerpts
Highly Influenced

Bottom-Up Computation of Sparse and Iceberg CUBEs

SIGMOD Conference • 1999
View 4 Excerpts
Highly Influenced

Top Ten Program Summary : The survey of the world ’ s largest databases

J. Han, B. W. Wah.
2005

Building large ROLAP data cubes in parallel

Proceedings. International Database Engineering and Applications Symposium, 2004. IDEAS '04. • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…