FAQ: Questions Asked Frequently
Summary: Defines FAQ, a unifying formalism for CSPs, PGMs, matrix ops, joins and logic, and presents InsideOut, a variable-elimination algorithm that leverages fractional edge covers and worst-case optimal join techniques. Characterizes semantically equivalent variable orderings and gives a polytime approximation to minimize fractional FAQ-width. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mahmoud Abo Khamis (LogicBlox; State University of New York at Buffalo)
- 2. Hung Q. Ngo (LogicBlox; State University of New York at Buffalo)
- 3. Atri Rudra (State University of New York at Buffalo)
BibTeX Citation
@inproceedings{khamis_pods16,
address = {New York, NY, USA},
series = {{PODS} '16},
title = {{FAQ: Questions Asked Frequently}},
url = {https://dl.acm.org/doi/10.1145/2902251.2902280},
doi = {10.1145/2902251.2902280},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Khamis, Mahmoud Abo and Ngo, Hung Q. and Rudra, Atri},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 50 of 78 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 397 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.0001911958 |
| 467 | Design and Implementation of the LogicBlox System | 2015 | SIGMOD | 0.00017740891 |
| 848 | Aggregation and Ordering in Factorised Databases | 2013 | VLDB | 0.00013463236 |
| 979 | Incremental Query Evaluation in a Ring of Databases | 2010 | PODS | 0.00012697012 |
| 1,695 | Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width | 2001 | PODS | 9.8317087e-05 |
| 1,734 | Beyond Worst-case Analysis for Joins with Minesweeper | 2014 | PODS | 9.7545941e-05 |
| 1,821 | Joins via Geometric Resolutions: Worst-case and Beyond | 2015 | PODS | 9.5466386e-05 |
| 2,488 | Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability | 2014 | PODS | 8.3790632e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,515 | On the Decidability and Finite Controllability of Query Processing in Databases with Incomplete Information | 2006 | PODS |
| 2 | 8,189 | Complete Approximations of Incomplete Queries | 2013 | VLDB |
| 3 | 10,091 | Containment of Conjunctive Object Meta-Queries | 2006 | VLDB |
| 4 | 1,057 | Answering Queries Using Limited External Query Processors | 1996 | PODS |
| 5 | 5,755 | An Operational Approach to Consistent Query Answering | 2018 | PODS |
| 6 | 6,761 | Computing Join Queries with Functional Dependencies | 2016 | PODS |
| 7 | 1,667 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 8 | 6,482 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 9 | 391 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS |
| 10 | 2,316 | On Functional Aggregate Queries with Additive Inequalities | 2019 | PODS |