#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2014

2017

- This year (3)
- Last 5 years (7)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra
- PODS
- 2016

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… (More)

- Mahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, Atri Rudra
- ACM Trans. Database Syst.
- 2015

We present a simple geometric framework for the relational join. Using this framework, we design an algorithm that achieves the fractional hypertree-width bound, which generalizes classical and recent worst-case algorithmic results on computing joins. In addition, we use our framework and the same algorithm to show a series of what are colloquially known as… (More)

- Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu
- PODS
- 2016

Recently, Gottlob, Lee, Valiant, and Valiant (GLVV) presented an output size bound for join queries with functional dependencies (FD), based on a linear program on polymatroids. GLVV bound strictly generalizes the bound of Atserias, Grohe and Marx (AGM) for queries with no FD, in which case there are known algorithms running within the AGM-bound and thus… (More)

In-database analytics is of great practical importance as it avoids the costly repeated loop data scientists have to deal with on a daily basis: select features, export the data, convert data format, train models using an external tool, reimport the parameters. It is also a fertile ground of theoretically fundamental and challenging problems at the… (More)

- Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu
- PODS
- 2017

Recent works on bounding the output size of a conjunctive query with functional dependencies and degree bounds have shown a deep connection between fundamental questions in information theory and database theory. We prove analogous output bounds for <i>disjunctive datalog rules</i>, and answer several open questions regarding the tightness and looseness of… (More)

- Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra
- SIGMOD Record
- 2017

We define and study the Functional Aggregate Query (FAQ) problem, which captures common computational tasks across a very wide range of domains including relational databases, logic, matrix and tensor computation, probabilistic graphical models, constraint satisfaction, and signal processing. Simply put, an FAQ is a declarative way of defining a new… (More)

- Mahmoud Abo Khamis, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra
- ArXiv
- 2014

We consider list versions of sparse approximation problems, where unlike the existing results in sparse approximation that consider situations with unique solutions, we are interested in multiple solutions. We introduce these problems and present the first combinatorial results on the output list size. These generalize and enhance some of the existing… (More)

- ‹
- 1
- ›