A Hilbert space compression architecture for data warehouse environments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4654 LNCS, Issue , 2007, Pages 1-12

  Eavis, Todd ^a   Cueva, David ^a  

^a Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; DATA STORAGE EQUIPMENT; DATA WAREHOUSES; STATISTICAL METHODS;

HILBERT SPACE COMPRESSION ARCHITECTURE; STATISTICAL DATABASES;

HILBERT SPACES;

EID: 38049002611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74553-2_1     Document Type: Conference Paper

References (21)

1. Faloutsos, C., Roseman, S.: Fractals for secondary key retrieval. In: ACM Symposium on Principles of Database Systems, pp. 247-252. ACM Press, New York (1989)
2. Gaede, V., Gunther, O.: Multidimensional access methods. ACM Computing Surveys 30(2), 170-231 (1998)
3. Goldstein, J., Ramakrishnan, R., Shaft, U.: Compressing relations and indexes. In: International Conference on Data Engineering (ICDE), pp. 370-379 (1998)
4. Golomb, S.W.: Run-length encodings. IEEE Transactions on Information Theory 12(3), 399-401 (1966)
5. Gray, J., Bosworth, A., Layman, A., Pirahesh, H.: Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In: International Conference On Data Engineering (ICDE), pp. 152-159 (1996)
6. Guttman, A.: R-trees: A dynamic index structure for spatial searching, pp. 47-57 (1984)
7. Hahn, C., Warren, S., Loudon, J.: Edited synoptic cloud reports from ships and land stations over the globe, Available at http://cdiac.esd.ornl.gov/ cdiac/ ndps/ndpo26b.html
8. Hilbert, D.: Ueber die stetige abbildung einer line auf ein flchenstck. Mathematische Annalen 38(3), 459-460 (1891)
9. Huffman, D.: A method for the construction of minimum redundancy codes. Proceedings of the Institute of Radio Engineers (IRE) 40(9), 1098-1101 (1952)
10. Jagadish, H.: Linear clustering of objects with multiple attributes. In: ACM SIGMOD, 332-342 (1990)
11. Kamel, I., Faloutsos, C.: On packing r-trees. In: International Conference on Information and Knowledge Management (CIKM), pp. 490-499 (1993)
12. Leutenegger, S., Lopez, M., Eddington, J.: STR: A simple and efficient algorithm for r-tree packing. In: International Conference on Data Engineering (ICDE), pp. 497-506 (1997)
13. Moon, B., Jagadish, H., Faloutsos, C., Saltz, J.: Analysis of the clustering properties of the hilbert space-filling curve. Knowledge and Data Engineering 13(1), 124-141 (2001)
14. Ng, W., Ravishankar, C.V.: Block-oriented compression techniques for large statistical databases. IEEE Transactions on Knowledge and Data Engineering 9(2), 314-328 (1997)
15. Peano, G.: Sur une courbe, qui remplit toute une aire plane. Mathematische Annalen 36(1), 157-160 (1890)
16. Ray, G., Haritsa, J.R., Seshadri, S.: Database compression: A performance enhancement tool. In: International Conference on Management of Data (COMAD) (1995)
17. Rissanen, J.: Generalized kraft inequality and arithmetic coding. IBM Journal of Research and Development 20(3), 198-203 (1976)
18. Roussopoulos, N., Leifker, D.: Direct spatial search on pictorial databases using packed r-trees, pp. 17-31 (1985)
19. Sismanis, Y., Deligiannakis, A., Roussopoulos, N., Kotidis, Y.: Dwarf: shrinking the petacube. In: ACM SIGMOD, pp. 464-475 (2002)
20. Westmann, T., Kossmann, D., Helmer, S., Moerkotte, G.: The implementation and performance of compressed databases. SIGMOD Record 29(3), 55-67 (2000)
21. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23(3), 337-343 (1977)