CS2029 / CS606 - ADVANCED DATABASE TECHNOLOGY (ADT) - Question bank

Anna University

B.E. / B.Tech. DEGREE EXAMINATION

Sixth Semester

Computer Science Engineering

CS2029 / CS606 - ADVANCED DATABASE TECHNOLOGY

(Regulation 2008)

 

Subject Title: Advanced Database Technology

Subject Code : CS2029 /  CS606

Semester: 6

Year: III

Attachment Type: PDF

Content:  CS2029 / CS606 - ADVANCED DATABASE TECHNOLOGY - Question bank

GET A COPY OF CS2029 / CS606 - ADVANCED DATABASE TECHNOLOGY QUESTION BANK - DOWNLOAD FROM HERE

SAMPLE CONTENT:

UNIT I

2 mark questions

1. What do you mean by cardinality? What are different kinds of cardinalities?

2. What is a primary key?

3. How is E-R data model useful?

4. Define an attribute. What is a key attribute?

5. Define subtype and super type entities?

6. What is DOMAIN? What is domain value?

7. What do you mean by a key? Give the difference between primary key and Candidate key.

8. What is the difference between the strong entity set and weak entity set ?

9. Give example of following relationships:

(i) Many-to-One

(ii) One-to-One

(iii) One-to-Many

(iv) Many-to-Many

10. Define foreign key? How does it play a role in the join operation?

11. What do you mean by Mapping Operation?

12. What do you mean by redundancy? How this can be avoided?

13. What do you mean by Normalization? Why this is useful?

14. Write short notes on transaction processing.

15. Define ACID in transaction processing.

16. Briefly describe lost update problem.

17. Briefly describe inconsistent read problem.

18. Briefly describe phantom phenomena.

19. What are the various types of serializability?

20. What are the four essential conditions for deadlock?

21. List the different types of backup and recovery techniques in Oracle database setup environment.

22. Discuss the reasons for converting SQL queries into relational algebra queries before optimization is done.

23. What is a query execution plan?

24. What is meant by the term heuristic optimization? Discuss the main heuristics that are applied during query optimization.

25. How does a query tree represent a relational algebra expression?

26. What is meant by an execution of a query tree?

27. Discuss the rules for transformation of query trees, and identify when each rule should be applied during optimization.

28. How many different join orders are there for a query that joins 10 relations?

29. What is meant by cost-based query optimization?

30. What is the difference between pipelining and materialization?

31. Discuss the different types of parameters that are used in cost functions. e is this information kept?

32. List the cost functions for the SELECT and JOIN methods.

33. What is meant by semantic query optimization? How does it differ from other query optimization techniques?