{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T01:11:06Z","timestamp":1648861866758},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":[[1983,1]]},"DOI":"10.1016\/0306-4379(83)90009-1","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T21:31:39Z","timestamp":1060291899000},"page":"231-233","source":"Crossref","is-referenced-by-count":3,"title":["Coding methods for text string search on compressed databases"],"prefix":"10.1016","volume":"8","author":[{"given":"P","family":"Goyal","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0306-4379(83)90009-1_BIB1","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1093\/comjnl\/15.3.259","article-title":"The identification of variable-length, equifrequent character strings in a natural language data base","volume":"15","author":"Clare","year":"1972","journal-title":"Comput. J."},{"key":"10.1016\/0306-4379(83)90009-1_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/asi.4630310312","article-title":"Compression of continuous prose texts using variety generation","volume":"31","author":"Cooper","year":"1980","journal-title":"J. Am. Soc. for Informa. Sci."},{"key":"10.1016\/0306-4379(83)90009-1_BIB3","article-title":"Computer coding processes to aid bibliographic record control and storage","author":"Goyal","year":"1981","journal-title":"Ph.D. Thesis University of Bradford"},{"key":"10.1016\/0306-4379(83)90009-1_BIB4","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1145\/362919.362934","article-title":"Implementation of the substring test by Hashing","volume":"14","author":"Harrison","year":"1971","journal-title":"Commun. ACM"},{"key":"10.1016\/0306-4379(83)90009-1_BIB5","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(83)90009-1_BIB6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0020-0271(74)90069-2","article-title":"A comparison of algorithms for data base compression by use of fragments as language elements","volume":"10","author":"Schuegraf","year":"1975","journal-title":"Informa. Storage Retrieval"},{"issue":"1","key":"10.1016\/0306-4379(83)90009-1_BIB7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/spe.4380120104","article-title":"The practicality of text signatures for accelerating string searching","volume":"12","author":"Tharp","year":"1982","journal-title":"Software Practice & Experience"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437983900091?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437983900091?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:52:27Z","timestamp":1552611147000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437983900091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["0306437983900091"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(83)90009-1","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}