Optimizing Performance in DB2 Software |
From inside the book
Results 1-3 of 23
Page 9
... clustered . Whether clustered or nonclustered , there can be zero or more indexes pointing to designated fields . The index has three levels : the root page level , the intermediate page level , and the leaf page level . The two top ...
... clustered . Whether clustered or nonclustered , there can be zero or more indexes pointing to designated fields . The index has three levels : the root page level , the intermediate page level , and the leaf page level . The two top ...
Page 37
... clustered data ; ( b ) . Index entries into a clustered table on other than the primary key . optimization of data is possible , even though the data may be sequentially accessed any number of ways . It is a temptation to say that an ...
... clustered data ; ( b ) . Index entries into a clustered table on other than the primary key . optimization of data is possible , even though the data may be sequentially accessed any number of ways . It is a temptation to say that an ...
Page 116
... CLUSTERING ANALYSIS Considered in combination with the consolidation of tables is the issue of whether data should be clustered or not . When the total number of table accesses was calculated , no considerations were given to whether ...
... CLUSTERING ANALYSIS Considered in combination with the consolidation of tables is the issue of whether data should be clustered or not . When the total number of table accesses was calculated , no considerations were given to whether ...
Contents
Conceptual Data Base Design | 19 |
Chapter 3 | 43 |
Examples of Designed and Undesigned Transactions | 52 |
Copyright | |
14 other sections not shown
Common terms and phrases
ACCT activities algorithm American Management Systems amount of data amount of I/O analysis application archival data archival environment balance base table batch processing batch window bill of material buffer bytes clustered COBOL columns created cross-reference table data base design data elements data relationships Database DB2 data deleted denormalization depends encoded end user example execution exist extract Fast Path foreign key I/O required index entry iteration large data base level count locking multiple NEWLIMIT NEWRATE nonkey normal occurrences of data occurs online performance option page2 part-supplier PARTABLE partitions PARTNO DESCR peak-period processing physical data base pointer primary key processor production environment query recursive referential integrity reorganization retrieve scan SELECT PARTNO separate sequential access sequentially shown in Figure simple small data base space SQL program stack stored subassemblies supplier table Suppose technique undesigned transactions update usage utilization VARCHAR variable length fields VSAM