Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


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?

Answers were Sorted based on User's Feedback



I have a table with 1 million records out of which 10,000 records are of unique records, then if I w..

Answer / thanjairajan@gmail.com

You Can use Bitmap Index. Because while no.of unique record is small than no.of total record, we can use bitmap index. i.e we can use bitmap index in low cardinality column.

For example a table contain name,address,sex column. in sex column may be two values. i.e male and female. so this distinct values small but no.of total records is high.

So in this situation we can use bitmap index.

Is This Answer Correct ?    9 Yes 0 No

I have a table with 1 million records out of which 10,000 records are of unique records, then if I w..

Answer / 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

More SQL PLSQL Interview Questions

What is cursor status?

0 Answers  


how do you know the version of your mysql server? : Sql dba

0 Answers  


Can you alter start with clause?

1 Answers   TCS,


Is sql a microsoft product?

0 Answers  


Which is faster joins or subqueries?

0 Answers  


How to display the contents of a current record fetched in a reference cursor?

2 Answers  


What are records give examples?

0 Answers  


Write the command to remove all players named sachin from the players table.

0 Answers  


What are two virtual tables available during database trigger execution ?

2 Answers  


Do prepared statements prevent sql injection?

0 Answers  


what is cursor and its type, what is ref cursor write a syntax to pass ref cursor into procedure out fucntion and call the procedure

0 Answers  


Can we create foreign key without primary key?

0 Answers  


Categories