skip to main content
article
Free Access

Distributing a database for parallelism

Authors Info & Claims
Published:01 May 1983Publication History
Skip Abstract Section

Abstract

In this paper we 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. Our goal is to establish a conceptual framework for distributing data without being committed to specific cost models.We 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, we offer ways to introduce redundancy in achieving local sufficiency

References

  1. {APER80} Apers, P.M.G., "Redundant Allocation of Relations in a Communications Network," Proc. Fifth Berkeley Workshop on Distributed Data Management and Computer Networks (Feb. 1981).Google ScholarGoogle Scholar
  2. {CHEN76} Chen, P.P., "The Entity-Relationship Model-Toward a Unified View of Data," ACM Trans. Database Systems, V1, N1 (Mar, 1976). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. {CHU73} Chu, W.W., "Optimal Allocation of Files in Computer Networks," in Computer Communications Networks, Prentice-Hall, Englewood Cliffs, NJ, 1973.Google ScholarGoogle Scholar
  4. {MAHO76} Mahoud, S., J.S. Riordan, "Optimal Allocation of Resources in Distributed Information Networks," ACM Trans. on Database Systems, V1, N1 (Mar. 1976). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. {WONG79} Wong, E., Katz, R.H., "Logical Design and Schema Conversion for Relational and DBTG Databases," Proc. Intl. Conference on Entity-Relationship Approach to Systems Analysis and Design (Dec. 1979). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. {WONG81} Wong, E., "Dynamic Re-Materialization: Processing Distributed Queries Using Redundant Data," Proc. Fifth Berkeley Workshop on Distributed Data Management and Computer Networks (Feb. 1981).Google ScholarGoogle Scholar

Index Terms

  1. Distributing a database for parallelism
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM SIGMOD Record
      ACM SIGMOD Record  Volume 13, Issue 4
      May 1983
      245 pages
      ISSN:0163-5808
      DOI:10.1145/971695
      Issue’s Table of Contents
      • cover image ACM Conferences
        SIGMOD '83: Proceedings of the 1983 ACM SIGMOD international conference on Management of data
        May 1983
        252 pages
        ISBN:0897911040
        DOI:10.1145/582192

      Copyright © 1983 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 May 1983

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader