Abstract
The Linked Data cloud consists of a great variety of data provided by an increasing number of sources. Selecting relevant sources is therefore a core ingredient of efficient query processing. So far, this is either done with additional indexes or by iteratively performing lookups for relevant URIs. None of the existing methods takes additional aspects into account such as the degree of overlap between the sources, resulting in unnecessary requests. In this paper, we propose a sketch-based query routing strategy that takes source overlap into account. The proposed strategy uses sketches and can be tuned towards either retrieving as many results as possible for a given budget or minimizing the number of requests necessary to retrieve all or a certain fraction of the results. Our experiments show significant improvements over state-of-the-art but overlap-ignorant methods for source selection.
Originalsprog | Engelsk |
---|---|
Titel | Proceedings of the 4th International Workshop on Semantic Web Information Management, SWIM'12 |
Publikationsdato | 9 jul. 2012 |
ISBN (Trykt) | 9781450314466 |
DOI | |
Status | Udgivet - 9 jul. 2012 |
Udgivet eksternt | Ja |
Begivenhed | 4th International Workshop on Semantic Web Information Management, SWIM'12 - Scottsdale, AZ, USA Varighed: 20 maj 2012 → 20 maj 2012 |
Konference
Konference | 4th International Workshop on Semantic Web Information Management, SWIM'12 |
---|---|
Land/Område | USA |
By | Scottsdale, AZ |
Periode | 20/05/2012 → 20/05/2012 |
Sponsor | ACM Special Interest Group on Management of Data (SIGMOD) |