Relational online analytical processing (ROLAP) reduces the amount of storage required for maintaining various sizes of data cubes by materializing only parts of them in a lazy evaluation manner. In ROLAP however, cube creation queries need to be issued repeatedly in order to search for useful features (i.e. rules or patterns) within large scale databases. The cube creation cost can be a bottleneck in the whole ROLAP processing. The cost of the queries can be effectively reduced by estimating the query results using samples. To maintain the accuracy of ROLAP even when using samples, the samples need to be extracted in an appropriate unit. However, conventional query optimization methods only support record based sampling and cannot be applied for complex queries that have other sampling units, such as the ones that include grouping aggregate operations. We develop a query optimization method named SUPRA that preserves the sampling unit used in random data extraction. The method is designed to preserve both the sampling unit and the randomness of the sampling operation. Using this method, typical ROLAP queries can be transformed into more efficient ones than those obtained through conventional methods.
[1]
Doron Rotem,et al.
Random Sampling from B+ Trees
,
1989,
VLDB.
[2]
Gennady Antoshenkov,et al.
Random Sampling from Pseudo-Ranked B+ Trees
,
1992,
VLDB.
[3]
Jeffrey D. Ullman,et al.
Implementing data cubes efficiently
,
1996,
SIGMOD '96.
[4]
Doron Rotem,et al.
Random Sampling from Database Files: A Survey
,
1990,
SSDBM.
[5]
Frank Olken,et al.
Random Sampling from Databases
,
1993
.
[6]
Doron Rotem,et al.
Simple Random Sampling from Relational Databases
,
1986,
VLDB.
[7]
Ping Xu,et al.
Random sampling from hash files
,
1990,
SIGMOD '90.
[8]
Jeffrey F. Naughton,et al.
On the Computation of Multidimensional Aggregates
,
1996,
VLDB.
[9]
Helen J. Wang,et al.
Online aggregation
,
1997,
SIGMOD '97.