{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:44:58Z","timestamp":1742942698064,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030698720"},{"type":"electronic","value":"9783030698737"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-69873-7_14","type":"book-chapter","created":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T14:03:28Z","timestamp":1614434608000},"page":"198-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficiently Update Disk-Resident Interval Tree"],"prefix":"10.1007","author":[{"given":"Jianqiu","family":"Xu","sequence":"first","affiliation":[]},{"given":"Jianhua","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,28]]},"reference":[{"key":"14_CR1","unstructured":"http:\/\/factory.datatang.com\/en\/ (2018)"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s00453-001-0107-6","volume":"33","author":"L Arge","year":"2002","unstructured":"Arge, L., Hinrichs, K.H., Vahrenhold, J., Vitter, J.S.: Efficient bulk operations on dynamic r-trees. Algorithmica 33(1), 104\u2013128 (2002)","journal-title":"Algorithmica"},{"issue":"6","key":"14_CR3","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1137\/S009753970240481X","volume":"32","author":"L Arge","year":"2003","unstructured":"Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM J. Comput. 32(6), 1488\u20131508 (2003)","journal-title":"SIAM J. Comput."},{"key":"14_CR4","unstructured":"Biveinis, L., Saltenis, S., Jensen, C.S.: Main-memory operation buffering for efficient r-tree update. In: VLDB, pp. 591\u2013602 (2007)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Klump, G., Kriegel, H.-P.: Xz-ordering: A space-filling curve for objects with spatial extension. In: 6th International Symposium, Advances in Spatial Databases, pp. 75\u201390 (1999)","DOI":"10.1007\/3-540-48482-5_7"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/BFb0054512","volume-title":"Database and Expert Systems Applications","author":"T Bozkaya","year":"1998","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Indexing valid time intervals. In: Quirchmayr, G., Schweighofer, E., Bench-Capon, T.J.M. (eds.) DEXA 1998. LNCS, vol. 1460, pp. 541\u2013550. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054512"},{"key":"14_CR7","unstructured":"den Bercken, J.V., Seeger, B.: An evaluation of generic bulk loading techniques. In: VLDB, pp. 461\u2013470 (2001)"},{"key":"14_CR8","unstructured":"den Bercken, J.V., Seeger, B., Widmayer, P.: A generic approach to bulk loading multidimensional index structures. In: VLDB, pp. 406\u2013415 (1997)"},{"key":"14_CR9","unstructured":"Edelsbrunner, H.: Dynamic data structures for orthogonal intersection queries. Tech. Univ. Graz, Austria, Technical report (1980)"},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1121995.1122002","volume":"35","author":"G Graefe","year":"2006","unstructured":"Graefe, G.: B-tree indexes for high update rates. SIGMOD Rec. 35(1), 39\u201344 (2006)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"14_CR11","first-page":"56","volume":"33","author":"RH G\u00fcting","year":"2010","unstructured":"G\u00fcting, R.H., Behr, T., D\u00fcntgen, C.: SECONDO: a platform for moving objects database research and for publishing and integrating research implementations. IEEE Data Eng. Bull. 33(2), 56\u201363 (2010)","journal-title":"IEEE Data Eng. Bull."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Bohannon, P., Naughton, J.F., Shenoy, P.: Updates for structure indexes. In VLDB, pp. 239\u2013250 (2002)","DOI":"10.1016\/B978-155860869-6\/50029-9"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Lee, M., Hsu, W., Jensen, C.S., Cui, B., Teo, K.L.: Supporting frequent updates in R-trees: a bottom-up approach. In: VLDB, pp. 608\u2013619 (2003)","DOI":"10.1016\/B978-012722442-8\/50060-4"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Overmars, M., Berg, M., Kreveld, M., Schwarzkopf, O.: Computational Geometry. Section 10.1: Interval Trees. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-662-04245-8","DOI":"10.1007\/978-3-662-04245-8"},{"key":"14_CR15","unstructured":"Khalil, M., Kamel, I., Kouramajian, V.: Bulk insertion in dynamic R-trees. In: SDH, pp. 31\u201342 (1996)"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s00778-008-0120-3","volume":"18","author":"YN Silva","year":"2009","unstructured":"Silva, Y.N., Xiong, X., Aref, W.G.: The RUM-tree: supporting frequent updates in R-trees using memos. VLDB J. 18(3), 719\u2013738 (2009)","journal-title":"VLDB J."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2012.03.001","volume":"203","author":"M Song","year":"2012","unstructured":"Song, M., Choo, H., Kim, W.: Spatial indexing for massively update intensive applications. Inf. Sci. 203, 1\u201323 (2012)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Spatial Data and Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69873-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T14:11:14Z","timestamp":1614435074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69873-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030698720","9783030698737"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69873-7_14","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":"28 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SpatialDI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Spatial Data and Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spatialdi2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/geospatial.szu.edu.cn\/notice_details?id=51","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":"50","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":"21","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":"42% - 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":"4","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)"}}]}}