Data Mgmt Lab_Part_27 - Overview of Storage and Indexing 79...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Overview of Storage and Indexing 79 2. Heap file would be the best fit in this situation. 3. Using this particular field as the search key, choosing a hash indexed file would be the best. Exercise 8.10 Consider the following relation: Emp( eid: integer , sal: integer , age: real , did: integer ) There is a clustered index on eid and an unclustered index on age . 1. How would you use the indexes to enforce the constraint that eid is a key? 2. Give an example of an update that is definitely speeded up because of the available indexes. (English description is sufficient.) 3. Give an example of an update that is definitely slowed down because of the indexes. (English description is sufficient.) 4. Can you give an example of an update that is neither speeded up nor slowed down by the indexes? Answer 8.10 Answer omitted. Exercise 8.11 Consider the following relations: Emp( eid: integer , ename: varchar , sal: integer , age: integer , did: integer ) Dept( did: integer , budget: integer , floor: integer , mgr eid: integer ) Salaries range from $10,000 to $100,000, ages vary from 20 to 80, each department has...
View Full Document

This note was uploaded on 01/17/2012 for the course EGN 4302 taught by Professor Dr.vishak during the Fall '12 term at University of Central Florida.

Page1 / 3

Data Mgmt Lab_Part_27 - Overview of Storage and Indexing 79...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online