Query Processing over Graph-based Data on the Web
Linked Data initiatives have encouraged the publication of large datasets in the Linking Open Data (LOD) cloud, where data is represented using the graph-based RDF data model. In order to support querying capabilities over Linked Data sets, Web access interfaces such as SPARQL endpoints or Triple Pattern Fragment (TPF) servers have been deployed. TPF servers support the evaluation of single triple patterns and have been recently proposed as a highly available mechanism to query RDF data online. Despite these developments, the Web-like characteristics of Linked Data sources pose fundamental challenges to Linked Data management, specifically on remote query processing over RDF datasets. The lack of statis-tics about selectivities and data distributions, as well as unpredictable data transfer rates and server work-load, can negatively impact the effectiveness of query engines against Linked Data, even in presence of the innovative querying capabilities offered by TPF servers. This problem is mainly generated because existing SPARQL query engines implement query execution strategies that rely in some way on the tradi-tional optimize-then-execute paradigm, instead of following adaptive strategies that adjust query execu-tions to unexpected data source conditions. In this talk, we present an adaptive SPARQL query engine tailored to TPFs servers that relies on a network of Linked Data Eddies (nLDE). Our proposed solution is able to adjust query execution schedulers to data availability and runtime conditions. We will present the results of our experimental studies which suggest that nLDE outperforms static Web query schedulers in scenarios with unpredictable transfer delays and data distributions.
An orthogonal, but equally important aspect of querying Linked Data is the quality of the retrieved data. Recent studies reveal that RDF datasets exhibit varying quality in different dimensions including complete-ness, semantic validity, and semantic accuracy. Moreover, the semi-structured nature of RDF data makes it very hard to assess the quality of datasets up front. Executing SPARQL queries against data with quality issues leads to low-quality and even incomplete results. To overcome this limitation, we present HARE, a hybrid query processing engine that brings together machine and human computation to execute SPARQL queries. HARE extends the optimization techniques presented in nLDE to identify efficient hybrid query plans. Furthermore, HARE implements a novel query engine that relies on the graph topology of RDF data to decide on-the-fly which parts of a SPARQL query should be executed against a dataset or via crowdsourcing. In addition, HARE exploits knowledge encoded in the RDF graphs to create questionnaires that can be answered by the crowd. In this talk, we will discuss the results of an empirical evaluation of HARE, and show how HARE is able to accurately enhance SPARQL query answer completeness.
Start: 08. Juni 2016 um 15:45
Ende: 08. Juni 2016 um 16:45
Im Gebäude 11.40, Raum: 231
Veranstaltung vormerken: (iCal)
Veranstalter: Forschungsgruppe(n) Web Science und Wissensmanagement
Information: Media:Acosta 08-06-2016.pdf