i have a question here...
As of my knowledge, when we apply an index (b-tree)on a column, internally it arranges the data in b-tree format and do the fetching process correspondingly...
and my quetion is...
How a bit-map index arranges the data internally when applied on a column?IS it in b-tree format or whatelse?
No Answer is Posted For this Question
Be the First to Post Answer
How to synchronize 2 schema's objects?
Difference between cartesian join and cross join?
What do you know about normalization? Explain in detail?
How to create a new table by selecting rows from another table?
Do you know about aggregate functions? What is row num function? Can it be used all databases?
1 Answers Bravura Solutions, Cap Gemini,
Why does Oracle not permit the use of PCTUSED with indexes?
What are the factors causing the reparsing of SQL statements in SGA?
What are various joins used while writing SUBQUERIES?
Can an Integrity Constraint be enforced on a table if some existing table data does not satisfy the constraint ?
What is a synonym? What are its various types?
Can objects of the same schema reside in different tablespace?
What is DTS and purpose of DTS ?