{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T05:09:25Z","timestamp":1761109765510},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Inf Syst Front"],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s10796-006-8777-x","type":"journal-article","created":{"date-parts":[[2006,7,9]],"date-time":"2006-07-09T05:35:48Z","timestamp":1152423348000},"page":"147-161","source":"Crossref","is-referenced-by-count":8,"title":["A data mining approach to database compression"],"prefix":"10.1007","volume":"8","author":[{"given":"Chin-Feng","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Wesley","family":"Changchien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Tse","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jau-Ji","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8777_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0020-0255(01)00100-1","volume":"135","author":"SD Agostino","year":"2001","unstructured":"Agostino SD. Parallelism and dictionary based data compression. Information Sciences 2001;135:43\u201356.","journal-title":"Information Sciences"},{"key":"8777_CR2","doi-asserted-by":"crossref","unstructured":"Babu S, Garofalakis M, Rastogi R. SPARTAN: a model-based semantic compression system for massive data tables. In: Proceedings of ACM SIGMOD\u2032;2001. 2001;283\u2013294.","DOI":"10.1145\/375663.375693"},{"issue":"10","key":"8777_CR3","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1109\/12.888040","volume":"49","author":"B Balkenhol","year":"2000","unstructured":"Balkenhol B, Kurtz S. Universal data compression based on the burrows-wheeler transformation: theory and practice. IEEE Transactions on Computers 2000;49(10):1043\u20131053.","journal-title":"IEEE Transactions on Computers"},{"issue":"10","key":"8777_CR4","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1109\/TSE.1985.231852","volume":"SE-11","author":"MA Bassiouni","year":"1985","unstructured":"Bassiouni MA. Data compression in scientific and statistical databases. IEEE Transactions on Software Engineering 1985;SE-11(10):1047\u20131058.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"8777_CR5","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1145\/76894.76896","volume":"21","author":"TC Bell","year":"1989","unstructured":"Bell TC, Witten IH, Cleary JG. Modeling for text compression. ACM Computing Surveys 1989;21:557\u2013591.","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"8777_CR6","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1145\/5684.5688","volume":"29","author":"JL Bentley","year":"1986","unstructured":"Bentley JL, Sleator DD, Tarjan RE, Wei VK. A locally adaptive data compression scheme. Communications of the ACM 1986;29(4):320\u2013330.","journal-title":"Communications of the ACM"},{"issue":"2","key":"8777_CR7","first-page":"6","volume":"22","author":"A Cannane","year":"2000","unstructured":"Cannane A, Williams HE. A compression scheme for large databases. In: Australasian Database Conference. 2000;22(2):6\u201311.","journal-title":"Australasian Database Conference"},{"issue":"2","key":"8777_CR8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0164-1212(95)00200-6","volume":"36","author":"CC Chang","year":"1997","unstructured":"Chang CC, Wang CH. A locally adaptive data compression strategy for chinese-english characters. Journal of Systems and Software 1997;36(2):167\u2013179.","journal-title":"Journal of Systems and Software"},{"issue":"6","key":"8777_CR9","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1093\/comjnl\/36.6.570","volume":"36","author":"HKC Chang","year":"1993","unstructured":"Chang HKC, Chen SH. A new locally adaptive data compression scheme using multilist structure. The Computer Journal 1993;36(6):570\u2013578.","journal-title":"The Computer Journal"},{"key":"8777_CR10","first-page":"7","volume":"6","author":"SW Changchien","year":"2001","unstructured":"Changchien SW, Lu TC. Knowledge discovery from object-oriented databases using an association rules mining algorithm. In: Proceedings of the Fifth International Conference on Knowledge-Based Intelligent Information Engineering Systems & Allied Technologies 2001;6:7\u20138.","journal-title":"Proceedings of the Fifth International Conference on Knowledge-Based Intelligent Information Engineering Systems & Allied Technologies"},{"key":"8777_CR11","unstructured":"Cockshott WP, McGregor, Kotsis DN, Wilson J. Data compression in database systems. In: Proceedings International Database Engineering and Applications Symposium 1998."},{"key":"8777_CR12","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1093\/comjnl\/30.6.541","volume":"30","author":"GV Connack","year":"1987","unstructured":"Connack GV, Horspool RNS. Data compression using dynamic markov modeling. The Computer Journal 1987;30:541\u2013550.","journal-title":"The Computer Journal"},{"key":"8777_CR13","doi-asserted-by":"crossref","first-page":"1336","DOI":"10.1145\/214956.214963","volume":"28","author":"GV Cormack","year":"1985","unstructured":"Cormack GV. Data compression on a database system. Communications of the ACM 1985;28:1336\u20131342.","journal-title":"Communications of the ACM"},{"issue":"11","key":"8777_CR14","doi-asserted-by":"crossref","first-page":"1756","DOI":"10.1109\/5.892711","volume":"88","author":"M Crochemore","year":"2000","unstructured":"Crochemore M, Mignosi F, Restivo A, Salemi S. Data compression using antidictionaries. In: Proceedings of the IEEE 2000;88(11):1756\u20131768.","journal-title":"Proceedings of the IEEE"},{"issue":"11","key":"8777_CR15","doi-asserted-by":"crossref","first-page":"1703","DOI":"10.1109\/5.892706","volume":"88","author":"M Effros","year":"2000","unstructured":"Effros M. PPM performance with BWT complexity: a fast and effective data compression algorithm. In: Proceedings of the IEEE 88(11), 2000:1703\u20131712.","journal-title":"Proceedings of the IEEE"},{"key":"8777_CR16","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"IT-21","author":"P Elias","year":"1975","unstructured":"Elias P. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory 1975;IT-21:194\u2013203.","journal-title":"IEEE Transactions on Information Theory"},{"key":"8777_CR17","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","volume":"IT-24","author":"RG Gallagher","year":"1978","unstructured":"Gallagher RG. Variations on a theme by huffman. IEEE Transactions on Information Theory 1978;IT-24:668\u2013674.","journal-title":"IEEE Transactions on Information Theory"},{"key":"8777_CR18","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1109\/PROC.1980.11676","volume":"68","author":"JD Gibson","year":"1980","unstructured":"Gibson JD. Adaptive prediction in speech differential encoding system. In: Proceedings of the IEEE. 1980; 68:488\u2013525.","journal-title":"Proceedings of the IEEE"},{"key":"8777_CR19","unstructured":"Goh CL, Aisaka K, Tsukamoto M, Harumoto K, Nishio S. Database compression with data mining methods. In: Proceedings of FODO\u2032;98. 1998;97\u2013106."},{"key":"8777_CR20","doi-asserted-by":"crossref","unstructured":"Huffman D. A method for the construction of minimum redundancy codes. In: Proceedings of IRE. 1951;1098\u20131101.","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"8777_CR21","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0196-6774(85)90036-7","volume":"6","author":"DE Knuth","year":"1985","unstructured":"Knuth DE. Dynamic huffman coding. Journal of Algorithms 1985;6:163\u2013180.","journal-title":"Journal of Algorithms"},{"key":"8777_CR22","doi-asserted-by":"crossref","unstructured":"Linoff G, Stanfill C. Compression of indexes with full positional information in very large text databases. In: Proceedings of the 16th International. ACM SIGIR Conference on Research and Development in Information Retrieval. 1993;88\u201395.","DOI":"10.1145\/160688.160699"},{"issue":"2","key":"8777_CR23","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/69.591454","volume":"9","author":"A Moffat","year":"1997","unstructured":"Moffat A, Zobel J. Text compression for dynamic document database. IEEE Transactions on Knowledge and Data Engineering 1997;9(2):302\u2013313.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"8777_CR24","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/69.591455","volume":"9","author":"WK Ng","year":"1997","unstructured":"Ng WK, Ravishankar CV. Block-oriented compression techniques for large statistical databases. IEEE Transactions on Knowledge and Data Engineering 1997;9(2):314\u2013328.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"8777_CR25","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak Z. Rough sets. International Journal of Computer and Information Science 1982;11:341\u2013356.","journal-title":"International Journal of Computer and Information Science"},{"key":"8777_CR26","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1145\/31846.42227","volume":"34","author":"JS Vitter","year":"1987","unstructured":"Vitter JS. Design and analysis of dynamic huffman codes. Journal of ACM 1987;34:825\u2013845.","journal-title":"Journal of ACM"},{"key":"8777_CR27","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"17","author":"TA Welch","year":"1984","unstructured":"Welch TA. A technique for high-performance data compression. IEEE Computer 1984;17:8\u201319.","journal-title":"IEEE Computer"},{"issue":"6","key":"8777_CR28","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"IH Witten","year":"1987","unstructured":"Witten IH, Neal RM, Cleary JG. Arithmetic coding for data compression. Communications of ACM 1987;30(6):520\u2013540.","journal-title":"Communications of ACM"},{"issue":"6","key":"8777_CR29","doi-asserted-by":"crossref","first-page":"2130","DOI":"10.1109\/18.945239","volume":"47","author":"EH Yang","year":"2001","unstructured":"Yang EH, Kaltchenko A, Kieffer JC. Universal lossless data compression with side information by using a conditional MPM grammar transform. IEEE Transactions on Information Theory 2001;47(6):2130\u20132150.","journal-title":"IEEE Transactions on Information Theory"},{"key":"8777_CR30","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT-23","author":"J Ziv","year":"1977","unstructured":"Ziv J, Lempel A. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 1977;IT-23:337\u2013343.","journal-title":"IEEE Transactions on Information Theory"},{"key":"8777_CR31","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"IT-24","author":"J Ziv","year":"1978","unstructured":"Ziv J, Lempel A. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 1978;IT-24:530\u2013536.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Information Systems Frontiers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-006-8777-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10796-006-8777-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-006-8777-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:36:06Z","timestamp":1559262966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10796-006-8777-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["8777"],"URL":"https:\/\/doi.org\/10.1007\/s10796-006-8777-x","relation":{},"ISSN":["1387-3326","1572-9419"],"issn-type":[{"value":"1387-3326","type":"print"},{"value":"1572-9419","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7]]}}}