|
Indexes are maintained as the underlying data changes and with binary
radix
tree indexes the tree is always optimized, i.e. it is not necessary to reorganize indexes or keyed logical files.
I'd be curious to see any technical documentation on how the tree is always optimized. It still needs to be a trunk/branch/leaf structure, no? Regardless, a rebuild, preferably as a SQL index, not a DDS logical (see Dan Cruikshank's "iSeries Database Reengineering" PDF) would result in physical storage optimization, and if it's a SQL index would result in 64K pages too -- a real boon to performance, even from HLL IO. -Walden
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.