adplus-dvertising
frame-decoration

Question

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

a.

The system adds a pointer to the new record in the index entry

b.

The system places the record being inserted after the other records with the same search-key values

c.

The system inserts an index entry with the search-key value in the index at the appropriate position

d.

None of the mentioned

Posted under DBMS

Answer: (c).The system inserts an index entry with the search-key value in the index at the appropriate position

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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. 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. Key value pairs is usually seen in

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

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

Q. Breadth First Search is used in

Q. What is the main limitation of Hierarchical Databases?

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

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

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

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. The database design that consists of multiple tables that are linked together through matching data stored in each table is called

Q. The association role defines:

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

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

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

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. To identify the deleted records we use the ______________

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

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.