{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:38:17Z","timestamp":1743082697912,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181226"},{"type":"electronic","value":"9783319181233"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18123-3_22","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T07:51:48Z","timestamp":1428479508000},"page":"363-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tree Contraction for Compressed Suffix Arrays on Modern Processors"],"prefix":"10.1007","author":[{"given":"Takeshi","family":"Yamamuro","sequence":"first","affiliation":[]},{"given":"Makoto","family":"Onizuka","sequence":"additional","affiliation":[]},{"given":"Toshimori","family":"Honjo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,9]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Grossi, R., Ottaviano, G.: Fast compressed tries through path decompositions. In: Proceedings of ALENEX (2012)","DOI":"10.1137\/1.9781611972924.7"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"22:1","DOI":"10.1145\/2043652.2043655","volume":"36","author":"C Kim","year":"2011","unstructured":"Kim, C., et al.: Designing Fast Architecture-sensitive Tree Search on Modern Multi-core\/Many-core Processors. ACM Transaction on Database Systems 36(4), 22:1\u201322:34 (2011)","journal-title":"ACM Transaction on Database Systems"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Kreft, S., Navarro, G.: LZ77-like Compression with fast random access. In: Proceedings of DCC, pp. 239\u2013248 (2010)","DOI":"10.1109\/DCC.2010.29"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-21458-5_6","volume-title":"Combinatorial Pattern Matching","author":"S Kreft","year":"2011","unstructured":"Kreft, S., Navarro, G.: Self-indexing based on LZ77. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 41\u201354. Springer, Heidelberg (2011)"},{"key":"22_CR5","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In: Proceedings of SODA, pp. 319\u2013327 (1990)"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/382780.382782","volume":"48","author":"G Manzini","year":"2001","unstructured":"Manzini, G.: An Analysis of the Burrows Wheeler Transform. J. ACM 48(3), 407\u2013430 (2001)","journal-title":"J. ACM"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Yamamuro, T., et al. Vast-tree: a vector-advanced and compressed structure for massive data tree traversal. In: Proceedings of EDBT, pp. 396\u2013407 (2012)","DOI":"10.1145\/2247596.2247643"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed Full-Text Indexes. ACM Computing Surveys (CSUR) 39(1) (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-540-30551-4_59","volume-title":"Algorithms and Computation","author":"V M\u00e4kinen","year":"2004","unstructured":"M\u00e4kinen, V., Navarro, G., Sadakane, K.: Advantages of backward searching: efficient secondary memory and distributed implementation of compressed suffix arrays. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 681\u2013692. Springer, Heidelberg (2004)"},{"key":"22_CR10","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings of FOCS (2000)"},{"key":"22_CR11","unstructured":"Kim, C., et al.: Closing the Ninja Performance Gap through Traditional Programming and Compiler Technology. Technical report, Intel Lab. (2012)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Hankins, R.A., Patel, J. M.: Effect of node size on the performance of cache-conscious B+trees. In: Proceedings of SIGMETRICS, pp. 283\u2013294 (2003)","DOI":"10.1145\/885651.781063"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Chen, S., Gibbons, P.B., Mowry, T.C.: Improving index performance through prefetching. In: Proceedings of SIGMOD, pp. 235\u2013246 (2001)","DOI":"10.1145\/376284.375688"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Zhou, J., Ross, K.A.: Buffering accesses to memory-resident index structures. In: Proceedings of VLDB, pp. 405\u2013416 (2003)","DOI":"10.1016\/B978-012722442-8\/50043-4"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: Proceedings of ALENEX, pp. 60\u201370 (2006)","DOI":"10.1137\/1.9781611972870.6"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Schlegel, B., Gemulla, R., Lehner, W.: K-ary search on modern processors. In: Proceedings of DaMoN, pp. 52\u201360 (2009)","DOI":"10.1145\/1565694.1565705"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18123-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:11:00Z","timestamp":1676938260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18123-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181226","9783319181233"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18123-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}