{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:08:24Z","timestamp":1758265704829,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642244339"},{"type":"electronic","value":"9783642244346"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24434-6_6","type":"book-chapter","created":{"date-parts":[[2011,10,5]],"date-time":"2011-10-05T23:40:43Z","timestamp":1317858043000},"page":"72-86","source":"Crossref","is-referenced-by-count":8,"title":["Top-K Possible Shortest Path Query over a Large Uncertain Graph"],"prefix":"10.1007","author":[{"given":"Lei","family":"Zou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongyan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD Conference (2008)","DOI":"10.1145\/1376616.1376623"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput.\u00a032(5) (2003)","DOI":"10.1137\/S0097539702403098"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00778-005-0177-1","volume":"16","author":"E.P.F. Chan","year":"2007","unstructured":"Chan, E.P.F., Lim, H.: Optimization and evaluation of shortest path queries. VLDB J\u00a016(3), 343\u2013369 (2007)","journal-title":"VLDB J"},{"key":"6_CR4","doi-asserted-by":"crossref","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.\u00a010(3) (1998)","DOI":"10.1109\/69.687976"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: WWW (2007)","DOI":"10.1145\/1242572.1242667"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Kasneci, G., Suchanek, F.M., Ifrim, G., Ramanath, M., Weikum, G.: Naga: Searching and ranking knowledge. In: ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497504"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Frank, H.: Shortest paths in probabilistic graphs. Operations Research\u00a017 (1969)","DOI":"10.1287\/opre.17.4.583"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Soliman, M.A., Ilyas, I.F., Chang, K.C.-C.: Top-k query processing in uncertain databases. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367935"},{"key":"6_CR9","unstructured":"Sigal, C.E., Pritsker, A.A.B., Solberg, J.J."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT (2010)","DOI":"10.1145\/1739041.1739084"},{"key":"6_CR11","unstructured":"Yen, J.Y."},{"key":"6_CR12","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. The MIT Press, Cambridge (2001)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Luby, M.: Monte-carlo algorithms for enumeration and reliability problems. In: FOCS (1983)","DOI":"10.1109\/SFCS.1983.35"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-12026-8_14","volume-title":"Database Systems for Advanced Applications","author":"Y. Yuan","year":"2010","unstructured":"Yuan, Y., Chen, L., Wang, G.: Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol.\u00a05981, pp. 155\u2013170. Springer, Heidelberg (2010)"},{"key":"6_CR15","first-page":"47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Reviews of Mordern Physics\u00a074, 47\u201397 (2002)","journal-title":"Reviews of Mordern Physics"}],"container-title":["Lecture Notes in Computer Science","Web Information System Engineering \u2013 WISE 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24434-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:41:57Z","timestamp":1560728517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24434-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642244339","9783642244346"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24434-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}