Graphs have been the natural choice for modeling entities and the relationships among
them. One of the most fundamental graph processing operators is a reachability query …

When graph database users explore unfamiliar graphs, potentially with heterogeneous
structure, users may need to find how two or more groups of nodes are connected in a …

Path queries are a core feature of modern graph query languages such as Cypher,
SQL/PGQ, and GQL. These languages provide a rich set of features for matching paths, such …

Label-constrained reachability (LCR) has been ex-tensively studied. However, these studies
have neglected two aspects: the label sequence and time-dependent properties. When …

We survey graph reachability indexing techniques for efficient processing of graph
reachability queries in two types of popular graph models: plain graphs and edge-labeled …

Path queries are a central feature of all modern graph query languages and standards, such
as SPARQL, Cypher, SQL/PGQ, and GQL. While SPARQL returns endpoints of path queries …