On Functional Aggregate Queries with Additive Inequalities

by   Mahmoud Abo Khamis, et al.

Motivated by fundamental applications in databases and relational machine learning, we formulate and study the problem of answering Functional Aggregate Queries (FAQ) in which some of the input factors are defined by a collection of Additive Inequalities between variables. We refer to these queries as FAQ-AI for short. To answer FAQ-AI in the Boolean semiring, we define "relaxed" tree decompositions and "relaxed" submodular and fractional hypertree width parameters. We show that an extension of the InsideOut algorithm using Chazelle's geometric data structure for solving the semigroup range search problem can answer Boolean FAQ-AI in time given by these new width parameters. This new algorithm achieves lower complexity than known solutions for FAQ-AI. It also recovers some known results in database query answering. Our second contribution is a relaxation of the set of polymatroids that gives rise to the counting version of the submodular width, denoted by "#subw". This new width is sandwiched between the submodular and the fractional hypertree widths. Any FAQ and FAQ-AI over one semiring can be answered in time proportional to #subw and respectively to the relaxed version of #subw. We present three applications of our FAQ-AI framework to relational machine learning: k-means clustering, training linear support vector machines, and training models using non-polynomial loss. These optimization problems can be solved over a database asymptotically faster than computing the join of the database relations.


page 1

page 2

page 3

page 4


Boolean Tensor Decomposition for Conjunctive Queries with Negation

We propose an algorithm for answering conjunctive queries with negation,...

Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems

Answering Conjunctive Queries (CQs) and solving Constraint Satisfaction ...

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 ...

Space-Time Tradeoffs for Answering Boolean Conjunctive Queries

In this paper, we investigate space-time tradeoffs for answering boolean...

Approximate Aggregate Queries Under Additive Inequalities

We consider the problem of evaluating certain types of functional aggreg...

Linear Programs with Conjunctive Database Queries

In this paper, we study the problem of optimizing a linear program whose...

Thistle: A Vector Database in Rust

We present Thistle, a fully functional vector database. Thistle is an en...

Please sign up or login with your details

Forgot password? Click here to reset