oracle Index Unique Range Bitmap

Index Unique Scan唯一索引(B-tree)

Index unique scan is one of the most efficient ways of accessing data. This access method is used for returning the data from B-tree indexes. The optimizer chooses a unique scan when all columns of a unique (B-tree) index are specified with equality conditions.

Index Range Scan 范围(升序 相同值根据ROWID升)

Index range scan is a common operation for accessing selective data. It can be bounded (bounded on both sides) or unbounded (on one or both sides). Data is returned in the ascending order of index columns. Multiple rows with identical values are sorted (in ascending order) by the ROWIDs.

Bitmap Indexes(节省空间；不适合修改多的事务操作；不适合范围条件的查询，适合相等条件的查询;适用类型手机号;可以有NULL值跟其他索引不一样)

The purpose of an index is to provide pointers to the rows in a table that contain a given key value. In a regular index, this is achieved by storing a list of rowids for each key corresponding to the rows with that key value. Oracle stores each key value repeatedly with each stored rowid. In a bitmap index, a bitmap for each key value is used instead of a list of rowids.




 




http://docs.oracle.com/cd/B19306_01/server.102/b14220/schema.htm#sthref984




两篇还不错的文章：
http://blog.csdn.net/robinson1988/article/details/4980611

http://www.cnblogs.com/tracy/archive/2011/09/02/2163462.html