DBScholar

Back to papers

The Complexity of Transformation-Based Join Enumeration

Summary: Shows that standard associativity/commutativity transformations generate O(4^n) duplicate join operators. A duplicate-free transformation scheme reaches the O(3^n) lower bound, improving 8-table optimization by up to 5×. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
8622
Venue
VLDB
Year
1997
Pagerank
8.3284491e-05
Overall Rank
2,627 | 81.98%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{pellenkoft_vldb97,
        title = {{The Complexity of Transformation-Based Join Enumeration}},
        author = {Pellenkoft, Arjan and Galindo-Legaria, César A. and Kersten, Martin},
        journal = {PVLDB},
        series = {{VLDB} '97},
        pages = {306--315},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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