Distributed database design methodologies

This paper surveys methodological approaches for distributed database design. The design of distribution can be performed top-down or bottom-up; the first approach is typical of a distributed database developed from scratch, while the second approach is typical of the development of a multi-database as the aggregation of existing databases. We review the design problems and methodologies along both directions, and we describe DATAID-D, a top-down methodology for distribution design. We indicate how the methodology is part of a global approach to database design; how to collect the requirements about the distribution of data and applications; and how to progressively build the distribution of a schema. Our approach is exemplified through one case study.

[1]  Peter M. G. Apers,et al.  Query processing and data allocation in distributed database systems , 1983 .

[2]  Michael L. Brodie,et al.  A Prototyping Approach to Database Applications Development , 1984, IEEE Database Eng. Bull..

[3]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[4]  Shamkant B. Navathe,et al.  1978 New Orleans Data Base Design Workshop Report , 1979, Fifth International Conference on Very Large Data Bases, 1979..

[5]  Keki B. Irani,et al.  A Methodology for the Design of Communication Networks and the Distribution of Data in Distributed Supercomputer Systems , 1982, IEEE Transactions on Computers.

[6]  Stefano Ceri,et al.  Distributed Databases: Principles and Systems , 1984 .

[7]  Shamkant B. Navathe,et al.  Distribution Design of Logical Database Schemas , 1983, IEEE Transactions on Software Engineering.

[8]  Nathan Goodman,et al.  A Survey of Research and Development in Distributed Database Management , 1977, VLDB.

[9]  Domenico Saccà,et al.  Database partitioning in a cluster of processors , 1983, TODS.

[10]  花田 収悦,et al.  Optimal File Allocation in a Multiple Computer System , 1970 .

[11]  David Maier,et al.  Fragments of Relations: First Hack , 1981, XP2 Workshop on Relational Database Theory.

[12]  Maurizio Lenzerini,et al.  Views Integration , 1983, Methodology and Tools for Data Base Design.

[13]  Barbara Pernici,et al.  DATAID-D: Methodology for Distributed Database Design , 1985, Computer-Aided Database Design: the DATAID approach.

[14]  Shi-Kuo Chang,et al.  A Methodology for Structured Database Decomposition , 1980, IEEE Transactions on Software Engineering.

[15]  Peter M G Apers,et al.  Data allocation in distributed database systems , 1988, TODS.

[16]  Umeshwar Dayal,et al.  View Definition and Generalization for Database Integration in a Multidatabase System , 1984, IEEE Transactions on Software Engineering.

[17]  David Maier,et al.  Fragments of relations , 1983, SIGMOD '83.

[18]  John Grant.  Constraint preserving and lossless database transformations , 1984, Inf. Syst..

[19]  S. Ceri Ed.  Methodology and Tools for Data Base Design , 1983 .

[20]  Paul De Bra,et al.  On Horizontal Decompositions , 1981, XP2 Workshop on Relational Database Theory.

[21]  Ramez Elmasri,et al.  Data model integration using the structural model , 1979, SIGMOD '79.

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

[23]  Wesley W. Chu,et al.  Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[24]  Shamkant B. Navathe,et al.  Vertical partitioning algorithms for database design , 1984, TODS.

[25]  Toby J. Teorey,et al.  Design of Database Structures , 1982 .

[26]  K. K. Wong,et al.  MRDSM: A Relational Multidatabases Management System , 1984, DDSS.

[27]  Peter P. Chen.  The entity-relationship model: toward a unified view of data , 1975, VLDB '75.

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

[29]  J. Spruce Riordon,et al.  Optimal allocation of resources in distributed information networks , 1976, TODS.

[30]  Peter Buneman,et al.  Constructing superviews , 1981, SIGMOD '81.

[31]  Gary D. Scudder,et al.  On the selection of efficient record segmentations and backup strategies for large shared databases , 1984, TODS.

[32]  Dorit S. Hochbaum,et al.  Database Location in Computer Networks , 1980, JACM.

[33]  K. Dan Levin,et al.  Optimal program and data locations in computer networks , 1977, CACM.

[34]  Robert L. Blum,et al.  Discovery and Representation of Causal Relationships from a Large Time-Oriented Clinical Database: The RX Project , 1982, Lecture Notes in Medical Informatics.

[35]  Stefano Ceri,et al.  Horizontal data partitioning in database design , 1982, SIGMOD '82.

[36]  Michael Hammer,et al.  A heuristic approach to attribute partitioning , 1979, SIGMOD '79.

[37]  Umeshwar Dayal,et al.  Processing Queries Over Generalization Hierarchies in a Multidatabase System , 1983, VLDB.

[38]  Ramez Elmasri,et al.  Relationship Merging in Schema Integration , 1984, VLDB.

[39]  Kapali P. Eswaran.  Placement of Records in a File and File Allocation in a Computer , 1974, IFIP Congress.

[40]  Gio Wiederhold,et al.  Separability —An Approach to Physical Database Design , 1984, IEEE Transactions on Computers.

[41]  Dennis McLeod,et al.  A federated architecture for database systems , 1899, AFIPS '80.