Minimization of Tree Patterns

    J. ACM, Volume 65, Issue 4, 2018, Pages 26:1-26:46.

    Cited by: 7|Bibtex|Views16|Links
    EI

    Abstract:

    Many of today’s graph query languages are based on graph pattern matching. We investigate optimization of tree-shaped patterns that have transitive closure operators. Such patterns not only appear in the context of graph databases but also were originally studied for querying tree-structured data, where they can perform child, descendant,...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments