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

Which data type is a composite type?

0 Answers  


Why do we need pl sql?

0 Answers  


What is data control language (dcl)?

0 Answers  


What is a sql profiler?

0 Answers  


What is the difference between UNIQUE CONSTRAINT and PRIMARY KEY? 1. There is no difference. 2. A PRIMARY KEY cannot be declared on multiple columns. 3. A UNIQUE CONSTRAINT cannot be declared on multiple columns. 4. A table can have multiple PRIMARY KEYS but only one UNIQUE CONSTRAINT. 5. A table can have multiple UNIQUE CONSTRAINTs but only one PRIMARY KEY.

7 Answers   Satyam,


What is the difference between functions, procedures, and packages in pl/sql?

0 Answers  


query to retrive the employees whose sal is greater than avg sal

10 Answers   TCS,


How do I start sql profiler?

0 Answers  


Why we use pl sql?

0 Answers  


Which constraints we can use while creating database in sql?

0 Answers  


What is a 'instead of trigger'?

3 Answers   Eenadu, TCS,


Why are sql stored procedures used?

0 Answers  


Categories