Answer / Kapil

Heap is an implementation of B-trees (Balanced Trees) used by databases for organizing data. It stores the rows of a table without any particular order, allowing fast insertion but slow searching compared to sorted indexes.

What is ole db used for?

1 Answers  

---

What are indexes in oracle?

1 Answers   CGI,

---

Explain inner and outer joins with examples.

1 Answers   Agilent,

---

Explain data independence & its types.

1 Answers  

---

can any one explain about normalization forms with clear explanation in interview point of view. thanks for ur answers.

1 Answers  

---

What is difference between data and database?

1 Answers  

---

How to produce such kind of file?

1 Answers   Tech Mahindra,

---

Explain transaction manager?

1 Answers  

---

Does facebook use graph database?

1 Answers  

---

What is relational database with example?

1 Answers  

---

what is data set ?

1 Answers  

---

What is the purpose of firebase?

1 Answers  

---