RELATIONAL DATABASE MANAGEMENT SYSTEM Riktesh Srivastava PhD (Computer Science & Engineering) Assistant Professor (Information Systems) Skyline University College Sharjah, UAE Rajita Srivastava MSc (Computer Science), MCA and MBA Associate Editor Journal of Computer Science and Information Technology (JCSIT) NEW AGE MANAGEMENT NEW AGE INTERNATIONAL (P) LIMITED, PUBLISHERS New Delhi Bangalore Chennai Cochin Guwahati Hyderabad Kolkata Lucknow Mumbai
Contents Acknowledgement Preface (v) (vii) 1. INTRODUCTION TO DBMS 1-14 1.0 Introduction 1 1.1 History of Database Management System 2 1.2 Database Architecture 2 1.3 Database Management System Users 3 1.4 Role of DBMS 4 15 Advantages of Databases 4 1.6 Data Models 4 1.6.1 File-based data models 5 1.6.2 Traditional data models 7 1.6.3 Semantic datamodels 10 1.7 Schema and Instances 10 1.8 Data Independence 11 1.9 Database Languages 11 1.10 DBMS Interfaces 12 1.11 Overall Database Structure 12 Review Questions 14 2. ENTITY-RELATIONSHIP MODEL 15-27 20 Introduction 15 2.1 E-R Model 16 22 Notation for E-R Diagram 17 2.3 Mapping Constraints 18 24 Keys 19 25 Strong and Weak Entity Sets 19 26 Reducing E-R Diagram to Tables 21 2.7 Generalization 23 28 Aggregation 24 29 Relationships Among Data 25 Review Questions 26
(x) Contents 3. ENHANCED ENTITY-RELATIONSHIP (EER) MODEL 29-38 3.0 Introduction 29 3.1 Superclass and Subclass Entity Types 29 3.2 Attribute Inheritance 32 33 Specialization 34 3.4 Generalization 34 3.5 Specialization/Generalization Constraints 34 3.6 Categorization 36 Review Questions 38 4. RELATIONAL DATA MODEL 39-48 4.0 Introduction 39 4.1 Definition of Relation 39 4.2 Properties of Relational Tables 41 4.3 Codd'sRule 42 4.4 Concept of Keys 43 4.5 Integrity Constraints 45 4.6 Domain Constraints 45 4.7 Assertions 46 4.8 Triggers 46 4.9 Query Languages 47 Review Questions 48 5. RELATIONAL ALGEBRA 49-61 5.0 Introduction 49 5.1 Operations in Relational Algebra 49 5.2 Set Operations 51 5.3 Other Set Operators 57 5.4 Solved Query Examples 60 Review Questions 61 6. RELATIONAL CALCULUS 63-68 6.0 Introduction 63 6.1 Tuple Relational Calculus 64 6.2 Solved Tuple Relational Calculus Examples 65
Contents (xi) 6.3 Domain Relational Calculus 65 6.4 Solved Domain Relational Calculus Examples 67 Review Questions 68 7. STRUCTURED QUERY LANGUAGE 69-101 7.0 Introduction 69 7.1 Parts of SQL Language 70 12 How to Start ORACLE SQL 70 7.3 Data Definition Language 71 7.4 Data Manipulation Commands 77 75 Operators in SQL*Plus 82 7.6 Privilege Commands 86 7.7 Transaction Control Commands 87 7.8 Oracle Functions 88 7.9 Set Operators 94 7.10 Joins 96 7.11 Sub-Queries 98 Review Questions 101 8. PL/SQL 103-125 8.0 Introduction 103 8.1 PL/SQL Syntax 104 8.2 PL/SQL Data Types and Declarations 106 8.3 PL/SQL Operators 108 8.4 Conditional Control in PL/SQL 110 8.5 Iterative Control in PIVSQL 111 8.6 Error Handling in PL/SQL 115 8.7 PL/SQL Functions and Procedures 118 8.8 Database Triggers 120 8.9 Cursors 121 Review Questions 125 9. DATABASE DESIGN 127-154 9.0 Definition of Functional Dependency 127 9.1 Inference Axioms for Functional Dependencies 129 9.2 Redundant Functional Dependencies 130
(xii) Contents 93 Closure of a Set of Functional Dependencies 131 9.4 Closure of a Set of Attributes 132 9.5 Covers and Equivalence of Set of Functional Dependencies 133 9.6 Extraneous Attributes 133 9.7 Canonical Cover 133 9.8 Normal Process 133 9.9 FirstNormal Form 134 9.10 Partial Dependencies 138 9.11 Second Normal Form 138 9.12 Transitive Dependencies 140 9.13 Third Normal Form 140 9.14 Boyce-Codd Normal Form 142 9.15 Multi-valued Dependencies 143 9.16 Fourth Normal Form 145 9.17 Join Dependency and Fifth Normal Form 145 9.18 Inclusion Dependencies 147 9.19 Lossless or Lossy Decompositions 148 Review Questions 154 10. QUERY PROCESSING 155-169 10.0 Introduction 155 10.1 Phases of Query Processing 155 10.2 Query Optimization 157 103 Algorithms for Algebra Operations 165 Review Questions 169 11. TRANSACTION PROCESSING CONCEPTS 171-188 11.0 Introduction 171 11.1 Transaction and System Preliminaries 172 112 A Typical Multiuser System 172 11.3 The Need for Concurrency Control 173 11.3.1 The lost update problem 174 11.32 The temporary update (dirty read) problem 174 11.3.3 The incorrect summary problem 175 11.3.4 Unrepeatable read 175
Contents (xiii) 11.4 The Concept of Failures and Recovery 175 11.5 Transaction States and Additional Operations 176 11.5.1 The concept of system log 177 11.5.2 Commit point of a transaction 178 11.6 Desirable Transaction Properties (ACID Properties) 178 11.7 The Concept of Schedules 180 11.7.1 Schedule (history of transaction) 180 11.7.2 Schedules and recoverability 181 11.8 Serializability 182 11.8.1 Testing for conflict serializability ofa schedule 185 11.8.2 View equivalence and view serializability 186 11.8.3 Uses of serializability 186 11.9 Summary 187 Review Questions 187 12. CONCURRENCY CONTROL TECHNIQUES 189-200 12.0 Introduction 189 12.1 Locking Techniques for Concurrency Control 190 122 Types of Locks and Their Uses 190 12.2.1 Binary locks 190 12.3 Shared/exclusive locks 191 12.4 Conversion Locks 193 125 Two-Phase locking 193 12.6 Deadlock and Starvation 194 12.6.1 Deadlock prevention protocols 195 12.6.2 Deadlock detection & timeouts 195 12.6.3 Starvation 196 12.7 Concurrency Control Based on Time Stamp Ordering 196 12.7.1 The concept of time stamps 196 12.7.2 An algorithm for ordering the time stamp 1% 12.7.3 The concept of basic time stamp ordering 197 12.7.4 Strict time stamp ordering 197 12.8 Multiversion Concurrency Control Techniques 198 12.8.1 Multiversion technique based on time stamp ordering 198 12.8.2 Multiversion two-phase locking certify locks 199
(xiv) Contents 12.9 Summary 200 Review Questions 200 13. DATABASE RECOVERY TECHNIQUES 201-209 13.0 Introduction 201 13.1 Concept of Recovery 202 13.1.1 The Role of the Operating System in Recovery 202 132 Write Ahead Logging 203 133 Role of Check Points in Recovery 203 13.4 Recovery Techniques Based on Defeired Update 204 135 An Algorithm for Recovery Using The Deferred Update in a Single User Environment 204 13.6 Deferred Update with Concurrent Execution 204 13.7 Recovery Techniques on Immediate Update 205 13.7.1 A typical UNDO/REDO algorithm for an immediate Update single user environment 205 13.7.2 The UNDO/REDO recovery based on immediate update with concurrent execution 206 13.8 Shadow Paging 206 13.9 Backup and Recovery in the Case of Catastrophic Failures 207 13.10 Some Aspects of Database Security and Authorization 207 13.11 Summary 208 Review Questions 209 14. DISTRIBUTED DATABASE 211-218 14.0 Introduction 211 14.0.1 Transaction processing in DDBMS 211 14.1 Data Fragmentation 212 14.1.1 Horizontal fragmentation 212 14.1.2 Vertical fragmentation 214 14.2 Concurrency Control in Distributed Database 216 15. INTRODUCTION TO DATA WAREHOUSING AND DATA MINING 219-234 15.0 Introduction 219 15.1 Concepts of Data Warehousing 220
Contents (xv) 15.1.1 Data warehousing terminology and definitions 220 15.1.2 Characteristics of data warehouses 221 15.1.3 Data modeling for data warehouses 223 15.1.4 How to build a data warehouse 224 15.1.5 Typical functionality of data warehouses 227 15.2 Data Mining 228 15.2.1 The foundations of data mining 229 15.2.2 An overview of data mining technology 229 15.2.3 Profitable applications of data mining 233 15.3 Summary 234 16. INTERNET DATABASES 235-246 16.0 Introduction 235 16.1 The World Wide Web 235 16.2 Introduction to HTML 236 16.3 Databases and the World Wide Web 238 16.4 Architecture 238 16.5 Application Servers and SeRver-Side Java 239 16.6 Beyond HTML-XML 241 16.7 XML-QL: Querying XML Data 242 16.8 Search Engines 243 16.8.1 Search tools and methods 243 16.9 Summary 246 17. EMERGING DATABASE TECHNOLOGIES 247-257 17.0 Introduction 247 17.1 SQL3 Object Model 248 17.2 Mobile Databases 249 17.2.1 Mobile computing architecture 250 17.2.2 Types of data used in mobile computing applications 250 173 Main Memory Databases 251 17.4 Multimedia Databases 252 17.4.1 Multimedia database applications 253 17.5 Geographic Information Systems 254 17.6 Temporal and Sequence Databases 254
(xvi) Contents 17.7 Information visualization 255 17.8 Genome Data Management 255 17.8.1 Biological sciences and genetics 255 17.8.2 The genome database (GDB) 256 17.9 Digital Libraries 256 17.10 Summary 257