{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:22Z","timestamp":1725487282332},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000099"},{"type":"electronic","value":"9783540360773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36077-8_2","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:24:15Z","timestamp":1184588655000},"page":"11-20","source":"Crossref","is-referenced-by-count":3,"title":["Database Compression Using an Offline Dictionary Method"],"prefix":"10.1007","author":[{"given":"Abu Sayed Md. Latiful","family":"Hoque","sequence":"first","affiliation":[]},{"given":"Douglas","family":"McGregor","sequence":"additional","affiliation":[]},{"given":"John","family":"Wilson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. A. Huffman","year":"1952","unstructured":"Huffman D. A. A method for the construction of minimum-redundancy code. Proc. IRE, 40:9:1098\u20131101, 1952.","journal-title":"Proc. IRE"},{"key":"2_CR2","unstructured":"W.P. Cockshott, D. McGregor, and Wilson J. Kotsis, N. Data compression in database systems. IDEAS\u201998, Cardi., July, 1998."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"G. P. Copeland and S. Khoshafian. A decomposition storage model. In Proceedings of the 1985 ACM SIGMOD, Austin, Texas, May 1985.","DOI":"10.1145\/318898.318923"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/214956.214963","volume":"28","author":"G.V. Cormack","year":"1985","unstructured":"G.V. Cormack. Data compression on a database system. Communication of the ACM, 28:12, 1985.","journal-title":"Communication of the ACM"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"J. Goldstein, R. Ramakrishnan, and U. Shaft. Compressing relations and indexes. Int Proce. IEEE Conf on Data Engineering, 1998.","DOI":"10.1109\/ICDE.1998.655800"},{"key":"2_CR6","unstructured":"McGregor D. R. Hoque A. S. M. L. Storage and querying high dimensional sparsely populated data in compressed representation. In Accepted in EurAsia-ICT, Tehran, Iran, October 2002."},{"key":"2_CR7","unstructured":"Bentley J. and Mcllroy D. Data compression using long common strings. \n                    \n                      http:\/\/www.bell-labs.com\n                    \n                    \n                  ."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Larson N. J. and Moffat A. Off-line dictionary-based compression. Proceedings of the IEEE, 88:11, 2000.","DOI":"10.1109\/5.892708"},{"key":"2_CR9","unstructured":"M Neumuller. Compact data structure for querying xml. Proceedings of EDTB, 2002."},{"issue":"5","key":"2_CR10","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1093\/comjnl\/41.5.283","volume":"41","author":"W. P. Cockshott","year":"1998","unstructured":"Cockshott W. P., MCGregor D., and Wilson J. High-performance operations using a compressed architecture. The Computer Journal, 41:5:283\u2013296, 1998.","journal-title":"The Computer Journal"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"F. Rubin. Experiments in text compression. Commun. ACM, 19, November 1976.","DOI":"10.1145\/360363.360368"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"D. Solomon. Data Compression The Complete Reference. Springer-Verlag New York, Inc., 1998.","DOI":"10.1007\/978-1-4757-2939-9"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"J.A. Storer","year":"1982","unstructured":"J.A. Storer and T.G. Szymanski. Data compression via textual substitution. Journal of the ACM, 29:928\u2013951, 1982.","journal-title":"Journal of the ACM"},{"issue":"6","key":"2_CR14","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"17","author":"T.A. Weltch","year":"1984","unstructured":"Weltch T.A. A technique for high-performance data compression. Computer, 17:6:8\u201319, 1984.","journal-title":"Computer"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/362084.362137","volume":"29","author":"T. Westmann","year":"2000","unstructured":"T. Westmann, D. Kossmann, S. Helmer, and G. Moerkotte. The implementation and performance of compressed databases. SIGMOD Record, 29:3:55\u201367, 2000.","journal-title":"SIGMOD Record"},{"issue":"3","key":"2_CR16","first-page":"337","volume":"IT-23","author":"J. Ziv","year":"1978","unstructured":"J. Ziv and A. Lempel. Compression of individual sequences via variable rate coding. IEEE Transaction on Information Theory, IT-23(3):337\u2013343, 1978.","journal-title":"IEEE Transaction on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36077-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T19:13:40Z","timestamp":1550430820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36077-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000099","9783540360773"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36077-8_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}