Database Management System: An Evolutionary Approach
- Length: 192 pages
- Edition: 1
- Language: English
- Publisher: Chapman and Hall/CRC
- Publication Date: 2022-01-28
- ISBN-10: 0367244934
- ISBN-13: 9780367244934
- Sales Rank: #0 (See Top 100 Books)
Database management system (DBMS) is a collection of programs that enable users to create and maintain a database, it also consists of a collection of interrelated data and a set of programs to access that data. The DBMS is hence a general purpose software system that facilitates the processes of defining, constructing and manipulating databases for various applications.
The primary goal of a DBMS is to provide an environment that is both convenient and efficient to use in retrieving and storing data base information. It is an interface between the user of application programs on one hand and the data base on the other.
The objective of book “Database Management System: An Evolutionary Approach” is to enable learner:
- grasp basic understanding of DBMS, its need and terminologies.
- make a difference between the traditional file based systems and DBMS.
- to code while learn to grasp theory in practical way.
- with plenty of examples and case studies for better understanding.
This book Database Management System: An Evolutionary Approach is intended to give undergraduate and post graduate students a fundamental background in databases management system. The book follows an evolutionary learning approach that emphasize more on the basic concepts and build a strong foundation to learn more advanced topics like normalizations, Normal Forms, PL/SQL, Transactions, concurrency control, etc.
This book also gives the detailed knowledge with a focus on ER diagrams and its reductions in tables, with sufficient amount of SQL codes for more practical understanding.
Cover Half Title Title Page Copyright Page Table of Contents Preface Authors Chapter 1 Database Basics 1.1 INTRODUCTION AND HISTORY OF DATABASES 1.2 DATA AND INFORMATION 1.2.1 Data 1.2.2 Information 1.3 DATABASE 1.4 NEED FOR A DATABASE 1.5 FILE-BASED DATA MANAGEMENT SYSTEM 1.6 DATABASE SYSTEM 1.6.1 Database System Components 1.6.2 DBMS Services 1.7 DATABASE CHARACTERISTICS 1.8 ADVANTAGES OF A DATABASE 1.8.1 Reducing Redundancy 1.8.2 Preventing Unauthorized Access 1.8.3 Faster Data Access 1.8.4 Backup and Recovery 1.8.5 Multiple User Interfaces 1.8.6 Enforcing Integrity Constraints and Support Inferencing/Actions 1.8.7 Persistent Storage 1.8.8 Additional Benefits 1.9 LIMITATIONS OF DATABASES 1.9.1 Increased Cost 1.9.2 Complexity 1.9.3 Performance 1.10 SUMMARY 1.11 REVIEW QUESTIONS REFERENCES Chapter 2 Data Models and Architecture of a DBMS 2.1 EVOLUTION OF DATA MODEL 2.2 HIERARCHICAL DATABASE MODEL 2.2.1 Advantages 2.2.2 Disadvantages 2.3 NETWORK DATA MODEL 2.3.1 Advantages 2.3.2 Disadvantages 2.4 RELATIONAL DATABASE MODEL 2.4.1 Concepts of RDBMS 2.4.2 Advantages 2.4.3 Disadvantages 2.5 OBJECT-ORIENTED DATA MODEL 2.5.1 Advantages 2.5.2 Disadvantages 2.6 OBJECT RELATIONAL DATA MODEL 2.6.1 Advantages 2.6.2 Disadvantages 2.7 THREE-LEVEL ARCHITECTURE OF A DATABASE 2.7.1 Data, Relationships, Constraints, and Schema 2.7.2 Internal Level 2.7.3 Conceptual Level 2.7.4 External Level 2.7.5 Advantages 2.8 DATA INDEPENDENCE 2.8.1 Importance of Database Independence 2.9 DATABASE LANGUAGES 2.10 SUMMARY 2.11 REVIEW QUESTIONS REFERENCES Chapter 3 Relational Database Management System 3.1 DIFFERENCE BETWEEN RDBMS AND DBMS 3.2 FEATURES OF RDBMS 3.3 ADVANTAGES OF RDBMS 3.4 DISADVANTAGES OF RDBMS 3.5 EXAMPLES OF RDBMS 3.5.1 MySQL 3.5.1.1 Limitations for SQL Database 3.5.2 NoSQL 3.5.2.1 Benefits and Scope 3.5.2.2 Disadvantage and Limitations 3.5.3 PostgreSQL 3.5.4 Microsoft SQL Server 3.6 RDBMS TERMINOLOGIES 3.7 KEYS IN DATABASE 3.7.1 Super Keys 3.7.2 Candidate Keys 3.7.3 Primary Keys 3.7.4 Composite Keys 3.7.5 Secondary or Alternative Key 3.7.6 Foreign Keys 3.7.7 Difference between Primary Key, Candidate Key, Super Key, and Foreign Key 3.8 INTEGRITY CONSTRAINTS IN DBMS 3.8.1 Integrity Constraints 3.8.1.1 Entity Integrity Constraints 3.8.1.2 Referential Integrity Constraints 3.8.1.3 Domain Constraints 3.8.1.4 Not Null Constraint 3.8.1.5 Default Value Constraint 3.8.1.6 Check Clause 3.9 RELATIONAL ALGEBRA 3.9.1 Unary Operators 3.9.2 Binary Operators 3.9.2.1 SELECT Operator 3.9.2.2 PROJECT Operator 3.9.2.3 Union Operation 3.9.2.4 Set Difference 3.9.2.5 Cartesian Product(X) 3.9.2.6 Join Operations 3.9.3 Left Outer Join 3.9.4 Right Outer Join 3.9.5 Full Outer Join 3.10 STRUCTURED QUERY LANGUAGE (SQL) 3.10.1 SELECT Statements 3.11 CODD’S 12 RULES OF RELATIONAL DATABASE 3.12 DATABASE DEVELOPMENT LIFE CYCLE 3.12.1 The Database Initial Study 3.12.1.1 Analyze the Scenario 3.12.1.2 Define the Problems and Other Constraints 3.12.1.3 Objectives Scope and Boundaries 3.12.2 Database Design 3.12.3 Implementation of Databases 3.12.3.1 Install the DBMS 3.12.3.2 Database Creation 3.12.3.3 Populate the Data 3.12.4 Testing and Evaluation 3.12.4.1 Database Test 3.12.4.2 Tuning of Database 3.12.4.3 Database Evaluation 3.12.5 Operation 3.12.6 Maintenance of Database System 3.13 SUMMARY 3.14 REVIEW QUESTIONS REFERENCES Chapter 4 Entity-Relationship Model 4.1 ER DIAGRAM 4.2 COMPONENTS OF AN ER DIAGRAM 4.2.1 Entity Set 4.2.1.1 Weak Entity Set 4.2.1.2 Strong Entity Set 4.2.2 Attributes 4.2.2.1 Key Attribute 4.2.2.2 Composite Attribute 4.2.2.3 Multivalued Attribute 4.2.2.4 Derived Attribute 4.2.3 Relationship 4.2.3.1 One-to-One Relationship 4.2.3.2 One-to-Many Relationship 4.2.3.3 Many-to-One Relationship 4.2.3.4 Many-to-Many Relationship 4.3 PARTICIPATION CONSTRAINTS 4.4 STRONG AND WEAK RELATIONSHIP 4.4.1 Strong Entity Set 4.4.2 Weak Entity 4.5 HANDLING MANY-TO-MANY RELATIONSHIP 4.5.1 Loss of Analytical Capability 4.5.2 Multiple Counting 4.5.2.1 Method 1 4.5.2.2 Method 2 4.5.2.3 Method 3 4.6 EXAMPLE OF ER MODEL 4.6.1 An ER Diagram of an Organization 4.6.1.1 Initial Conceptual Design of the Company Database 4.6.1.2 Relations and Its Structure 4.6.1.3 Tables for Company Database 4.6.1.4 Relationship Types to Database Schema 4.7 ENHANCED ER MODEL 4.7.1 Hierarchies 4.7.2 Properties of IsA Relationship Vehicle 4.7.3 Constraints in ER/EER Diagram 4.7.4 Specialization Abstraction 4.7.5 Generalization Abstraction 4.7.6 Union or Category 4.8 REDUCTION OF ER DIAGRAM TO RELATIONAL MODEL 4.8.1 Regular Table 4.8.2 Attributes for the Table 4.8.3 Key Attribute (Primary Key) 4.8.4 Separate Table for Multivalued Attribute 4.8.5 Derived Attributes 4.8.6 Mapping of Relationships in the Tables 4.8.7 Tables 4.9 SUMMARY 4.10 REVIEW QUESTIONS REFERENCES Chapter 5 Normalization 5.1 INTRODUCTION TO NORMALIZATION – A BOTTOM-UP APPROACH 5.2 NEED FOR NORMALIZATION 5.3 TYPES OF DEPENDENCIES 5.3.1 Trivial FD 5.3.2 Nontrivial FD 5.3.3 Armstrong’s Axioms or Inference Rule of Functional Dependencies 5.4 FIRST NORMAL FORM 5.5 SECOND NORMAL FORM 5.6 THIRD NORMAL FORM 5.7 BOYCE-CODD NORMAL FORM 5.8 MULTI-VALUED DEPENDENCY 5.9 JOIN DEPENDENCY 5.10 LOSSLESS AND LOSSY DECOMPOSITIONS 5.11 NORMALIZING TABLES AND UNSOLVED EXAMPLES WITH CASE STUDIES 5.12 SUMMARY 5.13 REVIEW QUESTIONS REFERENCES Chapter 6 Managing Data Using Structured Query Language 6.1 INTRODUCTION TO STRUCTURED QUERY LANGUAGE 6.1.1 Advantages of SQL 6.1.2 Types of SQL Commands 6.2 DATA DEFINITION COMMANDS 6.3 DML 6.4 DATA CONTROL LANGUAGE 6.4.1 GRANT Command 6.4.2 REVOKE Command 6.5 TRANSACTION CONTROL LANGUAGE (TCL) 6.5.1 COMMIT Command 6.5.2 ROLLBACK Command 6.6 DATA QUERY LANGUAGE (DQL) 6.7 AGGREGATE FUNCTIONS 6.8 DATE AND TIME FUNCTIONS 6.9 STRING FUNCTIONS 6.10 CONVERSION FUNCTIONS 6.11 MATHEMATICAL FUNCTIONS 6.12 SPECIAL OPERATORS 6.13 TYPES OF CONSTRAINTS 6.14 SUBQUERY 6.15 SUMMARY 6.16 REVIEW QUESTIONS REFERENCES Chapter 7 Introduction to PL/SQL 7.1 PL/SQL 7.2 VARIABLES AND CONSTANTS 7.2.1 Constant 7.3 DATA TYPES 7.3.1 PL/SQL Number Types 7.3.2 PL/SQL Character and String Types and PL/SQL National Character Types 7.3.3 “LONG and LONG RAW Datatypes” 7.3.4 PL/SQL Date, Time, and Interval Types 7.3.5 NULLs in PL/SQL 7.4 PL/SQL LITERALS 7.4.1 Example of These Different Types of Literals 7.5 CONTROL STATEMENTS 7.5.1 If Statement 7.5.1.1 IF-THEN Statement 7.5.1.2 IF-THEN-ELSE Statement 7.5.2 Example of PL/SQL If Statement 7.6 PL/SQL CASE STATEMENT 7.6.1 Example of PL/SQL Case Statement 7.7 PL/SQL LOOP 7.7.1 Example of PL/SQL EXIT Loop with WHEN Condition 7.8 PL/SQL EXIT LOOP EXAMPLE WITH IF CONDITION 7.8.1 Example of PL/SQL While Loop 7.8.2 PL/SQL WHILE Loop Example 2 7.8.3 PL/SQL for Loop Example 1 7.8.4 PL/SQL for Loop REVERSE Example 7.9 PL/SQL CONTINUE STATEMENT 7.9.1 Example of PL/SQL Continue Statement 7.10 PL/SQL GOTO STATEMENT 7.10.1 Example of PL/SQL GOTO Statement 7.11 PL/SQL PROCEDURE AND FUNCTIONS 7.11.1 PL/SQL Procedure Syntax and Examples 7.11.1.1 PL/SQL Procedure Example 7.11.2 PL/SQL Function Syntax and Examples 7.11.2.1 PL/SQL Function Example 7.11.2.2 PL/SQL Function Example 3 7.11.2.3 PL/SQL Function Example 4 7.12 PL/SQL CURSOR 7.12.1 PL/SQL Implicit Cursors 7.12.2 PL/SQL Implicit Cursor Example 7.12.3 PL/SQL Explicit Cursors 7.12.3.1 PL/SQL Explicit Cursor Example 7.13 PL/SQL EXCEPTION 7.14 PL/SQL EXCEPTION HANDLING 7.14.1 System-Defined Exception Handling 7.14.2 System-Defined Exceptions 7.14.3 User-Defined Exceptions 7.14.4 Raising Exceptions 7.15 PL/SQL TRIGGER 7.15.1 Trigger Example 7.16 SUMMARY 7.17 REVIEW QUESTIONS Chapter 8 Transaction Management in a Database 8.1 INTRODUCTION 8.2 DEFINITION OF TRANSACTION 8.2.1 Commit 8.2.2 Rollback 8.3 PROPERTIES OF TRANSACTION 8.3.1 Atomicity 8.3.2 Consistency 8.3.3 Isolation 8.3.4 Durability 8.4 STATES OF TRANSACTION 8.4.1 Active State 8.4.2 Partially Committed State 8.4.3 Committed State 8.4.4 Failed State 8.4.5 Aborted State 8.4.6 Terminated State 8.5 SCHEDULE 8.5.1 Types of Schedules 8.5.1.1 Serial Schedule 8.5.1.2 Concurrent Schedule 8.5.1.3 Cascadeless Schedule 8.5.1.4 Recoverable Schedule 8.6 SERIALIZABILITY 8.6.1 Conflict-Serializable Schedule 8.6.2 Precedence Graph Method of Serializability 8.6.3 View-Serializable Schedule 8.7 RECOVERABLE SCHEDULE 8.8 CONCURRENCY CONTROL 8.8.1 Lost Update Problem 8.8.2 Dirty Read Problem 8.8.3 Inconsistent Retrieval or Unrepeatable Read Problem 8.9 CONCURRENCY CONTROL MECHANISM 8.9.1 Lock-Based Protocol 8.9.1.1 Lock-Based Protocols 8.9.1.2 Deadlock Problem with Lock-Based Protocol 8.9.1.3 Two-Phase Locking Protocol 8.9.2 Timestamp-Based Protocol 8.9.2.1 Timestamp Ordering Protocol 8.9.2.2 Basic Timestamp Ordering 8.9.3 Multiple Granularity-Based Protocols 8.9.4 Intention Lock Mode 8.9.5 Multiversion Schemes 8.9.5.1 Multiversion Concurrency Control Techniques 8.9.5.2 Multiversion Techniques Based on Timestamp Ordering 8.10 DATABASE BACKUP AND RECOVERY 8.10.1 Log-Based Recovery 8.10.2 Recovery with Concurrent Transactions 8.10.2.1 Checkpoint 8.10.2.2 Recovery 8.11 SECURITY, INTEGRITY, AND AUTHORIZATION 8.12 SUMMARY 8.13 REVIEW QUESTIONS REFERENCES INDEX
Donate to keep this site alive
1. Disable the AdBlock plugin. Otherwise, you may not get any links.
2. Solve the CAPTCHA.
3. Click download link.
4. Lead to download server to download.