{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:24:10Z","timestamp":1740097450840,"version":"3.37.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319465647"},{"type":"electronic","value":"9783319465654"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-46565-4_18","type":"book-chapter","created":{"date-parts":[[2016,10,8]],"date-time":"2016-10-08T07:20:30Z","timestamp":1475911230000},"page":"228-240","source":"Crossref","is-referenced-by-count":2,"title":["Using Triple Pattern Fragments to Enable Streaming of Top-k Shortest Paths via the Web"],"prefix":"10.1007","author":[{"given":"Laurens","family":"De Vocht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruben","family":"Verborgh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Mannens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,9]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/978-1-4471-1007-1_25","volume-title":"Performance Engineering of Computer and Telecommunications Systems","author":"AW Brander","year":"1996","unstructured":"Brander, A.W., Sinclair, M.C.: A comparative study of k-shortest path algorithms. In: Merabti, M., Carew, M., Ball, F. (eds.) Performance Engineering of Computer and Telecommunications Systems, pp. 370\u2013379. Springer, London (1996)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Cedeno, J.P.: A framework for top-K queries over weighted RDF graphs. Ph.D. thesis, Arizona State University (2010)","DOI":"10.1145\/1988688.1988736"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/978-3-319-11915-1_27","volume-title":"The Semantic Web \u2013 ISWC 2014","author":"G Cheng","year":"2014","unstructured":"Cheng, G., Zhang, Y., Qu, Y.: Explass: exploring associations between entities via top-K ontological patterns and facets. In: Mika, P., et al. (eds.) ISWC 2014, Part II. LNCS, vol. 8797, pp. 422\u2013437. Springer, Heidelberg (2014)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-319-25639-9_6","volume-title":"The Semantic Web: ESWC 2015 Satellite Events","author":"L Vocht De","year":"2015","unstructured":"De Vocht, L., Beecks, C., Verborgh, R., Seidl, T., Mannens, E., Van de Walle, R.: Improving semantic relatedness in paths for storytelling with linked data on the web. In: Gandon, F., Gu\u00e9ret, C., Villata, S., Breslin, J., Faron-Zucker, C., Zimmermann, A. (eds.) ESWC 2015. LNCS, vol. 9341, pp. 31\u201335. Springer, Switzerland (2015). http:\/\/dx.doi.org\/10.1007\/978-3-319-25639-9_6"},{"key":"18_CR5","unstructured":"De Vocht, L., Coppens, S., Verborgh, R., Vander Sande, M., Mannens, E., Van de Walle, R.: Discovering meaningful connections between resources in the web of data. In: Proceedings of the 6th Workshop on Linked Data on the Web (LDOW2013) (2013)"},{"issue":"2","key":"18_CR6","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"18_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.14778\/2078331.2078339","volume":"5","author":"L Fang","year":"2011","unstructured":"Fang, L., Sarma, A.D., Yu, C., Bohannon, P.: REX: explaining relationships between entity pairs. Proc. VLDB Endow. 5(3), 241\u2013252 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/978-3-642-17746-0_13","volume-title":"The Semantic Web \u2013 ISWC 2010","author":"JD Fern\u00e1ndez","year":"2010","unstructured":"Fern\u00e1ndez, J.D., Mart\u00ednez-Prieto, M.A., Gutierrez, C.: Compact representation of large RDF data sets for publishing and exchange. In: Patel-Schneider, P.F., et al. (eds.) ISWC 2010, Part I. LNCS, vol. 6496, pp. 193\u2013208. Springer, Heidelberg (2010)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-25953-1_6","volume-title":"The Semantic Web: ESWC 2011 Workshops","author":"JL Moore","year":"2012","unstructured":"Moore, J.L., Steinke, F., Tresp, V.: A novel metric for information retrieval in semantic networks. In: Garc\u00eda-Castro, R., Fensel, D., Antoniou, G. (eds.) ESWC 2011. LNCS, vol. 7117, pp. 65\u201379. Springer, Heidelberg (2012)"},{"issue":"3","key":"18_CR10","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1089\/cmb.1997.4.385","volume":"4","author":"T Shibuya","year":"1997","unstructured":"Shibuya, T., Imai, H.: New flexible approaches for multiple sequence alignment. J. Comput. Biol. 4(3), 385\u2013413 (1997)","journal-title":"J. Comput. Biol."},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-319-11964-9_12","volume-title":"The Semantic Web \u2013 ISWC 2014","author":"R Verborgh","year":"2014","unstructured":"Verborgh, R., et al.: Querying datasets on the web with high availability. In: Mika, P., et al. (eds.) ISWC 2014, Part I. LNCS, vol. 8796, pp. 180\u2013196. Springer, Heidelberg (2014)"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.websem.2016.03.003","volume":"37\u201338","author":"R Verborgh","year":"2016","unstructured":"Verborgh, R., Vander Sande, M., Hartig, O., Van Herwegen, J., De Vocht, L., De Meester, B., Haesendonck, G., Colpaert, P.: Triple pattern fragments: a low-cost knowledge graph interface for the Web. J. Web Semant. 37\u201338, 184\u2013206 (2016)","journal-title":"J. Web Semant."},{"issue":"8","key":"18_CR13","first-page":"1531","volume":"43","author":"DY Zhang","year":"2014","unstructured":"Zhang, D.Y., Wu, W., Ouyang, C.F.: Top-k shortest path query processing in RDF graphs. Chin. J. Electron. 43(8), 1531\u20131537 (2014)","journal-title":"Chin. J. Electron."}],"container-title":["Communications in Computer and Information Science","Semantic Web Challenges"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46565-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T07:22:55Z","timestamp":1568445775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46565-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319465647","9783319465654"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46565-4_18","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}