Data summaries for on-demand queries over linked data

Abstract

Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering. However, this time-consuming pre-processing phase however leverages the benefits of Linked Data -- where structured data is accessible live and up-to-date at distributed Web resources that may change constantly -- only to a limited degree, as query results can never be current. An ideal query answering system for Linked Data should return current answers in a reasonable amount of time, even on corpora as large as the Web. Query processors evaluating queries directly on the live sources require knowledge of the contents of data sources. In this paper, we develop and evaluate an approximate index structure summarising graph-structured content of sources adhering to Linked Data principles, provide an algorithm for answering conjunctive queries over Linked Data on theWeb exploiting the source summary, and evaluate the system using synthetically generated queries. The experimental results show that our lightweight index structure enables complete and up-to-date query results over Linked Data, while keeping the overhead for querying low and providing a satisfying source ranking at no additional cost.

DOI: 10.1145/1772690.1772733

Extracted Key Phrases

11 Figures and Tables

0204020102011201220132014201520162017
Citations per Year

199 Citations

Semantic Scholar estimates that this publication has 199 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Harth2010DataSF, title={Data summaries for on-demand queries over linked data}, author={Andreas Harth and Katja Hose and Marcel Karnstedt and Axel Polleres and Kai-Uwe Sattler and J{\"{u}rgen Umbrich}, booktitle={WWW}, year={2010} }