Q. State true or false: Bitmaps can be combined with B+ trees

View solution

Q. We create an index in SQL using _______ command

View solution

Q. We delete and index in SQL using the ________ command

View solution

Q. State true or false: Intersection operations are extremely slow on bitmaps

View solution

Q. Which of the following operations is used for the union of bitmaps?

View solution

Q. In ordered indices the file containing the records is sequentially ordered, a ___________ is an index whose search key also defines the sequential order of the file.

View solution

Q. Indices whose search key specifies an order different from the sequential order of the file are called ___________ indices.

View solution

Q. An ____________ consists of a search-key value and pointers to one or more records with that value as their search-key value.

View solution

Q. In a _______ clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.

View solution

Q. In a __________ index, an index entry appears for only some of the search-key values.

View solution

Q. Incase the indices values are larger, index is created for these values of index. This is called

View solution

Q. A search key containing more than one attribute is referred to as a _________ search key.

View solution

Q. In B+ tree the node which points to another node is called

View solution

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

View solution

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

View solution

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.

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

Q. Key value pairs is usually seen in

View solution

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

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