That is, DB2 scans every single leaf page.
也就是说，DB2扫描每一个单一的叶级页。
All paths from the root page to any leaf page traverse the same number of levels.
从根页面到任何叶页面的路径均穿过相同数量的层。
The costs used to find a leaf page depends on the size of the index, the filer of the query, and the uniqueness of the index.
用以读取叶子页面的成本取决于索引的大小、查询的筛选器以及索引的惟一性。
The costs used to find a leaf page depends on the size of the index, the filer of the query, and the uniqueness of the index.
用以读取叶子页面的成本取决于索引的大小、查询的筛选器以及索引的惟一性。
应用推荐