{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T22:38:31Z","timestamp":1649198311397},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1016\/0306-4379(86)90006-2","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"177-184","source":"Crossref","is-referenced-by-count":4,"title":["Double encoding\u2014a technique for reducing storage requirement of text"],"prefix":"10.1016","volume":"11","author":[{"given":"M.A.","family":"Bassiouni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Ok","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/0306-4379(86)90006-2_BIB1","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1145\/358105.358194","article-title":"Audit trail compaction for database recovery","volume":"27","author":"Kaunitz","year":"1984","journal-title":"CACM"},{"key":"10.1016\/0306-4379(86)90006-2_BIB2","first-page":"1114","article-title":"Space and time savings through large database compression and dynamic restructuring","volume":"63","author":"Alsberg","year":"1975"},{"key":"10.1016\/0306-4379(86)90006-2_BIB3","series-title":"Proc. 2nd Int. Workshop on Stat. Database Management","first-page":"306","article-title":"Index coding: A compression technique for large statistical databases","author":"Batory","year":"1983"},{"key":"10.1016\/0306-4379(86)90006-2_BIB4","series-title":"The Art of Computer Programming, Vol. 3-Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0306-4379(86)90006-2_BIB5","series-title":"Proc. 2nd Int. Workshop on Statistical Database Management","first-page":"296","article-title":"Computer independent data compression for large statistical databases","author":"Gey","year":"1983"},{"key":"10.1016\/0306-4379(86)90006-2_BIB6","series-title":"Proc. VLDB","first-page":"435","article-title":"Application of data compression techniques to a large bibliographic database","author":"Lynch","year":"1981"},{"issue":"3","key":"10.1016\/0306-4379(86)90006-2_BIB7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1145\/320473.320476","article-title":"The design and implementation of INGRES","volume":"1","author":"Stonebraker","year":"1976","journal-title":"ACM Trans. on Database Systems"},{"issue":"10","key":"10.1016\/0306-4379(86)90006-2_BIB8","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1109\/TSE.1985.231852","article-title":"Data compression in scientific and statistical databases","volume":"SE-11","author":"Bassiouni","year":"1985","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/0306-4379(86)90006-2_BIB9","series-title":"Proc. VLDB","first-page":"223","article-title":"Microprocessor assisted tuple access decompression and assembly for statistical database systems","author":"Hawthorn","year":"1982"},{"key":"10.1016\/0306-4379(86)90006-2_BIB10","series-title":"Proc. 2nd Int. Workshop on Stat. Database management","first-page":"54","article-title":"A multi-tree automation for efficient data transmission","author":"Hazboun","year":"1983"},{"key":"10.1016\/0306-4379(86)90006-2_BIB11","series-title":"Proc. 2nd Int. Workshop on Statistical Database Management","first-page":"338","article-title":"Utilization of character reference locality for efficient storage of databases","author":"Bassiouni","year":"1983"},{"key":"10.1016\/0306-4379(86)90006-2_BIB12","series-title":"Proc. ACM SIGMOD Int. Conf. on Management of Data","first-page":"284","article-title":"A multi-group technique for data compression","author":"Hazboun","year":"1982"},{"issue":"6","key":"10.1016\/0306-4379(86)90006-2_BIB13","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","article-title":"A technique for high-performance data compression","volume":"17","author":"Welch","year":"1984","journal-title":"Computer"},{"issue":"5","key":"10.1016\/0306-4379(86)90006-2_BIB14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"IT-23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. on Info. Theory"},{"issue":"5","key":"10.1016\/0306-4379(86)90006-2_BIB15","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable rate coding","volume":"IT-24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. on Info. Theory"},{"key":"10.1016\/0306-4379(86)90006-2_BIB16","first-page":"1098","article-title":"A method for the construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952"},{"key":"10.1016\/0306-4379(86)90006-2_BIB17","series-title":"Proc. 6th VLDB","first-page":"205","article-title":"Efficient access of compressed data","author":"Eggers","year":"1980"},{"key":"10.1016\/0306-4379(86)90006-2_BIB18","series-title":"Proc. 6th Int. ACM SIGIR Conf. on Res. and Development in Info. Retrieval","first-page":"205","article-title":"Combinatorial compression and partitioning of large dictionaries: theory and experiences","author":"Fraenkel","year":"1983"},{"issue":"9","key":"10.1016\/0306-4379(86)90006-2_BIB19","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1145\/358628.358635","article-title":"File Archival techniques using data compression","volume":"25","author":"Pechura","year":"1982","journal-title":"CACM"},{"key":"10.1016\/0306-4379(86)90006-2_BIB20","series-title":"Computational Analysis on Present-Day American English","author":"Kucera","year":"1967"},{"issue":"6","key":"10.1016\/0306-4379(86)90006-2_BIB21","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","article-title":"Variations on a theme by Huffman","volume":"IT-24","author":"Gallager","year":"1978","journal-title":"IEEE Trans. On Info. Theory"},{"issue":"7","key":"10.1016\/0306-4379(86)90006-2_BIB22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/361011.361061","article-title":"The UNIX time-sharing system","volume":"17","author":"Ritchie","year":"1974","journal-title":"CACM"},{"issue":"6","key":"10.1016\/0306-4379(86)90006-2_BIB23","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/3812.3815","article-title":"Data compression using static Huffman code-decode tables","volume":"28","author":"McIntyre","year":"1985","journal-title":"Communications of ACM"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437986900062?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437986900062?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:53:08Z","timestamp":1552625588000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437986900062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["0306437986900062"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(86)90006-2","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}