{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:00:11Z","timestamp":1759683611739},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694762"},{"type":"electronic","value":"9783540694977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69497-7_12","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"150-167","source":"Crossref","is-referenced-by-count":26,"title":["Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks"],"prefix":"10.1007","author":[{"given":"Hans-Peter","family":"Kriegel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"12_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Corman","year":"1990","unstructured":"Corman, T.H., Leiserson, C.E., Riverst, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"unstructured":"Kung, R., Hanson, E., Ioannidis, Y., Sellis, T., Shapiro, L., Stonebraker, M.: Heuristic Search in Data Base Systems. Expert Database Systems (1986)","key":"12_CR3"},{"doi-asserted-by":"crossref","unstructured":"Agrawal, R., Dar, S., Jagadish, H.: Direct Transitive Closure Algorithms: Design and Performance Evaluation. TODS\u00a015(3) (1990)","key":"12_CR4","DOI":"10.1145\/88636.88888"},{"doi-asserted-by":"crossref","unstructured":"Ioannidis, Y., Ramakrishnan, R., Winger, L.: Transitive Closure Algorithms Based on Graph Traversal. TODS\u00a018(3) (1993)","key":"12_CR5","DOI":"10.1145\/155271.155273"},{"unstructured":"Jung, S., Pramanik, S.: HiTi Graph Model of Topographical Roadmaps in Navigation Systems. In: Proc. Int. Conf. on Data Engineering (ICDE 1996) (1996)","key":"12_CR6"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/11427186_13","volume-title":"Experimental and Efficient Algorithms","author":"E. K\u00f6hler","year":"2005","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Acceleration of Shortest Path and Constrained Shortest Path Computation. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 126\u2013138. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: Proc. Int. Conf. on Very Large Databases (VLDB 2003) (2003)","key":"12_CR8","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1025153016110","volume":"7","author":"C. Shahabi","year":"2003","unstructured":"Shahabi, C., Kolahdouzan, M., Sharifzadeh, M.: A Road Network Embedding Technique for k-Nearest Neighbor Search in Moving Object Databases. Geoinformatica\u00a07(3), 255\u2013273 (2003)","journal-title":"Geoinformatica"},{"doi-asserted-by":"crossref","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. In: Proc. IEEE Symp. Foundations of Computer Science (1994)","key":"12_CR10","DOI":"10.1109\/SFCS.1994.365733"},{"unstructured":"Hu, H., Lee, D.L., Lee, V.C.S.: Distance Indexing on Road Networks. In: Proc. Int. Conf. on Very Large Databases (VLDB 2006) (2006)","key":"12_CR11"},{"key":"12_CR12","volume-title":"Proc. of the 7th WS on Algorithm Engineering and Experiments (ALENEX)","author":"A.V. Goldberg","year":"2005","unstructured":"Goldberg, A.V., Werneck, R.F.: Computing Point-to-Point Shortest Paths from External Memory. In: Proc. of the 7th WS on Algorithm Engineering and Experiments (ALENEX). SIAM, Philadelphia (2005)"},{"key":"12_CR13","volume-title":"Proc. of the 8th WS on Algorithm Engineering and Experiments (ALENEX)","author":"A.V. Goldberg","year":"2006","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient point-to-point shortest path algorithms\u2019. In: Proc. of the 8th WS on Algorithm Engineering and Experiments (ALENEX). SIAM, Philadelphia (2006)"},{"doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Kunath, P., Renz, M., Schmidt, T.: Proximity Queries in Large Traffic Networks. In: Proc. 15th Int. Symposium on Advances in Geographic Information Systeme (ACM GIS 2007), Seattle, WA (2007)","key":"12_CR14","DOI":"10.1145\/1341012.1341040"},{"doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M., Shahabi, C.: Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. In: Proc. Int. Conf. on Very Large Databases (VLDB 2004) (2004)","key":"12_CR15","DOI":"10.1016\/B978-012088469-8.50074-7"},{"doi-asserted-by":"crossref","unstructured":"Kolahdouzan, M., Shahabi, C.: Continuous K-Nearest Neighbor Queries in Spatial Network Databases. In: Proc. of STDBM 2004 (2004)","key":"12_CR16","DOI":"10.1016\/B978-012088469-8\/50074-7"},{"unstructured":"Cho, H.J., Chung, C.W.: An efficient and scalable approach to cnn queries in a road network. In: Proc. Int. Conf. on Very Large Databases (VLDB 2005) (2005)","key":"12_CR17"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-73540-3_5","volume-title":"Advances in Spatial and Temporal Databases","author":"H.P. Kriegel","year":"2007","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Kunath, P., Renz, M.: Generalizing the Optimality of Multi-Step k-Nearest Neighbor Query Processing. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol.\u00a04605, pp. 75\u201392. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69497-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:00:51Z","timestamp":1605744051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69497-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540694762","9783540694977"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69497-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}