A Trichotomy for Regular Trail Queries

Wim Martens, Matthias Niewerth & Tina Trautner
Regular path queries (RPQs) are an essential component of graph query languages. Such queries consider a regular expression r and a directed edge-labeled graph G and search for paths in G for which the sequence of labels is in the language of r. In order to avoid having to consider infinitely many paths, some database engines restrict such paths to be trails, that is, they only consider paths without repeated edges. In this paper we...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.