0% found this document useful (0 votes)
108 views

End Semester Examination, 2014-15

This document is the question paper for an end semester examination for an M. Tech course in Computer Science Engineering. The paper covers topics related to advanced database management systems including distributed databases, query processing and optimization, object relational databases, transaction management, and schema evolution. It contains 6 sections with a total of 7 questions. Students are required to attempt questions from each section, with some having multiple parts. The document provides the structure and scope of the exam, focusing on key advanced database concepts.

Uploaded by

kfrahman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
108 views

End Semester Examination, 2014-15

This document is the question paper for an end semester examination for an M. Tech course in Computer Science Engineering. The paper covers topics related to advanced database management systems including distributed databases, query processing and optimization, object relational databases, transaction management, and schema evolution. It contains 6 sections with a total of 7 questions. Students are required to attempt questions from each section, with some having multiple parts. The document provides the structure and scope of the exam, focusing on key advanced database concepts.

Uploaded by

kfrahman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Printed Pages : 3

Paper ID: 3458

Roll Number

END SEMESTER EXAMINATION, 201415


M. Tech. (CSE) Networking 1st Year
CSE 624: Advanced Database Management Systems
Time : 03 Hours

Maximum Marks : 100

Note : 1. Attempt all sections.


2. All questions carry equal marks.

SECTION-A
NOTE: ATTEMPT ANY TWO QUESTIONS.
(5 4 20)

Q.1 Answer all parts of the following:


(i) Explain the difference between simple and composite attributes.
Provide at least one example of each.

(ii)

What are the applications of distributed databases?

(iii) Describe the mechanisms for calculating the computational


inference mechanism that are based on the rule of proof
theoretic mechanism.
(iv) Explain how query tuning helps in database tuning?
(v)

Explain the integrity issues in database design.

[Contd.

(5 4 20)

Q.2 Answer all parts of the following:


(i) Database systems allow the management of extremely large objects

SECTION-B

like video, audio and text documents. Identify the new data types
available to support these requirements.

(ii)

OODB and ORDB are two database systems. Which of them are
considered to provide better protection and inheritance? Justify
which one of them has superior performance.

[Contd.

NOTE: ATTEMPT ANY TWO QUESTIONS.


(2 10 20)

(iv) Define distributed join. Explain its representation in relational


algebra.

Q.4Answer both parts of the following:


(i)
Give an example of join that is not simple equi-join for which
portioned parallelism can be used. What attributes should be used
for partitioning?
(ii)
Explain, how a dimensional model differs from Entity Relationship
(ER) model.

(v)

Q.5

(iii) What do you mean by Correlated subquery? What do you mean


by recursive queries?

How does a DBMS exploit encapsulation in implementing


support for Abstract Data Types (ADTs)?
(5 4 20)

Q.3 Answer all parts of the following:


(i) Discuss the extensions that are needed to query processing
and query optimization to fully support the Object Relational
Database Management Systems (ORDBMS)?
(ii)

Explain multivalued attributes, and provide an example. How are


multivalued attributes indicated in the Chen model? How are
they indicated in the Crow.s Foot model?

(iii) Discuss the various anomalies related to interleaved execution of


transactions with suitable examples
(iv) Explain stratification as a technique to determine whether the
recursive datalog with negation is safe.
(v) Discuss the role of Object Management Group (OMG) in forming
standard in Object Oriented Programming (OOP) technology.

(2 10 20)

Answer

both

parts

of

the

following:

(i) Explain in detail the various approaches of Schema


Evolution.
(ii) W. What do you mean by Correlated subquery? What do you mean
by recursive queries?
Q.6
Answer
both
parts
of
the
following:
(2 10 20)

(i)

Give details of the centralized two-phase commit protocol in a


distributed environment. Outline the algorithms for both
coordinator and participants.

(ii)

Explain the following:


(a) SOAP,
(b) XML DTD,
(c) XQuery.

SECTION-C

Q.7 Explain the following in relation to transaction management in Mobile


Database Systemstransaction scenario, mobile transaction, and the
various mobile transaction models (Kangaroo Transaction, Reporting

(20)

and Co-transactions, Clustering, Semantic-based).


3

You might also like