DBScholar

Back to papers

Hierarchical Compact Cube for Range-Max Queries

Summary: Hierarchical Compact Cube (HCC) stores per-subcube max and an argmax location, enabling range-max queries with compact storage. Compared to a prefix cube, HCC reduces storage; average query time is constant with respect to N, and worst-case update is O(log N) for a fixed dimension. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8841
Venue
VLDB
Year
2000
Pagerank
5.093636e-05
Overall Rank
12,883 | 11.62%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{lee_vldb00,
        title = {{Hierarchical Compact Cube for Range-Max Queries}},
        author = {Lee, Sin Yeung and Ling, Tok Wang and Li, HuaGang},
        journal = {PVLDB},
        series = {{VLDB} '00},
        pages = {232--243},
        year = {2000}
}

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 6 of 6 cited papers.

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

Rank Cited Paper Year Venue Pagerank
11 Implementing Data Cubes Efficiently 1996 SIGMOD 0.00071822821
198 Aggregate-Query Processing in Data Warehousing Environments 1995 VLDB 0.00025618616
207 On the Computation of Multidimensional Aggregates 1996 VLDB 0.00025088003
905 Maintenance of Data Cubes and Summary Tables in a Warehouse 1997 SIGMOD 0.0001331508
1,100 Range Queries in OLAP Data Cubes 1997 SIGMOD 0.00012169143
3,954 Hierarchical Cubes for Range-Sum Queries 1999 VLDB 6.9956335e-05
Previous Page 1 / 1 Next

Semantically Similar Papers