Veröffentlichung: 2012 Mai
Art der Veröffentlichung: 9th Extended Semantic Web Conference (ESWC) Demo Session
We present DEFENDER and illustrate the benefits of iden- tifying promising query decompositions and efficient plans that combine results from federations of SPARQL endpoints. DEFENDER is a query decomposer that implements a two-fold approach. First triple patterns in a SPARQL query are decomposed into simple sub-queries that can be completely executed on one endpoint. Second, sub-queries are combined into a feasible bushy tree plan where the number of joins is maximized and the height of tree is minimized. We demonstrate DEFENDER and compare its performance with respect to state-of-the-art RDF engines for queries of diverse complexity, networks with different delays, and dataset differently distributed among a variety of endpoints.
Weitere Informationen unter: Link