On Completeness Classes for Query Evaluation on Linked Data

Abstract

The advent of the Web of Data kindled interest in linktraversal (or lookup-based) query processing methods, with which queries are answered via dereferencing a potentially large number of small, interlinked sources. While several algorithms for query evaluation have been proposed, there exists no notion of completeness for results of so-evaluated queries… (More)

Topics

2 Figures and Tables

Statistics

051015201520162017
Citations per Year

Citation Velocity: 6

Averaging 6 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Harth2012OnCC, title={On Completeness Classes for Query Evaluation on Linked Data}, author={Andreas Harth and Sebastian Speiser}, booktitle={AAAI}, year={2012} }