{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:56Z","timestamp":1760202656745},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401725"},{"type":"electronic","value":"9783642401732"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40173-2_17","type":"book-chapter","created":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T01:38:34Z","timestamp":1376703514000},"page":"189-202","source":"Crossref","is-referenced-by-count":1,"title":["Implementing Efficient Updates in Compressed Big Text Databases"],"prefix":"10.1007","author":[{"given":"Stefan","family":"B\u00f6ttcher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"B\u00fcltmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rita","family":"Hartel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Schl\u00fc\u00dfler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"B\u00f6ttcher, S., B\u00fcltmann, A., Hartel, R.: Search and Modification in Compressed Texts. In: 2011 Data Compression Conference (DCC 2011), Snowbird, UT, USA, pp. 403\u2013412 (2011)","DOI":"10.1109\/DCC.2011.47"},{"key":"17_CR2","unstructured":"Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124 (1994)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Buneman, P., Grohe, M., Koch, C.: Path Queries on Compressed XML. In: Proceedings of 29th International Conference on Very Large Data Bases, Berlin, Germany, pp. 141\u2013152 (2003)","DOI":"10.1016\/B978-012722442-8\/50021-5"},{"key":"17_CR4","unstructured":"Zhang, N., Kacholia, V., \u00d6zsu, M.: A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML. In: Proceedings of the 20th International Conference on Data Engineering, ICDE 2004, Boston, MA, USA, pp. 54\u201365 (2004)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-39467-6_15","volume-title":"Big Data","author":"S. B\u00f6ttcher","year":"2013","unstructured":"B\u00f6ttcher, S., Hartel, R., Jacobs, T.: Fast multi-update operations on compressed XML data. In: Gottlob, G., Grasso, G., Olteanu, D., Schallhart, C. (eds.) BNCOD 2013. LNCS, vol.\u00a07968, pp. 149\u2013164. Springer, Heidelberg (2013)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. In: Proceedings of the I.R.E., pp. 1098\u20131101 (1952)","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0166-218X(93)00116-H","volume":"64","author":"A. Fraenkel","year":"1996","unstructured":"Fraenkel, A., Klein, S.: Robust Universal Complete Codes for Transmission and Compression. Discrete Applied Mathematics\u00a064, 31\u201355 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","volume":"12","author":"S. Golomb","year":"1966","unstructured":"Golomb, S.: Run-length encodings. IEEE Transactions on Information Theory\u00a012, 399\u2013401 (1966)","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"I. Witten","year":"1987","unstructured":"Witten, I., Neal, R., Cleary, J.: Arithmetic Coding for Data Compression. Commun. ACM\u00a030, 520\u2013540 (1987)","journal-title":"Commun. ACM"},{"key":"17_CR10","unstructured":"Martin, G.N.N.: Range encoding: an algorithm for removing redundancy from a digitized message. In: Video and Data Recording Conference, Southhampton (1979)"},{"key":"17_CR11","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 Transactions on Information Theory\u00a023, 337\u2013343 (1977)","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR12","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, 530\u2013536 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"17","author":"T. Welch","year":"1984","unstructured":"Welch, T.: A Technique for High-Performance Data Compression. IEEE Computer\u00a017, 8\u201319 (1984)","journal-title":"IEEE Computer"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"J. Cleary","year":"1984","unstructured":"Cleary, J., Witten, I.: Data Compression Using Adaptive Coding and Partial String Matching. IEEE Transactions on Communications\u00a032, 396\u2013402 (1984)","journal-title":"IEEE Transactions on Communications"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1093\/comjnl\/30.6.541","volume":"30","author":"G. Cormack","year":"1987","unstructured":"Cormack, G., Horspool, R.: Data Compression Using Dynamic Markov Modelling. Comput. J.\u00a030, 541\u2013550 (1987)","journal-title":"Comput. J."},{"key":"17_CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"C. Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C., Witten, I.: Identifying Hierarchical Structure in Sequences: A Linear-Time Algorithm. J. Artif. Intell. Res. (JAIR)\u00a07, 67\u201382 (1997)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Kreft, S., Navarro, G.: LZ77-Like Compression with Fast Random Access. In: 2010 Data Compression Conference (DCC 2010), Snowbird, UT, USA, pp. 239\u2013248 (2010)","DOI":"10.1109\/DCC.2010.29"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Bille, P., Landau, G., Raman, R., Sadakane, K., Satti, S., Weimann, O.: Random Access to grammar-Compressed Strings. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, pp. 373\u2013389 (2011)","DOI":"10.1137\/1.9781611973082.30"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Chan, H.-L., Hon, W.-K., Lam, T., Sadakane, K.: Compressed indexes for dynamic text collections. ACM Transactions on Algorithms\u00a03 (2007)","DOI":"10.1145\/1240233.1240244"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.jda.2006.03.011","volume":"5","author":"K. Sadakane","year":"2007","unstructured":"Sadakane, K.: Succinct data structures for flexible text retrieval systems. J. Discrete Algorithms\u00a05, 12\u201322 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM\u00a052, 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"17_CR22","unstructured":"Ferragina, P., Manzini, G.: An experimental study of an opportunistic index. In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, Washington, DC, USA, pp. 269\u2013278 (2001)"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"4350","DOI":"10.1016\/j.tcs.2009.07.016","volume":"410","author":"M. Salson","year":"2009","unstructured":"Salson, M., Lecroq, T., L\u00e9onard, M., Mouchard, L.: A four-stage algorithm for updating a Burrows-Wheeler transform. Theor. Comput. Sci.\u00a0410, 4350\u20134359 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jda.2011.01.002","volume":"11","author":"M. L\u00e9onard","year":"2012","unstructured":"L\u00e9onard, M., Mouchard, L., Salson, M.: On the number of elements to reorder when updating a suffix array. J. Discrete Algorithms\u00a011, 87\u201399 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"17_CR25","first-page":"40","volume":"12","author":"V. M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G.: Succinct Suffix Arrays based on Run-Length Encoding. Nord. J. Comput.\u00a012, 40\u201366 (2005)","journal-title":"Nord. J. Comput."},{"key":"17_CR26","unstructured":"Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, USA, pp. 841\u2013850 (2003)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40173-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:02:45Z","timestamp":1558015365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40173-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401725","9783642401732"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40173-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}