The VLDB Journal

, Volume 6, Issue 1, pp 53–72 | Cite as

Data placement in shared-nothing parallel database systems

  • Manish Mehta
  • David J. DeWitt


Data placement in shared-nothing database systems has been studied extensively in the past and various placement algorithms have been proposed. However, there is no consensus on the most efficient data placement algorithm and placement is still performed manually by a database administrator with periodic reorganization to correct mistakes. This paper presents the first comprehensive simulation study of data placement issues in a shared-nothing system. The results show that current hardware technology trends have significantly changed the performance tradeoffs considered in past studies. A simplistic data placement strategy based on the new results is developed and shown to perform well for a variety of workloads.

Key words:Declustering – Disk allocation – Resource allocation – Resource scheduling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Manish Mehta
    • 1
  • David J. DeWitt
    • 2
  1. 1.12, S. First St., San Jose, CA 95113, USA; e-mail: mmehta@64k.comUS
  2. 2.1210, W. Dayton St., Madison, WI 53706, USA; e-mail: dewitt@cs.wisc.eduUS

Personalised recommendations