Distributed Efficient Provenance-Aware Regular Path Queries on Large RDF Graphs

Xin, Yueqi; Wang, Xin; Jin, Di; Wang, Simiao

doi:10.1007/978-3-319-91452-7_49

Cited by 4 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Different approaches (e.g., [44,73,74]) have adopted Pregel's architecture for distributed path or reachability queries. Nolé et al [44] for example proposed an evaluation technique according to the Pregel-based vertex-centric model.…”

Section: Vertex-centric Approachesmentioning

confidence: 99%

“…In [73,74], the authors proposed a distributed Pregel-based approaches named DP2RPQ to answer provenance-aware regular path queries Regular Path Queries (RPQs) using Glushkov automata. In their approach, at each superstep, one hop of edges in the path of the RDF graph is matched forward to obtain intermediate partial answers.…”

Section: Vertex-centric Approachesmentioning

confidence: 99%

“…For example, in some applications, the RDF knowledge bases are partitioned according to topics (i.e., different domains) or are partitioned according to different data contributors. On the other side, Pregel's vertexcentric computing model has been widely adopted in most of the recent distributed graph computing systems [19,44,59,73,74] because of being fault tolerant and also efficient as compared to Hadoop-based approaches. However, Pregel also suffered the aforementioned challenges that is the controlled environment.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient distributed path computation on RDF knowledge graphs using partial evaluation

Mehmood

Saleem²,

Jha

et al. 2021

World Wide Web

View full text Add to dashboard Cite

A key property of Linked Data is the representation and publication of data as interconnected labelled graphs where different resources linked to each other form a network of meaningful information. Searching these important relationships between resourceswithin single or distributed graphs -can be reduced to a pathfinding or navigation problem, i.e., looking for chains of intermediate nodes. SPARQL1.1, the current standard query language for RDF-based Linked Data defines a construct -called Property Paths (PPs) -to navigate between entities within a single graph. Since Linked Data technologies are naturally aimed at decentralised scenarios, there are many cases where centralising this data is not feasible or even not possible for querying purposes. To address these problems, we propose a SPARQL PP-based graph processing approach -dubbed DpcLD -where users can execute SPARQL PP queries and find paths distributed across multiple, connected graphs exposed as SPARQL endpoints. To execute the distributed path queries we implemented an index-free, cache-based query engine that communicates with a shared algorithm running on each remote endpoint, and computes the distributed paths. In this paper, we highlight the way in which this approach exploits and aggregates partial paths, within a distributed environment, to produce complete results. We perform extensive experiments to demonstrate the performance of our approach on two datasets: One representing 10 million triples from the DBPedia SPARQL benchmark, and another full benchmark dataset corresponding to 124 million triples. We also perform a scalability test of our approach using real-world genomics datasets distributed across multiple endpoints. We compare our distributed approach with other distributed and centralized pathfinding approaches, showing that it outperforms other distributed approaches by orders of magnitude, and provides a good trade-off for cases when the data cannot be centralised.

show abstract

Section: Vertex-centric Approachesmentioning

confidence: 99%

Section: Vertex-centric Approachesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient distributed path computation on RDF knowledge graphs using partial evaluation

Mehmood

Saleem²,

Jha

et al. 2021

World Wide Web

View full text Add to dashboard Cite

show abstract

“…Extensions of RPQ Provenance-aware RPQs [39,192,199] refer to RPQs that not only return the pairs of vertices connected by any matched simple paths but also need to generate the provenance why a pair of vertices is returned. Specifically, a provenance-aware RPQ retrieves a subgraph consisting of all the simple paths matching R. Recent studies have supported provenance-aware RPQs in real-world systems.…”

Section: Regular Path Querymentioning

confidence: 99%

“…Dey et al [39] provide a scheme for provenance-aware RPQs by using relational query engines. Xin et al [199] and Wang et al [192] integrate provenance-aware RPQs into Pregel.…”

Section: Regular Path Querymentioning

confidence: 99%

A survey of typical attributed graph queries

Wang

Fan

et al. 2020

World Wide Web

View full text Add to dashboard Cite

Graphs are commonly used for representing complex structures such as social relationships, biological interactions, and knowledge bases. In many scenarios, graphs not only represent topological relationships but also store the attributes that denote the semantics associated with their vertices and edges, known as attributed graphs. Attributed graphs can meet demands for a wide range of applications, and thus a variety of queries on attributed graphs have been proposed. However, these diverse types of attributed graph queries have not been systematically investigated yet. In this paper, we provide an extensive survey of several typical types of attributed graph queries. We propose a taxonomy of attributed graph queries based on query inputs and outputs. We summarize the definitions of queries that fall into each category and present a fine-grained classification of queries within each category by analyzing the semantics and algorithmic motivations behind these queries. Moreover, we discuss the insights of how existing studies address the technical challenges of query processing and outline several promising future research directions.

show abstract

Answering Property Path Queries over Federated RDF Systems

Ge,

Peng,

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Distributed Efficient Provenance-Aware Regular Path Queries on Large RDF Graphs

Cited by 4 publications

References 13 publications

Efficient distributed path computation on RDF knowledge graphs using partial evaluation

Efficient distributed path computation on RDF knowledge graphs using partial evaluation

A survey of typical attributed graph queries

Answering Property Path Queries over Federated RDF Systems

Contact Info

Product

Resources

About