{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:31Z","timestamp":1742913811641,"version":"3.40.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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46565-4_15","type":"book-chapter","created":{"date-parts":[[2016,10,8]],"date-time":"2016-10-08T07:20:30Z","timestamp":1475911230000},"page":"191-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Top-K Shortest Paths in Large Typed RDF Datasets Challenge"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Papadakis","sequence":"first","affiliation":[]},{"given":"Michalis","family":"Stefanidakis","sequence":"additional","affiliation":[]},{"given":"Phivos","family":"Mylonas","sequence":"additional","affiliation":[]},{"given":"Brigitte Endres","family":"Niggemeyer","sequence":"additional","affiliation":[]},{"given":"Spyridon","family":"Kazanas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,9]]},"reference":[{"issue":"11","key":"15_CR1","doi-asserted-by":"publisher","first-page":"2841","DOI":"10.1093\/comjnl\/bxu128","volume":"58","author":"X Zhang","year":"2014","unstructured":"Zhang, X., Van den Bussche, J.: On the power of SPARQL in expressing navigational queries. Comput. J. 58(11), 2841\u20132851 (2014)","journal-title":"Comput. J."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Gubichev, A., Bedathur, S.J., Seufert, S.: Sparqling kleene: fast property paths in RDF-3X. In: First International Workshop on Graph Data Management Experiences and Systems, GRADES 2013, pp. 14:1\u201314:7. ACM, New York (2013)","DOI":"10.1145\/2484425.2484443"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Arenas, M., Conca, S., Perez, J.: Counting beyond a yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard. In: Proceedings of the 21st International Conference on World Wide Web, WWW 2012, pp. 629\u2013638. ACM, New York (2012)","DOI":"10.1145\/2187836.2187922"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2430456.2430458","volume":"41","author":"M Arenas","year":"2013","unstructured":"Arenas, M., Gutierrez, C., Miranker, D.P., Perez, J., Sequeda, J.F.: Querying semantic data on the web? ACM SIGMOD Rec. 41(4), 6\u201317 (2013)","journal-title":"ACM SIGMOD Rec."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Hassan, Z., Qadir, M. A., Islam, M. A., Shahzad, U., Akhter, N.: Modified MinG Algorithm to Find Top-K Shortest Paths from Large RDF Graphs. In: ESWC 2016","DOI":"10.1007\/978-3-319-46565-4_17"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Hertling, S., Schroeder, M., Jilek, C., Dengel, A.: Top-K Shortest Paths in Directed, Labeled Multigraphs. In: ESWC 2016","DOI":"10.1007\/978-3-319-46565-4_16"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"De Vocht, L., Verborgh, R., Mannens, E, Van de Walle, R.: Using Triple Pattern Fragments to Enable Streaming of Top-K Shortest Paths via the Web. In: ESWC 2016","DOI":"10.1007\/978-3-319-46565-4_18"},{"key":"15_CR8","unstructured":"Barton, S.: Indexing graph structured data. Ph.D. thesis, Masaryk University, Brno, Czech Republic (2007)"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","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."},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-25639-9_6","volume-title":"The Semantic Web: ESWC 2015 Satellite Events","author":"L De Vocht","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, Heidelberg (2015). doi:\n                    10.1007\/978-3-319-25639-9_6"},{"key":"15_CR11","unstructured":"Salvadores, M., Horridge, M., Alexander, P.R., Fergerson, R.W., Musen, M.A., Noy, N.F.: Using SPARQL to Query BioPortal Ontologies and Metadata"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"RE Tarjan","year":"1981","unstructured":"Tarjan, R.E.: Fast algorithms for solving path problems. J. ACM 28(3), 594\u2013614 (1981)","journal-title":"J. ACM"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Dietz, P.F.: Maintaining order in a linked list. In: STOC 1982: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 122\u2013127. ACM Press, New York (1982)","DOI":"10.1145\/800070.802184"}],"container-title":["Communications in Computer and Information Science","Semantic Web Challenges"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46565-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:25:43Z","timestamp":1558394743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46565-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319465647","9783319465654"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46565-4_15","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SemWebEval","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Semantic Web Evaluation Challenge","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Heraklion","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semwebeval2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}