Question
a.
preserving hashing
b.
external hashing
c.
internal hashing
d.
reversal hashing
Posted under DBMS
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The hashing process if used for disk files is classified as
Similar Questions
Discover Related MCQs
Q. The fields which are used to retrieve the related records from other files are called
View solution
Q. The command in DBMS software which is used to locate records that fulfills the search condition is classified as
View solution
Q. The number of values taken by hash field are called
View solution
Q. The index which has an entry for some of the key value is classified as
View solution
Q. The primary indexes, secondary indexes and cluster indexes are all types of
View solution
Q. In multilevel indexes, the primary index created for its first level is classified as
View solution
Q. The indexes which specifies address of records on disk with a physical pointer are classified as
View solution
Q. The example of non dense index is
View solution
Q. In the data file, the first record of any of the block is called
View solution
Q. The file which has secondary index for its every field is classified as
View solution
Q. The first field in the primary index having same data type as in the ordering field is considered as
View solution
Q. In multilevel indexes, the primary index created for its second level is classified as
View solution
Q. The kind of index which is based on any candidate key or a non key field which may have duplicate values is classified as
View solution
Q. In multilevel indexes, the blocking factor is also called
View solution
Q. The index which has an entry for every key value is classified as
View solution
Q. The special node in the tree structure which has many child nodes and one parent node is called
View solution
Q. The tree structure diagram in which the pointers of data are stored at the leaf nodes of diagram is classified as
View solution
Q. The type of multilevel index which leaves space for inserting new entries in its blocks is called
View solution
Q. In tree structure, the node which is free of child nodes is called
View solution
Q. In physical ordered record files, the non key field for which the records does not have distinct values is classified as
View solution
Suggested Topics
Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
