On the size of the search space of join optimization

Authors:
Cong-cong Xing;Bill P. Buckles
Affiliations:
Nicholls State University, Thibodeaux, LA;Tulane University, New Orleans, LA
Venue:
Journal of Computing Sciences in Colleges
Year:
2005

Citing 3
Cited 0

Optimizing equijoin queries in distributed databases where relations are hash partitioned

ACM Transactions on Database Systems (TODS)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Data Structure Techniques

Data Structure Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fundamental issue when we deal with the analysis of the join optimization problem in database systems is: How large is the search space? This paper presents a complete answer to this question. The result shows that the size of the search space is far beyond exponential, which poses a great challenge for finding an e_cient polynomial time algorithm for solving the join optimization problem. On the other hand, it prompts attempts to prove that the join optimization problem is NP-complete. Our work is the initial step for further study on the join optimization problem.