DBScholar

Back to papers

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)

Paper ID
1674
Venue
PODS
Year
2016
Pagerank
0.00020243592
Overall Rank
358 | 97.55%
DOI
10.1145/2902251.2902280

Incoming Non-self Citations Over Time

Authors

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 76 citing papers.

Rank Citing Paper Year Venue Pagerank
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
321 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021283186
536 Learning Linear Regression Models over Factorized Joins 2016 SIGMOD 0.0001693369
814 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00013841737
816 The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017 SIGMOD 0.00013827772
1,109 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00012142685
1,246 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011504088
1,250 Data Management in Machine Learning: Challenges, Techniques, and Systems 2017 SIGMOD 0.00011485301
1,549 AJAR: Aggregations and Joins over Annotated Relations 2016 PODS 0.00010390168
1,740 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.875587e-05
2,266 On Functional Aggregate Queries with Additive Inequalities 2019 PODS 8.8391372e-05
2,600 Convergence of Datalog over (Pre-) Semirings 2022 PODS 8.3571843e-05
2,745 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 8.1747954e-05
2,769 A Layered Aggregate Engine for Analytics Workloads 2019 SIGMOD 8.1465406e-05
2,927 In-Database Learning with Sparse Tensors 2018 PODS 7.9531195e-05
3,136 Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries 2020 PODS 7.7210541e-05
3,206 Incremental View Maintenance with Triple Lock Factorization Benefits 2018 SIGMOD 7.6367549e-05
3,284 SPOOF: Sum-Product Optimization and Operator Fusion for Large-Scale Machine Learning 2017 CIDR 7.5663058e-05
3,498 Attacking Diophantus: Solving a Special Case of Bag Containment 2019 PODS 7.3629798e-05
3,941 Guaranteeing the O~(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins 2023 PODS 7.0074268e-05
4,128 The Relational Data Borg is Learning 2020 VLDB 6.8850804e-05
4,409 MNC: Structure-Exploiting Sparsity Estimation for Matrix Expressions 2019 SIGMOD 6.7178579e-05
4,976 SPORES: Sum-Product Optimization via Relational Equality Saturation for Large Scale Linear Algebra 2020 VLDB 6.4168322e-05
5,195 Tensor Relational Algebra for Distributed Machine Learning System Design 2021 VLDB 6.3232105e-05
5,461 HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings 2019 PODS 6.2090515e-05
5,463 Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins 2021 PODS 6.2086169e-05
5,601 Optimal Join Algorithms Meet Top-k 2020 SIGMOD 6.1540123e-05
5,893 A Query Language Perspective on Graph Learning 2023 PODS 6.0486927e-05
5,923 Topology Dependent Bounds For FAQs 2019 PODS 6.0411129e-05
6,094 The Fast and the Private: Task-based Dataset Search 2024 CIDR 5.9786215e-05
6,159 General and Fractional Hypertree Decompositions: Hard and Easy Cases 2018 PODS 5.9542729e-05
6,301 Evaluating Datalog over Semirings: A Grounding-based Approach 2024 PODS 5.9213518e-05
6,398 Query Evaluation by Circuits 2022 PODS 5.8867918e-05
6,412 Ranked Enumeration of Join Queries with Projections 2022 VLDB 5.8836116e-05
6,434 Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees 2025 SIGMOD 5.8799421e-05
6,444 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 5.8774519e-05
6,585 JoinBoost: Grow Trees Over Normalized Data Using Only SQL 2023 VLDB 5.8350362e-05
6,678 Output-sensitive Conjunctive Query Evaluation 2024 PODS 5.8053953e-05
6,732 Insert-Only versus Insert-Delete in Dynamic Query Evaluation 2024 PODS 5.7885064e-05
6,929 Mining Approximate Acyclic Schemes from Relations 2020 SIGMOD 5.7369354e-05
7,161 Computing the Difference of Conjunctive Queries Efficiently 2023 SIGMOD 5.6852987e-05
7,195 Space-Time Tradeoffs for Conjunctive Queries with Access Patterns 2023 PODS 5.6765621e-05
7,286 Efficient Computation of Quantiles over Joins 2023 PODS 5.655242e-05
7,292 A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries 2022 PODS 5.653597e-05
7,386 Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores 2025 VLDB 5.6273882e-05
7,904 Tight Bounds of Circuits for Sum-Product Queries 2024 PODS 5.5181056e-05
7,914 Saibot: A Differentially Private Data Search Platform 2023 VLDB 5.5181056e-05
8,513 Galley: Modern Query Optimization for Sparse Tensor Programs 2025 SIGMOD 5.4119882e-05
8,528 Aggregate Queries on Sparse Databases 2020 PODS 5.4119882e-05
9,118 Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs 2024 SIGMOD 5.3201316e-05
Previous Page 1 / 2 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers