Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration
Summary: JD testing NP-hard even for binary relations, resolving a long-open question (prior hardness required Omega(d)-arity) and ruling out efficient small-arity JD tests unless P=NP. New I/O-efficient JD-existence algorithm that settles Loomis-Whitney enumeration and gives optimal external-memory I/O bounds for triangle enumeration, improving PODS'14. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiaocheng Hu
- 2. Miao Qiao
- 3. Yufei Tao
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,997 | Subgraph Matching: on Compression and Computation | 2018 | VLDB | 7.7559339e-05 |
| 4,432 | Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins | 2016 | PODS | 6.1938383e-05 |
| 5,639 | Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins | 2021 | PODS | 5.393897e-05 |
| 6,867 | 2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection | 2017 | PODS | 4.9025083e-05 |
| 11,437 | Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins | 2021 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 502 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021526612 |
| 2,215 | The Input/Output Complexity of Triangle Enumeration | 2014 | PODS | 9.2717602e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,515 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.0220813e-05 |
| 5,962 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 5.2536266e-05 |
| 3,104 | Computing Local Sensitivities of Counting Queries with Joins | 2020 | SIGMOD | 7.5578613e-05 |
| 915 | The Complexity of Evaluating Relational Queries | 1983 | PODS | 0.0001538509 |
| 12,959 | A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies | 1988 | SIGMOD | 4.1945683e-05 |
| 6,728 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS | 4.9483326e-05 |
| 3,929 | Maximally Joining Probabilistic Data | 2007 | PODS | 6.6248763e-05 |
| 8,028 | Tight Fine-Grained Bounds for Direct Access on Join Queries | 2022 | PODS | 4.6028646e-05 |
| 502 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021526612 |
| 4,953 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 5.8085795e-05 |