{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:49:24Z","timestamp":1743130164157,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031478420"},{"type":"electronic","value":"9783031478437"}],"license":[{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47843-7_4","type":"book-chapter","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:27:25Z","timestamp":1699306045000},"page":"44-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing Taxi Route Planning Based on\u00a0Taxi Trajectory Data Analysis"],"prefix":"10.1007","author":[{"given":"Xinyi","family":"Yang","sequence":"first","affiliation":[]},{"given":"Zhi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yadan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"4_CR3","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+-tree: a dynamic index for multi-dimensional objects (1987)"},{"key":"4_CR4","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: an index structure for high-dimensional data. In: Very Large Data-Bases, pp. 28\u201339 (1996)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"F\u00e8vre, C., Zgaya-Biau, H., Mathieu, P., Hammadi, S.: Preferential optimization of multi-hop dynamic ridesharing based on R-trees and multi-agent systems. Transp. Res. Rec. 03611981231187530 (2023)","DOI":"10.1177\/03611981231187530"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bentley, J.L.: K-D trees for semidynamic point sets. In: Proceedings of the Sixth Annual Symposium on Computational Geometry, pp. 187\u2013197 (1990)","DOI":"10.1145\/98524.98564"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"James, D.L., Pai, D.K.: BD-tree: output-sensitive collision detection for reduced deformable models. In: ACM SIGGRAPH 2004 Papers, pp. 393\u2013398 (2004)","DOI":"10.1145\/1186562.1015735"},{"issue":"194","key":"4_CR8","first-page":"311","volume":"93","author":"PN Yianilos","year":"1993","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. Soda 93(194), 311\u201321 (1993)","journal-title":"Soda"},{"key":"4_CR9","unstructured":"Ciaccia, P., Patella, M., Zezula, P., et al.: M-tree: an efficient access method for similarity search in metric spaces. In: VLDB, vol. 97, pp. 426\u2013435. Citeseer (1997)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Becker, P.H.E., Arnau, J.-M., Gonz\u00e1lez, A.: KD bonsai: ISA-extensions to compress KD trees for autonomous driving tasks. In: Proceedings of the 50th Annual International Symposium on Computer Architecture, pp. 1\u201313 (2023)","DOI":"10.1145\/3579371.3589055"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Hadjieleftheriou, M., Manolopoulos, Y., Theodoridis, Y., Tsotras, V.J.: R-trees: a dynamic index structure for spatial searching. Encycl. GIS 1805\u20131817 (2017)","DOI":"10.1007\/978-3-319-17885-1_1151"},{"key":"4_CR12","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-981-15-6014-9_61","volume-title":"Rising Threats in Expert Applications and Solutions","author":"S Gill","year":"2021","unstructured":"Gill, S., Hooda, M.: The design perspective of the structures based on k-d tree. In: Rathore, V.S., Dey, N., Piuri, V., Babo, R., Polkowski, Z., Tavares, J.M.R.S. (eds.) Rising Threats in Expert Applications and Solutions. AISC, vol. 1187, pp. 515\u2013524. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-15-6014-9_61"},{"key":"4_CR13","unstructured":"Toussaint, G.T.: Solving geometric problems with the rotating calipers. In: Proceedings of the IEEE Melecon, vol. 83, no. 83, p. A10 (1983)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pp. 71\u201379 (1995)","DOI":"10.1145\/568271.223794"},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1201\/b12207","volume-title":"Ensemble Methods: Foundations and Algorithms","author":"Z-H Zhou","year":"2012","unstructured":"Zhou, Z.-H.: Ensemble Methods: Foundations and Algorithms. CRC Press, Boca Raton (2012)"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47843-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T13:50:22Z","timestamp":1730469022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47843-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"ISBN":["9783031478420","9783031478437"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47843-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,7]]},"assertion":[{"value":"7 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2023","order":10,"name":"conference_id","label":"Conference ID","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","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":"26","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":"63% - 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":"2.5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}