Monadic Datalog, Tree Validity, and Limited Access Containment

Benedikt, Michael; Bourhis, Pierre; Gottlob, Georg; Senellart, Pierre

Document type :

Article dans une revue scientifique

DOI :

10.1145/3344514

Title :

Monadic Datalog, Tree Validity, and Limited Access Containment

Author(s) :

Benedikt, Michael [Auteur]
Computing Science Laboratory - Oxford University
Bourhis, Pierre [Auteur]

Self-adaptation for distributed services and large software systems [SPIRALS]
Gottlob, Georg [Auteur]
Computing Science Laboratory - Oxford University
Senellart, Pierre [Auteur]
Data, Intelligence and Graphs [DIG]
Value from Data [VALDA ]

Journal title :

ACM Transactions on Computational Logic

Pages :

6:1-6:45

Publisher :

Association for Computing Machinery

Publication date :

2020

ISSN :

1529-3785

English keyword(s) :

Monadic datalog
Access patterns
Deep Web
Query containment
Binding patterns

HAL domain(s) :

Informatique [cs]/Base de données [cs.DB]

English abstract : [en]

We reconsider the problem of containment of monadic datalog (MDL) queries in unions of conjunctive queries (UCQs). Prior work has dealt with special cases of the problem, but has left the precise complexity characterization ...
Show more >We reconsider the problem of containment of monadic datalog (MDL) queries in unions of conjunctive queries (UCQs). Prior work has dealt with special cases of the problem, but has left the precise complexity characterization open. In addition, the complexity of one important special case, that of containment under access patterns, was not known before. We start by revisiting the connection between MDL/UCQ containment and containment problems involving regular tree languages. We then present a general approach for getting tighter bounds on the complexity of query containment, based on analysis of the number of mappings of queries into tree-like instances. We give two applications of the machinery. We first give an important special case of the MDL/UCQ containment problem that is in EXPTIME, and use this bound to show an EXPTIME bound on containment under access patterns. Secondly we show that the same technique can be used to get a new tight upper bound for containment of tree automata in UCQs. We finally show that the new MDL/UCQ upper bounds are tight. We establish a 2EXPTIME lower bound on the MDL/UCQ containment problem, resolving an open problem from the early 1990s. This bound holds for the MDL/CQ containment problem as well. We also show that changes to the conditions given in our special cases can not be eliminated, and that in particular slight variations of the problem of containment under access patterns become 2EXPTIME-complete.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Files

https://hal.inria.fr/hal-02307999/document
Open access
Access the document

https://hal.inria.fr/hal-02307999/document
Open access
Access the document

https://ora.ox.ac.uk/objects/uuid:4f6fcbe8-61ad-4ac8-bae1-646c1b68db8a/download_file?safe_filename=mdl.pdf&file_format=application%2Fpdf&type_of_work=Journal+article
Open access
Access the document

https://hal.inria.fr/hal-02307999/document
Open access
Access the document

Monadic Datalog, Tree Validity, and Limited ... BibTeX CSV Excel RIS

Files

Monadic Datalog, Tree Validity, and Limited ...

BibTeX

CSV

Excel

RIS