Conjunctive Queries with Comparisons

Summary: Conjunctive queries with inter-relational comparisons; predicate pushdown is weak here. Introduces a new algorithm for short and long comparisons, with an acyclic condition yielding linear-time evaluation; implemented on Spark and achieves order-of-magnitude speedups over SparkSQL on graph-pattern and analytical workloads. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 6285
Venue: SIGMOD
Year: 2022
Pagerank: 5.350072e-05
Overall Rank: 5,728 | 60.20%
DOI: 10.1145/3514221.3517830

Incoming Non-self Citations Over Time

Authors

1. Qichen Wang
2. Ke Yi

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,466	Robust Join Processing with Diamond Hardened Joins	2024	VLDB	6.1545841e-05
7,161	Computing the Difference of Conjunctive Queries Efficiently	2023	SIGMOD	4.8086254e-05
7,465	Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees	2025	SIGMOD	4.7186055e-05
8,470	Rapidash: Efficient Detection of Constraint Violations	2024	VLDB	4.4993203e-05
8,587	Output-Optimal Algorithms for Join-Aggregate Queries	2025	PODS	4.4853975e-05
10,493	Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized	2025	SIGMOD	4.1905499e-05
10,560	Avoiding Materialisation for Guarded Aggregate Queries	2025	VLDB	4.1905499e-05
10,740	Subgraph Matching: A New Decomposition Based Approach	2025	VLDB	4.1905499e-05
10,930	Complex Event Recognition meets Hierarchical Conjunctive Queries	2024	PODS	4.1905499e-05
10,973	Relational Algorithms for Top-k Query Evaluation	2024	SIGMOD	4.1905499e-05
11,135	A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition	2024	VLDB	4.1905499e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
66	Spark SQL: Relational Data Processing in Spark	2015	SIGMOD	0.00061707583
503	Worst-case Optimal Join Algorithms	2012	PODS	0.00021517145
1,452	What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?	2017	PODS	0.00011922523
2,173	AJAR: Aggregations and Joins over Annotated Relations	2016	PODS	9.3767985e-05
3,009	On Functional Aggregate Queries with Additive Inequalities	2019	PODS	7.7230513e-05
3,374	On the Enumeration Complexity of Unions of Conjunctive Queries	2019	PODS	7.1631303e-05
5,963	Beyond Equi-joins: Ranking, Enumeration and Factorization	2021	VLDB	5.2485815e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,575	Lightning Fast and Space Efficient Inequality Joins	2015	VLDB	6.9509846e-05
10,009	The Space-Time Complexity of Sum-Product Queries	2026	PODS	4.1905499e-05
332	Accelerating Machine Learning Inference with Probabilistic Predicates	2018	SIGMOD	0.00027173479
9,850	COMPARE: Accelerating Groupwise Comparison in Relational Databases for Data Analytics	2021	VLDB	4.2680295e-05
8,163	Computing Complex Temporal Join Queries Efficiently	2022	SIGMOD	4.5685178e-05
6,372	Optimization of Conjunctive Predicates for Main Memory Column Stores	2016	VLDB	5.0878306e-05
10,973	Relational Algorithms for Top-k Query Evaluation	2024	SIGMOD	4.1905499e-05
8,972	Output-sensitive Conjunctive Query Evaluation	2024	PODS	4.4150824e-05
1,114	Parallel Evaluation of Conjunctive Queries	2011	PODS	0.00013871948
7,161	Computing the Difference of Conjunctive Queries Efficiently	2023	SIGMOD	4.8086254e-05