Approximate aggregate queries with guaranteed error bounds

Authors:
Seok-Ju Chun;Ju-Hong Lee;Seok-Lyong Lee
Affiliations:
Department of Internet Information, Ansan College, Ansan, Korea;School of Computer Science and Engineering, Inha University, Inchon, Korea;School of Industrial and Information System Engineering, Hankuk University of Foreign Studies, Yongin-si, Kyounggi-do, Korea
Venue:
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Year:
2003

Citing 5
Cited 0

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Range queries in OLAP data cubes

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Progressive approximate aggregate queries with a multi-resolution tree structure

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Dynamic Update Cube for Range-sum Queries

Proceedings of the 27th International Conference on Very Large Data Bases
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds

SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is very important to provide analysts with guaranteed error bounds for approximate aggregate queries in many current enterprise applications such as the decision support systems. In this paper, we propose a general technique to provide tight error bounds for approximate results to OLAP range-sum queries. We perform an extensive experiment on diverse data sets, and examine the effectiveness of our proposed method with respect to various dimensions of the data cube and query sizes.