{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T23:05:47Z","timestamp":1746313547017},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447765"},{"type":"electronic","value":"9783662447772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44777-2_34","type":"book-chapter","created":{"date-parts":[[2014,8,16]],"date-time":"2014-08-16T10:43:15Z","timestamp":1408185795000},"page":"406-417","source":"Crossref","is-referenced-by-count":13,"title":["Bicriteria Data Compression: Efficient and Usable"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Farruggia","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Ferragina","sequence":"additional","affiliation":[]},{"given":"Rossano","family":"Venturini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. Springer (2008)","DOI":"10.1007\/978-0-387-78909-5"},{"issue":"2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1006\/jagm.1997.0885","volume":"25","author":"J. B\u00e9k\u00e9si","year":"1997","unstructured":"B\u00e9k\u00e9si, J., Galambos, G., Pferschy, U., Woeginger, G.J.: Greedy algorithms for on-line data compression. J. Algorithms\u00a025(2), 274\u2013289 (1997)","journal-title":"J. Algorithms"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Borthakur, D., et al.: Apache Hadoop goes realtime at Facebook. In: SIGMOD, pp. 1071\u20131080 (2011)","DOI":"10.1145\/1989323.1989438"},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-10631-6_19","volume-title":"Algorithms and Computation","author":"G.S. Brodal","year":"2009","unstructured":"Brodal, G.S., Fagerberg, R., Greve, M., L\u00f3pez-Ortiz, A.: Online sorted range reporting. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 173\u2013182. Springer, Heidelberg (2009)"},{"key":"34_CR5","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Tech. Rep. Digital (1994)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Chang, F., et al.: Bigtable: A distributed storage system for structured data. ACM Transactions on Computer Systems\u00a026(2) (2008)","DOI":"10.1145\/1365815.1365816"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Farruggia, A., Ferragina, P., Frangioni, A., Venturini, R.: Bicriteria data compression. In: SODA, pp. 1582\u20131595 (2014)","DOI":"10.1137\/1.9781611973402.115"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1145\/1082036.1082043","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Giancarlo, R., Manzini, G., Sciortino, M.: Boosting textual compression in optimal linear time. Journal of the ACM\u00a052, 688\u2013713 (2005)","journal-title":"Journal of the ACM"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Nitto, I., Venturini, R.: On the bit-complexity of Lempel-Ziv compression. In: SODA, pp. 768\u2013777 (2009)","DOI":"10.1137\/1.9781611973068.84"},{"issue":"1","key":"34_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00453-010-9437-6","volume":"61","author":"P. Ferragina","year":"2011","unstructured":"Ferragina, P., Nitto, I., Venturini, R.: On optimally partitioning a text to improve its compression. Algorithmica\u00a061(1), 51\u201374 (2011)","journal-title":"Algorithmica"},{"issue":"4","key":"34_CR11","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1137\/120869511","volume":"42","author":"P. Ferragina","year":"2013","unstructured":"Ferragina, P., Nitto, I., Venturini, R.: On the bit-complexity of Lempel-Ziv compression. SIAM Journal on Computing (SICOMP)\u00a042(4), 1521\u20131541 (2013)","journal-title":"SIAM Journal on Computing (SICOMP)"},{"issue":"2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/128749.128751","volume":"39","author":"J. Katajainen","year":"1992","unstructured":"Katajainen, J., Raita, T.: An analysis of the longest match and the greedy heuristics in text encoding. Journal of the ACM\u00a039(2), 281\u2013294 (1992)","journal-title":"Journal of the ACM"},{"issue":"2\/3","key":"34_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1093\/comjnl\/40.2_and_3.117","volume":"40","author":"S.T. Klein","year":"1997","unstructured":"Klein, S.T.: Efficient optimal recompression. Computer Journal\u00a040(2\/3), 117\u2013126 (1997)","journal-title":"Computer Journal"},{"key":"34_CR14","unstructured":"Huang, L., Jia, J., Yu, B., Chun, B., Maniatis, P., Naik, M.: Predicting execution time of computer programs using sparse polynomial regression. In: NIPS, pp. 883\u2013891 (2010)"},{"key":"34_CR15","unstructured":"Salomon, D.: Data Compression: the Complete Reference, 4th edn. Springer (2006)"},{"issue":"9-10","key":"34_CR16","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0020-0271(74)90069-2","volume":"10","author":"E.J. Schuegraf","year":"1974","unstructured":"Schuegraf, E.J., Heaps, H.S.: A comparison of algorithms for data base compression by use of fragments as language elements. Information Storage and Retrieval\u00a010(9-10), 309\u2013319 (1974)","journal-title":"Information Storage and Retrieval"},{"issue":"2","key":"34_CR17","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/3149.3152","volume":"32","author":"M.E.G. Smith","year":"1985","unstructured":"Smith, M.E.G., Storer, J.A.: Parallel algorithms for data compression. Journal of the ACM\u00a032(2), 344\u2013373 (1985)","journal-title":"Journal of the ACM"},{"key":"34_CR18","unstructured":"Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers (1999)"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transaction on Information Theory\u00a023, 337\u2013343 (1977)","journal-title":"IEEE Transaction on Information Theory"},{"issue":"5","key":"34_CR20","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory\u00a024(5), 530\u2013536 (1978)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44777-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:19:47Z","timestamp":1558973987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44777-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447765","9783662447772"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44777-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}