This paper presents a simulation methodology for per- formance evaluation of distributed database query opti- mization schedules on a Hypercube network using SIM- SCRIPT II.STM. The simulation describes JOIN and SEMI-JOIN query processing schedules executing on a 32 node Hypercube packet switched network operating at 80 Mbitsls. This paper compares changes in relation loca- tion of optimized schedules. The simulation methodology describes and evaluates the use of SEMI-JOIN and JOIN query processing tactics with changes in relation location on a Hypercube network. The simulation supports a sliding window protocol of one and shortest path adaptive rout- ing. Results show the JOIN tactic preforms well even with changes in relation location.
['Steven G. Popovich', 'Mansoor Alam', 'Subir Bandyopadhyay']
Simulation Of Optimized Distributed Query Schedules On A Hypercube Network