Efficient querying of distributed linked data

  • Authors:

  • Martin Svoboda;Irena Mlýnková

  • Affiliations:

  • Charles University in Prague, Malostranské náměstí, Czech Republic;Charles University in Prague, Malostranské náměstí, Czech Republic

  • Venue:
  • Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The contemporary Web is formed mainly by documents, from which it is rather complicated to automatically retrieve hidden structured and interlinked information. The idea of Linked Data based primarily on RDF data triples seems to successfully follow this drawback. In recent years, a significant effort was made not only in a theoretical research, but also in the amount of Linked Data globally available. Since RDF triples are modelled as graph data, we cannot directly adopt the existing solutions from relational databases or XML technologies. Thus, several research questions remain opened. The purpose of our ongoing research effort is to propose an efficient framework for querying Linked Data. This requires finding the compromise between storing data in local storages and accessing them directly on-demand in distributed data sources. Next, we need to choose a suitable querying language, propose auxiliary indexing structures and, finally, to define an ordering model for query results. The theoretical research will be supplemented by a prototype implementation and experiments over real-world data.