Bissoy.com
Doctors Medicines MCQs Q&A

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

If the file containing the records is sequentially ordered, a ___________ is an index whose search key also defines the sequential order of the file. Correct Answer Cluttering index

If the file containing the records is sequentially ordered, a Clustering index is an index whose search key also defines the sequential order of the file. Clustering indices are also called as primary indices but they do not denote an index on the primary key. Such indices can be built on any search key.

Related Questions

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.
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.
Indices whose search key specifies an order different from the sequential order of the file are called ___________ indices.
A boy is asked to put in a basket one mango when ordered 'one', one orange when ordered 'two', one apple when ordered 'three' and is asked to take out from the basket one mango and orange when ordered 'four'. A sequence of orders is given as 1 2 3 3 2 1 4 2 3 1 4 2 2 3 3 1 4 1 1 3 2 3 4. How many total oranges were in the basket at the end of the above sequence?
Public key encryption uses multiple keys.ne key is used to encrypt data, while another is used to decrypt data.he key used to encrypt data is called the _______ key, while the key used to decrypt data is called the ________ key.
An ____________ consists of a search-key value and pointers to one or more records with that value as their search-key value.
A search key containing more than one attribute is referred to as a _________ search key.
A search key containing more than one attribute is called a _________ search key
If a relation can have more than one record containing the same search key value, the search key is said to be a __________
We create a binary search tree B1 by inserting the numbers 1, 2, 3, 4, 5 into an empty binary search tree. We create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B2?