Q. In linear hashing, the formula used to calculate number of records if the blocking factor, loading factor and file buckets are known is as

View solution

Q. The type of data organization which does not allow cross block boundaries is called

View solution

Q. If the global depth is more than local depth then the operation must be performed in directory array is

View solution

Q. In extendible hashing array of bucket addresses 2d then d is considered as

View solution

Q. The open addressing, multiple hashing and chaining are all the methods used for

View solution

Q. The record searching technique which is based on the blocks rather than records is called

View solution

Q. The additional access path added into ordered file is called

View solution

Q. The hash functions that does not maintain order of values of hash field are called

View solution

Q. The kind of hashing technique in which a directory of having addresses 2d is maintained is called

View solution

Q. The type of organization in which the records are inserted at the end of stored file is classified as

View solution

Q. The kind of field with which the record searching is done is classified as

View solution

Q. The hashing process if used for disk files is classified as

View solution

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