DATABASE MANAGEMENT SYSTEMS

UNIT-5

1. Discuss in detail about cluster and Multilevel indexes.

2. Explain in detail about internal hashing Techniques.
3. List out the operations that can be performed on files.
4. When does a collision occur in hashing? Illustrate various collision resolution techniques.
5. Describe different methods of defining indexes on multiple keys.
6. Brief extendible hashing scheme
7. Discuss in detail about primary file organization.
8. Differentiate volatile and non-volatile storage.
9. Write about indexed sequential files with advantages and disadvantages
10. Write short notes on the following topics.
(i) Optical disk. (ii) Magnetic tapes.
11. Define single level and multilevel indexing.
12. Explain how B+ tree eliminate the redundant storage of search key values
13. What are the disadvantages of static hashing?
14. Compare dynamic hashing with static hashing.
15. Explain about hash based indexing with an example.
16. What is dynamic hashing? Give the implementation details of it.
17. Mention various types of records. Describe how they are organized inside a file?
18. What is an index? Explain its role in improving database access.
19. Describe the structure of a node in B-tree .
20. Discuss in detail about different file operations.
21. Explain the concept of B+ trees
22. Distinguish between:
i) Primary and Secondary indexing. ii) Ordered indexing and hashing.

23. Explain in detail about B+ trees.

24. Explain about hash based indexing.
25. Discuss about dynamic index structure.

ASSIGNMENT QUESTIONS
LEVEL-1
1. Mention various types of records. Describe how they are organized inside a file?
2. Explain about hash based indexing.
LEVEL-2
1. Write about indexed sequential files with advantages and disadvantages
2. List out the operations that can be performed on files.
LEVEL-3
1. What is an index? Explain its role in improving database access.
2. Describe the structure of a node in B-tree .