Topic: 2013 EMEA
Subtopic: DB2 for z/OS
In every shop the big challenge is performance of queries (access path selection). Fortunately it is quite surprising how little we really need to understand about the optimizer to improve this queries performance by building proper indexes, suiting a particular query.
The presentation will describe two algorithms how to create indexes for Boolean Term (BT) predicate,
The first algorithm is about creating indexes for maximum MATCHCOLS (matching).
The second algorithm is about creating indexes for sort avoidance.
These algorithms will be compared from a performance point of view, and which one to choose, and also will disscuss where to stop with adding columns to index.
Click Here to Download
NOTE: These are only open to members of IDUG. If you are not a member, please CLICK HERE for more information.