A Trichotomy for Regular Trail Queries

    Tina Trautner
    Tina Trautner

    arXiv: Formal Languages and Automata Theory, 2019.

    Cited by: 2|Bibtex|Views0|Links
    EI

    Abstract:

    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 suc...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments