Q. In a B+-tree index ______ for each value we would normally maintain a list of all records with that value for the indexed attribute.

View solution

Q. 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.

View solution

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

View solution

Q. To identify the deleted records we use the ______________

View solution

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.

View solution

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

View solution

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

View solution

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

View solution

Q. The association role defines:

View solution

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

View solution

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?

View solution

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

View solution

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

View solution

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

View solution

Q. What is the main limitation of Hierarchical Databases?

View solution

Q. Breadth First Search is used in

View solution

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

View solution

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

View solution

Q. Key value pairs is usually seen in

View solution

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

View solution