دانلود کتاب Concept of Database Management Systems

ContentsUnit 1-INTRODUCTION 1-541.1 Data 11.1.1 Three-layer data architecture 11.2 Information 21.3 Data Warehous 21.4 Data Dictionary 21.5 Records 21.6 Files 31.7 Database 31.8 Database Management System 31.8.1 Application of database system 31.8.2 Functions and services of DBMS 41.8.3 Database vs. file systems 51.8.4 Advantages of file processing system 51.8.5 Disadvantages of files processing system 51.8.6 Advantages of DBMS 61.8.7 Disadvantages of DBMS 81.9 Data Abstraction 91.10 Instances and Schemas 91.11 Data Independence 101.12 Data Models 111.12.1 The entity-relationship model 111.12.2 Relational model 121.12.3 Object-oriented data model 121.12.4 The object-relational data model 131.12.5 Hierarchical model 141.12.6 The network data model 141.13 'JYpes of Database Systems 151.13.1 Centralised database system 151.13.2 Distributed database system 161.13.3 Parallel database system 171.13.4 Client/Server database system 191.14 Database Languages 201.14.1 Data definition language 201.14.2 Data-manipulation language 211.14.3 Data control language 211.14.4 Data query language 221.15 DBMS Interfaces 221.16 Database Users and Administrators1.16.1 Database administrator1.16.2 Database users1.17 Overall Database Structure1.17.1 Storage manager'1.17.2 Querry processor1.18 Fourth-Generation Language (4GL)1.19 Metadata1.19.1 lYpes of metadata1.20 ER-Model Concepts1.20.1 Entity1.20.2 Attributes1.21 Relationships and Relationship Sets1.22 Constraints1.22.1 Mapping cardinalities1.22.2 Participation constraints1.23 Existence Dependency1.24 Keys1.25 Association1.26 Specialization1.27 Generalization1.28 Aggregation1.29 Relationships of Higher Degree1.30 Reduction of an E-R Diagram to Tables1.30.1 Tabular representation of strong entity set1.30.2 Tabular representation of weak entity set1.30.3 Tabular representation of relationship setsSolved ProblemsReview QuestionsUnit 2-RELATIONAL DATA MODEL CONCEPTS2.1 Relational Data Model Concepts2.2 Integrity Constraints2.2.1 Entity integrity2.2.2 Referential integrity2.3 Domain Constraints2.4 Relational Algebra2.4.1 Select operation2.4.2 Project operation2.4.3 Union operation2.4.4 Set-difference operation2.4.5 Cartesian product operation2.4.6 Division operation 602.4.7 Rename operation 612.4.8 Join 612.4.8.1 Natural join 612.4.8.2 Semi join 622.4.8.3 Anti join 622.4.8.4 Outer join 632.4.9 Projection 632.5 Relational Calculas 642.6 The Domain Relational Calculus 652.7 Introduction to SOL 662.7.1 Data types 672.7.2 lYpes of SOL commands 672.7.3 Insertion of Data into Tables 682.7.4 Select command 682.7.5 Elimination of duplicates from the select statement 692.7.6 Sorting data in a table 692.7.7 Creating a table from a table 692.7.8 Inserting data into a table from another table 692.7.9 Delete operations 702.7.10 Update command 702.7.11 Modifying the structure of tables 712.7.12 Renaming command 712.7.13 Destroying table 712.7.14 Logical operators 712.7.15 Range searching 722.7.16 Unique key 732.7.17 Primary key 732.7.18 Foreign key 732.7.19 Aggregate functions 732.7.20 Subqueries 762.7.21 Joins 772.7.22 Union clause 782.7.23 Intereset clause 792.7.24 Minus clause 802.8 Views 822.9 Indexes 822.10 Row Num in SOL Statement 832.11 Sequences 842.12 Cursor 852.13 Database Triggers 862.14 Oracle Packages 872.15 AssertionsSolved ProblemsReview QuestionsUnit 3-DATABASE DESIGN AND NORMALIZATION3.1 Database Design3.2 Decomposition3.3 Universal Relation3.4 Functional Dependency3.5 Prime Attribute3.5.1 Non-prime attribute3:6 Armstrong's Axioms3.7 Closure of Set of Functional Dependencies3.8 Non-Redundant Covers3.9 Canonical Cover or Minimal Set of FD's3.10 Normalization3.10.1 First normal form (INF)3.10.2 Second normal form (2NF)3.10.3 Third normal form (3NF)3.10.4 Boyce-Codd normal form (BCNF)3.10.5 Fourth normal form (4NF)3.10.6 Fifth normal form (5NF)3.10.7 Sixth normal form3.10.8 Domain/key normal form3.10.9 Conclusion of database normalization3.11 Lossless-join DecompositionSolved ProblemsReview Questions.Unit 4-TRANSACTION PROCESSING CONCEPTS4.1 Transaction Concept4.2 Transaction Access Data4.3 Transaction State4.4 Concurrent Excutions4.4.1 Schedules4.5 Serializability4.5.1 Conflict serializability4.5.2 View serializability4.5.3 Testing of serializability4.6 Recoverability4.6.1 Recoverable schedules4.6.2 Cascadclcss schedules4.7 Transaction Recovery 1634.7.1 Failure classification 1644.7.2 Types of transaction recovery 1654.8 Log Based Recovery 1674.9 Check Points 1684.10 Deadlocks 1694.10.1 Deadlock handling 1694.10.1.1 Deadlock prevention 1704.10.1.2 Deadlock detection and recovery 1704.11 Concept of Phantom Deadlock 172Solved Problems 173-177Review Questions 177Unit 5-CONCURRENCY CONTROL TECHNIQUES 180-2145.1 Locking Techniques for Concurrency Control 1805.1.1 Lock 1805.1.2 The two-phase locking protocol 1815.2 Concurency Co';trol Based on Timestamp Protocol 1835.3 Validation (Optimistic)-Based Protocol 1855.4 Multiple Granularity Locking 1865.5 Multi-Version Schemes 1885.6 Multi-Version 1Wo-Phase Locking 1895.7 Recovery with Concurrent Transactions 1905.8 Distributed Database 1905.8.1 Classification of distributed database 1915.8.2 Functions of distributed database 1925.8.3 Advantages of distributed database 1935.8.4 Disadvantages of distributed database 1945.8.5 Architecture of distribtued database 1945.8.6 Distributed database system design 1965.8.7 Transaction processing in distributed system 1975.8.7.1 System structure 1975.8.7.2 System failure modes 1985.8.8 Data fragmentation 1985.8.9 Data replication and allocation 1995.8.10 Data allocation 2005.8.11 Overview of concurrency control 2015.8.12 Distributed recov(!ry 2025.8.13 1Wo-phase commit protocol 2025.8.14 Handling of failures 203Solved Problems 204-213Review Questions 213APPENDIXAppendix A : Lab AssignmentAppendix B : Tick the Appropriate AnswerAppendix C : UPTU Question PaperAppendix D : DBMS Interview Questions and AnswersINDEX