DBScholar

Back to papers

A One-Pass Aggregation Algorithm with the Optimal Buffer Size in Multidimensional OLAP

Summary: Introduces the Disjoint-Inclusive Partition model and an optimal one-pass aggregator for skew-adaptive MOLAP files, deriving the minimum buffer for one disk access per page. Predictable page order makes Belady/Toss-Immediate practical, reducing I/O up to 7.31× with 0.05–0.6% of database-sized memory. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
9085
Venue
VLDB
Year
2002
Pagerank
5.093636e-05
Overall Rank
12,844 | 11.88%
DOI
10.1016/B978-155860869-6/50075-5

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{lee_vldb02,
        title = {{A One-Pass Aggregation Algorithm with the Optimal Buffer Size in Multidimensional OLAP}},
        author = {Lee, Young-Koo and Whang, Kyu-Young and Moon, Yang-Sae and Song, Il-Yeol},
        journal = {PVLDB},
        series = {{VLDB} '02},
        doi = {10.1016/B978-155860869-6/50075-5},
        url = {https://doi.org/10.1016/B978-155860869-6/50075-5},
        year = {2002}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers