FAQ: Questions Asked Frequently

@article{AboKhamis2016FAQQA,
  title={FAQ: Questions Asked Frequently},
  author={Mahmoud Abo Khamis and Hung Quoc Ngo and Atri Rudra},
  journal={Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems},
  year={2016}
}
  • Mahmoud Abo Khamis, H. Ngo, A. Rudra
  • Published 15 April 2015
  • Computer Science
  • Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
We define and study the Functional Aggregate Query (FAQ) problem, which encompasses many frequently asked questions in constraint satisfaction, databases, matrix operations, probabilistic graphical models and logic. This is our main conceptual contribution. We then present a simple algorithm called "InsideOut" to solve this general problem. InsideOut is a variation of the traditional dynamic programming approach for constraint programming based on variable elimination. Our variation adds a… 

Figures and Tables from this paper

Juggling Functions Inside a Database
TLDR
The framework tightly connects new ideas in database theory with a vast number of application areas in a coherent manner, showing potentially that a good database engine can be a general purpose constraint solver, relational data store, graphical model inference engine, and matrix/tensor computation processor all at once.
Functional Aggregate Queries with Additive Inequalities
TLDR
This work defines relaxed tree decompositions and relaxed submodular and fractional hypertree width parameters and shows 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.
On Functional Aggregate Queries with Additive Inequalities
TLDR
It is shown 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.
Ranked Enumeration of Join Queries with Projections
TLDR
This paper begins the study of the problem of enumerating results in ranked order for queries with projections, and shows that for any acyclic query, it is possible to obtain a near-linear delay algorithm after only a linear time preprocessing step for two important ranking functions: sum and lexicographic ordering.
Attacking Diophantus: Solving a Special Case of Bag Containment
Conjunctive-query containment is the problem of deciding whether the answers of a given conjunctive query on an arbitrary database instance are always contained in the answers of a second query on
General dynamic Yannakakis: conjunctive queries with theta joins under updates
TLDR
First, full formal proof of GDyn ’s correctness and complexity is given and a novel algorithm for computing GDyn query plans is presented, which performs consistently better than the competitor systems with multiple orders of magnitude improvements in both time and memory consumption.
Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries
TLDR
“Any-k” algorithms are developed which, without knowing the number k of desired answers, push the ranking into joins and avoid materializing the join output earlier than necessary, to design a novel algorithm that asymptotically dominates all previously known alternatives.
Optimal Joins using Compact Data Structures
TLDR
It is shown that optimal algorithms can be obtained directly from a representation that regards the relations as point sets in variable-dimensional grids, without the need of extra storage, and developed a compositional algorithm to process full join queries under this representation.
AJAR: Aggregations and Joins over Annotated Relations
We study a class of aggregate-join queries with multiple aggregation operators evaluated over annotated relations. We show that straightforward extensions of standard multiway join algorithms and
The Complexity of Aggregates over Extractions by Regular Expressions
TLDR
This work formally defines aggregate functions over regular document spanners and analyzes the computational complexity of exact and approximative computation of the aggregates.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 129 REFERENCES
Counting solutions to conjunctive queries: structural and hybrid tractability
TLDR
A negative answer is given to the question in the general case, by exhibiting a more powerful structural method based on the novel concept of #-generalized hypertree decomposition, which is shown to be feasible in polynomial time.
Computing Join Queries with Functional Dependencies
TLDR
This paper presents an algorithm for computing join queries with FDs, running within GLVV bound up to a poly-log factor, and shows that it is tight on distributive lattices and some other simple lattices.
Size Bounds and Query Plans for Relational Joins
TLDR
This work studies relational joins from a theoretical perspective and shows that there exist queries for which the join-project plan suggested by the fractional edge cover approach may be substantially better than any join plan that does not use intermediate projections.
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
  • D. Marx
  • Computer Science, Mathematics
    JACM
  • 2013
TLDR
The goal is to characterize those classes of hypergraphs for which CSP(H) is polynomial-time solvable or fixed-parameter tractable, parameterized by the number of variables, and to prove via a series of combinatorial results that if a hypergraph H has large submodular width, then a 3SAT instance can be efficiently simulated by a CSP instance whose hypergraph is H.
Conjunctive Query Containment Revisited
TLDR
Algorithms for containment and minimization that run in time polynomial in n k, where n is the input size and k is the query width are given, which naturally generalize those for acyclic queries and are of practical signiicance because many queries have small query width compared to their sizes.
Semiring-Based Mini-Bucket Partitioning Schemes
TLDR
This paper addresses the partitioning problem which occurs in many approximation techniques such as mini-bucket elimination and joingraph propagation algorithms and proposes a general partitioning scheme that instantiates to the particular task of computing the probability of evidence, but also applies directly to other important reasoning tasks.
Beyond worst-case analysis for joins with minesweeper
TLDR
A new algorithm is described, Minesweeper, that is able to satisfy stronger runtime guarantees than previous join algorithms (colloquially ``beyond worst-case'' guarantees) for data in indexed search trees and a dichotomy theorem is developed for the certificate-based notion of complexity.
Structural Tractability of Counting of Solutions to Conjunctive Queries
TLDR
A parameter, called the quantified star size of a query ϕ, which measures how the free variables are spread in ϕ is introduced, and it is shown that for classes of queries for which these associated hypergraphs admit good decompositions, bounded quantification star size exactly characterizes the subclasses of hyper graphs for which counting the number of solutions is tractable.
Incremental query evaluation in a ring of databases
TLDR
The algebraic structure of a ring of databases is constructed and used as the foundation of the design of a query calculus that allows to express powerful aggregate queries and shows that, for non-nested queries, each individual aggregate value can be incrementally maintained using a constant amount of work.
...
1
2
3
4
5
...