A Btree index sorts the keys into a binary tree and stores these keys together with the table’s ROWIDs. Btree indexes are the default index type, can be unique or non-unique, and are appropriate for medium- to high-cardinality columns—those having many distinct values.
Btree-Index , 将keys值排序形成二叉树,存储这些keys值及 table ROWID。一般原则是:按照keys值来排序,如果是非唯一的列值,相同的两个key按照rowid来排序,存储。
所有index葉子節點存有信息 key , rowid , rowid是為了select 時候能快速定位block .
来自 “ ITPUB博客 ” ,链接:http://blog.itpub.net/35489/viewspace-84886/,如需转载,请注明出处,否则将追究法律责任。