24 citations · 24 across the 3 of their papers we have counts for
3 papers
cs.CC2022
Jumping Evaluation of Nested Regular Path Queries
Joachim Niehren, Sylvain Salvati, Rustam Azimov
Nested regular path queries are used for querying graph databases and RDF triple stores. We propose a new algorithm for evaluating nested regular path queries on a graph from a set…
cs.DB2021
One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries
Ekaterina Shemetova, Rustam Azimov, Egor Orachev +2
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…
cs.DB2017★ 24 cited
Context-Free Path Querying by Matrix Multiplication
Rustam Azimov, Semyon Grigorev
Graph data models are widely used in many areas, for example, bioinformatics, graph databases. In these areas, it is often required to process queries for large graphs. Some of the…