The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs

    Ann. Math. Artif. Intell., pp. 167-203, 2015.

    Cited by: 13|Bibtex|Views3|Links
    EI
    Keywords:
    Boolean queryTransitive closureRelation algebraUnlabeled graphExpressivenessMore(4+)

    Abstract:

    Several established and novel applications motivate us to study the expressive power of navigational query languages on graphs, which represent binary relations. Our basic language has only the operators union and composition, together with the identity relation. Richer languages can be obtained by adding other features such as intersecti...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments