Distributing a Database for Parallelism.

Abstract

In this paper the authors treat the problem of subdividing a database and allocating the fragments to the sites in a distributed database system in order to maximize non-duplicative parallelism. Their goal is to establish a conceptual framework for distributing data without being committed to specific cost models. They introduce the concept of local sufficiency as a measure of parallelism, and show how certain classes of queries lead naturally to irredundant partitions of a database that are locally sufficient. For classes of queries for which no irredundant distribution is locally sufficient, ways to introduce redundancy in achieveing local sufficiency are introduced.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1983
Accession Number
ADA127856

Entities

People

  • Elissa W.P. Wong
  • R. H. Katz

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Artillery
  • Cartesian Coordinates
  • Celestial Brightness
  • Competition
  • Data Reduction
  • Errors
  • Firing Tables
  • Goniometers
  • Grids
  • Materials
  • Plotting
  • Plotting Boards
  • Psychology
  • Range Finding
  • Standards
  • Trainees
  • Training

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Geospatial Intelligence and Artificial Intelligence Analytics
  • Neural Network Machine Learning.