Graphs are commonly used for representing complex structures such as social relationships,
biological interactions, and knowledge bases. In many scenarios, graphs not only represent …

Path querying refers to the evaluation of path queries in a graph database. New research in
this topic is crucial for the development of graph database systems as path queries are …

A recent study showed that the applicability of context-free path querying (CFPQ) algorithms
with relational query semantics integrated with graph databases is limited because of low …

Context-Free Path Querying (CFPQ) allows one to use context-free grammars as path
constraints in navigational graph queries. Many algorithms for CFPQ were proposed but …

We present a method based on top-down parsing techniques for evaluating context-free
path queries on RDF Graph Databases. The syntax of the query language is based on …

Path queries are used to specify paths inside a data graph to match a given pattern. Query
languages such as SPARQL usually include support for regular path patterns defined by …

ABSTRACT Context-Free Path Querying (CFPQ) allows one to express path constraints in
navigational graph queries as context-free grammars. Although there are many algorithms …

We propose GLL-based context-free path querying algorithm which handles queries in
Extended Backus-Naur Form (EBNF) using Recursive State Machines (RSM). Utilization of …

Recently proposed matrix multiplication based algorithm for context-free path querying
(CFPQ) offloads the most performance-critical parts onto boolean matrices multiplication …

Context-free path queries (CFPQ) extend the regular path queries (RPQ) by allowing context-
free grammars to be used as constraints for paths. Algorithms for CFPQ are actively …