Description: Managing Indexes:- B-TREE leafs store lists of rowids. High cardinality Inexpensive key updates Not good for OR queries, Useful in OLTP , Bitmap index leafs store bitmap pointer , Low cardinality (more compact) , Very expensive key updates, Good for OR queries , Better for Data Warehousing