{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T19:51:10Z","timestamp":1759693870362},"reference-count":12,"publisher":"Elsevier BV","issue":"6","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 Processing & Management"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1016\/0306-4573(86)90100-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T18:05:40Z","timestamp":1034100340000},"page":"493-501","source":"Crossref","is-referenced-by-count":8,"title":["Compression of index term dictionary in an inverted-file-orientated database: Some effective algorithms"],"prefix":"10.1016","volume":"22","author":[{"given":"Janusz L.","family":"Wis\u0300niewski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0306-4573(86)90100-7_BIB1","series-title":"File Structures for On-line Systems","author":"Lefkovitz","year":"1969"},{"key":"10.1016\/0306-4573(86)90100-7_BIB2","first-page":"87","article-title":"The comparative efficiency of two dictionary structures for document retrieval","volume":"20","author":"Ein-Dor","year":"1974","journal-title":"INFOR"},{"key":"10.1016\/0306-4573(86)90100-7_BIB3","series-title":"Human Behaviour and the Principle of Least Effort","author":"Zipf","year":"1949"},{"key":"10.1016\/0306-4573(86)90100-7_BIB4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0306-4379(83)90030-3","article-title":"A practitioner's guide to data base compression","volume":"8","author":"Severance","year":"1983","journal-title":"Inf. Systems"},{"key":"10.1016\/0306-4573(86)90100-7_BIB5","first-page":"1098","article-title":"A method for construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952"},{"key":"10.1016\/0306-4573(86)90100-7_BIB6","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1145\/322344.322346","article-title":"Data compression via textual substitution","volume":"29","author":"Storer","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0306-4573(86)90100-7_BIB7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0306-4573(78)90067-5","article-title":"Selection of prefix and postfix word fragments for data compression","volume":"14","author":"Radhakrishnan","year":"1978","journal-title":"Inf. Proc. Manage."},{"key":"10.1016\/0306-4573(86)90100-7_BIB8","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0306-4573(86)90100-7_BIB9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/comjnl\/25.2.183","article-title":"Quasi equi-frequent group generation and evaluation","volume":"25","author":"Yannakoudakis","year":"1982","journal-title":"Comput. J."},{"key":"10.1016\/0306-4573(86)90100-7_BIB10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0306-4573(76)90041-8","article-title":"A mathematical model for estimating the effectiveness of bigram coding","volume":"12","author":"Bookstein","year":"1976","journal-title":"Inf. Proc. Manage."},{"key":"10.1016\/0306-4573(86)90100-7_BIB11","series-title":"Ph.D thesis","article-title":"On some data compression techniques based on the codeable elements selection from sources with known statistical characteristics","author":"Wis\u0300niewski","year":"1985"},{"key":"10.1016\/0306-4573(86)90100-7_BIB12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0020-0271(73)90072-7","article-title":"Analysis of the microstructure of titles in the Inspec database","volume":"9","author":"Lynch","year":"1973","journal-title":"Inf. Storage Retrieval"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306457386901007?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306457386901007?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T09:21:44Z","timestamp":1554888104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306457386901007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["0306457386901007"],"URL":"https:\/\/doi.org\/10.1016\/0306-4573(86)90100-7","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}