Summary models for routing keywords to linked data sources

  • Authors:

  • Thanh Tran;Lei Zhang;Rudi Studer

  • Affiliations:

  • Institute AIFB, Karlsruhe Institute of Technology, Germany;Institute AIFB, Karlsruhe Institute of Technology, Germany;Institute AIFB, Karlsruhe Institute of Technology, Germany

  • Venue:
  • ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The proliferation of linked data on the Web paves the way to a new generation of applications that exploit heterogeneous data from different sources. However, because this Web of data is large and continuously evolving, it is non-trivial to identify the relevant link data sources and to express some given information needs as structured queries against these sources. In this work, we allow users to express needs in terms of simple keywords. Given the keywords, we define the problem of finding the relevant sources as the one of keyword query routing. As a solution, we present a family of summary models, which compactly represents the Web of linked data and allows to quickly find relevant sources. The proposed models capture information at different levels, representing summaries of varying granularity. They represent different trade-offs between effectiveness and efficiency. We provide a theoretical analysis of these trade-offs and also, verify them in experiments carried out in a real-world setting using more than 150 publicly available datasets.