GK One-Line Question & Answer

What are the correct features of a distributed database?

A major goal of the database system is to minimize the number of block transfers between the disk and memory. This is achieved by

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

Each tablespace in an Oracle database consists of one or more files called

The subsystem responsible for the allocation of buffer space is called the

Breadth First Search is used in

Choose the RDBMS which supports full fledged client server application development

In the buffer where there is no space for another block, the block can be inserted using

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

An audit trail                        

A block that is not allowed to be written back to disk is said to be                              

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

Large collection of files are called

In case the buffer manager do not write the blocks properly then the buffer manager uses

Which of these is not a feature of Hierarchical model?

The technique where the blocks which have been used are replaced is called

Which of these data models is an extension of the relational data model?

                                       frees the space occupied by a block as soon as the final tuple of that block has been processed.

The information about data in a database is called                

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

A data dictionary is a special file that contains?

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

The DBMS acts as an interface between what two components of an enterprise-class database system?

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.

Relational schemas and other metadata about relations are stored in a structure called the                          

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

                       is the collection of memory structures and Oracle background processes that operates against an Oracle database.

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

A                  is a logical grouping of database objects, usually to facilitate security, performance, or the availability of database objects such as tables and indexes.

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

A tablespace is further broken down into

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 :

                     is a contiguous group of

A technique for direct search is

                 is the smallest unit of allocation in an Oracle database.

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.

An Oracle                      is a set of tables and views that are used as a read-only reference about the database.

Key value pairs is usually seen in

The                is that part of main memory available for storage of copies of disk blocks.

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