Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data

    SIGMOD Record, Volume 46, Issue 1, 2017, Pages 15-22.

    Cited by: 3|Bibtex|Views12|Links
    EI

    Abstract:

    Many of today's graph query languages are based on graph pattern matching. We investigate optimization for treeshaped patterns with transitive closure. Such patterns are quite expressive, yet can be evaluated efficiently. The minimization problem aims at reducing the number of nodes in patterns and goes back to the early 2000's. We provid...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments