{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T19:53:14Z","timestamp":1711482794845},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,8,7]],"date-time":"2006-08-07T00:00:00Z","timestamp":1154908800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2007,5,16]]},"DOI":"10.1007\/s00778-005-0177-1","type":"journal-article","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T10:14:02Z","timestamp":1155809642000},"page":"343-369","source":"Crossref","is-referenced-by-count":40,"title":["Optimization and evaluation of shortest path queries"],"prefix":"10.1007","volume":"16","author":[{"given":"Edward P. F.","family":"Chan","sequence":"first","affiliation":[]},{"given":"Heechul","family":"Lim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,8,7]]},"reference":[{"issue":"2","key":"177_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/69.277767","volume":"6","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Jagadish, H.V.: Algorithms for searching massive graphs. IEEE Trans. on Knowl. Data Eng. 6(2), 225\u2013238 (1994)","journal-title":"IEEE Trans. on Knowl. Data Eng."},{"key":"177_CR2","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Ramakrishnan, R.: An Amateur's introduction to recursive query processing strategies. In: Proceedings of Sigmod, pp.16\u201352 (1996)","DOI":"10.1145\/16856.16859"},{"key":"177_CR3","doi-asserted-by":"crossref","unstructured":"Chan, E.P.F., Zhang, N.: Finding shortest paths in large network systems. In: Proceedings of the 9th ACM International Workshop on Advances in Geographic Information Systems. (ACM-GIS 2001). pp.160\u2013166 Atlanta, Georgia (2001)","DOI":"10.1145\/512161.512197"},{"key":"177_CR4","first-page":"129","volume":"73","author":"B.V. Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest path algorithms: theory and experimental evaluation. Mathematical Programming. 73, 129\u2013174 (1996)","journal-title":"Mathematical Programming."},{"key":"177_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press (1990)"},{"key":"177_CR6","unstructured":"Goldman, R., Shivakumar, N., Venkatasubramanian, S., Garcia-Molina H.: Proximity search in databases. In: Proceedings of the 24th VLDB Conference, pp.26\u201337 New York (1998)"},{"key":"177_CR7","doi-asserted-by":"crossref","unstructured":"Hutchinson, D., Maheshwari, A., Zeh, Z.: An external-memory data structure for shortest path queries. In: Proceedings of the 5th Annual Combinatorics and Computing Conference (COCOON 99), Tokyo, July 26\u201328, 1999, Lecture Notes in Computer Science, vol. 1627, pp.51\u201360, Springer Verlag (1999)","DOI":"10.1007\/3-540-48686-0_5"},{"key":"177_CR8","unstructured":"Ioannidis, Y., Ramakrishnan, R.: Efficient Transitive Closure Algorithms, In: Proceedings of 14th VLDB Conference, pp.382\u2013394 (1988)"},{"issue":"4","key":"177_CR9","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/99935.99944","volume":"14","author":"H.V. Jagadish","year":"1990","unstructured":"Jagadish, H.V.: A compression technique to materialize transitive closure. ACM Trans. Database Sys. 14(4), 558\u2013598 (1990)","journal-title":"ACM Trans. Database Sys."},{"issue":"3","key":"177_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/69.687976","volume":"10","author":"N. Jing","year":"1998","unstructured":"Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans. Knowl. Data Eng. 10(3), 1\u201323 (1998)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"177_CR11","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/TKDE.2002.1033772","volume":"14","author":"S. Jung","year":"2002","unstructured":"Jung, S., Pramanik, S.: An efficient path computation model for hierarchicallly structured topographical road maps. IEEE Trans. Knowl. Data Eng. 14(5), 1029\u20131046 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"177_CR12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"177_CR13","unstructured":"Merrett, T.H., Kambayashi, Y., Yasuura, H.: Scheduling of Page-Fetches in Join Operation. In: Proceedings of the Seventh International Conference on VLDB. pp. 488\u2013497 Cannes, France (1981)"},{"key":"177_CR14","doi-asserted-by":"crossref","unstructured":"Shekhar, S., Fetterer, A., Goyal, B.: Materialization Trade-Offs in Hierarchical Shortest Path Algorithms. In: Proceedings of the 5th International Symposium on Large Spatial Databases, Lecture Nodes in Computer Science 1262, Springer Verlag pp.94\u2013111 (1997)","DOI":"10.1007\/3-540-63238-7_26"},{"key":"177_CR15","unstructured":"Tiger\/Line Files, US Department of Commerce Economics and Statistics Administration, Bureau of Census (1998)"},{"key":"177_CR16","unstructured":"Valduriez, P., Boral, H.: Evaluation of recursive queries using join indices. In: Proceedings of 12th International Conference on VLDB. pp.403\u2013411, Kyoto, Japan (1986)"},{"key":"177_CR17","unstructured":"Vazirgiannis, M., Wolfson, O.: A Spatialtemporal Model and Language for Moving Objects on Road Networks. In: Proceedings of the 7th International Symposium on Spatial and Temporal Databases (STTD 2001), pp.20\u201335. L.A., CA, (2001)"},{"key":"177_CR18","unstructured":"Zeh, N.: An external-memory data structure for shortest path queries. Diplomarbeit, Friedrich-Schiller-Universitit Jena (1998)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0177-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-005-0177-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0177-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T15:05:00Z","timestamp":1559142300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-005-0177-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,7]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,5,16]]}},"alternative-id":["177"],"URL":"https:\/\/doi.org\/10.1007\/s00778-005-0177-1","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,7]]}}}