The Community for Technology Leaders
Green Image
<p>The problem of finding an optimal semijoin sequence that fully reduces a given tree query is discussed. A method is presented that intelligently navigates the space of all semijoin sequences and returns an optimal solution. Experiments are reported that show that this method performs very efficiently: on average, less than 5% of the search space is searched before an optimal solution is found. Other advantages of the method are ease of implementation, generality of the cost mode considered, and ability to handle tree queries with arbitrary target lists.</p>
intelligent navigation; intelligent search method; query optimization; optimal semijoin sequence; tree query; space; optimal solution; search space; cost mode; arbitrary target lists; distributed databases; information retrieval; knowledge engineering
H. Yoo, S. Lafortune, "An Intelligent Search Method for Query Optimization by Semijoins", IEEE Transactions on Knowledge & Data Engineering, vol. 1, no. , pp. 226-237, June 1989, doi:10.1109/69.87962
97 ms
(Ver )