
An Algorithm for ContextFree Path Queries over Graph Databases
RDF (Resource Description Framework) is a standard language to represent...
read it

Faster deterministic parameterized algorithm for kPath
In the kPath problem, the input is a directed graph G and an integer k≥...
read it

Typed Linear Algebra for Efficient Analytical Querying
This paper uses typed linear algebra (LA) to represent data and perform ...
read it

Regular Path Query Evaluation Sharing a Reduced Transitive Closure Based on Graph Reduction
Regular path queries (RPQs) find pairs of vertices of paths satisfying g...
read it

ContextFree Path Querying by Matrix Multiplication
Graph data models are widely used in many areas, for example, bioinforma...
read it

The First Order Truth behind Undecidability of Regular Path Queries Determinacy
In our paper [GMO18] we have solved an old problem stated in [CGLV02] sh...
read it

A universal predictorcorrector type incremental algorithm for the construction of weighted straight skeletons based on the notion of deforming polygon
A new predictorcorrector type incremental algorithm is proposed for the...
read it
One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and ContextFree Path Queries
The Kronecker productbased algorithm for contextfree 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/logn) 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 graphtheoretic problem), as opposed to the algorithm with the same complexity proposed by Chaudhuri (2008). Our evaluation shows that our algorithm is a good candidate to be the universal algorithm for both regular and contextfree path querying.
READ FULL TEXT
Comments
There are no comments yet.