A Bottom-Up Algorithm for Answering Context-Free Path Queries in Graph Databases

Santos, Fred C.; Costa, Umberto Souza da; Musicante, Martin A.

doi:10.1007/978-3-319-91662-0_17

Cited by 9 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, many CFPQ algorithms with various properties were proposed recently. They employ the ideas of different parsing algorithms, such as CYK in works by Hellings (2014) and Bradford (2017), (G)LR and (G)LL in works by Grigorev and Ragozina (2017), Medeiros et al (2018), Santos et al (2018), Verbitskaia et al (2016). Unfortunately, none of them has better than cubic time complexity in terms of the input graph size.…”

Section: Related Workmentioning

confidence: 99%

One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries

Shemetova,

Azimov,

Orachev

et al. 2021

Preprint

View full text Add to dashboard Cite

The Kronecker product-based algorithm for context-free path querying (CFPQ) was proposed by Orachev et al. (2020). We reduce this algorithm to operations over Boolean matrices and extend it with the mechanism to extract all paths of interest. We also prove O(n 3 / log n) time complexity of the proposed algorithm, where n is a number of vertices of the input graph. Thus, we provide the alternative way to construct a slightly subcubic algorithm for CFPQ which is based on linear algebra and incremental transitive closure (a classic graph-theoretic problem), as opposed to the algorithm with the same

show abstract

Section: Related Workmentioning

confidence: 99%

One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries

Shemetova,

Azimov,

Orachev

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…In [15], the authors present a Context-Free Path ery processing algorithm based on the well-known bo om-up LR parsing technique [2].…”

Section: Related Workmentioning

confidence: 99%

“…For queries of the form (x, S), where x is a vertex of the graph and S is a non-terminal symbol, the algorithm proceeds in a top-down manner, trying to discover S-generated paths from x. e worst case runtime complexity of their algorithm is O(|V | 3 • |P |), where P is the set of production rules of the grammar. e authors in [9] evaluate the Context-Free Path ery evaluation methods in [4,8,15]. e authors perform experiments with several data sets, including real and synthetic ones.…”

Section: Related Workmentioning

confidence: 99%

An Algorithm for Context-Free Path Queries over Graph Databases

Medeiros¹,

Musicante²,

Costa³

2020

Preprint

Self Cite

View full text Add to dashboard Cite

RDF (Resource Description Framework) is a standard language to represent graph databases.ery languages for RDF databases usually include primitives to support path queries, linking pairs of vertices of the graph that are connected by a path of labels belonging to a given language. Languages such as SPARQL include support for paths dened by regular languages (by means of Regular Expressions).A context-free path query is a path query whose language can be de ned by a context-free grammar. Context-free path queries can be used to implement queries such as the "same generation queries", that are not expressible by Regular Expressions. In this paper, we present a novel algorithm for context-free path query processing. We prove the correctness of our approach and show its run-time and memory complexity. We show the viability of our approach by means of a prototype implemented in Go. We run our prototype using the same cases of study as proposed in recent works, comparing our results with another, recently published algorithm. e experiments include both synthetic and real RDF databases. Our algorithm can be seen as a step forward, towards the implementation of more expressive query languages.

show abstract