Chen Rui-dian
Abstract
This paper presents a new optimization algorithm to determine join sequence in multi-join queries of By intradutimg the benefit-cost ratio, the aut hor presents a greedy- selection model. Using the new model, we can easily gain a ideal join sequence.
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.
This paper presents a new optimization algorithm to determine join sequence in multi-join queries of By intradutimg the benefit-cost ratio, the aut hor presents a greedy- selection model. Using the new model, we can easily gain a ideal join sequence.
Key concepts: Computer science, Join (topology), Sequence (biology), Selection (genetic algorithm), Database, Ideal (ethics), Greedy algorithm, Distributed database