B-Tree Indexes Bitmap Indexes
(1)Suitable for high-cardinality Suitable for low-cardinality
columns columns
(2)Updates on keys relatively Updates to key columns very inexpensive expensive
(3)Inefficient for queries using Efficient for queries using
AND/OR predicates AND/OR predicates
(4)Row-level locking Bitmap segment-level locking
(5)More storage Less storage
(6)Useful for OLTP Useful for DSS
来自 “ ITPUB博客 ” ，链接：https://blog.itpub.net/594655/viewspace-973880/ ，如需转载，请注明出处，否则将追究法律责任。
-
博文量5
-
访问量5204
