Indexing and incremental updating condensed data cube

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn 2003-January, Issue , 2003, Pages 23-32

  Feng, Jianlin ^a   Si, Hongjie ^a   Feng, Yucai ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Aggregates; Binary search trees; Computer science; Data analysis; Delay; Indexing; Marketing and sales; Multidimensional systems; Physics computing; Query processing

Indexed keywords

AGGREGATES; BINARY TREES; COMPUTER SCIENCE; DATA REDUCTION; GEOMETRY; INDEXING (MATERIALS WORKING); INDEXING (OF INFORMATION); MANAGEMENT INFORMATION SYSTEMS; SEARCH ENGINES; TREES (MATHEMATICS);

AGGREGATE QUERIES; BINARY SEARCH TREES; DELAY; INCREMENTAL UPDATING; INDEXING SCHEME; MULTIDIMENSIONAL SYSTEMS; OLAP (ONLINE ANALYTICAL PROCESSING); SPARSE DATA;

QUERY PROCESSING;

EID: 19644397169     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSDM.2003.1214949     Document Type: Conference Paper

References (16)

1. R. Bayer. The Universal B-Tree for multidimensional Indexing. Technical Report TUM-I9637, Institut für Informatik, TU München, 1996.
2. K. Beyer, R. Ramakrishnan. Bottom-Up Computation of Sparse and Iceberg CUBEs. Proc. Of the ACM SIGMOD Int. Conf. on Management of Data, USA, 1999.
3. A. Binstock, J. Rex. Practical Algorithms for Programmers. Addison-Wesley, 1995.
4. V. Gaede, O. Gunther. Multidimensional Access Methods. ACM Computing Surveys, 1998, 30(2).
5. G. Graefe. Sorting and Indexing With Partitioned B-Trees. Proc. of the first biennial Conf. on Innovative Data Systems Research (CIDR), 2003.
6. J. Gray, A. Bosworth, A. Layman, H. Pirahesh. Data Cube: A Relational Operator Generalizing Group-By, Cross-Tab, and Sub-Totals. Proc. of the Int. Conf. on Data Engineering, 1996, pp.152-159.
7. J. Gray, P. Sundaresan, S. Englert, K. Baclawski, P. J. Weinberger. Quickly Generating Billion-Record Synthetic Databases. Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 1994, pp.243-252.
8. C. Hahn, S. Warren, J. London. Edited synoptic cloud report from ships and land stations over the globe, http://cdiac.esd.ornl.gov/cdiac/ndps/ndp026b.html, http://cdiac.esd.ornl.gov/ftp/ndp026b/SEP85L.DAT.Z
9. T. Johnson, D. Shasha. Some Approaches to Index Design for Cube Forest. Data Engineering Bulletin, Vol. 22, Num. 4, 1999, pp.19-26.
10. R. K. V Kothuri, S. Ravada, D. Abugov. Quadtree and R-tree Indexes in Oracle Spatial: A Comparison Using GIS Data. Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 2002.
11. L. V. S. Lakshmanan, J. Pei, J. Han. Quotient Cube: How to Summarize the Semantics of a Data Cube. Proc. of Int. Conf. on Very Large Data Bases, 2002, p.766-777.
12. J. A. Orenstein, T. H. Merret. A Class of Data Structures for Associate Searching. Proc. of ACM SIGMOD-PODS Conf., 1984, p. 294-305.
13. F. Ramsak, V. Markl, R. Fent, M. Zirkel, K. Elhardt, R. Bayer. Integrating the UB-Tree into a Database System Kernel. Proc. of Int. Conf. on Very Large Data Bases, 2000, p.263-27.
14. N. Roussopoulos, Y. Kotidis, M. Roussopoulos. Cubetree: Organization of and Bulk Incremental Updates on the Data Cube. Proc. of the ACM SIGMOD Int. Conf. on Management of Data, 1997, pp.89-99.
15. Y. Sismanis, A. Deligiannakis, N. Roussopoulos, Y. Kotidis. Dwarf: Shrinking the PetaCube. Proc. Of the ACM SIGMOD Int. Conf. on Management of Data, 2002.
16. W. Wang, J. Feng, H. Lu, J. X. Yu. Condensed Cube: An Effective Approach to Reducing Data Cube Size. Proc. of the Int. Conf. on Data Engineering, 2002, p155-165.