2004Gongcheng shuxue xuebaoRequires access

WPERF+:An Efficient Optimization Algorithm for Distributed Query

Zongben Xu

Open publisher page 0 citations

Abstract

The constant development of computer hardware and internet have encouraged the decen- tralization of data, which increases the needs to access data from different sites. Distributed query is a query process that will incur heavy communication cost. The basic challenge is to design and develop efficient query strategies and techniques to minimize this communication cost. An efficient optimization algorithm for distributed query, i.e., WPERF+, is presented in this paper. The advantages of W semi- joins and PERF joins have been combined into the WPERF+, and greatly enhanced the performance of W semi-joins and PERF joins. In this paper, it is theoretically proved that the WPERF+ strategy is an efficient optimization algorithm that can greatly reduce its communication cost of distributed query.

About this research paper

What this paper is about

The constant development of computer hardware and internet have encouraged the decen- tralization of data, which increases the needs to access data from different sites. Distributed query is a query process that will incur heavy communication cost. The basic challenge is to design and develop efficient query strategies and techniques to minimize this communication cost. An efficient optimization algorithm for distributed query, i.e., WPERF+, is presented in this paper. The advantages of W semi- joins and PERF joins have been combined into the WPERF+, and greatly enhanced the performance of W semi-joins and PERF joins. In this paper, it is theoretically proved that the WPERF+ strategy is an efficient optimization algorithm that can greatly reduce its communication cost of distributed query.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The constant development of computer hardware and internet have encouraged the decen- tralization of data, which increases the needs to access data from different sites. Distributed query is a query process that will incur heavy communication cost. The basic challenge is to design and develop efficient query strategies and techniques to minimize this communication cost. An efficient optimization algorithm for distributed query, i.e., WPERF+, is presented in this paper. The advantages of W semi- joins and PERF joins have been combined into the WPERF+, and greatly enhanced the performance of W semi-joins and PERF joins. In this paper, it is theoretically proved that the WPERF+ strategy is an efficient optimization algorithm that can greatly reduce its communication cost of distributed query.

Key concepts: Joins, Query optimization, Computer science, Process (computing), Distributed computing, Query expansion, Sargable, Database

Related papers

Back to paper searchBrowse research topicsOriginal source
WPERF+:An Efficient Optimization Algorithm for Distributed Query — Research Paper | ScholarLens