Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Walking Without a Map: Ranking-Based Traversal for Querying Linked Data
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.
University of Waterloo, Canada.
2016 (English)In: SEMANTIC WEB - ISWC 2016, PT I, Springer-Verlag New York, 2016, Vol. 9981, p. 305-324Conference paper, Published paper (Refereed)
Abstract [en]

The traversal-based approach to execute queries over Linked Data on the WWW fetches data by traversing data links and, thus, is able to make use of up-to-date data from initially unknown data sources. While the downside of this approach is the delay before the query engine completes a query execution, user perceived response time may be improved significantly by returning as many elements of the result set as soon as possible. To this end, the query engine requires a traversal strategy that enables the engine to fetch result-relevant data as early as possible. The challenge for such a strategy is that the query engine does not know a priori which of the data sources discovered during the query execution will contain result-relevant data. In this paper, we investigate 14 different approaches to rank traversal steps and achieve a variety of traversal strategies. We experimentally study their impact on response times and compare them to a baseline that resembles a breadth-first traversal. While our experiments show that some of the approaches can achieve noteworthy improvements over the baseline in a significant number of cases, we also observe that for every approach, there is a non-negligible chance to achieve response times that are worse than the baseline.

Place, publisher, year, edition, pages
Springer-Verlag New York, 2016. Vol. 9981, p. 305-324
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-133407DOI: 10.1007/978-3-319-46523-4_19ISI: 000389086500019ISBN: 978-3-319-46523-4 (print)ISBN: 978-3-319-46522-7 (print)OAI: oai:DiVA.org:liu-133407DiVA, id: diva2:1059986
Conference
15th International Semantic Web Conference (ISWC)
Available from: 2016-12-27 Created: 2016-12-22 Last updated: 2018-02-15

Open Access in DiVA

fulltext(552 kB)44 downloads
File information
File name FULLTEXT01.pdfFile size 552 kBChecksum SHA-512
9259f386ce98eab617d21f7101bbcb6b06e7bb9d2fe1d50b600fe2cd14e9ea8fbcdbbc62704a1fa0f5f81c1d2d22b262873a80d01d0007ea6178ee6ba5c0bfd8
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Hartig, Olaf
By organisation
Database and information techniquesFaculty of Science & Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 44 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 47 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf