{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T22:49:50Z","timestamp":1761518990367,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,6]],"date-time":"2010-06-06T00:00:00Z","timestamp":1275782400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,6]]},"DOI":"10.1145\/1807167.1807181","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"99-110","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":116,"title":["TEDI"],"prefix":"10.1145","author":[{"given":"Fang","family":"Wei","sequence":"first","affiliation":[{"name":"University of Freiburg, Freiburg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2010,6,6]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/67544.66950"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1137\/0608024"},{"key":"e_1_3_2_1_3_1","volume-title":"October","author":"Barabasi A. L.","year":"1999","unstructured":"A. L. Barabasi and R. Albert . Emergence of scaling in random networks. Science, 286(5439) , October 1999 . A. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439), October 1999."},{"key":"e_1_3_2_1_4_1","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender H. L.","year":"1993","unstructured":"H. L. Bodlaender . A tourist guide through treewidth . Acta Cybernetica , 11 : 1 -- 23 , 1993 . H. L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1--23, 1993.","journal-title":"Acta Cybernetica"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1111\/j.1467-8640.2005.00274.x"},{"key":"e_1_3_2_1_6_1","volume-title":"VLDB","author":"Chen L.","year":"2005","unstructured":"L. Chen , A. Gupta , and M. E. Kurul . Stack-based algorithms for pattern matching on dags . In VLDB , 2005 . L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on dags. In VLDB, 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_8_1","volume-title":"Computing the shortest path: A* search meets graph theory","author":"Goldberg A.","year":"2005","unstructured":"A. Goldberg and C. Harrelson . Computing the shortest path: A* search meets graph theory . In SODA. SIAM , 2005 . A. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In SODA. SIAM, 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/978-3-540-69507-3_6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1142351.1142370"},{"key":"e_1_3_2_1_11_1","volume-title":"Reach-based routing: A new approach to shortest path algorithms optimized for road networks","author":"Gutman R.","year":"2004","unstructured":"R. Gutman . Reach-based routing: A new approach to shortest path algorithms optimized for road networks . In ALENEX. SIAM , 2004 . R. Gutman. Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In ALENEX. SIAM, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/1247480.1247516"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1559845.1559930"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/1376616.1376677"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1016\/j.artint.2005.04.004"},{"key":"e_1_3_2_1_16_1","volume-title":"Art of Computer Programming, Volume 1: Fundamental Algorithms","author":"Knuth D. E.","year":"1997","unstructured":"D. E. Knuth . Art of Computer Programming, Volume 1: Fundamental Algorithms ( 3 rd Edition). 1997 . D. E. Knuth. Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd Edition). 1997.","edition":"3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/S1571-0653(05)80078-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1016\/0095-8956(84)90013-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/ICDE.2005.57"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1109\/ICDE.2009.119"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/1247480.1247573"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1109\/ICDE.2006.53"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/1516360.1516418"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"acronym":"SIGMOD\/PODS '10","name":"SIGMOD\/PODS '10: International Conference on Management of Data","location":"Indianapolis Indiana USA"},"container-title":["Proceedings of the 2010 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807167.1807181","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807167.1807181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:35Z","timestamp":1750249055000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807167.1807181"}},"subtitle":["efficient shortest path query answering on graphs"],"short-title":[],"issued":{"date-parts":[[2010,6,6]]},"references-count":23,"alternative-id":["10.1145\/1807167.1807181","10.1145\/1807167"],"URL":"https:\/\/doi.org\/10.1145\/1807167.1807181","relation":{},"subject":[],"published":{"date-parts":[[2010,6,6]]},"assertion":[{"value":"2010-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}