This document discusses database performance and indexing. It notes that database performance can be improved through high performance server hardware, optimized operating systems, fast CPUs, plenty of RAM, high throughput backplanes, fast storage arrays, low latency networking, and clustering. It also discusses different types of databases (SQL, noSQL) and indexing techniques like B-Trees, bitmaps, hashes, clustered vs non-clustered indexes, and spatial, filtered, XML and full text indexes. The document emphasizes that database indexing is a critical tool for improving performance but that even expert DBAs need the right tools to deliver optimal index tuning.

1. @dez_blanchfield
CREATE INDEX Pindex
ON People(LastName)
database indexes are now
a black art and not the
stuff of mere mortals

2. @dez_blanchfield
database performance
by throwing tin at it !!

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

4. @dez_blanchfield
not all databases are created
equal.. there are databases,
and then there are,
“databases” !!

5. @dez_blanchfield
Databases: The Usual Suspects (SQL)

6. @dez_blanchfield
Databases: The Unusual Suspects (noSQL)

7. @dez_blanchfield
Databases: Beyond Super Human DBA’s

8. @dez_blanchfield
database indexing for improved
performance is a standard
industry practice

9. @dez_blanchfield
Explain Indexing Like I’m a 3 Year Old

10. @dez_blanchfield
database admins often consider
indexes to be the single most
critical tool for improving
database performance

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

12. @dez_blanchfield
we’ve long passed a time when
super human database admins
could manually manage database
index performance tuning

13. @dez_blanchfield
Data Servers – Big Iron VS Cloud “XaaS”

14. @dez_blanchfield
even the world’s best dba’s need
to leverage the right tools to
deliver optimum index tuning