A Research on Optimization of Multi-join Queries
Peng Jian
Abstract
Peng Jian
Abstract
On the basis of the given condition,it is shown that the global optimization algorithm can apply to equi_join or nonequi_join and has nothing to do with the estimation model of the join_later size in muti_join queries,and that for star queries, the algorithm can produce join sequences with the following global optimization property.In the join sequence, arbitrary subsequence formed by three neighboring joins is optimum.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
On the basis of the given condition,it is shown that the global optimization algorithm can apply to equi_join or nonequi_join and has nothing to do with the estimation model of the join_later size in muti_join queries,and that for star queries, the algorithm can produce join sequences with the following global optimization property.In the join sequence, arbitrary subsequence formed by three neighboring joins is optimum.
Key concepts: Join (topology), Joins, Subsequence, Computer science, Hash join, Sort-merge join, Sequence (biology), Theoretical computer science