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.
Answer to relevant QuestionsDefine the term dangling pointer. Describe how the unique-id scheme helps in detecting dangling pointers in an object-oriented database.Is it possible in general to have two primary indices on the same relation for different search keys? Explain your answer. What are the causes of bucket overflow in a hash file organization? What can be done to reduce the occurrence of bucket overflows?Show how to compute existence bitmaps from other bitmaps. Make sure that your technique works even in the presence of null values, by using a bitmap for the value null.Estimate the number of block accesses required by your solution to Exercise for r1 Θ r2, where r1 and r2 are as defined in Exercise.
Post your question