Regresar

DEFENDER: A decomposer for queries against federations of endpoints

Abstract:

We present DEFENDER and illustrate the benefits of identifying 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.

Año de publicación:

2015

Keywords:

    Fuente:

    scopusscopus

    Tipo de documento:

    Conference Object

    Estado:

    Acceso restringido

    Áreas de conocimiento:

    • Base de datos
    • Ciencias de la computación

    Áreas temáticas:

    • Métodos informáticos especiales
    • Funcionamiento de bibliotecas y archivos

    Contribuidores:

    Montoya G.Montoya G.
    Acosta M.Acosta M.
    María-Esther VidalMaría-Esther Vidal