A Framework for Comparing Query Languages in Their Ability to Express Boolean Queries

    Annals of Mathematics and Artificial Intelligence, pp. 157-184, 2018.

    Cited by: 0|Bibtex|Views1|Links
    EI
    Keywords:
    Query languages Expressive power Graph databases Conjunctive queries Boolean query modalitiesMore(1+)

    Abstract:

    For any query language $\mathcal {F}$ , we consider three natural families of boolean queries. Nonemptiness queries are expressed as e ≠ ∅ with e an ...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments