Answering provenance-aware regular path queries on RDF graphs using an automata-based algorithm

Wang, Xin; Ling, Jun; Wang, Junhu; Wang, Kewen; Feng, Zhiyong

doi:10.1145/2567948.2577284

Cited by 6 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [8] the authors developed a technique by which database queries, e.g., nearest neighbor queries, are expressed using an automata-theoretic approach. Ideas and methods from the theory of finite automata motivated Wang et al in [9] to devise an algorithm suitable for evaluating RDF queries. They also presented experimental results that confirm that the methodology they propose is capable of handling efficiently certain categories of regular path queries on large scale RDF graphs.…”

Section: Related Workmentioning

confidence: 99%

Classification of Sparql Queries Into Equivalence Classes of Relevant Queries

Andronikos¹

2017

ijarcs

View full text Add to dashboard Cite

This paper is inspired by ideas from the field of theoretical Mathematics, used for the partitioning of abstract spaces into equivalence classes, and applies analogous concepts in order to propose a classification of SPARQL queries into equivalence classes. The novel concepts of relevant queries and covering query are introduced in a manner appropriate for the study of SPARQL queries. These new definitions shed new light on the relations among SPARQL queries. They enable the formal identification of similar queries and this leads to the partition of SPARQL queries into equivalence classes of relevant queries. This work also discusses how the covering query relating two or more relevant queries can be useful from the perspective of computational cost when evaluating composite queries composed of simpler relevant queries. Hence, the introduction of the concept of relevance between queries provides not only obvious theoretical advantages, but also concrete practical ones, which in many cases have the potential to lower the computational cost of query evaluation.

show abstract

Section: Related Workmentioning

confidence: 99%