{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:13Z","timestamp":1725490213625},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745525"},{"type":"electronic","value":"9783540745532"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74553-2_1","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T03:07:48Z","timestamp":1187838468000},"page":"1-12","source":"Crossref","is-referenced-by-count":8,"title":["A Hilbert Space Compression Architecture for Data Warehouse Environments"],"prefix":"10.1007","author":[{"given":"Todd","family":"Eavis","sequence":"first","affiliation":[]},{"given":"David","family":"Cueva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","first-page":"247","volume-title":"ACM Symposium on Principles of Database Systems","author":"C. Faloutsos","year":"1989","unstructured":"Faloutsos, C., Roseman, S.: Fractals for secondary key retrieval. In: ACM Symposium on Principles of Database Systems, pp. 247\u2013252. ACM Press, New York (1989)"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., Gunther, O.: Multidimensional access methods. ACM Computing Surveys\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Computing Surveys"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Goldstein, J., Ramakrishnan, R., Shaft, U.: Compressing relations and indexes. In: ICDE. International Conference on Data Engineering, pp. 370\u2013379 (1998)","DOI":"10.1109\/ICDE.1998.655800"},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","volume":"12","author":"S.W. Golomb","year":"1966","unstructured":"Golomb, S.W.: Run-length encodings. IEEE Transactions on Information Theory\u00a012(3), 399\u2013401 (1966)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Gray, J., Bosworth, A., Layman, A., Pirahesh, H.: Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In: ICDE. International Conference On Data Engineering, pp. 152\u2013159 (1996)","DOI":"10.1109\/ICDE.1996.492099"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"1_CR7","unstructured":"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"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF01199431","volume":"38","author":"D. Hilbert","year":"1891","unstructured":"Hilbert, D.: Ueber die stetige abbildung einer line auf ein flchenstck. Mathematische Annalen\u00a038(3), 459\u2013460 (1891)","journal-title":"Mathematische Annalen"},{"issue":"9","key":"1_CR9","first-page":"1098","volume":"40","author":"D. Huffman","year":"1952","unstructured":"Huffman, D.: A method for the construction of minimum redundancy codes. Proceedings of the Institute of Radio Engineers (IRE)\u00a040(9), 1098\u20131101 (1952)","journal-title":"Proceedings of the Institute of Radio Engineers (IRE)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Jagadish, H.: Linear clustering of objects with multiple attributes. In: ACM SIGMOD, 332\u2013342 (1990)","DOI":"10.1145\/93597.98742"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Kamel, I., Faloutsos, C.: On packing r-trees. In: CIKM. International Conference on Information and Knowledge Management, pp. 490\u2013499 (1993)","DOI":"10.1145\/170088.170403"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Leutenegger, S., Lopez, M., Eddington, J.: STR: A simple and efficient algorithm for r-tree packing. In: ICDE. International Conference on Data Engineering, pp. 497\u2013506 (1997)","DOI":"10.1109\/ICDE.1997.582015"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/69.908985","volume":"13","author":"B. Moon","year":"2001","unstructured":"Moon, B., Jagadish, H., Faloutsos, C., Saltz, J.: Analysis of the clustering properties of the hilbert space-filling curve. Knowledge and Data Engineering\u00a013(1), 124\u2013141 (2001)","journal-title":"Knowledge and Data Engineering"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1109\/69.591455","volume":"9","author":"W. Ng","year":"1997","unstructured":"Ng, W., Ravishankar, C.V.: Block-oriented compression techniques for large statistical databases. IEEE Transactions on Knowledge and Data Engineering\u00a09(2), 314\u2013328 (1997)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01199438","volume":"36","author":"G. Peano","year":"1890","unstructured":"Peano, G.: Sur une courbe, qui remplit toute une aire plane. Mathematische Annalen\u00a036(1), 157\u2013160 (1890)","journal-title":"Mathematische Annalen"},{"key":"1_CR16","unstructured":"Ray, G., Haritsa, J.R., Seshadri, S.: Database compression: A performance enhancement tool. In: COMAD. International Conference on Management of Data (1995)"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1147\/rd.203.0198","volume":"20","author":"J. Rissanen","year":"1976","unstructured":"Rissanen, J.: Generalized kraft inequality and arithmetic coding. IBM Journal of Research and Development\u00a020(3), 198\u2013203 (1976)","journal-title":"IBM Journal of Research and Development"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Leifker, D.: Direct spatial search on pictorial databases using packed r-trees, pp. 17\u201331 (1985)","DOI":"10.1145\/971699.318900"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Sismanis, Y., Deligiannakis, A., Roussopoulos, N., Kotidis, Y.: Dwarf: shrinking the petacube. In: ACM SIGMOD, pp. 464\u2013475 (2002)","DOI":"10.1145\/564691.564745"},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/362084.362137","volume":"29","author":"T. Westmann","year":"2000","unstructured":"Westmann, T., Kossmann, D., Helmer, S., Moerkotte, G.: The implementation and performance of compressed databases. SIGMOD Record\u00a029(3), 55\u201367 (2000)","journal-title":"SIGMOD Record"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory\u00a023(3), 337\u2013343 (1977)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74553-2_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:23:58Z","timestamp":1619519038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74553-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745525","9783540745532"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74553-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}