{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:39:09Z","timestamp":1742992749291,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030824716"},{"type":"electronic","value":"9783030824723"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-82472-3_10","type":"book-chapter","created":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T23:03:01Z","timestamp":1629068581000},"page":"121-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Inserting Keys into the Robust Content-and-Structure (RCAS) Index"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Wellenzohn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luka","family":"Popovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"B\u00f6hlen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Helmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,16]]},"reference":[{"issue":"10","key":"10_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/3183558","volume":"61","author":"J Abramatic","year":"2018","unstructured":"Abramatic, J., Cosmo, R.D., Zacchiroli, S.: Building the universal archive of source code. Commun. ACM 61(10), 29\u201331 (2018). https:\/\/doi.org\/10.1145\/3183558","journal-title":"Commun. ACM"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-003-1021-x","volume":"37","author":"L Arge","year":"2003","unstructured":"Arge, L.: The buffer tree: a technique for designing batched external data structures. Algorithmica 37(1), 1\u201324 (2003). https:\/\/doi.org\/10.1007\/s00453-003-1021-x","journal-title":"Algorithmica"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00778-008-0094-1","volume":"18","author":"N Askitis","year":"2009","unstructured":"Askitis, N., Zobel, J.: B-tries for disk-based string management. VLDB J. 18(1), 157\u2013179 (2009). https:\/\/doi.org\/10.1007\/s00778-008-0094-1","journal-title":"VLDB J."},{"doi-asserted-by":"crossref","unstructured":"Di Cosmo, R., Zacchiroli, S.: Software heritage: why and how to preserve software source code. In: iPRES (2017)","key":"10_CR4","DOI":"10.1145\/3059009.3059066"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/506309.506312","volume":"20","author":"S Heinz","year":"2002","unstructured":"Heinz, S., Zobel, J., Williams, H.E.: Burst tries: a fast, efficient data structure for string keys. ACM Trans. Inf. Syst. 20(2), 192\u2013223 (2002). https:\/\/doi.org\/10.1145\/506309.506312","journal-title":"ACM Trans. Inf. Syst."},{"unstructured":"Jagadish, H.V., Narayan, P.P.S., Seshadri, S., Sudarshan, S., Kanneganti, R.: Incremental organization for data recording and warehousing. In: VLDB, pp. 16\u201325 (1997)","key":"10_CR6"},{"doi-asserted-by":"publisher","unstructured":"Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: artful indexing for main-memory databases. In: ICDE, pp. 38\u201349 (2013). https:\/\/doi.org\/10.1109\/ICDE.2013.6544812","key":"10_CR7","DOI":"10.1109\/ICDE.2013.6544812"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00778-019-00555-y","volume":"29","author":"C Luo","year":"2019","unstructured":"Luo, C., Carey, M.J.: LSM-based storage techniques: a survey. VLDB J. 29(1), 393\u2013418 (2019). https:\/\/doi.org\/10.1007\/s00778-019-00555-y","journal-title":"VLDB J."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00450-012-0204-6","volume":"30","author":"C Mathis","year":"2012","unstructured":"Mathis, C., H\u00e4rder, T., Schmidt, K., B\u00e4chle, S.: XML indexing and storage: fulfilling the wish list. Comput. Sci. Res. Dev. 30(1), 51\u201368 (2012). https:\/\/doi.org\/10.1007\/s00450-012-0204-6","journal-title":"Comput. Sci. Res. Dev."},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"DR Morrison","year":"1968","unstructured":"Morrison, D.R.: PATRICIA - practical algorithm to retrieve information coded in alphanumeric. J. ACM 15(4), 514\u2013534 (1968). https:\/\/doi.org\/10.1145\/321479.321481","journal-title":"J. ACM"},{"doi-asserted-by":"publisher","unstructured":"Nishimura, S., Yokota, H.: QUILTS: multidimensional data partitioning framework based on query-aware and skew-tolerant space-filling curves. In: SIGMOD, pp. 1525\u20131537 (2017). https:\/\/doi.org\/10.1145\/3035918.3035934","key":"10_CR11","DOI":"10.1145\/3035918.3035934"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"PE O\u2019Neil","year":"1996","unstructured":"O\u2019Neil, P.E., Cheng, E., Gawlick, D., O\u2019Neil, E.J.: The log-structured merge-tree (LSM-tree). Acta Informatica 33(4), 351\u2013385 (1996). https:\/\/doi.org\/10.1007\/s002360050048","journal-title":"Acta Informatica"},{"doi-asserted-by":"publisher","unstructured":"Orenstein, J.A., Merrett, T.H.: A class of data structures for associative searching. In: PODS 1984, New York, NY, USA, pp. 181\u2013190 (1984). https:\/\/doi.org\/10.1145\/588011.588037","key":"10_CR13","DOI":"10.1145\/588011.588037"},{"doi-asserted-by":"publisher","unstructured":"Piatov, D., Helmer, S., Dign\u00f6s, A.: An interval join optimized for modern hardware. In: ICDE, pp. 1098\u20131109 (2016). https:\/\/doi.org\/10.1109\/ICDE.2016.7498316","key":"10_CR14","DOI":"10.1109\/ICDE.2016.7498316"},{"issue":"4","key":"10_CR15","doi-asserted-by":"publisher","first-page":"2930","DOI":"10.1007\/s10664-020-09828-5","volume":"25","author":"G Rousseau","year":"2020","unstructured":"Rousseau, G., Di Cosmo, R., Zacchiroli, S.: Software provenance tracking at the scale of public source code. Empirical Softw. Eng. 25(4), 2930\u20132959 (2020). https:\/\/doi.org\/10.1007\/s10664-020-09828-5","journal-title":"Empirical Softw. Eng."},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/320473.320484","volume":"1","author":"DG Severance","year":"1976","unstructured":"Severance, D.G., Lohman, G.M.: Differential files: their application to the maintenance of large databases. ACM Trans. Database Syst. 1(3), 256\u2013267 (1976). https:\/\/doi.org\/10.1145\/320473.320484","journal-title":"ACM Trans. Database Syst."},{"doi-asserted-by":"publisher","unstructured":"Wellenzohn, K., B\u00f6hlen, M.H., Helmer, S.: Dynamic interleaving of content and structure for robust indexing of semi-structured hierarchical data. In: PVLDB, vol. 13, no. 10, pp. 1641\u20131653 (2020). https:\/\/doi.org\/10.14778\/3401960.3401963","key":"10_CR17","DOI":"10.14778\/3401960.3401963"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-82472-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T11:36:20Z","timestamp":1699356980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-82472-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030824716","9783030824723"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-82472-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADBIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Advances in Databases and Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tartu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adbis2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adbis2021.cs.ut.ee\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","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":"18","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":"26% - 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":"3","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)"}},{"value":"Workshops: submissions: 17, papers accepted: DOING 2021: 3, SIMPDA 2021: 1, MADEISD 2021: 4, MegaData 2021: 1, CAoNS 2021: 2","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}