Mul6agribute search keys should be considered when a

Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview:   For each update in the workload: –  –  Which agributes are involved in selec6on/join condi6ons? How selec6ve are these condi6ons likely to be? The type of update (INSERT/DELETE/UPDATE), and the agributes that are affected. Choice of Indexes •  What indexes should we create? –  Which rela6ons should have indexes? What field(s) should be the search key? Should we build several indexes? •  For each index, what kind of an index should it be? –  Clustered? Hash/tree? Choice of Indexes (Contd.) •  One approach: Consider the most important queries in turn. Consider the best plan using the current indexes, and see if a beger plan is possible with an addi6onal index. If so, create it. –  Obviously, this implies that we must understand how a DBMS evaluates queries and creates query evalua6on plans! –  For now, we discuss simple 1 ­table queries. •  Before crea6ng an index, must also consider the impact on updates in the workload! –  Trade ­off: Indexes can make queries go faster, updates slower. Require disk space, too. Index Selec6on Guidelines •  A...
View Full Document

This document was uploaded on 03/12/2014 for the course CSCI 165B at UC Davis.

Ask a homework question - tutors are online