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 : 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
|