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?

1949

---

What is ad hoc analysis? : bw on hana

104

---

What are the advantages and disadvantages of using stored procedures versus calling sql inline in cold fusion?

1184

---

How to remove the trailing spaces from a string?

1276

---

Which dialog boxes can you use in your android application?

950

---

what is the water cement ratio for plastering

1642

---

What are the software instructions related to stack operations?

1105

---

can any one give one scenario of change request

1014

---

What are the common vsam error conditions and codes?

1084

---

Please let me know the important Interview concepts to be learnt for PO,OM and INV Modules

2664

---

What were the issues which were demonstrated in the G - 8 summits recently and are drawing huge attention?

1030

---

what is a reference variable in C++?

1243

---

Is a job split into maps?

1036

---

what is Identity template in XSL, why do you use it?

942

---

How can we get the number of statements which have caused errors during a script execution?

1

---