Consider A Grid File In Which We Wish To Avoid Overflow Buckets For Performance Reasons. In Cases Where An Overflow Bucket Would Be Needed, We Instead Reorganize The Grid File. Present An Algorithm For Such A Reorganization?

Why Is A Hash Structure Not The Best Choice For A Search Key On Which Range Queries Are Likely?

What Are The Causes Of Bucket Overflow In A Hash File Organization? What Can Be Done To Reduce The Occurrence Of Bucket Overflows?

Explain The Distinction Between Closed And Open Hashing. Discuss The Relative Merits Of Each Technique In Database Applications?

Is It Possible In General To Have Two Primary Indices On The Same Relation For Different Search Keys?

What Is The Difference Between A Primary Index And A Secondary Index?

Since Indices Speed Query Processing, Why Might They Not Be Kept On Several Search Keys?

When Is It Preferable To Use A Dense Index Rather Than A Sparse Index?

Define The Term Dangling Pointer. Describe How The Unique-id Scheme Helps In Detecting Dangling Pointers In An Object-oriented Database?

If Physical Oids Are Used, An Object Can Be Relocated By Keeping A Forwarding Pointer To Its New Location. In Case An Object Gets Forwarded Multiple Times, What Would Be The Effect On Retrieval Speed? Suggest A Technique To Avoid Multiple Accesses In Such A Case?