Study on Optimized Algorithm for Distributed Database Direct-join Query
YU Xiuxia, Jianping Zhao
Abstract
YU Xiuxia, Jianping Zhao
Abstract
For distribute database query,join operation is the kind of the most common use with time-consuming and higher price and also it is the key confluence factor of the query efficiency.This paper presents an optimized query algorithm,which adopts direct-join using data partition and parallel processing.It can reduce the response time of query process.
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.
For distribute database query,join operation is the kind of the most common use with time-consuming and higher price and also it is the key confluence factor of the query efficiency.This paper presents an optimized query algorithm,which adopts direct-join using data partition and parallel processing.It can reduce the response time of query process.
Key concepts: Computer science, Join (topology), Query optimization, Partition (number theory), Database, Sargable, Online aggregation, View