his short paper reports on the benefits that traversal queries over existing graph stores (such as RDF databases) can gain from a class of optimizations based on summaries. Summaries, also known as structural indexes, have been extensively covered in the literature (see [2] for a brief overview). Despite this, summary-based optimizations are not widely implemented. To make both graph traversal queries and summaries readily available in existing RDF stores, we have devised a translation that outputs SPARQL queries that execute over sum- maries directly represented in RDF. In what follows, we give an overview of our proposal, illustrate it with an example, and mention preliminary evaluation results on real-world data
Rewriting queries over summaries of big data graphs / Consens, M. P.; Fionda, V.; Khatchadourian, S.; Pirro', Giuseppe. - 1189:(2014). (Intervento presentato al convegno 8th Alberto Mendelzon Workshop on Foundations of Data Management, AMW 2014 tenutosi a Cartagena).
Rewriting queries over summaries of big data graphs
Pirro' Giuseppe
2014
Abstract
his short paper reports on the benefits that traversal queries over existing graph stores (such as RDF databases) can gain from a class of optimizations based on summaries. Summaries, also known as structural indexes, have been extensively covered in the literature (see [2] for a brief overview). Despite this, summary-based optimizations are not widely implemented. To make both graph traversal queries and summaries readily available in existing RDF stores, we have devised a translation that outputs SPARQL queries that execute over sum- maries directly represented in RDF. In what follows, we give an overview of our proposal, illustrate it with an example, and mention preliminary evaluation results on real-world dataI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
