Question Bank: Unit – IV : Data Storage & Indexing
1. Describe sequential file organization. Explain how insert and delete operations are performed? 2. Explain multitable clustering file organization. 3. When is it preferable to use a dense index rather than a sparse index? Explain your answer. 4. Compare dense and sparse index with example. 5. With an example, represent storage of variable-length record(s) individually and within a block using slotted-page structure. 6. Write short note on file organization with variable-length records. 7. Write short note on data dictionary storage. 8. Compare and comment on primary index vs secondary index, sparse index vs dense index. 9. Illustrate with example multilevel indexing. Give significance of this technique. 10. Compare static vs dynamic hashing. 11. What are the causes of bucket overflow in a hash file organization? What can be done to reduce the occurrence of bucket overflows? 12. What is the need of dynamic hashing? Illustrate with example extendable hashing. 13. Refer to the table shown in figure. i) Construct bitmap indices on the attributes part-color and price, dividing price values into 2 ranges: below 250, and 250 and above. ii) Consider a query that requests all parts of red color with a price of 250 or more. Outline the steps in answering the query, and show the final and intermediate bitmaps constructed to answer the query. 14. Since indices speed query processing, why might they not be kept on several search keys? List as many reasons as possible. 15. How following query gets processed using i) multiple single key indices and ii) single multiple key index. Select account_number From account Where branch_name = “Perryridge” and balance = 2000 16. Construct a B+-tree for the following set of key values: (2, 3, 5, 7, 11, 17, 19, 23, 29, 31) Assume that the tree is initially empty and values are added in ascending order. Assume number of pointers that will fit in one node is 4. 17. Construct a B+-tree for the following set of key values: (8, 5, 1, 7, 3, 12, 9, 6) Assume that the tree is initially empty and values are added in sequence given. Construct B+-trees for the cases where the number of pointers that will fit in one node is 3. 18. Implement extendable hashing on a file that contains records with following search-key values: 2, 3, 5, 7, 11, 17, 19, 23, 29, 31 Show the extendable hash structure for this file if the hash function is h(x) = x mod 8 and can hold three records. Show all the intermediate steps. 19. Consider the following set of key values to be added in the given order for constructing a B+ tree: (Anil, Sujata, Nitesh, Kalyani, Aarti, Praveen, Beena, Neeta, Kedar) Assume that the tree is initially empty. Construct B+ tree for the case where the number of pointers that fit in one node is 4. 20. Consider search key values and their 8-bit hash indices as shownin Fig. (a). The database relation is given in Fig. (b). Create extendable hash index for given data with respect to search keys. Assume bucket size = 2 i.e. Maximum number of records in a bucket = 2. Show intermediate steps with description.
