Maintaining bounded disorder files in multiprocessor multi-disk environments

  • Gabriel Matsliach
  • Oded Shmueli
Data Structures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 470)


The Bounded Disorder file is a file organization method that consists of an index and multi-bucket data leaves which are partially expanded before being split. It guarantees good performance for single-key operations (e.g. search, insert, and delete), similar to that of hash based methods, and in addition, good performance for subrange operations, and reasonable performance for sequential-key operations. To obtain these capabilities, the index must be entirely stored in main memory.

In this paper, we consider the problem of implementing Bounded Disorder files in multiprocessor multi-disk environments which consist of P processor-disk pairs. The processors are either tightly coupled (communicate via shared memory) or loosely coupled (communicate via a local network).

The straightforward solution is to equally partition the file records among processors, each of which maintains its part as a “local” Bounded Disorder file (stored in the processor's main memory and disk). This method is highly parallel (up to P single-key operations can be executed in parallel) and achieves good performance due to the use of Bounded Disorder files.

We present an alternative method, called Conceptual Bounded Disorder file, which obtains performance similar to the above straightforward method, and in addition, obtains a significant cut down in main memory space consumption. Thus, in on-line systems, the number of files that can be concurrently opened for access is much larger when files are maintained as Conceptual Bounded Disorder files.


Hash Function Main Memory Execution Cost Space Utilization Search Structure 
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]
    D. Comer, “The Ubiquitous B-tree”, ACM Computing Surveys, Vol 11, No 2, June 1979, pp. 121–137.CrossRefGoogle Scholar
  2. [2]
    D. J. DeWitt, H. R. Gerber, G. Graefe, L. M. Heytens, K. B. Kumar, and M. Muralikrishna, “GAMMA: A Performance Dataflow Database Machine”, Proc. of Very Large Data Bases Conf., August 1986, pp. 228–237.Google Scholar
  3. [3]
    B. Eisenbarth, N. Ziviani, G. H. Gonnet, K. Mehlhorn, and D. Wood, “The Theory of Fringe Analysis and its Application to 2–3 Trees and B-trees”, Information and Control, Vol 55, 1982, pp. 125–174.Google Scholar
  4. [4]
    R. Fagin, J. Nievergelt, N. Pippenger, and R. H. Strong, “Extendible Hashing — a Fast Access Method for Dynamic Files”, ACM Transaction on Database Systems, Vol 4, No 3, September 1979, pp. 315–355.Google Scholar
  5. [5]
    T. Lehman, “Design and Performance Evaluation of Main Memory Relational Database System”, University of Wisconsin Madison, Computer Science Dep. T.R. #656, August 1986.Google Scholar
  6. [6]
    W. Litwin, “Linear Hashing: a new tool for file and table addressing”, Proc. of Very Large Data Bases Conf., October 1980, pp. 212–223.Google Scholar
  7. [7]
    D. B. Lomet, “Partial Expansions for File Organizations With an Index”, ACM Transactions on Database Systems, Vol 12, No 1, March 1987, pp. 65–84.Google Scholar
  8. [8]
    D. B. Lomet, “A Simple Bounded Disorder File Organization with Good Performance”, ACM Transactions on Database Systems, Vol 13, No 4, December 1988, pp. 525–551.Google Scholar
  9. [9]
    G. Matsliach, “Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions”, Technion — Israel Institute of Technology, Dept. of Computer Science, TR #643, July 1990.Google Scholar
  10. [10]
    G. Matsliach, and O. Shmueli, “Distributing a B+-tree in a Loosely Coupled Environment”, Information Processing Letters, Vol 34, No 6, May 1990. pp. 313–321.Google Scholar
  11. [11]
    G. Matsliach, and O. Shmueli, “A Combined Method for Maintaining Indices in Multi-processor Multi-disk Environments”, Technion — Israel Institute of Technology, Dept. of Computer Science, TR #608, February 1990.Google Scholar
  12. [12]
    G. Matsliach, and O. Shmueli, “A General Method For Distributing Search Structures and Reducing Main Memory Consumption”, Technion — Israel Institute of Technology, Dept. of Computer Science, Center of Intelligent Systems, TR #9004, June 1990.Google Scholar
  13. [13]
    G. Matsliach, and O. Shmueli, “A Framework for Distributing and Parallelizing Secondary Memory Search Structures”, Technion — Israel Institute of Technology, Dept. of Computer Science, TR #637, June 1990.Google Scholar
  14. [14]
    M. V. Ramakrishna, and P. Mulkhopadhyay, “Analysis of Bounded Disorder File Organization”, Proc. of ACM-PODS Conf., 1988, pp. 117–125.Google Scholar
  15. [15]
    Y. Sagiv, “Concurrent Operations on B+-trees with Overtaking”, Journal of Computer and System Sciences, Vol 33, No 2, October 1986, pp. 275–296.Google Scholar
  16. [16]
    A. A. C. Yao, “On Random 2–3 Trees”, Acta Informatica, Vol 9, No 2, 1978, pp. 159–170.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Gabriel Matsliach
    • 1
  • Oded Shmueli
    • 1
  1. 1.Dept. of Computer ScienceTechnion — Israel Institute of TechnologyHaifaIsrael

Personalised recommendations