Database Paper Browser

Back to papers

Query Evaluation by Circuits

Summary: First study of circuit complexity for conjunctive-query evaluation: polylog-depth circuits under degree constraints whose size matches the polymatroid bound up to polylog factors. Defines output-sensitive circuit families and gives circuits matching RAM-size bounds. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1836
Venue
PODS
Year
2022
Pagerank
4.8603097e-05
Overall Rank
7,017 | 51.19%
DOI
10.1145/3517804.3524142

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
8,589 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 4.4897014e-05
9,652 Secure Sampling for Approximate Multi-party Query Processing 2023 SIGMOD 4.3109001e-05
10,254 Secure Multi-Party Sampling over Joins 2026 VLDB 4.1945683e-05
10,343 Circuit Bounds for Conjunctive Queries with Self-joins 2025 PODS 4.1945683e-05
10,544 Jodes: Efficient Oblivious Join in the Distributed Setting 2025 VLDB 4.1945683e-05
10,905 Tight Bounds of Circuits for Sum-Product Queries 2024 PODS 4.1945683e-05
10,970 Relational Algorithms for Top-k Query Evaluation 2024 SIGMOD 4.1945683e-05
Previous Page 1 / 1 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