Space-efficient cubes for OLAP range-sum queries

Decision Support Systems

Volumn 37, Issue 1, 2004, Pages 83-102

  Chun, Seok Ju ^a   Chung, Chin Wan ^a   Lee, Seok Lyong ^b  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Hankuk University of Foreign Studies   (South Korea)

Author keywords

Clustering; Data cube; OLAP; Range sum query

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CUSTOMER SATISFACTION; DATA REDUCTION; DATA WAREHOUSES; ONLINE SYSTEMS; QUERY LANGUAGES;

CLUSTERING; DATA CUBES; ONLINE ANALYTICAL PROCESSING (OLAP); RANGE-SUM QUERY;

DECISION SUPPORT SYSTEMS;

EID: 1842506415     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9236(03)00003-4     Document Type: Article

References (22)

1. Agrawal R., Gehrke J., Gunopulos D., Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. Proceedings of ACM SIGMOD Int'l Conference on Management of Data. 1998;94-105 ACM Press, Washington.
2. D. Barbara, M. Sullivan, A space-efficient way support approximate multidimensional databases, George Mason University Technical Report ISSE-TR-98-03, 1998.
3. Beckmann N., Kriegel H., Schneider R., Seeger B. The R*-tree: an efficient and robust access method for points and rectangles. Proceedings of ACM SIGMOD Int'l Conference on Management of Data. 1990;322-331 ACM Press, New Jersey.
4. Chan C.-Y., Ioannidis Y.E. Hierarchical cubes for range-sum queries. Proceedings of Int'l Conference on Very Large Data Bases. 1999;675-686 Morgan Kaufmann, Scotland.
5. Cheung D.W., Zhou B., Kao B., Kan H., Lee S.D. Towards the building of a dense-region based OLAP system. Data and Knowledge Engineering. vol. 36:2001 (January);1-27 Elsevier Science.
6. Chun S.-J., Chung C.-W., Lee J.-H., Lee S.-L. Dynamic update cube for range-sum queries. Proceedings of Int'l Conference on Very Large Data Bases Conference. 2001;521-530 Morgan Kaufmann, Italy.
7. Ester M., Kriegel H.P., Sander J., Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. Int'l Conference on Knowledge Discovery in Databases and Data Mining. 1996;226-231 AAAI Press, Oregon.
8. Geffner S., Agrawal D., El Abbadi A., Smith T. Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes. Proceedings of Int'l Conference on Data Engineering. 1999;328-335 IEEE Computer Society Press, Australia.
9. Geffner S., Agrawal D., El Abbadi A. The dynamic data cube. Proceedings of Int'l Conference on Extending Database Technology. 2000;237-253 Springer, Germany.
10. S. Goil, A. Choudhary, BESS: Sparse data storage of multi-dimensional data for OLAP and data mining, Technical report, Northwestern University, 1997.
11. Guha S., Rastogi R., Shim K. CURE: an efficient clustering algorithm for large databases. Proceedings of ACM SIGMOD Int'l Conference on Management of Data. 1998;73-84 ACM Press, Washington.
12. Ho C., Agrawal R., Megido N., Srikant R. Range queries in OLAP data cubes. Proceedings of ACM SIGMOD Int'l Conference on Management of Data. 1997;73-88 ACM Press, Arizona.
13. Liang W., Wang H., Orlowska M.E. Range queries in dynamic OLAP data cubes. Data and Knowledge Engineering. 34:2000;21-38.
14. Ng R.T., Han J. Efficient and effective clustering methods for spatial data mining. Proceedings of Int'l Conference on Very Large Data Bases. 1994;144-155 Morgan Kaufmann, Chile.
15. Riedewald M., Agrawal D., Abbadi A.E. pCube: update-efficient online aggregation with progressive feedback and error bounds. SSDBM Conference. 2000;95-108 IEEE Computer Society, Berlin.
16. Riedewald M., Agrawal D., Abbadi A.E., Pajarola R. Space-efficient data cubes for dynamic environments. DaWaK Conference. 2000;24-33 Springer, London.
17. Shanmugasundaram J., Fayyad U., Bradley P. Compressed data cubes for OLAP aggregate query approximation on continuous dimensions. KDD Conference. 1999;223-232 ACM, San Diego.
18. U.S. Census Bureau, Census bureau databases, The online data are available on the web at http://www.census.gov/.
19. Vitter J.S., Wang M. Approximate computation of multidimensional aggregates of sparse data using wavelets. SIGMOD Conference. 1999;193-204 ACM Press, Pennsylvania.
20. Vitter J.S., Wang M., Iyer B.R. Data cube approximation and histograms via wavelets. CIKM Conference. 1998;96-104 ACM, Maryland.
21. Youness S. Professional Data Warehousing with SQL Server 7.0 and OLAP Services. 2000;Wrox Press.
22. Zhang T., Ramakrishnan R., Livny M. BIRCH: an efficient data clustering method for very large databases. Proceedings of ACM SIGMOD Int'l Conference on Management of Data. 1996;103-114 ACM Press, Canada.