To optimize the performance of a database by minimizing disk accesses required for queries. | Card: 2 / 30 |
Riddle: I help you find information quickly, stored in sorted order, but I am not the data itself. What am I? | Card: 5 / 30 |
True or False: In Sparse Index, index records appear for every item in the data file. | Card: 7 / 30 |
False. A non-clustered index does not store data in order of the index; it provides pointers to the actual data. | Card: 10 / 30 |
Fill in the blank: The technique of distributing data uniformly across buckets using a function is called ______. | Card: 11 / 30 |
What type of file organization allows records to be stored one after another in a sequential manner? | Card: 15 / 30 |
![]() Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only |
Riddle: I help you organize data like a tree, with branches growing wide, but all my leaves are at the same height. What am I? | Card: 21 / 30 |
It stores multiple records related to the same thing together, reducing search costs. | Card: 24 / 30 |
Fill in the blank: The process of extracting useful information from large datasets is known as ______. | Card: 27 / 30 |
Which operation in a B-tree involves rearranging children when a key is deleted? | Card: 29 / 30 |






