NDLI: Does query evaluation tractability help query containment?

Please wait, while we are loading the content...

Incomplete data: what went wrong, and how to fix it

Expressive languages for querying the semantic web

Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture

Model-data Ecosystems: challenges, tools, and trends

All-distances sketches, revisited: HIP estimators for massive graphs analysis

Enumerating answers to first-order queries over databases of low degree

Database principles in information extraction

Nested dependencies: structure and reasoning

Skew in parallel query processing

Independent range sampling

Expressiveness of guarded existential rule languages

Composable core-sets for diversity and coverage maximization

Counting solutions to conjunctive queries: structural and hybrid tractability

Cleaning inconsistencies in information extraction via prioritized repairs

Does query evaluation tractability help query containment?

The input/output complexity of triangle enumeration

A dynamic I/O-efficient structure for one-dimensional top-k range reporting

Containment and equivalence of well-designed SPARQL

Is min-wise hashing optimal for summarizing set intersection?

A dichotomy for non-repeating queries with negation in probabilistic databases

Generating low-cost plans from proofs

Beyond worst-case analysis for joins with minesweeper

Categorical range maxima queries

On scale independence for querying big data

Cost-oblivious storage reallocation

Does query evaluation tractability help query containment?

Content Provider	ACM Digital Library
Author	Vardi, Moshe Y. Romero, Miguel Barceló, Pablo
Abstract	While checking containment of Datalog programs is undecidable, checking whether a Datalog program is contained in a union of conjunctive queries (UCQ), in the context of relational databases, or a union of conjunctive 2-way regular path queries (UC2RPQ), in the context of graph databases, is decidable. The complexity of these problems is, however, prohibitive: 2exptime-complete. We investigate to which extent restrictions on UCQs and UC2RPQs, which have been known to reduce the complexity of query containment for these classes, yield a more "manageable" single-exponential time bound, which is the norm for several static analysis and verification tasks. Checking containment of a UCQ Theta' in a UCQ Theta is NP-hard, in general, but better bounds can be obtained if Theta is restricted to belong to a "tractable" class of UCQs, e.g., a class of bounded treewidth or hypertreewidth. Also, each Datalog program Pi is equivalent to an infinite union of CQs. This motivated us to study the question of whether restricting Theta to belong to a tractable class also helps alleviate the complexity of checking whether Pi is contained in Theta. We study such question in detail and show that the situation is much more delicate than expected: First, tractability of UCQs does not help in general, but further restricting Theta to be acyclic and have a bounded number of shared variables between atoms yields better complexity bounds. As corollaries, we obtain that checking containment of Pi in Theta is in exptime if Theta is of treewidth one, or it is acyclic and the arity of the schema is fixed. In the case of UC2RPQs we show an exptime bound when queries are acyclic and have a bounded number of edges connecting pairs of variables. As a corollary, we obtain that checking whether Pi is contained in UC2RPQ Gamma is in exptime if Gamma is a strongly acyclic UC2RPQ. Our positive results for UCQs and UC2RPQs are optimal, in a sense, since slightly extending the conditions turns the problem 2exptime-complete.
Starting Page	188
Ending Page	199
Page Count	12
File Format	PDF
ISBN	9781450323758
DOI	10.1145/2594538.2594553
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-06-18
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Conjunctive regular path queries Datalog Tree automata Conjunctive queries Containment
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in