Bitmap indexes are most suitable for columns having very few unique values (very low cardinality). This is best for multiple combination of low to medium cardinality columns.
B-tree indexes are appropriate for medium to high cardinality columns having many distinct values.
Bitmap indexes are more advantageous than btree when the table has million of rows and the key column has low cardinality. bitmap indexes provide better performance than b tree indexes when queries often use a combination of multiple where conditions involving the OR operator, the table is read-only, or when there is low update activity on the key columns.
Popular Posts
-
How to create Matrix report / Pivot Report using Oracle BI Publisher Step by step instruction: 1. Make data model using Oracle Reports Dev...
-
Installation Steps: 1. First create a folder named app_server in any directory 2. go to the software to install and double click install...
-
A lot of differences this is my take on them: 8i -> 9i - Real Application Clusters, PL/SQL enhancements, XMLType enhancem...
-
Oracle 10g New Features: Flashback and RMAN Flashback Database - This feature introduces the FLASHBACK DATABASE statement in SQL. I...
-
ORACLE BI PUBLISHER A. Please learn the steps of creating Matrix report from previous video B. Now we will discuss about Position, Sorting...
-
TO DECLARE/SET A VARIABLE VALUE: ------------------------------- <?xdoxslt:set_variable($_XDOCTX, 'variable name', value)?> ...
-
A. Download and install VirtualBox There are possibilities of different versions based on your Operating System. Here we worked with Virtu...
Blog Archive
Labels
- (APEX) 5.0 (1)
- answer (1)
- Application Express (1)
- aprosoft (1)
- data type in MYSQL (1)
- data type MSSQL (1)
- datatype in ORACLE (1)
- datatype in POSTGRESQL (1)
- dynamic views (1)
- Eplislon (1)
- Exam (1)
- ferite (1)
- Installation (1)
- Interview (2)
- oracle (4)
- oracle erp (1)
- php (1)
- PL/SQL (1)
- plsql (1)
- Question (1)
- Questions (1)
- windows 8 (1)
Pages All
Members
PageRank#
Search This Blog
True statement regarding space management is:
In a locally managed tablespace free space are managed by bitmap
Coalescing of free space is not required in a locally managed tablespace
n.b.: Coalescing free space is not necessary for locally managed tablespaces, because bitmaps automatically track adjacent free space.
But free space in a dictionary managed tablespace can become fragmented, making it difficult to allocate new extents. For this way coalescing of free space is needed in a dictionary managed tablespace.
SQL > ALTER TABLESPACE tabsp_4 COALESCE;
Coalescing operation reduces one of the index partitions, which are partitioned using hash method. This method redistributes the index entries of an indexed partition.
SQL > ALTER INDEX parts1_hgidx COALESCE PARTITION PARALLEL