{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T05:24:14Z","timestamp":1649049854843},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8873,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,4]]},"DOI":"10.1016\/0022-0000(89)90009-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"405-430","source":"Crossref","is-referenced-by-count":1,"title":["Rearranging data to maximize the efficiency of compression"],"prefix":"10.1016","volume":"38","author":[{"given":"Frank","family":"Olken","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doron","family":"Rotem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 4","key":"10.1016\/0022-0000(89)90009-3_BIB1","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1145\/320107.320125","article-title":"On searching transposed files","volume":"4","author":"Batory","year":"1979","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0022-0000(89)90009-3_BIB2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0019-9958(72)90211-2","article-title":"Minimizing expected travel time on geometrical patterns by optimal probability rearrangements","volume":"20","author":"Bergmans","year":"1972","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(89)90009-3_BIB3","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1109\/TIT.1969.1054385","article-title":"Space-filling curves: Their generation and application to bandwidth reduction","volume":"IT-15","author":"Bially","year":"1969","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/0022-0000(89)90009-3_BIB4","doi-asserted-by":"crossref","DOI":"10.1147\/rd.182.0172","article-title":"Image data compression by predictive coding ii: Encoding Algorithms","volume":"18","author":"Bahl","year":"1974","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0022-0000(89)90009-3_BIB5","first-page":"424","article-title":"Alternative algorithm for hilbert's space filling curve","volume":"IT-17","author":"Butz","year":"1971","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0022-0000(89)90009-3_BIB6","series-title":"Proceedings, International Conference on Very Large Databases (VLDB)","first-page":"424","article-title":"A compression technique for large statistical databases","author":"Eggers","year":"1981"},{"key":"10.1016\/0022-0000(89)90009-3_BIB7","series-title":"Proceedings, 6th International Conference on Very Large Databases (VLDB)","first-page":"205","article-title":"Efficient access of compressed data","author":"Eggers","year":"1980"},{"key":"10.1016\/0022-0000(89)90009-3_BIB8","series-title":"Eighth Annual Symposium on Theory of Computing, ACM SIGACT","first-page":"10","article-title":"Some NP-complete geometric problems","author":"Garey","year":"1976"},{"key":"10.1016\/0022-0000(89)90009-3_BIB9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","article-title":"Run-length encoding","volume":"IT-12","author":"Golomb","year":"1966","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0022-0000(89)90009-3_BIB10","series-title":"Inequalities","author":"Hardy","year":"1952"},{"key":"10.1016\/0022-0000(89)90009-3_BIB11","series-title":"Fundamentals of Data Structures","author":"Horowitz","year":"1977"},{"key":"10.1016\/0022-0000(89)90009-3_BIB12","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1109\/TC.1968.226443","article-title":"Mapping multi-dimensional space to one dimension for computer output display","volume":"C-17","author":"Patrick","year":"1968","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0022-0000(89)90009-3_BIB13","series-title":"Database Design","author":"Wiederhold","year":"1983"},{"key":"10.1016\/0022-0000(89)90009-3_BIB14","first-page":"168","article-title":"Minimizing expected head movement in one-dimensional and two-dimensional mass storage systems","volume":"1","author":"Wong","year":"1980","journal-title":"Comput. Surveys"},{"key":"10.1016\/0022-0000(89)90009-3_BIB15","series-title":"Algorithmic Studies in Mass Storage Systems","author":"Wong","year":"1983"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900093?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:54:45Z","timestamp":1550325285000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0022000089900093"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90009-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}