LIS 384K.11 Database-Management Principles and Applications

1. LIS 384K.11Database-Management Principles and Applications Designing Distributed Databases (DDBs) R. E. Wyllys Last revised 2002 Apr 22 GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

2. Lesson Objectives • You will • Understand the principles underlying distributed databases (DDBs) in multi-user environments • Understand the advantages and disadvantages of DDBs • Understand the various ways in which databases can be distributed • Become familiar with the "12 Rules for Databases" of C. J. Date GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

3. Background of DDBs • DDBs were first used in mainframe environments in the 1950s and 1960s. • But they have flourished best since the development, in the 1980s and 1990s, of minicomputers and powerful desktop and workstation computers, along with fast, capacious telecommunications, has made it (relatively) easy and cheap to distribute computing facilities widely. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

4. 1. Local site independence 2. Central site independence 3. Failure independence 4. Location transparency 5. Fragmentation transparency 6. Replication transparency 7. Distributed query processing 8. Distributed transaction processing 9. Hardware independence 10. Operating system independence 11. Network independence 12. Database independence Date's 12 Rules for DDBs In 1987 one of the founders of relational database theory, C. J. Date, stated 12 goals1,2 which, he held, designers should strive to achieve in their DDBs and with the associated DDBMSs: 1Date, C. J. "Twelve Rules for a Distributed Database." Computer World; 1987 June 8; 2(23): 77-81. 2See also: Date, C. J. An Introduction to Database Systems, vol. 1. 5th ed. Reading, MA: Addison-Wesley; 1990. Chap. 23. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

5. Date's 12 Rules for DDBs • 1. Local site independence: Each site in the DDB should act independently with respect to vital DBM functions. • Security • Concurrency Control • Backup • Recovery GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

6. Date's 12 Rules for DDBs • 2. Central site independence: Each site in the DDB should act independently with respect to • The central site • All other remote sites • Note: All sites should have the same capabilities, even though some sites may not necessarily exercise all these capabilities at a given point in time. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

7. Date's 12 Rules for DDBs • 3. Failure independence: The DDBMS should be unaffected by the failure of a node or nodes; the rest of the nodes, and the DDBMS as a whole, should continue to work. • Note: In similar fashion, the DDBMS should continue to work if new nodes are added. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

8. Date's 12 Rules for DDBs • 4. Location transparency: Users should not have to know the location of a datum in order to retrieve it. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

9. Date's 12 Rules for DDBs • 5. Fragmentation transparency: The user should be unaffected by, and not even notice, any fragmentation of the DDB. The user can retrieve data without regard to the fragmentation of the DDB. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

10. Date's 12 Rules for DDBs • 6. Replication transparency: The user should be able to use the DDB without being concerned in any way with the replication of the data in the DDB. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

11. Date's 12 Rules for DDBs • 7. Distributed query processing: A query should be capable of being executed at any node in the DDBMS that contains data relevant to the query. Many nodes may participate in the response to the user's query without the user's being aware of such participation. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

12. Date's 12 Rules for DDBs • 8. Distributed transaction processing: A transaction may access and modify data at several different sites in the DDB without the user's being aware that multiple sites are participating in the transaction. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

13. Date's 12 Rules for DDBs • 9. Hardware independence: The DDB and its associated DDBMS should be capable of being implemented on any suitable platform, i.e., on any computer with appropriate hardware resources regardless of what company manufactured the computer. • Note: Current DDBMSs often fail to achieve this goal. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

14. Date's 12 Rules for DDBs • 10. Operating system independence: The DDB and its associated DDBMS should be capable of being implemented on any suitable operating system, i.e., on any operating system capable of handling multiple users. • Note: At present this means Windows NT and 2000, and the various varieties of Unix including Linux. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

15. Date's 12 Rules for DDBs • 11. Network independence: The DDB and its associated DDBMS should be capable of being implemented on any suitable network platform. • Note: At present, this goal means that the DDBMS should be able to run on Windows NT, on Windows 2000, on any variant of Unix, and on Novell Networks. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

16. Date's 12 Rules for DDBs • 12. Database independence: The design of the DDB should render it capable of being supported by suitable, i.e., of sufficient power and sophistication, DDBMS from any vendor. • Note: In terms of logical design, this goal is currently often achieved, even though actual implementations rarely use more than one or two DDBMSs. GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

17. Summary • Date's 12 Rules emphasize the following goals: • Independence of individual sites within the system from other sites and non-dependence of the system on any one site (independence of the system internally): Rules 1-3 • Transparency, to users, of the operations of the system and the distribution of the data: Rules 4-6 • Distributed nature of query and transaction processing: Rules 7-8 • Independence of the system with respect to hardware, operating systems, network software, and particular database-management systems (independence of the system with respect to its external environment): Rules 9-12 GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications

18. Distributed Databases Present Problems That Are Complex, But Solvable GSLIS - The University of Texas at Austin LIS 384K.11, Database-Management Principles and Applications