adplus-dvertising
frame-decoration

Question

Bitmaps can be used as a compressed storage mechanism at the leaf nodes of ________ for those values that occur very frequently.

a.

B-trees

b.

B+-trees

c.

Bit trees

d.

Both B-trees and B+-trees

Posted under Indexing and Hashing DBMS

Answer: (b).B+-trees

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Bitmaps can be used as a compressed storage mechanism at the leaf nodes of ________ for those values that occur very frequently.

Similar Questions

Discover Related MCQs

Q. To identify the deleted records we use the ______________

Q. SELECT *
FROM r
WHERE gender = ’f’ AND income level = ’L2’;

In this selection, we fetch the bitmaps for gender value f and the bitmap for income level value L2, and perform an ________ of the two bitmaps.

Q. A _______ on the attribute A of relation r consists of one bitmap for each value that A can take.

Q. Bitmap indices are a specialized type of index designed for easy querying on ___________

Q. The purpose of an N-Ary association is:

Q. The association role defines:

Q. The database design that consists of multiple tables that are linked together through matching data stored in each table is called

Q. The traditional storage of data that is organized by customer, stored in separate folders in filing cabinets is an example of what type of ‘database’ system?

Q. In the client / server model, the database:

Q. The separation of the data definition from the program is known as:

Q. The property (or set of properties) that uniquely defines each row in a table is called the:

Q. What is the main limitation of Hierarchical Databases?

Q. Breadth First Search is used in

Q. Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?

Q. What is the best definition of a collision in a hash table?

Q. Key value pairs is usually seen in

Q. A hash table can store a maximum of 10 records, currently there are records in location 1, 3,4,7,8,9,10. The probability of a new record going into location 2, with hash functions resolving collisions by linear probing is

Q. Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.

Q. While inserting the record into the index, if the search-key value does not appear in the index.

Q. Insertion of a large number of entries at a time into an index is referred to as __________ of the index.