Prototyping Bubba, A Highly Parallel Database System

  • Authors:
  • H. Boral;W. Alexander;L. Clay;G. Copeland;S. Danforth;M. Franklin;B. Hart;M. Smith;P. Valduriez

  • Affiliations:
  • -;-;-;-;-;-;-;-;-

  • Venue:
  • IEEE Transactions on Knowledge and Data Engineering
  • Year:
  • 1990

Quantified Score

Hi-index 0.02

Visualization

Abstract

Bubba is a highly parallel computer system for data-intensive applications. The basis of the Bubba design is a scalable shared-nothing architecture which can scale up to thousands of nodes. Data are declustered across the nodes (i.e. horizontally partitioned via hashing or range partitioning) and operations are executed at those nodes containing relevant data. In this way, parallelism can be exploited within individual transactions as well as among multiple concurrent transactions to improve throughput and response times for data-intensive applications. The current Bubba prototype runs on a commercial 40-node multicomputer and includes a parallelizing compiler, distributed transaction management, object management, and a customized version of Unix. The current prototype is described and the major design decisions that went into its construction are discussed. The lessons learned from this prototype and its predecessors are presented.