ACM Computing Surveys (CSUR)
ACM Transactions on Database Systems (TODS)
Protocols for high-speed networks: some questions and a few answers
Computer Networks and ISDN Systems - Special issue on protocol specification, testing and verification
Residual surrogates in database query processing
Residual surrogates in database query processing
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Join Index, Materialized View, and Hybrid-Hash Join: A Performance Analysis
Proceedings of the Sixth International Conference on Data Engineering
Domain Vector Accelerator for Relational Operations
Proceedings of the Seventh International Conference on Data Engineering
Multidatabase global query optimization
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Distributed query processing using active networks
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
| Hi-index | 0.00 |
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.