Database Paper Browser

Back to papers

The Complexity of Transformation-Based Join Enumeration

Summary: Complexity of transformation-based join enumeration with exhaustive rule application is analyzed. Duplicates from commutativity/associativity yield O(4^n) operators; a duplication-avoiding scheme within the transformation framework attains the O(3^n) join-enumeration bound, with up to 5x speedup on an 8-table query. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8431
Venue
VLDB
Year
1997
Pagerank
7.9808408e-05
Overall Rank
2,869 | 80.05%
DOI
-

Incoming Non-self Citations Over Time

Authors

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