{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:24:03Z","timestamp":1759335843308,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_24","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"327-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Space-Efficient B Trees via\u00a0Load-Balancing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9106-6192","authenticated-orcid":false,"given":"Tomohiro","family":"I","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8721-4444","authenticated-orcid":false,"given":"Dominik","family":"K\u00f6ppl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. In: Proceedings of the SIGFIDET, pp. 107\u2013141 (1970)","key":"24_CR1","DOI":"10.21236\/AD0712079"},{"issue":"11","key":"24_CR2","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.1007\/s00453-017-0380-7","volume":"80","author":"P Bille","year":"2018","unstructured":"Bille, P., et al.: Dynamic relative compression, dynamic partial sums, and substring concatenation. Algorithmica 80(11), 3207\u20133224 (2018)","journal-title":"Algorithmica"},{"unstructured":"Blandford, D.K., Blelloch, G.E.: Compact representations of ordered sets. In: Proceedings of the SODA, pp. 11\u201319 (2004)","key":"24_CR3"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D.: The ubiquitous B-tree. ACM Comput. Surv. 11(2), 121\u2013137 (1979)","journal-title":"ACM Comput. Surv."},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-69507-3_19","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"ON Delpratt","year":"2007","unstructured":"Delpratt, O.N., Rahman, N., Raman, R.: Compressed prefix sums. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 235\u2013247. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69507-3_19"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-51542-9_5","volume-title":"Algorithms and Data Structures","author":"PF Dietz","year":"1989","unstructured":"Dietz, P.F.: Optimal algorithms for list indexing and subset rank. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1989. LNCS, vol. 382, pp. 39\u201346. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-51542-9_5"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/321812.321820","volume":"21","author":"P Elias","year":"1974","unstructured":"Elias, P.: Efficient storage and retrieval by content and address of static files. J. ACM 21(2), 246\u2013260 (1974)","journal-title":"J. ACM"},{"issue":"24","key":"24_CR8","doi-asserted-by":"publisher","first-page":"2668","DOI":"10.1016\/j.tcs.2010.10.030","volume":"412","author":"A Farzan","year":"2011","unstructured":"Farzan, A., Munro, J.I.: Succinct representation of dynamic trees. Theor. Comput. Sci. 412(24), 2668\u20132678 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P Ferragina","year":"1999","unstructured":"Ferragina, P., Grossi, R.: The string B-tree: a new data structure for string search in external memory and its applications. J. ACM 46(2), 236\u2013280 (1999)","journal-title":"J. ACM"},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00224-005-1167-9","volume":"39","author":"G Franceschini","year":"2006","unstructured":"Franceschini, G., Grossi, R.: Optimal implicit dictionaries over unbounded universes. Theory Comput. Syst. 39(2), 321\u2013345 (2006)","journal-title":"Theory Comput. Syst."},{"issue":"43","key":"24_CR11","doi-asserted-by":"publisher","first-page":"4414","DOI":"10.1016\/j.tcs.2009.07.022","volume":"410","author":"R Gonz\u00e1lez","year":"2009","unstructured":"Gonz\u00e1lez, R., Navarro, G.: Rank\/select on dynamic compressed sequences and applications. Theor. Comput. Sci. 410(43), 4414\u20134422 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"24_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1561\/1900000028","volume":"3","author":"G Graefe","year":"2011","unstructured":"Graefe, G.: Modern B-tree techniques. Found. Trends Databases 3(4), 203\u2013402 (2011)","journal-title":"Found. Trends Databases"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-16321-0_35","volume-title":"String Processing and Information Retrieval","author":"M He","year":"2010","unstructured":"He, M., Munro, J.I.: Succinct representations of dynamic strings. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 334\u2013346. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16321-0_35"},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/COMST.2014.2354398","volume":"17","author":"P Jesus","year":"2015","unstructured":"Jesus, P., Baquero, C., Almeida, P.S.: A survey of distributed data aggregation algorithms. IEEE Commun. Surv. Tutor. 17(1), 381\u2013404 (2015)","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"23","key":"24_CR15","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1016\/j.ipl.2010.08.007","volume":"110","author":"J Katajainen","year":"2010","unstructured":"Katajainen, J., Rao, S.S.: A compact data structure for representing a dynamic multiset. Inf. Process. Lett. 110(23), 1061\u20131066 (2010)","journal-title":"Inf. Process. Lett."},{"unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 3: Sorting and Searching. Addison Wesley, Redwood City (1998)","key":"24_CR16"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/978-3-662-48350-3_74","volume-title":"Algorithms - ESA 2015","author":"JI Munro","year":"2015","unstructured":"Munro, J.I., Nekrich, Y.: Compressed data structures for dynamic sequences. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 891\u2013902. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_74"},{"issue":"5","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1137\/130908245","volume":"43","author":"G Navarro","year":"2014","unstructured":"Navarro, G., Nekrich, Y.: Optimal dynamic sequence representations. SIAM J. Comput. 43(5), 1781\u20131806 (2014)","journal-title":"SIAM J. Comput."},{"unstructured":"Prezza, N.: A framework of dynamic data structures for string processing. In: Proceedings of the SEA. LIPIcs, vol. 75, pp. 11:1\u201311:15 (2017)","key":"24_CR19"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-45061-0_30","volume-title":"Automata, Languages and Programming","author":"R Raman","year":"2003","unstructured":"Raman, R., Rao, S.S.: Succinct dynamic dictionaries and trees. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 357\u2013368. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_30"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:07:09Z","timestamp":1653779229000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}