Bitmaps can be combined with regular B+- tree indices for relations where a few attribute values are extremely common, and other values also occur, but much less frequently.

Related MCQs

• Department (dept name, building, budget) and Employee (employee_id, name, dept name, salary) Here the dept_name attribute appears in both the relations. Here using common attributes in relation schema is one way of relating ___________ relations.
• Department (dept name, building, budget) and Employee (employee_id , name, deptname,salary) Here the dept_name attribute appears in both the relations .Here using common attributes in relation schema is one way of relating ___________ relations.
• Every time attribute A appears, it is matched with the same value of attribute B, but not the same value of attribute C. Therefore, it is true that:
• Indices whose search key specifies an order different from the sequential order of the file are called                        indices.
• Indices whose search key specifies an order different from the sequential order of the file are called ___________ indices.
• The attribute name could be structured as an attribute consisting of first name, middle initial, and last name. This type of attribute is called
• The attribute name could be structured as an attribute consisting of first name, middle initial, and last name. This type of attribute is called
• Incase the indices values are larger, index is created for these values of the index. This is called
• For each attribute of a relation, there is a set of permitted values, called the                   of that attribute.
• For each attribute of a relation, there is a set of permitted values, called the ________ of that attribute.