PANDAExpress: A Simpler and Faster PANDA Algorithm

Summary: PANDAExpress removes PANDA’s prohibitive polylog(N) overhead while retaining support for conjunctive queries, disjunctive Datalog, and arbitrary degree constraints. A new output bound enables skew-aware arbitrary-hyperplane partitioning, achieving ~O(N^subw) and extending to ℓp constraints. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID: 2040
Venue: PODS
Year: 2026
Pagerank: 5.093636e-05
Overall Rank: 10,165 | 30.26%
DOI: 10.1145/3801910

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Mahmoud Abo Khamis (RelationalAI)
2. Hung Q. Ngo (RelationalAI)
3. Dan Suciu (University of Washington)

BibTeX Citation

@inproceedings{khamis_pods26,
        address = {New York, NY, USA},
        series = {{PODS} '26},
        title = {{PANDAExpress: A Simpler and Faster PANDA Algorithm}},
        url = {https://dl.acm.org/doi/10.1145/3801910},
        doi = {10.1145/3801910},
        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 Suciu, Dan},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
1	Access Path Selection in a Relational Database Management System	1979	SIGMOD	0.0024089429
321	Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems	2018	PODS	0.00021283186
358	FAQ: Questions Asked Frequently	2016	PODS	0.00020243592
411	Worst-case Optimal Join Algorithms	2012	PODS	0.00018902089
814	Hypertree Decompositions: Questions and Answers	2016	PODS	0.00013841737
1,109	What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?	2017	PODS	0.00012142685
2,266	On Functional Aggregate Queries with Additive Inequalities	2019	PODS	8.8391372e-05
5,639	LpBound: Pessimistic Cardinality Estimation using ℓp-Norms of Degree Sequences	2025	SIGMOD	6.1385102e-05
6,257	Join Size Bounds using l_p-Norms on Degree Sequences	2024	PODS	5.9397944e-05
6,672	Computing Join Queries with Functional Dependencies	2016	PODS	5.8070233e-05
9,994	Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints	2025	PODS	5.1814573e-05
10,643	Fast Matrix Multiplication meets the Submodular Width	2025	PODS	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,317	Probabilistic Query Evaluation: The Combined FPRAS Landscape	2023	PODS
2	4,301	Read-Once Functions and Query Evaluation in Probabilistic Databases	2010	VLDB
3	5,593	Beyond Equi-joins: Ranking, Enumeration and Factorization	2021	VLDB
4	10,643	Fast Matrix Multiplication meets the Submodular Width	2025	PODS
5	6,042	Pando: Enhanced Data Skipping with Logical Data Partitioning	2023	VLDB
6	11,939	PANDA: A System for Partial Topology-based Search on Large Networks	2018	VLDB
7	7,195	Space-Time Tradeoffs for Conjunctive Queries with Access Patterns	2023	PODS
8	1,109	What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?	2017	PODS
9	9,994	Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints	2025	PODS
10	10,159	Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time	2026	PODS