{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:04:28Z","timestamp":1725847468591},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319289397"},{"type":"electronic","value":"9783319289403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-28940-3_2","type":"book-chapter","created":{"date-parts":[[2016,1,21]],"date-time":"2016-01-21T12:04:06Z","timestamp":1453377846000},"page":"15-28","source":"Crossref","is-referenced-by-count":4,"title":["Access Time Tradeoffs in Archive Compression"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Petri","sequence":"first","affiliation":[]},{"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[]},{"given":"P. C.","family":"Nagesh","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,22]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Bergman, A., Zohar, E.: Compressing Yahoo mail. In: Proceedings of the DCC, pp. 223\u2013232 (2015)","DOI":"10.1109\/DCC.2015.15"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-319-11918-2_2","volume-title":"String Processing and Information Retrieval","author":"H Ferrada","year":"2014","unstructured":"Ferrada, H., Gagie, T., Gog, S., Puglisi, S.J.: Relative Lempel-Ziv with constant-time random access. In: Moura, E., Crochemore, M. (eds.) SPIRE 2014. LNCS, vol. 8799, pp. 13\u201317. Springer, Heidelberg (2014)"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/63334.63341","volume":"32","author":"ER Fiala","year":"1989","unstructured":"Fiala, E.R., Greene, D.H.: Data compression with finite windows. Commun. ACM 32(4), 490\u2013505 (1989)","journal-title":"Commun. ACM"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","volume-title":"Experimental Algorithms","author":"S Gog","year":"2014","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Gudmundsson, J., Katajainen, J. (eds.) sea 2014. LNCS, vol. 8504, pp. 326\u2013337. Springer, Heidelberg (2014)"},{"issue":"3","key":"2_CR5","first-page":"265","volume":"5","author":"C Hoobin","year":"2011","unstructured":"Hoobin, C., Puglisi, S.J., Zobel, J.: Relative Lempel-Ziv factorization for efficient storage and retrieval of web collections. PVLDB 5(3), 265\u2013273 (2011)","journal-title":"PVLDB"},{"key":"2_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0935-6","volume-title":"Compression and Coding Algorithms","author":"A Moffat","year":"2002","unstructured":"Moffat, A., Turpin, A.: Compression and Coding Algorithms. Kluwer, Boston (2002)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Tong, J., Wirth, A., Zobel, J.: Principled dictionary pruning for low-memory corpus compression. In: Proceedings of the SIGIR, pp. 283\u2013292 (2014)","DOI":"10.1145\/2600428.2609576"},{"key":"2_CR8","unstructured":"Webber, W., Moffat, A.: In search of reliable retrieval experiments. In: Proceedings of the 10th Australasian Document Computing Symposium, pp. 26\u201333 (2005)"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1093\/comjnl\/42.3.193","volume":"42","author":"HE Williams","year":"1999","unstructured":"Williams, H.E., Zobel, J.: Compressing integers for fast file access. Comput. J. 42(3), 193\u2013201 (1999)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Information Retrieval Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28940-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:48:42Z","timestamp":1559389722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28940-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319289397","9783319289403"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28940-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}