{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:27Z","timestamp":1750221087114,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,11,6]],"date-time":"2018-11-06T00:00:00Z","timestamp":1541462400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-13-20791, IIS-18-16889"],"award-info":[{"award-number":["IIS-13-20791, IIS-18-16889"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,11,6]]},"DOI":"10.1145\/3274895.3274898","type":"proceedings-article","created":{"date-parts":[[2018,11,14]],"date-time":"2018-11-14T13:19:29Z","timestamp":1542201569000},"page":"199-208","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["DOS"],"prefix":"10.1145","author":[{"given":"Shangfu","family":"Peng","sequence":"first","affiliation":[{"name":"University of Maryland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jagan","family":"Sankaranarayanan","sequence":"additional","affiliation":[{"name":"University of Maryland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanan","family":"Samet","sequence":"additional","affiliation":[{"name":"University of Maryland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,11,6]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"{n. d.}. DIMACS. http:\/\/www.dis.uniroma1.it\/challenge9.  {n. d.}. DIMACS. http:\/\/www.dis.uniroma1.it\/challenge9."},{"key":"e_1_3_2_1_2_1","unstructured":"{n. d.}. Fast food maps. http:\/\/www.fastfoodmaps.com\/.  {n. d.}. Fast food maps. http:\/\/www.fastfoodmaps.com\/."},{"key":"e_1_3_2_1_3_1","unstructured":"{n. d.}. Flatbuffers. https:\/\/google.github.io\/flatbuffers\/.  {n. d.}. Flatbuffers. https:\/\/google.github.io\/flatbuffers\/."},{"key":"e_1_3_2_1_4_1","unstructured":"{n. d.}. GeoNames. http:\/\/www.geonames.org\/.  {n. d.}. GeoNames. http:\/\/www.geonames.org\/."},{"key":"e_1_3_2_1_5_1","unstructured":"{n. d.}. Google Maps API. https:\/\/developers.google.com\/maps\/.  {n. d.}. Google Maps API. https:\/\/developers.google.com\/maps\/."},{"key":"e_1_3_2_1_6_1","unstructured":"{n. d.}. LODES. http:\/\/lehd.ces.census.gov\/data\/.  {n. d.}. LODES. http:\/\/lehd.ces.census.gov\/data\/."},{"key":"e_1_3_2_1_7_1","unstructured":"{n. d.}. OpenStreetMap. http:\/\/www.openstreetmap.org\/.  {n. d.}. OpenStreetMap. http:\/\/www.openstreetmap.org\/."},{"key":"e_1_3_2_1_8_1","unstructured":"{n. d.}. Protocol Buffers. https:\/\/github.com\/google\/protobuf\/.  {n. d.}. Protocol Buffers. https:\/\/github.com\/google\/protobuf\/."},{"key":"e_1_3_2_1_9_1","unstructured":"{n. d.}. RDI. http:\/\/www.slideshare.net\/CongressfortheNewUrbanism\/andy-mortensonmeasuring-transportation-connectivity-by-rdi\/.  {n. d.}. RDI. http:\/\/www.slideshare.net\/CongressfortheNewUrbanism\/andy-mortensonmeasuring-transportation-connectivity-by-rdi\/."},{"key":"e_1_3_2_1_10_1","unstructured":"{n. d.}. TAREEG. http:\/\/tareeg.org\/.  {n. d.}. TAREEG. http:\/\/tareeg.org\/."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424365"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"I. Abraham D. Delling A. V. Goldberg and R. F. Werneck. 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In SEA. Kolimpari Chania Greece 230--241.   I. Abraham D. Delling A. V. Goldberg and R. F. Werneck. 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In SEA. Kolimpari Chania Greece 230--241.","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"H. Bast S. Funke D. Matijevic P. Sanders and D. Schultes. 2007. In Transit to Constant Time Shortest-Path Queries in Road Networks. In ALENEX. New Orleans LA 46--59.   H. Bast S. Funke D. Matijevic P. Sanders and D. Schultes. 2007. In Transit to Constant Time Shortest-Path Queries in Road Networks. In ALENEX. New Orleans LA 46--59.","DOI":"10.1137\/1.9781611972870.5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200853"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0274-x"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"D. Delling A. V. Goldberg T. Pajor and R. F. Werneck. 2011. Customizable Route Planning. In SEA. Kolimpari Chania Greece 376--387.   D. Delling A. V. Goldberg T. Pajor and R. F. Werneck. 2011. Customizable Route Planning. In SEA. Kolimpari Chania Greece 376--387.","DOI":"10.1007\/978-3-642-20662-7_32"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jvlc.2000.0181"},{"key":"e_1_3_2_1_22_1","volume-title":"Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In WEA.","author":"Geisberger R.","year":"2008","unstructured":"R. Geisberger , P. Sanders , D. Schultes , and D. Delling . 2008 . Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In WEA. Cape Cod, MA , 319--333. R. Geisberger, P. Sanders, D. Schultes, and D. Delling. 2008. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In WEA. Cape Cod, MA, 319--333."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg H. Kaplan and R. F. Werneck. 2006. Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. In ALENEX. Miami FL 129--143.   A. V. Goldberg H. Kaplan and R. F. Werneck. 2006. Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. In ALENEX. Miami FL 129--143.","DOI":"10.1137\/1.9781611972863.13"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"N. Linial E. London and Y. Rabinovich. 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica 15 (Jun 1995) 215--245.  N. Linial E. London and Y. Rabinovich. 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica 15 (Jun 1995) 215--245.","DOI":"10.1007\/BF01200757"},{"key":"e_1_3_2_1_25_1","unstructured":"S. Ma K. Feng H. Wang J. Li and J. Huai. 2014. Distance Landmarks Revisited for Road Graphs. CoRR abs\/1401.2690 (Jan 2014).  S. Ma K. Feng H. Wang J. Li and J. Huai. 2014. Distance Landmarks Revisited for Road Graphs. CoRR abs\/1401.2690 (Jan 2014)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002974.2002978"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820806"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996913.2996921"},{"key":"e_1_3_2_1_29_1","volume-title":"SPDO: High-Throughput Road Distance Computations on Spark Using Distance Oracles. In ICDE. Helsinki, Finland, 1239--1250.","author":"Peng S.","year":"2016","unstructured":"S. Peng , J. Sankaranarayanan , and H. Samet . 2016 . SPDO: High-Throughput Road Distance Computations on Spark Using Distance Oracles. In ICDE. Helsinki, Finland, 1239--1250. S. Peng, J. Sankaranarayanan, and H. Samet. 2016. SPDO: High-Throughput Road Distance Computations on Spark Using Distance Oracles. In ICDE. Helsinki, Finland, 1239--1250."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.253"},{"volume-title":"Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann","author":"Samet H.","key":"e_1_3_2_1_31_1","unstructured":"H. Samet . 2006. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann , San Francisco, CA . H. Samet. 2006. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann, San Francisco, CA."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/602421.602453"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_71"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183471.1183506"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.53"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.75"},{"key":"e_1_3_2_1_37_1","first-page":"2","article-title":"Roads belong in databases","volume":"33","author":"Sankaranarayanan J.","year":"2010","unstructured":"J. Sankaranarayanan and H. Samet . 2010 . Roads belong in databases . Data Engineering Bulletin 33 , 2 (Jun 2010), 4--11. J. Sankaranarayanan and H. Samet. 2010. Roads belong in databases. Data Engineering Bulletin 33, 2 (Jun 2010), 4--11.","journal-title":"Data Engineering Bulletin"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687763"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025153016110"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.7"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"D. Wagner and T. Willhalm. 2003. Geometric speed-up techniques for finding shortest paths in large sparse graphs. In ESA. Budapest Hungary 776--787.  D. Wagner and T. Willhalm. 2003. Geometric speed-up techniques for finding shortest paths in large sparse graphs. In ESA. Budapest Hungary 776--787.","DOI":"10.1007\/978-3-540-39658-1_69"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140438"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465277"}],"event":{"name":"SIGSPATIAL '18: 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Seattle Washington","acronym":"SIGSPATIAL '18"},"container-title":["Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274895.3274898","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3274895.3274898","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3274895.3274898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:49Z","timestamp":1750208269000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274895.3274898"}},"subtitle":["a spatial system offering extremely high-throughput road distance computations"],"short-title":[],"issued":{"date-parts":[[2018,11,6]]},"references-count":42,"alternative-id":["10.1145\/3274895.3274898","10.1145\/3274895"],"URL":"https:\/\/doi.org\/10.1145\/3274895.3274898","relation":{},"subject":[],"published":{"date-parts":[[2018,11,6]]},"assertion":[{"value":"2018-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}