By Topic

Strategies for implementing distributed query algorithms over high-speed, bandwidth-on-demand, wide area networks

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
$31 $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)
Perrizo, W. ; Dept. of Comput. Sci., North Dakota State Univ., Fargo, ND, USA ; Zhang, Z. ; Krebsbach, S.

Because of the trend toward high bandwidth networks, current distributed query processing algorithms need to be modified or redesigned. Existing distributed query processing techniques must be refocused to reduce latency delay, exploit bandwidth-on-demand, handle multicast issues, and reduce the usual transmission and local processing delays. The authors propose a set of strategies designed to help the implementers of distributed query algorithms on high speed, bandwidth-on-demand, wide area networks. A distributed join algorithm using these design strategies is developed. Using an analytical model they show that the time cost for the proposed new distributed join algorithm is only slightly above that of a theoretical lower bound. Thus, they conclude that the algorithm exhibits near optimal performance and should be considered by implementers of distributed database systems on high-speed bandwidth-on-demand networks

Published in:

Computer Software and Applications Conference, 1997. COMPSAC '97. Proceedings., The Twenty-First Annual International

Date of Conference:

11-15 Aug 1997