3. @dez_blanchfield
Database Performance Through Big Iron
DB performance can be improved with
•High performance server hardware
•Appropriately tuned Operating Systems
•Fast multi-core multi-threading CPU’s
•Having plenty of high speed RAM
•High throughput multi-bus backplanes
•High speed caching HDD’s & Storage Arrays
•Low latency networking & interconnects
•Clustering of database infrastructure
11. @dez_blanchfield
Overview of Common Database Indexing
• Linear “unordered” .. n
– average search time = (n+1)/2
– average search time = n
• Binary “sorted” .. (n/2)+1
– average search time = log2(n)-1
– average search time = log2(n)
• B-Tree
– most common, allows logarithmic
selections, insertions, and deletions
• Bitmap
– store rowids associated with a key
value as a bitmap
• Hash
– large objects / blobs
– deals with equality but not inequality
• Clustered & Non-Clustered
• Spatial, Filtered, XML & Full Text