By Topic

The optimal query plan selection based on the network and remote server analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhining Liao ; Sch. of Comput. & Math., Ulster Univ., UK ; Hui Wang ; Gongde Guo

Query processing over the Internet involving multiple data sources is one of the most difficult and important problems. In this new data processing environment, three major factors affect the cost of a query; network congestion situation, server states (server workload), and data/query complexity. In this paper, we study the behavior of the wide area network and derive the server states from the system contention states and network congestion situation. We also analyze two cases of changes in network behavior and propose different methods to deal with them respectively. The first case is that the changes in the network are regular. We propose a time slide method to deal with this situation. The second case is that the changes in the network are irregular. We use a real discrete Fourier transform method to filter the noise in the main trend of network. So we can choose query plan much accurately by estimating the cost of servers and the network respectively at the query optimization stage.

Published in:

Systems, Man and Cybernetics, 2004 IEEE International Conference on  (Volume:7 )

Date of Conference:

10-13 Oct. 2004