{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:30:58Z","timestamp":1763458258851,"version":"build-2065373602"},"reference-count":83,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T00:00:00Z","timestamp":1689206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["IIS-18-16889","IIS-20-41415","IIS-21-1445"],"award-info":[{"award-number":["IIS-18-16889","IIS-20-41415","IIS-21-1445"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>Many spatial applications benefit from the fast answering to a seemingly simple spatial query: \u201cIs a point of interest (POI) \u2018in-path\u2019 to the shortest path between a source and a destination?\u201d In this context, an in-path POI is one that is either on the shortest path or can be reached within a bounded yet small detour from the shortest path. The fast answering of the in-path queries is contingent on being able to determine without having to actually compute the shortest paths during runtime. Thus, this requires a precomputation solution. The key contribution of the paper is the development of an in-path oracle that is based on precomputation of which pairs of sources and destinations are in-path with respect to the given POI. For a given road network with n nodes and m POIs, an O(m\u00d7n)-sized oracle is envisioned based on the reduction of the well-separated pairs (WSP) decomposition of the road network. Furthermore, an oracle can be indexed in a database using a B-tree that can answer queries at very high throughput. Experimental results on the real road network POI dataset illustrate the superiority of this technique compared to a baseline algorithm. The proposed approach can answer \u2248 1.5 million in-path queries per second compared to a few hundred per second using a suitable baseline approach.<\/jats:p>","DOI":"10.3390\/ijgi12070277","type":"journal-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T00:39:41Z","timestamp":1689295181000},"page":"277","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["In-Path Oracles for Road Networks"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1497-2874","authenticated-orcid":false,"given":"Debajyoti","family":"Ghosh","sequence":"first","affiliation":[{"name":"School of Engineering and Technology, BML Munjal University, Haryana 122413, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jagan","family":"Sankaranarayanan","sequence":"additional","affiliation":[{"name":"Google Inc., Sunnyvale, CA 94089, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiran","family":"Khatter","sequence":"additional","affiliation":[{"name":"School of Engineering and Technology, BML Munjal University, Haryana 122413, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanan","family":"Samet","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Maryland, College Park, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Cao, B., Alarabi, L., Mokbel, M.F., and Basalamah, A. (2015, January 15\u201318). SHAREK: A scalable dynamic ride sharing system. Proceedings of the 16th IEEE International Conference on Mobile Data Management, Pittsburgh, PA, USA.","DOI":"10.1109\/MDM.2015.12"},{"key":"ref_2","unstructured":"Geisberger, R., Luxen, D., Neubauer, S., Sanders, P., and Volker, L. (2010, January 9). Fast Detour Computation for Ride Sharing. Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Liverpool, UK."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3341818","article-title":"Activity-aware Ridesharing Group Trip Planning Queries for Flexible POIs","volume":"5","author":"Mahin","year":"2019","journal-title":"ACM Trans. Spat. Algorithms Syst."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Yuen, C.F., Singh, A.P., Goyal, S., Ranu, S., and Bagchi, A. (2019, January 13\u201317). Beyond Shortest Paths: Route Recommendations for Ride-sharing. Proceedings of the The World Wide Web, San Francisco, CA, USA.","DOI":"10.1145\/3308558.3313465"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Bao, J., Zheng, Y., and Mokbel, M.F. (2012, January 7\u20139). Location-based and preference-aware recommendation using sparse geo-social networking data. Proceedings of the 20th International Conference on Advances in Geographic Information Systems, Redondo Beach, CA, USA.","DOI":"10.1145\/2424321.2424348"},{"key":"ref_6","unstructured":"Bao, J., and Zheng, Y. (2017). Encyclopedia of GIS, Springer."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10707-014-0220-8","article-title":"Recommendations in location-based social networks: A survey","volume":"19","author":"Bao","year":"2015","journal-title":"GeoInformatica"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/17489725.2018.1508763","article-title":"Location based services: Ongoing evolution and research agenda","volume":"12","author":"Huang","year":"2018","journal-title":"J. Locat. Based Serv."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Levandoski, J.J., Sarwat, M., Eldawy, A., and Mokbel, M.F. (2012, January 1\u20135). LARS: A Location-Aware Recommender System. Proceedings of the IEEE International Conference on Data Engineering, Arlington, VA, USA.","DOI":"10.1109\/ICDE.2012.54"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3510409","article-title":"Point-of-Interest Recommender Systems based on Location-Based Social Networks: A Survey from an Experimental Perspective","volume":"1","author":"Sanchez","year":"2022","journal-title":"ACM Comput. Surv."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Ye, M., Yin, P., and Lee, W.C. (2010, January 2\u20135). Location recommendation for location-based social networks. Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, San Jose, CA, USA.","DOI":"10.1145\/1869790.1869861"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ghosh, D., Sankaranarayanan, J., Khatter, K., and Samet, H. (2023). Opportunistic Package Delivery as a Service on Road Networks. Geoinformatica.","DOI":"10.1007\/s10707-023-00497-2"},{"key":"ref_13","unstructured":"Ferraro, R., and Aktihanoglu, M. (2011). Location Aware Applications, Manning Publishers."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1670679.1670682","article-title":"Location-dependent query processing: Where we are and where we are heading","volume":"42","author":"Ilarri","year":"2010","journal-title":"ACM Comput. Surv."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Kupper, A. (2005). Location-Based Services Fundamentals and Operation, Wiley.","DOI":"10.1002\/0470092335"},{"key":"ref_16","unstructured":"Schiller, J., and Voisard, A. (2004). Location Based Services, Elsevier. [1st ed.]."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Johnson, I., Henderson, J., Perry, C., Schoning, J., and Hecht, B.J. (2017, January 11\u201315). Beautiful\u2026 but at What Cost?: An Examination of Externalities in Geographic Vehicle Routing. Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies, Maui, HI, USA.","DOI":"10.1145\/3090080"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Quercia, D., Schifanella, R., and Aiello, L.M. (2014, January 1\u20134). The shortest path to happiness: Recommending beautiful, quiet, and happy routes in the city. Proceedings of the 25th ACM Conference on Hypertext and Social Media, Santiago, Chile.","DOI":"10.1145\/2631775.2631799"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Sacharidis, D., Bouros, P., and Chondrogiannis, T. (2017, January 7\u201310). Finding The Most Preferred Path. Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Redondo Beach, CA, USA.","DOI":"10.1145\/3139958.3140029"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2422956.2422959","article-title":"GPSView: A scenic driving route planner","volume":"9","author":"Zheng","year":"2013","journal-title":"ACM Trans. Multimed. Comput. Commun. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1287\/trsc.2017.0762","article-title":"Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach","volume":"52","author":"Bayram","year":"2017","journal-title":"Transp. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1016\/j.trc.2022.103837","article-title":"Evacuation route planning for alternative fuel vehicles","volume":"143","author":"Purba","year":"2022","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.scs.2021.103386","article-title":"RnR-SMART: Resilient smart city evacuation plan based on road network reconfiguration in outbreak response","volume":"75","author":"Kim","year":"2021","journal-title":"Sustain. Cities Soc."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Liang, B., Yang, D., Qin, X., and Tinta, T. (2019). A Risk-Averse Shelter Location and Evacuation Routing Assignment Problem in an Uncertain Environment. Int. J. Environ. Res. Public Health, 16.","DOI":"10.3390\/ijerph16204007"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Russo, F., and Rindone, C. (2011, January 14\u201317). Planning in road evacuation: Classification of exogenous activities. Proceedings of the 17th International Conference on Urban Transport and the Environment, Nanjing, China.","DOI":"10.2495\/UT110541"},{"key":"ref_26","first-page":"1098","article-title":"Emergency shelter allocation planning technology for large-scale evacuation based on quantum genetic algorithm","volume":"10","author":"Yin","year":"2022","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Wagistina, S., Syafitri, D.R., Lestari, J.S., Amanatinismi, K.H., Setiawan, D., and Ramadhani, S. (2022). Service Area Network Analysis for Location Planning of Microbusiness and Local Franchise in Urban Area: A Case Study in Malang City, East Java Provence, Indonesia. Economies, 10.","DOI":"10.3390\/economies10050103"},{"key":"ref_28","unstructured":"Chechik, S. (June, January 31). Approximate distance oracles with constant query time. Proceedings of the 46th Annual ACM Symposium on Theory of Computing, New York, NY, USA."},{"key":"ref_29","unstructured":"Sankaranarayanan, J., and Samet, H. (April, January 29). Distance oracles for spatial networks. Proceedings of the 25th IEEE International Conference on Data Engineering, Shanghai, China."},{"key":"ref_30","first-page":"1210","article-title":"Path oracles for spatial networks","volume":"2","author":"Sankaranarayanan","year":"2009","journal-title":"Proc. Very Large Data Bases"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1044731.1044732","article-title":"Approximate Distance Oracles","volume":"52","author":"Thorup","year":"2005","journal-title":"J. Assoc. Comput. Mach."},{"key":"ref_32","unstructured":"Callahan, P.B. (1995). Dealing with Higher Dimensions: The Well-Separated Pair Decomposition and Its Applications. [Ph.D. Thesis, The Johns Hopkins University]."},{"key":"ref_33","unstructured":"Callahan, P.B., and Kosaraju, S.R. (1993, January 25\u201327). Faster algorithms for some geometric graph problems in higher dimensions. Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, USA."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/200836.200853","article-title":"A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields","volume":"42","author":"Callahan","year":"1995","journal-title":"J. ACM"},{"key":"ref_35","unstructured":"Fischer, J., and Peled, S.H. (2005, January 10\u201312). Dynamic well-separated pair decomposition made easy. Proceedings of the 17th Canadian Conference on Computational Geometry, Windsor, ON, Canada."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Park, E., and Mount, D.M. (2013, January 5\u20138). Output-Sensitive Well-Separated Pair Decompositions for Dynamic Point Sets. Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Orlando, FL, USA.","DOI":"10.1145\/2525314.2525364"},{"key":"ref_37","unstructured":"Elmasri, R., and Navathe, S.B. (2021). Fundamentals of Database Systems, Pearson. [7th ed.]."},{"key":"ref_38","unstructured":"Bast, H., Delling, D., Goldberg, A., Hannemann, M.M., Pajor, T., Sanders, P., Wagner, D., and Werneck, R.F. (2016). Algorithm Engineering: Selected Results and Surveys, Springer."},{"key":"ref_39","first-page":"294","article-title":"Shortest Paths in Road Networks: From Practice to Theory and Back","volume":"53","author":"Delling","year":"2011","journal-title":"Inf. Technol."},{"key":"ref_40","unstructured":"Schultes, D. (2008). Route Planning in Road Networks. [Ph.D. Thesis, Institut fur Theoretische Informatik]."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Wu, L., Xiao, X., Deng, D., Cong, G., Zhu, A.D., and Zhou, S. (2012, January 27\u201331). Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation. Proceedings of the VLDB Endowment, Istanbul, Turkey.","DOI":"10.14778\/2140436.2140438"},{"key":"ref_42","unstructured":"Peng, S., and Samet, H. (November, January 31). CDO: Extremely High-Throughput Road Distance Computations on City Road Networks. Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Burlingame, CA, USA."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Peng, S., Sankaranarayanan, J., and Samet, H. (2016, January 16\u201320). SPDO: High-throughput road distance computations on Spark using distance oracles. Proceedings of the 32nd IEEE International Conference on Data Engineering, Helsinki, Finland.","DOI":"10.1109\/ICDE.2016.7498328"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Peng, S., Sankaranarayanan, J., and Samet, H. (2018, January 6\u20139). DOS: A Spatial System Offering Extremely High-Throughput Road Distance Computations. Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Seattle, WA, USA.","DOI":"10.1145\/3274895.3274898"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., and Alborzi, H. (2008, January 10\u201312). Scalable network distance browsing in spatial databases. Proceedings of the ACM SIGMOD Conference, Vancouver, BC, Canada.","DOI":"10.1145\/1376616.1376623"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, J., Alborzi, H., and Samet, H. (2005, January 4\u20135). Efficient query processing on spatial networks. Proceedings of the 13th ACM International Symposium on Advances in Geographic Information Systems, Bremen, Germany.","DOI":"10.1145\/1097064.1097093"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Goldberg, A., and Werneck, R.F. (2011, January 5\u20137). A hub-based labeling algorithm for shortest paths in road networks. Proceedings of the Experimental Algorithms, Crete, Greece.","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Delling, D., Sanders, P., Schultes, D., and Wagner, D. (2009, January 17\u201319). Engineering Route Planning Algorithms. Proceedings of the Algorithmics of Large and Complex Networks, Design, Analysis, and Simulation, Beijing, China.","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"ref_49","unstructured":"Geisberger, R., Sanders, P., Schultes, D., and Delling, D. (June, January 30). Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. Proceedings of the 7th International Workshop on Experimental Algorithms, Provincetown, MA, USA."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Abraham, I., Fiat, A., Goldberg, A.V., and Werneck, R.F. (2010, January 17\u201319). Highway dimension, shortest paths, and provably efficient algorithms. Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, USA.","DOI":"10.1137\/1.9781611973075.64"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Arz, J., Luxen, D., and Sanders, P. (2013, January 5\u20137). Transit Node Routing Reconsidered. Proceedings of the International Symposium on Experimental Algorithms, Rome, Italy.","DOI":"10.1007\/978-3-642-38527-8_7"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Bast, H., Funke, S., Matijevic, D., and Sanders, P. (2007, January 9\u201310). In Transit to Constant Time Shortest-Path Queries in Road Networks. Proceedings of the 9th Workshop on Algorithm Engineering and Experiments, Alexandria, VA, USA.","DOI":"10.1137\/1.9781611972870.5"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1137\/S0097539702403098","article-title":"Reachability and Distance Queries via 2-Hop Labels","volume":"32","author":"Cohen","year":"2003","journal-title":"SIAM J. Comput."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/trsc.1110.0401","article-title":"Exact routing in large road networks using contraction hierarchies","volume":"46","author":"Geisberger","year":"2012","journal-title":"Transp. Sci."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10707-005-6671-1","article-title":"In-route nearest neighbor queries","volume":"9","author":"Yoo","year":"2005","journal-title":"GeoInformatica"},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Chen, Z., Shen, H.T., Zhou, X., and Yu, J.X. (2009, January 14\u201319). Monitoring path nearest neighbor in road networks. Proceedings of the ACM SIGMOD International Conference on Management of Data, Portland, OR, USA.","DOI":"10.1145\/1559845.1559907"},{"key":"ref_57","unstructured":"Saha, R., Hashem, T., Shahriar, T., and Kulik, L. (2018, January 28\u201331). Continuous Obstructed Detour Queries. Proceedings of the 10th International Conference on Geographic Information Science, Melbourne, Australia."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Shang, S., Deng, K., and Xie, K. (2010, January 2\u20135). Best Point Detour Query in Road Networks. Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, San Jose, CA, USA.","DOI":"10.1145\/1869790.1869804"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1109\/TKDE.2011.52","article-title":"Continuous Detour Queries in Spatial Networks","volume":"24","author":"Nutanong","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A Formal Basis for the Heuristic determination of Minimum Cost Paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybernat."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1958","journal-title":"Q. Appl. Math."},{"key":"ref_62","unstructured":"Ford, L.R. (1956). Network Flow Theory, RAND Corporation."},{"key":"ref_63","unstructured":"Moore, E.F. (1959, January 2\u20135). The shortest path through a maze. Proceedings of the International Symposium on the Theory of Switching, Cambridge, MA, USA."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","article-title":"Algorithm 360: Shortest-path forest with topological ordering [H]","volume":"12","author":"Dial","year":"1969","journal-title":"Commun. ACM"},{"key":"ref_65","first-page":"291","article-title":"Multikey retrieval from k-d trees and quad-trees","volume":"14","author":"Beckley","year":"1985","journal-title":"Proc. Int. Conf. Manag. Data"},{"key":"ref_66","unstructured":"Berg, M.D., Kreveld, M.V., Overmars, M., and Schwarzkopf, O. (2000). Computational Geometry Algorithms and Applications, Springer. [2nd ed.]."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","article-title":"Quad trees a data structure for retrieval on composite keys","volume":"4","author":"Finkel","year":"1974","journal-title":"Acta Inform."},{"key":"ref_68","unstructured":"Peled, S.H. (2011). Geometric Approximation Algorithms, American Mathematical Society."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","article-title":"The quadtree and related hierarchical data structures","volume":"16","author":"Samet","year":"1984","journal-title":"ACM Comput. Surv."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/282957.282966","article-title":"Storing a Collection of Polygons Using Quadtrees","volume":"4","author":"Samet","year":"1985","journal-title":"ACM Trans. Graph."},{"key":"ref_71","first-page":"51","article-title":"An overview of quadtrees, octrees, and related hierarchical data structures","volume":"Volume 40","author":"Earnshaw","year":"1988","journal-title":"Theoretical Foundations of Computer Graphics and CAD"},{"key":"ref_72","unstructured":"Samet, H. (2006). Foundations of Multidimensional and Metric Data Structures, Academic Press."},{"key":"ref_73","first-page":"4","article-title":"Roads belong in databases","volume":"33","author":"Sankaranarayanan","year":"2010","journal-title":"IEEE Data Eng. Bull."},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/358728.358741","article-title":"An effective way to represent quadtrees","volume":"25","author":"Gargantini","year":"1982","journal-title":"Commun. ACM"},{"key":"ref_75","unstructured":"Morton, G.M. (1966). A Computer Oriented Geodetic Database and a New Technique in File Sequencing, IBM Ltd.. Technical Report."},{"key":"ref_76","doi-asserted-by":"crossref","unstructured":"Perdacher, M., Plant, C., and Bohm, C. (2020, January 10\u201313). Improved Data Locality Using Morton-order Curve on the Example of LU Decomposition. Proceedings of the IEEE International Conference on Big Data, Virtual.","DOI":"10.1109\/BigData50022.2020.9378385"},{"key":"ref_77","doi-asserted-by":"crossref","unstructured":"Bayer, R., and McCreight, E. (1970, January 15\u201316). Organization and Maintenance of Large Ordered Indices. Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Houston, TX, USA.","DOI":"10.1145\/1734663.1734671"},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Bayer, R. (1971, January 11\u201312). Binary B-Trees for Virtual Memory. Proceedings of the 1971 ACM-SIGFIDET (Now SIGMOD) Workshop on Data Description, San Diego, CA, USA.","DOI":"10.1145\/1734714.1734731"},{"key":"ref_79","unstructured":"Bayer, R. (1996, January 11\u201313). The universal b-tree for multidimensional indexing: General concepts. Proceedings of the International Conference on Worldwide Computing and Its Applications, Orlando, FL, USA."},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/356770.356776","article-title":"The Ubiquitous B-Tree","volume":"11","author":"Comer","year":"1979","journal-title":"ACM Comput. Surv."},{"key":"ref_81","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. (2009). Introduction to Algorithms, MIT Press. [3rd ed.]."},{"key":"ref_82","doi-asserted-by":"crossref","unstructured":"Peng, S., and Samet, H. (2015, January 3\u20136). Analytical queries on road networks: An experimental evaluation of two system architectures. Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, Seattle, WA, USA.","DOI":"10.1145\/2820783.2820806"},{"key":"ref_83","unstructured":"(2023, May 17). 9th DIMACS Implementation Challenge\u2014Shortest Paths. Available online: http:\/\/users.diag.uniroma1.it\/challenge9\/download.shtml."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/7\/277\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:12:16Z","timestamp":1760127136000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/7\/277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,13]]},"references-count":83,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2023,7]]}},"alternative-id":["ijgi12070277"],"URL":"https:\/\/doi.org\/10.3390\/ijgi12070277","relation":{},"ISSN":["2220-9964"],"issn-type":[{"type":"electronic","value":"2220-9964"}],"subject":[],"published":{"date-parts":[[2023,7,13]]}}}