Data Summaries for On-demand Queries over Linked Data
Publication Type:Conference Paper
Source:19th World Wide Web Conference (WWW2010) (2010)
Keywords:Index Structures; Linked Data; RDF Querying
Typical approaches for querying structured Web Data col- lect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query an- swering. However, this time-consuming pre-processing phase however leverages the benefits of Linked Data – where struc- tured data is accessible live and up-to-date at distributed Web resources that may change constantly – only to a lim- ited degree, as query results can never be current. An ideal query answering system for Linked Data should return cur- rent answers in a reasonable amount of time, even on corpora as large as the Web. Query processors evaluating queries di- rectly 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, pro- vide an algorithm for answering conjunctive queries over Linked Data on the Web 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.
* Non-Clique Members