Dynamic update cube for range-sum queries

VLDB 2001 - Proceedings of 27th International Conference on Very Large Data Bases

Volumn , Issue , 2001, Pages 521-530

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

^a Department of Information and Communication Engineering ^*  (South Korea)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COST REDUCTION; COSTS; DECISION SUPPORT SYSTEMS; GEOMETRY; QUERY PROCESSING;

APPROXIMATE RESULTS; DATABASE APPLICATIONS; DIRECT METHOD; DYNAMIC UPDATE; ENTERPRISE ENVIRONMENT; HYBRID METHOD; INDEX STRUCTURE; SEARCH EFFICIENCY;

TREES (MATHEMATICS);

EID: 84944325678     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. 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, 1996, pp. 28-39.
2. 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, 1990, pp. 322-331.
3. Alex Berson, Stephen J. Smith, Data WareHousing, Data Mining, & OLAP, McGrawHill, 1997.
4. C.-Y. Chan, Y. E. Ioannidis, Hierarchical cubes for range-sum queries, Proceedings of Int'l Conference on Very Large Data Bases, Scotland, 1999, pp. 675-686.
5. E. F. Codd, Providing OLAP(on-line analytical processing) to user-analysts: An IT mandate, Technical report, E. F. Codd and Associates, 1993.
6. S. Geffner, D. Agrawal, A. El Abbadi, The Dynamic Data Cube, Proceedings of Int'l Conference on Extending Database Technology, Germany, 2000, pp.237-253.
7. 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,1999, pp. 328-335.
8. A.Guttman, R-trees: a dynamic index structure for spatial searching, Proceedings of ACM SIGMOD Int'l Conference on Management of Data, Massachusetts, 1984, pp. 47-57.
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, 1997, pp. 73-88.
10. W. Liang, H. Wang, M. E. Orlowska, Range Queries in dynamic OLAP data cubes, Data & Knowledge Engineering 34, 2000, pp. 21-38.
11. 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, 1987, pp. 507-518.