adplus-dvertising
frame-decoration

Question

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

a.

Clustering data

b.

Cluttering index

c.

Clustering index

d.

Clustering number

Posted under DBMS

Answer: (b).Cluttering index

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. State true or false: Clustering indices are also called as primary indices

Q. If an index entry appears for every search key value in the file, it is called as ________

Q. If an index entry appears for only some of the search key values in the file, it is called as ________

Q. Indices with two or more levels are called as?

Q. A search key containing more than one attribute is called a _________ search key

Q. State true or false: B+ trees are not always balanced trees.

Q. What are the leaf nodes in a B+ tree?

Q. Non-leaf nodes are also called as __________

Q. The queries used to find all records with search key values in a particular range are known as ________

Q. Statement 1: Insertion of record might require the change in position of the initial nodes.
Statement 2: Deletion of records might require the change in position of the initial nodes.

Q. If a relation can have more than one record containing the same search key value, the search key is said to be a __________

Q. State true or false: The fanout of nodes can be increased by using a technique called _________

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

Q. ___________ are the indices that store the values of some attributes along with the pointers to the record.

Q. The term ______ is used to denote a unit of storage that can store one or more records

Q. If K denotes the set of all the search key values, and B denotes the set of all bucket addresses, a function from K to B is called as __________

Q. In a __________ , we obtain the address of the disk block containing a desired record directly by computing a function on the search key value of the record

Q. In a __________ we organize the search keys, with their associated pointers, into a hash file structure

Q. What is a bucket overflow?

Q. Some buckets are assigned more records than the others which causes bucket overflow, this condition is called as ________