Errata for "Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products"
Summary: Erratum to a DP-based method for generating optimal bushy join trees without cross products. Corrects EnumerateCsgRec: use X ∪ Bi(N) instead of X ∪ N to avoid missing valid complements; example on a small query-graph (S1={v0}) and the corrected call. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Andreas Meister
- 2. Guido Moerkotte
- 3. Gunter Saake
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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 |
|---|---|---|---|---|
| 423 | Measuring the Complexity of Join Enumeration in Query Optimization | 1990 | VLDB | 0.00023669348 |
| 1,826 | Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products | 2006 | VLDB | 0.00010400425 |
Previous
Page 1 / 1
Next