mathfox 发表于 2013-1-29 22:54:46

I/O cost of table accesses based on index range scans


[*]http://dl.iteye.com/upload/attachment/257584/e6048d89-20b4-309c-9a8c-4f35853f68ac.pngAccess the root block of the index.
[*]Go through the branch blocks to locate the leaf block containing the first keys.
[*]For each key fulfilling the search criteria, do the following:
          Extract the rowid referencing the data block.
          Access the data block referenced by the rowid.
页: [1]
查看完整版本: I/O cost of table accesses based on index range scans