On the optimality of degree of declustering

  • Simon Sheu
  • Kien A. Hua
  • Ying Cai
Physical Aspects 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)


We present a data partitioning technique for shared-nothing database systems. A unique feature of our scheme is that it organizes a multicomputer system into groups of even number of PNs; and each relation is assigned to one of these groups in such a way to minimize contention among concurrent queries. Thus, a fixed degree of declustering is used for all base relations in this scheme. Our simulation results demonstrate that this approach provides significantly better performance than those of conventional methods which independently determine a degree of declustering for each of the base relations. These schemes totally ignore the requirement of interquery parallelism. Obviously, an appropriate degree of declustering represents a good trade-off between interquery and intraquery parallelism for our strategy. To investigate this issue, we perform extensive simulations to study the effect of various system and workload parameters on the optimality of the degree of declustering. We found that it is influenced primarily by the parallel processing overhead. With this finding, we develop a mathematical model to determine the optimal degree of declustering for a given system.


Base Relation Average Response Time Optimal Degree Heuristic Scheme Data Placement 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H. Boral, W. Alexander, L. Clay, G. Copeland, S. Danforth, M. Franklin, B. Hart, M. Smith and P. Valduriez: Prototyping Bubba, A Highly Parallel Database System, IEEE Trans. on Knowledge and Data Engineering, 2(1):4–24, 1990CrossRefGoogle Scholar
  2. 2.
    D. J. DeWitt, S. Ghandeharizadeh, D. A. Schneider, A. Bricker, H.-I Hsiao and R. Rasmussen: The Gamma Database Machine Project, IEEE Trans. on Knowledge and Data Engineering, 2(1):44–62, 1990CrossRefGoogle Scholar
  3. 3.
    K. A. Hua and H. C. Young: Designing A Highly Parallel Database Server Using Off-the-Shelf Components, Proc. of The Int'l Comp. Symp., 47–54, Dec. 1990Google Scholar
  4. 4.
    R. A. Lorie, J. Daudenarde, J. W. Stamos and H. C. Young: Exploiting Database Parallelism In A Message-Passing Multiprocessor, IBM Journal of Research and Development, 35(5/6):681–695, Sep./Nov. 1991Google Scholar
  5. 5.
    Stanley Y. W. Su: A Microcomputer Network System for Distributed Relational Databases: Design, Implementation, and Analysis, Journal of Telecommunication Networks, 2(3):307–334, 1983Google Scholar
  6. 6.
    M. Stonebraker: The Case for Shared Nothing, IEEE DB. Eng., 9(1):4–9, 1986Google Scholar
  7. 7.
    G. Copeland, W. Alexander, E. Boughter and Tom Keller: Data Placement in Bubba, Proc. of the 1988 SIGMOD Conf., 99–108, June 1988Google Scholar
  8. 8.
    A. N. Wilschut, J. Flokstra and P. M. G. Apers: Parallelism in a Main-Memory DBMS: The Performance of PRISMA/DB, Proc. of 18th Int'l Conf. on VLDB, 521–532, Vancouver, Canada, August 1992Google Scholar
  9. 9.
    S. F. Sheu, K. A. Hua and Y. Cai: UCF, Computer Science, CS-TR-96-04, 1996Google Scholar
  10. 10.
    M. Kitsuregawa, H. Tanaka and T. Moto-oka: Application of Hash to Database Machine and Its Architecture, New Generation Computing, 1(1):66–74, 1983Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Simon Sheu
    • 1
  • Kien A. Hua
    • 1
  • Ying Cai
    • 1
  1. 1.Department of Computer ScienceUniversity of Central FloridaOrlandoUSA

Personalised recommendations