Databases Reference
In-Depth Information
3
Optimizing Storage
Structures
In this chapter, we will cover:
F
Avoiding row chaining
F
Avoiding row migration
F
Using LOBs
F
Using index clusters
F
Using hash clusters
F
Indexing the correct way
F
Rebuilding index
F
Compressing indexes
F
Using reverse key indexes
F
Using bitmap indexes
F
Migrating to index organized tables
F
Using partitioning
Introduction
In the previous chapter, we saw how to design an application which performs well (or has
less chance to perform badly) by applying some simple rules of thumb, namely, connection
management, reusable code, reducing requests to the database, schema denormalization,
and the use of dynamic SQL.
