Database Reference
In-Depth Information
J. Absolute addresses in linked lists provide faster data retrieval than
relative addresses.
2. You are the database administrator in the database project for a department
store. Name any six relational tables that will be part of the logical design.
Describe how you will allocate storage for these tables and how you will assign
the data to physical files.
3. Explain how you can improve data access performance by adjusting block
sizes and block usage parameters.
4. What is hash or direct file organization? How are the records organized in the
file? Explain the problem of collisions in this method of file organization and
describe how collisions are resolved.
5. What is bitmapped indexing? When is it effective? Show, with a simple
example, how bitmapped indexes speed up data access.
Search WWH ::
Custom Search