DeepAI AI Chat
Log In Sign Up

Boolean Tensor Decomposition for Conjunctive Queries with Negation

by   Mahmoud Abo Khamis, et al.

We propose an algorithm for answering conjunctive queries with negation, where the negated relations are sparse. Its data complexity matches that of the best known algorithms for the positive subquery of the input query and is expressed in terms of the fractional hypertree width and the submodular width. The query complexity depends on the structure of the negated subquery; in general it is exponential in the number of join variables occurring in negated relations yet it becomes polynomial for several classes of queries. This algorithm relies on several contributions. We show how to rewrite queries with negation on sparse relations into equivalent conjunctive queries with not-all-equal (NAE) predicates, which are a multi-dimensional analog of disequality. We then generalize the known color-coding technique to conjunctions of NAE predicates and explain it via a Boolean tensor decomposition of conjunctions of NAE predicates. This decomposition can be achieved via a probabilistic construction that can be derandomized efficiently.


page 1

page 2

page 3

page 4


On Functional Aggregate Queries with Additive Inequalities

Motivated by fundamental applications in databases and relational machin...

Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width

Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width ...

The Complexity of Boolean Conjunctive Queries with Intersection Joins

Intersection joins over interval data are relevant in spatial and tempor...

The tractability frontier of well-designed SPARQL queries

We study the complexity of query evaluation of SPARQL queries. We focus ...

Almost Optimal Proper Learning and Testing Polynomials

We give the first almost optimal polynomial-time proper learning algorit...

A Polytime Delta-Decomposition Algorithm for Positive DNFs

We consider the problem of decomposing a given positive DNF into a conju...

Approximation and Semantic Tree-width of Conjunctive Regular Path Queries

We show that the problem of whether a query is equivalent to a query of ...