database management system chapter13

Teaching Aid Material

(www.phindia.com/gupta)

Authors invite your valuable feedback and suggestions on the [email protected]

[email protected]

DATABASE MANAGEMENT SYSTEM ORACLE SQL AND PL/SQL

PART III : Advanced Concepts & Technologies

CHAPTER 13

Query ProcessingFile Organization

Distributed Processing



CHAPTER 13Query Processing

1 of 3

Page reference in the book: 321-325


2 of 3

Major components of Query Processing Engine Query Parser Query Optimizer Query Code Generator Run-time Database Processor

Query Processing is supported by System catalogs Database statistics Main database



3 of 3

SELECT C.CNAME, P.PNAME

FROM CUSTOMER C, PRODUCT P, SALE S

WHERE C.CID=S.CID AND P.PID=S.PID AND P.PCOST>10;

Two example plans for the above query are:

Plan (a) Use the indexed/hashed CUSTOMER, PRODUCT and SALE tables. FindPNAME whose cost is greater than 10 and then join the three tables.

Plan (b) Take cross product of tables CUSTOMER, PRODUCT and SALE, which areneither sorted nor hashed. Join rows based on CID and PID and after that selectdisplay CNAME and PNAME based on PCOST greater than 10.

In case of

Plan (a) execution time will be in terms of seconds

Plan (b) execution time will be in terms of minutes


CHAPTER 13File Organization

1 of 17

Sequential Records are stored in sequence based on the primary key value

Indexed Index Part Data Part Dense Index Sparse Index

Page reference in the book: 325 -328


2 of 17

Page reference in the book: 325 -328


3 of 17

Binary TreeNode: Stores the actual data and links to the other nodeParent of a node: Immediate predecessor of a nodeChild: An immediate successor of a parent node Root: Designated node which has no parentLeaf Node: Node which is at the bottom most end and does not have any child Height’ of a tree: Maximum number of nodes in a path starting from the root node to a leaf

nodeDegree’ of a node:Maximum number of children that is possible for a node

A binary tree is empty or consists of a node (called root)together with two binary trees called the left subtree and rightsubtree of the root. A binary tree is a full binary tree if itcontains the maximum possible number of nodes at all levels.



4 of 17



5 of 17



6 of 17



7 of 17



8 of 17



9 of 17



10 of 17

Hashing

Provides key-to-Address transformation using some function known as hashing function

Types of Hashing:Static Hashing

Dynamic Hashing



11 of 17

Static Hashing



12 of 17

Static Hashing



13 of 17

Dynamic Hashing



14 of 17

Dynamic Hashing



15 of 17

Dynamic Hashing



16 of 17

Dynamic Hashing



17 of 17

Dynamic Hashing


CHAPTER 13Distributed Processing

1 of 5

Client/Server Architecture (or Two-Tier Arch)

Client program initiates communication and

server program cater the requests

Three-Tier Architecture

Data tier (back-end)

Logic tier (middle tier)

Presentation tier (front tier)



2 of 5

Client/Server Architecture Payroll software running on Oracle database server

Payroll application is developed using Visual Basic software

Three computers are used:

One for database (server side or back-end)

Two for clients (or front-ends)

TCP/IP networking protocol is used to establish the network



3 of 5



4 of 5

Three-tier Architecture

Message BoardOracle database server isused in the data tier (orback-end)

In the logic-tier (or middle-tier) Dot net server is used

In the front-end, InternetExplorer is used



5 of 5


CHAPTER 13Short/Objective Type Questions

1 of 4

Q1. What is the correlation between ‘execution plan’ and ‘queryoptimization’ in query processing?

Q2. Describe optimization technique used in Oracle database server.

Q3. Briefly describe ISAM.

Q4. What is the difference between B+ Tree and B– Tree?

Q5. Illustrates advantages of dynamic hashing over static hashing.

Q6. Describe advantages of two-tier and three-tier architectures.

Q7. Describe ETL, OLTP and OLAP.

Q8. Describe classification and association in data mining with the help ofan example.

Q9. Write two software suitable for middle-tier of 3-tier architecture.

Q10. Elaborate query processing with the help of an appropriate diagram.


2 of 4

Q11. Major component(s) of query processing is/are(a) Query parser(b) Query optimizer(c) Run-time database processor(d) Query file organizer

Q12. In dense index, the number of index record is(a) More than the number of records in the data file(b) Less than the number of records in the data file(c) Equal to the number of records in the data file(d) None of the above

Q13. Index part and data part are related to (a) B+ tree(b) ISAM(c) B– tree(d) Hashing


3 of 4

Q14. B+ tree and B– tree are form of a (a) Binary tree(b) Balanced tree(c) Basic tree(d) Bi-variant tree

Q15. The situation when static hash function generates the same bucket number for several search key values is known as(a) Overflow(b) Underflow(c) Collision(d) Spitting

Q16. Two-tier architecture is known as(a) Web based architecture(b) Client server architecture(c) Multi-tier architecture(d) Master–slave architecture


4 of 4

Q17. Example of presentation tier (or front-tier) in 3-tier is/are(a) Oracle database server(b) Internet explorer(c) Mozila firefox(d) Visual basic

Q18. Primary job ETL is/are(a) Finding interesting patterns(b) Moving data from source to destination repositories(c) Online transaction processing(d) Online analytical processing

Q19. Keyword related to data mining is/are(a) Extraction of non-trivial information(b) Data preprocessing(c) Online analytical processing(d) Revealing unexpected information

CHAPTER 13Home Assignment

WORKOUT SECTION

Periods Proposed – 12 to 18



Chapter 13Query Processing, File Organization & Distributed Processing

2-3 Periods [Theory]

Chapter 14Transaction Processing, Concurrency Control, Oracle Architecture, Backup & Recovery

2-3 Periods [Theory]

Chapter 15Data Warehousing

2-3 Period [Theory]

Chapter 16Online Analytical Processing and Materialized Views

2-3 Period [Theory]

Chapter 17Data Mining Overview

2-3 Period [Theory]

Chapter 18Data Mining techniques

2-3 Period [Theory]

THE BOOKThe book is organized into three parts to introduce thetheoretical and programming concepts of DBMS. Part I(Basic Concepts and Oracle SQL) deals with DBMS basic,software analysis and design, data flow diagram, ER model,relational algebra, normal forms, SQL queries, functions,sub‐queries, different types of joins, DCL, DDL, DML, objectconstraints and security in Oracle. Part II (Application UsingOracle PL/SQL) explains PL/SQL basics, functions,procedures, packages, exception handling, triggers, implicit,explicit and advanced cursors using suitable examples. Thispart also covers advanced concepts related to PL/SQL, suchas collection, records, objects, dynamic SQL andperformance tuning. Part III (Advanced Concepts andTechnologies) elaborates on advanced database conceptssuch as query processing, file organization, distributedarchitecture, backup, recovery, data warehousing, onlineanalytical processing and data mining concepts and theirtechniques.

KEY FEATURES Includes about 300 examples to illustrate the concepts. Offers about 400 objective type questions. Provides about 100 challenging workouts.

TEACHING AID MATERIALTeaching Aid Material for all the chapters is provided on thewebsite of PHI Learning. Visit www.phindia.com/gupta toexplore the contents.

Visit PHI Learning Center www.phindia.com/gupta and Click on Instructor Resources toaccess Teaching Aid Material for all the 18 chapters of the book.

database management system chapter13

Education

tierpage reference

usedpage reference

networkpage reference

static hashingpage reference

distributed processing

terms of minutespage

root node

query optimization