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
What is private procedure oracle?
What exactly do quotation marks around the table name do?
Explain a data segment?
Can Multiple instances be run on Single Machine???
when do u go for hash partitioning?
What is a Garbage Collection? and what is full recursive Garbage collection?
What is a nvl function?
Explain oracle insert into command?
What is meant by raw datatype?
what is the maximum number of indexes i can create for a table? What happens if i create indexes for all the columns of a table? Will it slow down the speed of retrieval
What is oracle database 10g express edition?
how to retrive xml data for using sql query?