Matches in ScholarlyData for { <https://w3id.org/scholarlydata/inproceedings/www2011/paper/rewriting-queries-on-sparql-views> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- rewriting-queries-on-sparql-views creator anastasios-kementsietsidis.
- rewriting-queries-on-sparql-views creator feifei-li.
- rewriting-queries-on-sparql-views creator min-wang.
- rewriting-queries-on-sparql-views creator songyun-duan.
- rewriting-queries-on-sparql-views creator wangchao-le.
- rewriting-queries-on-sparql-views type InProceedings.
- rewriting-queries-on-sparql-views label "Rewriting Queries on SPARQL Views".
- rewriting-queries-on-sparql-views sameAs rewriting-queries-on-sparql-views.
- rewriting-queries-on-sparql-views abstract "The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, or when integrating RDF data from disparate sources. We approach this problem by rewriting SPARQL queries over the views to equivalent queries over the underlying RDF data, thus avoiding the costs entailed by view materialization and maintenance. We show that SPARQL query rewriting combines the most challenging aspects of rewriting for the relational and XML cases: like the relational case, SPARQL query rewriting requires synthesizing multiple views; like the XML case, the size of the rewritten query is exponential to the size of the query and the views. In this paper, we present the first native query rewriting algorithm for SPARQL. For an input SPARQL query over a set of virtual SPARQL views, the rewritten query resembles a union of conjunctive queries and can be of exponential size. We propose optimizations over the basic rewriting algorithm to (i) minimize each conjunctive query in the union; (ii) eliminate conjunctive queries with empty results from evaluation; and (iii) efficiently prune out big portions of the search space of empty rewritings. The experiments, performed on two RDF stores, show that our algorithms are scalable and independent of the underlying RDF stores. Furthermore, our optimizations have order of magnitude improvements over the basic rewriting algorithm in both the rewriting size and evaluation time.".
- rewriting-queries-on-sparql-views hasAuthorList authorList.
- rewriting-queries-on-sparql-views hasTopic query-and-ontology-languages.
- rewriting-queries-on-sparql-views hasTopic World_Wide_Web.
- rewriting-queries-on-sparql-views isPartOf proceedings.
- rewriting-queries-on-sparql-views title "Rewriting Queries on SPARQL Views".