@InProceedings{copeland:bubba,
  author = {George Copeland and William Alexander and Ellen Boughter and Tom
  Keller},
  title = {Data Placement in {Bubba}},
  booktitle = {Proceedings of the ACM SIGMOD International Conference on
  Management of Data},
  year = {1988},
  month = {June},
  pages = {99--108},
  publisher = {ACM Press},
  address = {Chicago, IL},
  keywords = {parallel I/O, database, disk caching, pario-bib},
  comment = {A database machine. Experimental/analytical model of a placement
  algorithm that declusters relations across several parallel, independent
  disks. The declustering is done on a subset of the disks, and the choices
  involved are the number of disks to decluster onto, which relations to put
  where, and whether a relation should be cache-resident. Communications
  overhead limits the usefulness of declustering in some cases, depending on
  the workload. See boral:bubba.}
}