Sciweavers

Share
DOLAP
2000
ACM

CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries

10 years 5 months ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major concern in data warehousing. In this paper, we introduce a new data structure, called Statistics Tree (ST), together with an efficient algorithm called CubiST, for evaluating ad-hoc OLAP queries on top of a relational data warehouse. We are focusing on a class of queries called cube queries, which generalize the data cube operator. CubiST represents a drastic departure from existing relational (ROLAP) and multi-dimensional (MOLAP) approaches in that it does not use the familiar view lattice to compute and materialize new views from existing views in some heuristic fashion. CubiST is the first OLAP algorithm that needs only one scan over the detailed data set and can efficiently answer any cube query without additional I/O when the ST fits into memory. We have implemented CubiST and our experiments have demonstr...
Lixin Fu, Joachim Hammer
Added 01 Aug 2010
Updated 01 Aug 2010
Type Conference
Year 2000
Where DOLAP
Authors Lixin Fu, Joachim Hammer
Comments (0)
books