Site and Query Scheduling Policies in Multicomputer Database Systems

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. >

[1]  Chaitanya K. Baru,et al.  Join and Data Redistribution Algorithms for Hypercubes , 1993, IEEE Trans. Knowl. Data Eng..

[2]  John P. Hayes,et al.  A Microprocessor-based Hypercube Supercomputer , 1986, IEEE Micro.

[3]  Patrick Martin,et al.  An Evaluation of Site Selection Algorithms for Distributed Query Processing , 1990, Comput. J..

[4]  M. Kitsuregawa,et al.  Architecture and performance of relational algebra machine GRACE , 1989 .

[5]  Patrick Valduriez,et al.  Prototyping Bubba, A Highly Parallel Database System , 1990, IEEE Trans. Knowl. Data Eng..

[6]  Hans Christoph Zeidler,et al.  RDBM - A relational data base machine , 1981, Inf. Syst..

[7]  Edward Omiecinski,et al.  Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers , 1989, IEEE Trans. Knowl. Data Eng..

[8]  Margaret H. Dunham,et al.  Join processing in relational databases , 1992, CSUR.

[9]  Shi-Kuo Chang,et al.  Site Selection in Distributed Query Processing , 1982, ICDCS.

[10]  Clement T. Yu,et al.  On the design of a query processing strategy in a distributed database environment , 1983, SIGMOD '83.

[11]  David J. DeWitt,et al.  DIRECT - A Multiprocessor Organization for Supporting Relational Database Management Systems , 1979, IEEE Trans. Computers.

[12]  Hava T. Siegelmann,et al.  On the allocation of documents in multiprocessor information retrieval systems , 1991, SIGIR '91.

[13]  Sakti Pramanik,et al.  Optimizing Join Queries in Distributed Databases , 1988, IEEE Trans. Software Eng..

[14]  D. J. De Witt,et al.  Direct—A Multiprocessor Organization for Supporting Relational Database Management Systems , 1979 .

[15]  A. Witkowski,et al.  Concurrent I/O system for the hypercube multiprocessor , 1989, C3P.

[16]  Stanley Su.  Database Computers: concepts, architecture & techniques , 1988 .

[17]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[18]  Bernard L. Menezes,et al.  Design of a HyperKYKLOS-based Multiprocessor Architecture for High-Performance Join Operations , 1987, IWDM.

[19]  Kjell Bratbergsengen,et al.  The Development of the CROSS8 and HC16-186 Parallel (Database) Computers , 1989, IWDM.

[20]  Jake K. Aggarwal,et al.  A Mapping Strategy for Parallel Processing , 1987, IEEE Transactions on Computers.

[21]  Edward Omiecinski,et al.  The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer , 1992, IEEE Trans. Parallel Distributed Syst..

[22]  Füsun Özgüner,et al.  Parallel Boolean Operations for Information Retrieval , 1991, Inf. Process. Lett..

[23]  Chaitanya K. Baru,et al.  Implementing relational database operations in a cube-connected multicomputer system , 1987, 1987 IEEE Third International Conference on Data Engineering.

[24]  Yannis E. Ioannidis,et al.  Randomized algorithms for optimizing large join queries , 1990, SIGMOD '90.

[25]  O. Frieder,et al.  Experimentation with hypercube database engines , 1992, IEEE Micro.

[26]  Ophir Frieder,et al.  Duplicate removal on hypercube engines: an experimental analysis , 1991, Parallel Comput..

[27]  Chaitanya K. Baru,et al.  Squashed Embedding of E-R Schemas in Hypercubes , 1990, J. Parallel Distributed Comput..

[28]  Ophir Frieder,et al.  Multiprocessor algorithms for relational-database operators on hypercube systems , 1990, Computer.

[29]  Donovan A. Schneider,et al.  The Gamma Database Machine Project , 1990, IEEE Trans. Knowl. Data Eng..

[30]  Michael Stonebraker,et al.  The Case for Shared Nothing , 1985, HPTS.

[31]  Scott F. Midkiff,et al.  Processor and Link Assignment in Multicomputers Using Simulated Annealing , 1988, ICPP.

[32]  David J. DeWitt,et al.  An Evaluation of Non-Equijoin Algorithms , 1991, VLDB.

[33]  John C. Peterson,et al.  The Mark III Hypercube-Ensemble Concurrent Computer , 1985, International Conference on Parallel Processing.

[34]  John P. Hayes,et al.  Architecture of a Hypercube Supercomputer , 1986, ICPP.

[35]  Philip S. Yu,et al.  Effectiveness of Parallel Joins , 1990, IEEE Trans. Knowl. Data Eng..

[36]  J. P. Hong,et al.  Hypercube project and a simulator for a hypercube of computers , 1985 .