Answer Posted / rahul roshan

Bitmap indexes have traditionally been considered to work well for data such as Boolean values, which have a modest number of distinct values – in this case, boolean True and False - but many occurrences of those values. This would happen if, for example, you had data on whether or not each resident in a city has internet access. Bitmap indexes use bit arrays (commonly called bitmaps) and answer queries by performing bitwise logical operations on these bitmaps. Bitmap indexes have a significant space and performance advantage over other structures for query of such data. Their drawback is they are less efficient than the traditional B-tree indexes for columns whose data is frequently updated: consequently, they are more often employed in read-only systems that are specialized for fast query - e.g., data warehouses, and generally unsuitable for online transaction processing applications. However, this drawback appears to apply only to their implementation in relational database management systems: certain non-relational DBMSs, notably Intersystems Cache, a hierarchical database, use bitmap indexes for low-cardinality columns in transactional systems.

What are the two parts of design view?

971

---

How do we accept inputs from user during runtime?

989

---

Does group by remove duplicates?

978

---

What is the most important ddl statements in sql are?

941

---

What is normalisation and its types?

952

---

Can we edit a view in sql?

924

---

What is the difference between execution of triggers and stored procedures?

1047

---

What is a delimiter in sas?

973

---

Explain clause in sql?

955

---

What are the advantages of pl sql?

1070

---

What is the difference between cluster and non-cluster index?

1044

---

What is varchar example?

973

---

What is cost in sql execution plan?

897

---

Can we join two tables without common column?

926

---

How many types of literals are available in pl sql?

1044

---