INTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad -500 043 Computer cience and Engineering COURE INFORMATION HEET Course Title Course Code Programme DATABAE MANAGEMENT YTEM AC005 B. Tech emester Course Type Regulation IV Core IARE - R16 Course tructure Lectures Tutorials Practicals Credits Course Coordinator Course Faculty I. COURE OVERVIEW: 3 1-4 Ms. E Uma shankari, Assistant Professor Dr. M Madhu Bala, Professor Dr. K uvarchala, Professor Mr. P Anjaiah, Assistant Professor This course introduces the core principles and techniques required in the design and implementation of database systems. This introductory application-oriented course covers the relational database systems RDBM - the predominant system for business, scientific and engineering applications at present. It includes Entity-Relational model, Normalization, Relational model, Relational algebra, and data access queries as well as an introduction to QL. It also covers essential DBM concepts such as: Transaction Processing, Concurrency Control and Recovery. It also provides students with theoretical knowledge and practical skills in the use of databases and database management systems in information technology applications. II. COURE PRE-REQUIITE: Level Course Code emester Prerequisites Credits UG AC002 II Data tructures 4 III. MARK DITRIBUTION ubject EE Examination CIA Examination Total Marks Database Management ystems 70 Marks 30 Marks 100 emester End Examination (EE): The EE is conducted for 70 marks of 3 hours duration. The syllabus for the theory courses is divided into FIVE units and each unit carries equal weightage in terms of marks distribution. The question paper pattern is as follows: two full questions with either or choice will be drawn from each unit. Each question carries 14 marks. Continuous Internal Assessment (CIA): CIA is conducted for a total of 30 marks, with 25 marks for Continuous Internal Examination (CIE) and 05 marks for Quiz / Alternative Assessment Tool (AAT). Page 1
Continuous Internal Examination (CIE): The CIE exam is conducted for 25 marks of 2 hours duration consisting of two parts. Part A shall have five compulsory questions of one mark each. In part B, four out of five questions have to be answered where, each question carries 5 marks. Marks are awarded by taking average of marks scored in two CIE exams. Quiz / Alternative Assessment Tool (AAT): Two Quiz exams shall be online examination consisting of 20 multiple choice questions and are be answered by choosing the correct answer from a given set of choices (commonly four). Marks shall be awarded considering the average of two quizzes for every course. The AAT may include seminars, assignments, term paper, open ended experiments, micro projects, five minutes video and MOOCs. IV. DELIVERY / INTRUCTIONAL METHODOLOGIE: CHALK & TALK QUIZ AIGNMENT MOOCs LCD / PPT EMINAR MINI PROJECT VIDEO OPEN ENDED EXPERIMENT V. AEMENT METHODOLOGIE DIRECT CIE EXAM EE EXAM AIGNEMNT EMINAR LABORATORY TUDENT PRACTICE VIVA MINI PROJECT CERTIFICATION TERM PAPER VI. AEMENT METHODOLOGIE INDIRECT AEMENT OF COURE TUDENT FEEDBACK ON FACULTY OUTCOME (BY FEEDBACK, ONCE) (TWICE) AEMENT OF MINI PROJECT BY EXPERT VII. COURE OBJECTIVE: The course should enable the students to: I. Discuss the basic database concepts, applications, data models, schemas and instances. II. Design Entity Relationship model for a database. III. Demonstrate the use of constraints and relational algebra operations. IV. Describe the basics of QL and construct queries using QL. V. Understand the importance of normalization in databases. VIII. COURE LEARNING OUTCOME: tudents, who complete the course, will have demonstrated the ability to do the following:. No Description AC005.01 Differentiate database systems from file systems by enumerating the features provided by database systems and describe each in both function and benefit. AC005.02 Define the terminology, features, classifications, and characteristics embodied in database systems. AC005.03 Analyze an information storage problem and derive an information model expressed in the form of an entity relation diagram and other optional analysis forms, such as a data dictionary. AC005.04 Demonstrate an understanding of the relational data model. Page 2 AC005.05 Transform an information model into a relational database schema and to use a data definition language and/or utilities to implement the schema using a DBM.
AC005.06 AC005.07 AC005.08 AC005.09 AC005.10 AC005.11 AC005.12 AC005.13 AC005.14 AC005.15 AC005.16 Formulate, using relational algebra, solutions to a broad range of query problems. Understand the QL data definition and QL query languages and formulate solutions to a broad range of query and data update problems. Understand normalization theory and criticize a database design and improve the design by normalization. Declare and enforce integrity constraints on a database using a state-of-the-art RDBM Use an QL interface of a multi-user relational DBM package to create, secure, populate, maintain, and query a database. Programming PL/QL including stored procedures, stored functions, cursors, packages. Analyze techniques for transaction processing, concurrency control, backup and recovery that maintain data integrity in database systems. Implement transactions, concurrency control, and be able to do Database recovery and Query optimization. Use a desktop database package to create, populate, maintain, and query a database. Familiar with basic database storage structures and access techniques: file and page organizations, indexing methods including B+ tree, and hashing. Possess the knowledge and skills for employability and to succeed in national and international level competitive examinations. IX. HOW PROGRAM OUTCOME ARE AEED: PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9 Program Outcomes Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the solution of complex engineering problems. Problem analysis: Identify, formulate, review research literature, and analyze complex engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences. Design/development of solutions: Design solutions for complex engineering problems and design system components or processes that meet the specified needs with appropriate consideration for the public health and safety, and the cultural, societal, and environmental considerations. Conduct investigations of complex problems: Use research-based knowledge and research methods including design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid conclusions. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including prediction and modeling to complex engineering activities with an understanding of the limitations. The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional engineering practice. Environment and sustainability: Understand the impact of the professional engineering solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable development. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice. Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings. Level H H Proficiency assessed by Lectures and problem solving Lectures and problem solving Assignments/Quiz Exams Open ended experiments Lectures and problem solving N --- N ---. N --- N --- Page 3
PO 10 PO 11 PO 12 Program Outcomes Communication: Communicate effectively on complex engineering activities with the engineering community and with society at large, such as, being able to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions. Project management and finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these to one s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments. Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent and life-long learning in the broadest context of technological change. Level N= None = upportive H = Highly Related Proficiency assessed by eminars / Term Paper / 5 minutes video N --- Certifications IX. PO 1 PO 2 PO 3 HOW PROGRAM PECIFIC OUTCOME ARE AEED: Program pecific Outcomes Professional kills: The ability to research, understand and implement computer programs in the areas related to algorithms, system software, multimedia, web design, big data analytics, and networking for efficient analysis and design of computer-based systems of varying complexity. Problem-olving kills: The ability to apply standard practices and strategies in software project development using open-ended programming environments to deliver a quality product for business success. uccessful Career and Entrepreneurship: The ability to employ modern computer languages, environments, and platforms in creating innovative career paths, to be an entrepreneur, and a zest for higher studies. N - None - upportive H - Highly Related Level H H Proficiency assessed by Lectures, Assignments/Quiz eminars / Term Paper / 5 minutes video Guest Lectures X. YLLABU: UNIT-I CONCEPTUAL MODELING Introduction to file and database systems: Database system structure, data models, introduction to network and hierarchical models, ER model, relational model. UNIT-II RELATIONAL APPROACH Relational algebra and calculus: Relational algebra, selection and projection, set operations, renaming, joins, division, examples of algebra queries, relational calculus, tuple relational calculus, domain relational calculus, expressive power of algebra and calculus. UNIT-III BAIC QL QUERY QL data definition; Queries in QL: updates, views, integrity and security, relational database design. Functional dependencies and normalization for relational databases up to five normal forms. UNIT-IV TRANACTION MANAGEMENT Transaction processing: Introduction, need for concurrency control, desirable properties of transaction, schedule and recoverability, serializability and schedules, concurrency control; Types of Page 4
locks: Two phases locking, deadlock, time stamp based concurrency control, recovery techniques, concepts, immediate update, deferred update, shadow paging. UNIT-V DATA TORAGE AND QUERY PROCEING Record storage and primary file organization, secondary storage devices, operations on files, heap File, sorted files, hashing techniques, and index structures for files; Different types of indexes, B tree, B+ tree, query processing. Text books: 1. Abraham ilberschatz, Henry F. Korth,. udarshan, "Database ystem Concepts", McGraw- Hill, 4 th Edition, 2002. References: 1. Ramez Elmasri, hamkant B. Navathe, "Fundamental Database ystems", Pearson Education, 3 rd Edition, 2003. 2. Raghu Ramakrishnan, "Database Management ystem", Tata McGraw-Hill Publishing Company, 3 rd Edition, 2003. 3. Hector Garcia Molina, Jeffrey D. Ullman, Jennifer Widom, "Database ystem Implementation", Pearson Education, United tates 1 st Edition, 2000. 4. Peter Rob, Corlos Coronel, "Database ystem, Design, Implementation and Management", Thompson Learning Course Technology, 5 th Edition, 2003. XII. COURE PLAN: Lecture No. Course Learning Outcomes Topics to be covered Reference 1-3 Understand the basic concepts of databases and different type s of data models, languages Introduction, Data base ystem Applications, T2: 1.1, 1.2 Purpose of data base ystems. View of Data Data Abstraction, Instances and T2: 1.3 chemas Data Models T2: 1.4 Database Languages DDL DML Database T2: 1.5 Access for applications Programs 4-6 Describe overall architecture of DBM Transaction Management, Data torage and T2: 1.7, 1.8.1 Querying Database architecture T2: 1.8 Database users and administrators, History of T2:1.6, 1.10 database systems Introduction to database design, ER Diagrams T1: 2.1 Beyond ER design 7-9 Identify the entities and relationships and demonstrate Entities, Attributes and entity sets, Relationships T1: 2.2, 2.3 and relationship sets the features of ER model Additional features of ER model T1: 2.4 Conceptual design with ER model, Conceptual T1: 2.5, 2.6 design for large enterprises, 10-13 Apply integrity constraints Relational Model: Introduction to the Relational T1: 3.1, 3.2 Model Integrity Constraint Over relations Enforcing Integrity constraints Querying T1:3.3-3.5 relational data Logical data base Design Introduction to Views Destroying /altering T1:3.6, 3.7 Tables and Views 14-16 Analyze and solve database problems using relational Relational Algebra and Calculus: Relational T1: 4.1, 4.2.1 Algebra election and projection algebra, relational calculus set operations renaming, Joins Division T1: 4.2.2-4.2.5 17-23 Analyze and solve database Relational calculus Tuple relational Calculus T1:4.3, 4.4 Page 5
problems using QL 24-25 Discuss basic concepts of schema refinement Domain relational calculus Expressive Power of Algebra and calculus. Form of Basic QL Query Examples of Basic T1: 5.2 QL Queries Introduction to Nested Queries Correlated T1: 5.4 Nested Queries et Comparison Operators Aggregative Operators T1: 5.4.3, 5.5 NULL values Comparison using Null values, T1: 5.6 Logical connectivity s AND, OR and NOT Disallowing NULL values Complex Integrity T1: 5.7, 5.8 Constraints in QL,Triggers and Active Data bases Introduction to chema refinement Problems T1: 19.1 Caused by redundancy Decompositions Problem related to T1:19.1.3 decomposition Functional dependencies, reasoning about FD T1: 19.4 FIRT, ECOND Normal forms THIRD Normal forms BCNF,Properties of T1:19.4, 19.5 decompositions, 26-33 Define and Apply the normal forms Lossless join Decomposition preserving Decomposition Dependency T1: 19.5 chema refinement in Data base Design Multi T1: 19.7, 19.8.1 valued Dependencies Forth Normal Form,Join dependencies,fifth T1: 19.8.2 - Normal Form,Inclusion Dependencies 19.8.5 34-39 Understand the basic concepts of transaction and ACID properties olve problems of Concurrent Execution and Implement ACID properties Transaction Management: Transaction Concept-Transaction tate- T2: 15.1, 15.2 Implementation of atomicity and Durability, T2: 15.3 Concurrent Executions, erializability, T2: 15.4-15.6 Recoverability, Implementation of Isolation, Testing for T2: 15.7, 15.9 erializability. 40-42 Describe the Concurrency control protocols Concurrency Control: Lock-Based Protocols time T2: 16.1, 16.2 tamp Based Protocols- Validation Based Protocols-Multiple Granularity. T2: 16.3, 16.4 43-48 Understand storage structure, recovery process Recovery ystem-failure Classification-storage T2: 17.1, 17.2 tructure recovery and Atomicity-Log Based Recovery- T2: 17.3, 17.4 Recovery with Concurrent Transactions- T2: 17.6 Buffer Management-Failure with loss of Non T2: 17.7, 17.8 Volatile torage Advance Recovery ystems-remote Backup T2: 17.9, 17.10 ystems Page 6
49-51 52-53 Understand the basic concepts of file organization Differentiate Index data structures and File Organizations Overview of torage and Indexing: Data on T1: 8.1 External torage File Organization and Indexing Cluster Indexes, T1: 8.2 Primary and econdary Indexes Index data tructures Hash Based Indexing T1: 8.3.1 Tree base Indexing Comparison of File T1: 8.3.2, 8.4 Organizations 54-56 Apply Indexes,IAM on trees 57-58 59-60 Discuss Dynamic Index tructures and apply different operations Differentiate tatic and Dynamic hashing techniques Tree tructured Indexing: Intuitions for tree T1: 10.1 Indexes Indexed equential Access Methods (IAM) T1: 10.2 B+ Trees: A Dynamic Index tructure-earch, T1: 10.3-10.6 insert, Delete Hash Based Indexing: tatic Hashing Extendable T1: 11.1, 11.2 hashing Linear Hashing Extendable vs. Liner hashing T1: 11.3, 11.4 XIII. GAP IN THE YLLABU - TO MEET INDUTRY / PROFEION REQUIREMENT: NO DECRIPTION PROPOED ACTION RELEVANCE WITH POs RELEVANCE WITH POs 1 Relational calculus, Tuple relational Calculus, Domain relational calculus, Expressive Power of Algebra and calculus. eminars / Guest Lectures / NPTEL PO 1, PO 2, PO 3 PO 1 2 B+Trees,Hash based indexing and linear hashing techniques. 3 Encourage students to write QL Queries and PL/QL programs based on the RDBM Concepts. eminars / Guest Lectures / NPTEL Assignments / Laboratory Practices PO 2, PO 5 PO 3 PO 1, PO 3, PO 4 PO 2 XIV. MAPPING COURE OBJECTIVE LEADING TO THE ACHIEVEMENT OF PROGRAM OUTCOME AND PROGRAM PECIFIC OUTCOME: Course Objectives I Program Outcomes Program pecific Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PO1 PO2 PO3 II H III H H IV H H H V H = upportive H = Highly Related Page 7
XV. MAPPING COURE LEARNINIG OUTCOME LEADING TO THE ACHIEVEMENT OF PROGRAM OUTCOME AND PROGRAM PECIFIC OUTCOME: Course Learninig Outcomes Program Outcomes Program pecific Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PO1 PO2 PO3 AC005.01 AC005.02 AC005.03 H AC005.04 H H AC005.05 H H AC005.06 AC005.07 AC005.08 AC005.09 H AC005.10 AC005.11 H AC005.12 AC005.13 AC005.14 AC005.15 H AC005.16 H = upportive H = Highly Related XVI. DEIGN BAED PROBLEM (DP) / OPEN ENDED PROBLEM: 1. A university database contains information about professors (identified by social security number, or N) and courses (identified by courseid). Professors teach courses; each of the following situations concerns the Teaches relationship set. For each situation, draw an ER diagram that describes it (assuming no further constraints hold). 2. Create a Relational Model for Banking Database Application. 3. uppose that we have a ternary relationship R between entity sets A,B, and C such that A has a key constraint and total participation and B has a key constraint; these are the only constraints. A has attributes a1 and a2, with a1 being the key; B and C are similar. R has no descriptive attributes. Write QL statements that create tables corresponding to this information so as to capture as many of the constraints as possible 4. Consider the following relation: Emp(eid: integer, sal: integer, age: real, did: integer) There is a clustered index on eid and an unclustered index on age. Page 8 1. How would you use the indexes to enforce the constraint that eid is a key? 2. Give an example of an update that is definitely speeded up because of the available indexes.
3. Give an example of an update that is definitely slowed down because of the indexes. 4. Can you give an example of an update that is neither speeded up nor slowed down by the indexes? Prepared By: Ms. E Uma shankari, Assistant Professor, CE HOD, CE Page 9