Answering FO+MOD queries under updates on bounded degree databases

    ICDT, 2017.

    Cited by: 18|Bibtex|Views7|Links
    EI
    Keywords:
    Dynamic databases Hanf locality counting problem first-order logic with modulo-counting quantifiers query enumeration

    Abstract:

    We investigate the query evaluation problem for fixed queries over fully dynamic databases, where tuples can be inserted or deleted. The task is to design a dynamic algorithm that immediately reports the new result of a fixed query after every database update. We consider queries in first-order logic (FO) and its extension with modulo-co...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments