Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2003.10D.3.427

Efficient Processing method of OLAP Range-Sum Queries in a dynamic warehouse environment  

Chun, Seok-Ju (안산1대학 인터넷정보과)
Lee, Ju-Hong (인하대학교 컴퓨터공학부)
Publication Information
The KIPS Transactions:PartD / v.10D, no.3, 2003 , pp. 427-438 More about this Journal
Abstract
In a data warehouse, users typically search for trends, patterns, or unusual data behaviors by issuing queries interactively. The OLAP range-sum query is widely used in finding trends and in discovering relationships among attributes in the data warehouse. In a recent environment of enterprises, data elements in a data cube are frequently changed. The problem is that the cost of updating a prefix sum cube is very high. In this paper, we propose a novel algorithm which reduces the update cost significantly by an index structure called the Δ-tree. Also, we propose a hybrid method to provide either approximate or precise results to reduce the overall cost of queries. It is highly beneficial for various applications that need quick approximate answers rather than time consuming accurate ones, such as decision support systems. An extensive experiment shows that our method performs very efficiently on diverse dimensionalities, compared to other methods.
Keywords
Data warehouses; Prefix-sum Cube; Decision Support System;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E. F. Codd, Providing OLAP(on-line analytical processing) to user-analysts: An IT mandate, Technical report, E.F.Codd and Associates, 1993
2 S. Geffner, D. Agrawal, A. El Abbadi, The Dynamic Data Cube, Proceedings of Int'l Conference on Extending Database Technology, Germany, pp.237-253, 2000
3 S. Geffner, D. Agrawal, A. El Abbadi, T. Smith, Relative prefix sums: an efficient approach for quering dynamic OLAP Data Cubes, Proceedings of Int'l Conference on Data Engineering, Australia, pp.328-335, 1999
4 A. Guttman, R-trees: a dynamic index structure for spatial searching, Proceedings of ACM SIGMOD Int'l Conference on Management of Data, Massachusetts, pp.47-57, 1984   DOI
5 Alex Berson, Stephen J. Smith, Data WareHousing, Data Mining, & OLAP, McGrawHill, 1997
6 C.-Y. Chan, Y. E. Ioannidis, Hierarchical cubes for rangesum queries, Proceedings of Int'l Conference on Very Large Data Bases, Scotland, pp.675-686, 1999
7 S. Berchtold, D. keim and H. Kriegel, The X-tree: an index structure for high dimensional data, Proceedings of Int'l Conference on Very Large Data Bases, India, pp.28-39, 1996
8 N. Beckmann, H. Kriegel, R. Schneider and B. Seeger, The $R^*-Tree$ : an efficient and robust access method for points and rectangles, Proceedings of ACM SIGMOD Int'l Conference on Management of Data, New Jersey, pp.322-331, 1990   DOI
9 C. Ho, R. Agrawal, N. Megido, R. Srikant, Range queries in OLAP Data Cubes, Proceedings of ACM SIGMOD Int'l Conference on Management of Data, pp.73-88, 1997   DOI
10 J. Han, M. Kamber, Data Mining Concepts and Techniques, Morgan Kaufmann Publishers, 2001
11 W. Liang, H. Wang, M. E. Orlowska, Range Queries in dynamic OLAP data cubes, Data & Knowledge Engineering, 34, pp.21-38, 2000   DOI   ScienceOn
12 T. Sellis, N. Roussopoulos and C. Faloutsos, The R+-tree: a dynamic index for multi-dimensional objects, Proceedings of Int'l Conference on Very Large Data Bases, England, pp.507-518, 1987