A Methodology for Structured Database Decomposition

We present a methodology for structured database decomposition based on the relational data model. It is argued that in the distributed database environment, structured database decomposition is attractive both for efficiency and for database security considerations. Techniques for parallel processing and hashed access of structurally decomposed database are presented. Techniques for structured database decomposition to support multiple user views are also described. Structured database decomposition is most advantageous in a query only database environment with stable user views, although dynamic updates can also be handled using techniques described in this paper.

[1]  Philip A. Bernstein,et al.  Using Semi-Joins to Solve Relational Queries , 1981, JACM.

[2]  Shi-Kuo Chang.  Data base decomposition in a hierarchical computer system , 1975, SIGMOD '75.

[3]  Diane C. P. Smith,et al.  Database abstractions: aggregation and generalization , 1977, TODS.

[4]  Michael Stonebraker,et al.  Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres , 1979, IEEE Transactions on Software Engineering.

[5]  Per-Åke Larson,et al.  Dynamic hashing , 1978, BIT.

[6]  Shi-Kuo Chang,et al.  A Model for Distributed Computer System Design , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Wu-Haung Cheng.  Optimization techniques in designing relational database systems. , 1978 .

[8]  Shi-Kuo Chang,et al.  Design considerations of a database system in a clinical network environment , 1899 .

[9]  Jeffrey Alan Hoffer.  A clustering approach to the generation of subfiles for the design of a computer data base. , 1975 .

[10]  Nathan Goodman,et al.  An Overview of the Preliminary Design of SDD-1: A System for Distributed Databases , 1977, Berkeley Workshop.

[11]  Sakti P. Ghosh.  Distributing a Data Base with Logical Associations on a Computer Network for Parallel Searching , 1976, IEEE Transactions on Software Engineering.

[12]  R. G. Casey,et al.  Allocation of copies of a file in an information network , 1899, AFIPS '72 (Spring).

[13]  Dennis G. Severance,et al.  Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases , 1976, JACM.

[14]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[15]  Mario Schkolnick,et al.  A clustering algorithm for hierarchical structures , 1977, TODS.

[16]  E. F. Codd,et al.  Further Normalization of the Data Base Relational Model , 1971, Research Report / RJ / IBM / San Jose, California.

[17]  Jyh-Sheng Ke,et al.  Database Skeleton and Its Application to Fuzzy Query Translation , 1978, IEEE Trans. Software Eng..

[18]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[19]  Catriel Beeri,et al.  A Sophisticate's Introduction to Database Normalization Theory , 1978, VLDB.

[20]  E. F. Codd,et al.  A data base sublanguage founded on the relational calculus , 1971, SIGFIDET '71.

[21]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[22]  Michel E. Adiba,et al.  A Distributed Data Base System Using Logical Relational Machines , 1978, VLDB.