{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:26:01Z","timestamp":1743053161187,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953904"},{"type":"electronic","value":"9783030953911"}],"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-030-95391-1_46","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T09:04:54Z","timestamp":1645520694000},"page":"737-753","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["LIDUSA \u2013 A Learned Index Structure for Dynamical Uneven Spatial Data"],"prefix":"10.1007","author":[{"given":"Zejian","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shunzhi","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","unstructured":"Li, P., Lu, H., Zheng, Q., Yang, L., Pan, G.: LISA: a learned index structure for spatial data. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 2119\u20132133. ACM (2020). https:\/\/doi.org\/10.1145\/3318464.3389703","DOI":"10.1145\/3318464.3389703"},{"issue":"9","key":"46_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"1","key":"46_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees: a data structure for retrieval on composite keys. Acta Informatica 4(1), 1\u20139 (1974)","journal-title":"Acta Informatica"},{"issue":"2","key":"46_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0146-664X(82)90104-6","volume":"19","author":"D Meagher","year":"1982","unstructured":"Meagher, D.: Geometric modeling using octree encoding. Comput. Graph. Image Process. 19(2), 129\u2013147 (1982)","journal-title":"Comput. Graph. Image Process."},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of the International Conference on Management of Data, pp. 47\u201357. ACM (1984)","DOI":"10.1145\/971697.602266"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the International Conference on Management of Data, pp. 322\u2013331. ACM (1990)","DOI":"10.1145\/93605.98741"},{"key":"46_CR7","unstructured":"Kamel, I., Faloutsos, C.: Hilbert R-tree: an improved R-tree using fractals. In: Proceedings of the International Conference on Very Large Data Bases, pp. 500\u2013509. Morgan Kaufmann (1994)"},{"key":"46_CR8","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+-tree: a dynamic index for multi-dimensional objects. In: Proceedings of the International Conference on Very Large Data Bases, pp. 507\u2013518. Morgan Kaufmann (1987)"},{"key":"46_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0871-6","volume-title":"Space-Filling Curves","author":"H Sagan","year":"1994","unstructured":"Sagan, H.: Space-Filling Curves. Springer, New York (1994)"},{"key":"46_CR10","unstructured":"Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhardt, K., Bayer, R.: Integrating the UB-Tree into a database system kernel. In: Proceedings of the International Conference on Very Large Data Bases, pp. 263\u2013272. Morgan Kaufmann (2000)"},{"key":"46_CR11","unstructured":"Kraska, T., Alizadeh, M., Beutel, A., Chi, E.H., Ding, J., Kristo, A., et al.: SageDB: a learned database system. In: Proceedings of the Biennial Conference on Innovative Data Systems Research (2019)"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Wang, H., Fu, X., Xu, J., Lu, H.: Learned index for spatial queries. In: Proceedings of the IEEE International Conference on Mobile Data Management, pp. 569\u2013574. IEEE (2019)","DOI":"10.1109\/MDM.2019.00121"},{"key":"46_CR13","unstructured":"Royden, H.L., Fitzpatrick, P.M.: Real Analysis (2010)"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Nathan, V., Ding, J., Alizadeh, M., Kraska, T.: Learning multi-dimensional indexes. In: Proceedings of the International Conference on Management of Data, pp. 985\u22121000. ACM (2020)","DOI":"10.1145\/3318464.3380579"},{"issue":"1","key":"46_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: SIGMOD, pp. 489\u2013504. ACM (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"46_CR17","unstructured":"Davitkova, A., Milchevski, E., Michel, S.: The ML-index: a multidimensional, learned index for point, range, and nearest-neighbor queries. In: Proceedings of the International Conference on Extending Database Technology, pp. 407\u2013410 (2020)"},{"key":"46_CR18","unstructured":"Ho, D., Ding, J., Misra, S., Tatbul, N., Nathan, V., Vasimuddin, et al.: LISA: towards learned DNA sequence search. arXiv: Databases (2019)"},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"Kirsche, M., Das, A., Schatz, M.C..: Sapling: accelerating suffix array queries with learned data models. bioRxiv (2020)","DOI":"10.1101\/2020.01.29.925768"},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"Kristo, A., Vaidya, K., \u00c7etintemel, U., Misra, S., Kraska, T.: The case for a learned sorting algorithm. In: Proceedings of the International Conference on Management of Data, pp. 1001\u20131016. ACM (2020)","DOI":"10.1145\/3318464.3389752"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95391-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T09:12:02Z","timestamp":1645521122000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95391-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953904","9783030953911"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95391-1_46","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":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","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":"403","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":"145","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":"36% - 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.12","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":"2.27","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)"}}]}}