I have a table with 1 million records out of which 10,000 records are of unique records, then if I will implement index, then which type of index shall I use and why shall I use?
- 2 Answers
- 6753 Views
- HSBC, I also Faced
- E-Mail Answers
Answer Posted / mrityunjay singh
Fully indexing a large table with a traditional B-tree index can be prohibitively expensive in terms of disk space because the indexes can be several times larger than the data in the table. Bitmap indexes are typically only a fraction of the size of the indexed data in the table.
An index provides pointers to the rows in a table that contain a given key value. A regular index stores a list of rowids for each key corresponding to the rows with that key value. In a bitmap index, a bitmap for each key value replaces a list of rowids.
Each bit in the bitmap corresponds to a possible rowid, and if the bit is set, it means that the row with the corresponding rowid contains the key value. A mapping function converts the bit position to an actual rowid, so that the bitmap index provides the same functionality as a regular index. Bitmap indexes store the bitmaps in a compressed way. If the number of distinct key values is small, bitmap indexes compress better and the space saving benefit compared to a B-tree index becomes even better.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
what is meant by urlencode and urldocode? : Sql dba
Why we use cross join?
How do you modify a column in sql?
How do temporal tables work?
What are the operators in sql?
How is a process of pl/sql compiled?
Which join condition can be specified using on clause?
What is the use of <> sql?
What is on delete set null?
How are functions and procedures called in PL/SQL?
how many ways we can we find the current date using mysql? : Sql dba
Why join is faster than subquery?
What is varchar used for?
how would concatenate strings in mysql? : Sql dba
Can we create table inside stored procedure?
