{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:33:00Z","timestamp":1725791580045},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319058092"},{"type":"electronic","value":"9783319058108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05810-8_17","type":"book-chapter","created":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T03:31:25Z","timestamp":1397619085000},"page":"251-265","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Processing of Which-Edge Questions on Shortest Path Queries"],"prefix":"10.1007","author":[{"given":"Petrie","family":"Wong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duncan","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming Hay","family":"Luk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Lo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Man Lung","family":"Yiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenny Q.","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press (2001)"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1287\/ijoc.1070.0231","volume":"20","author":"L.S. Buriol","year":"2008","unstructured":"Buriol, L.S., Resende, M.G.C., Thorup, M.: Speeding up dynamic shortest-path algorithms. INFORMS Journal on Computing\u00a020(2), 191\u2013204 (2008)","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"17_CR3","first-page":"742","volume":"2","author":"C. Chen","year":"2009","unstructured":"Chen, C., Lin, C.X., Fredrikson, M., Christodorescu, M., Yan, X., Han, J.: Mining graph patterns efficiently via randomized summaries. PVLDB\u00a02(1), 742\u2013753 (2009)","journal-title":"PVLDB"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Chen, C., Yan, X., Zhu, F., Han, J., Yu, P.S.: Graph OLAP: Towards Online Analytical Processing on Graphs. In: ICDM, pp. 103\u2013112 (2008)","DOI":"10.1109\/ICDM.2008.30"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Khan, A., Yan, X., Wu, K.L.: Towards proximity pattern mining in large graphs. In: SIGMOD, pp. 867\u2013878 (2010)","DOI":"10.1145\/1807167.1807261"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: SIGMOD, pp. 567\u2013580 (2008)","DOI":"10.1145\/1376616.1376675"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Zhang, N., Tian, Y., Patel, J.M.: Discovery-driven graph summarization. In: ICDE, pp. 880\u2013891 (2010)","DOI":"10.1109\/ICDE.2010.5447830"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11535331_10","volume-title":"Advances in Spatial and Temporal Databases","author":"Y. Du","year":"2005","unstructured":"Du, Y., Zhang, D., Xia, T.: The optimal-location query. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol.\u00a03633, pp. 163\u2013180. Springer, Heidelberg (2005)"},{"key":"17_CR9","first-page":"1162","volume":"21","author":"Y. Gao","year":"2009","unstructured":"Gao, Y., Zheng, B., Chen, G., Li, Q.: Optimal-location-selection query processing in spatial databases. TKDE\u00a021, 1162\u20131177 (2009)","journal-title":"TKDE"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Xiao, X., Yao, B., Li, F.: Optimal location queries in road network databases. In: ICDE, pp. 804\u2013815 (2011)","DOI":"10.1109\/ICDE.2011.5767845"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1022429905385","volume":"25","author":"J. Zhang","year":"2003","unstructured":"Zhang, J., Lin, Y.: Computation of reverse shortest-path problem. Journal of Global Optimization\u00a025, 243\u2013261 (2003)","journal-title":"Journal of Global Optimization"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Italiano, G.F.: Algorithmic techniques for maintaining shortest routes in dynamic networks. Electron. Notes Theor. Comput. Sci. 171, 3\u201315 (April 2007)","DOI":"10.1016\/j.entcs.2006.11.006"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00778-005-0177-1","volume":"16","author":"E. Chan","year":"2007","unstructured":"Chan, E., Lim, H.: Optimization and evaluation of shortest path queries. The VLDB Journal\u00a016, 343\u2013369 (2007)","journal-title":"The VLDB Journal"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Pal, A., Paul, A., Mukherjee, A., Naskar, M., Nasipuri, M.: Fault detection and localization scheme for multiple failures in optical network. In: Distributed Computing and Networking, pp. 464\u2013470 (2008)","DOI":"10.1007\/978-3-540-77444-0_48"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05810-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T15:39:44Z","timestamp":1558885184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-05810-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319058092","9783319058108"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05810-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}