The Community for Technology Leaders
Green Image
<p>We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations.</p>
distributed databases; distributed memory systems; parallel algorithms; multiprocessing programs; hypercube networks; database theory; query scheduling policies; multicomputer database systems; run-time issues; site allocation; read-only queries; hypercube interconnection; query trees; operation sequence trees; dynamic site allocation; interquery concurrency; query completion times; initiation delays

O. Frieder and C. Baru, "Site and Query Scheduling Policies in Multicomputer Database Systems," in IEEE Transactions on Knowledge & Data Engineering, vol. 6, no. , pp. 609-619, 1994.
83 ms
(Ver 3.3 (11022016))