GK One-Line Question & Answer

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

To identify the deleted records we use the

The strategy can retrieve a single record if the equality condition is on a key; multiple records may be retrieved if the indexing field is not a key is

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.

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.

The algorithm that uses a secondary ordered index to guide retrieval for comparison conditions involving <,≤,≥, or > is

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

What is the purpose of the index in sql server?

The        algorithm scans each index for pointers to tuples that satisfy an individual condition.

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

How many types of indexes are there in sql server?

If access paths are available on all the conditions of a disjunctive selection, each index is scanned for pointers to tuples that satisfy the individual condition. This is satisfied by

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

How non clustered index point to the data?

If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :

Which one is true about clustered index?

A technique for direct search is

What is true about indexes?

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.

Does index take space in the disk?

Key value pairs is usually seen in

If an index is                                    the metadata and statistics continue to exists

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

In                                index instead of storing all the columns for a record together, each column is stored separately with all other rows in an index.

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

A                                    index is the one which satisfies all the columns requested in the query without performing further lookup into the clustered index.

Breadth First Search is used in

Which of the following schemas does define a view or views of the database for particular users?

A(n)                    can be used to preserve the integrity of a document or a message.

Which of the following is an attribute that can uniquely identify a row in a table?

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

The relationship between DEPARTMENT and EMPLOYEE is a

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

If the state of the database no longer reflects a real state of the world that the database is supposed to capture, then such a state is called

In the client / server model, the database:

In query processing, the                        is the lowest-level operator to access data.

The association role defines:

In a                          the system scans each file block and tests all records to see whether they satisfy the selection condition.

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

Which algorithm uses equality comparison on a key attribute with a primary index to retrieve a single record that satisfies the corresponding equality condition.