Podcast
Questions and Answers
What is the process of mapping a key value directly to the storage location without using indices called?
What is the process of mapping a key value directly to the storage location without using indices called?
- Hashing (correct)
- Arithmetic manipulation
- Indexing
- Sequential mapping
What is the usual method of direct mapping in direct file organisations?
What is the usual method of direct mapping in direct file organisations?
- Using index entries
- Performing arithmetic manipulation of the key value (correct)
- Assigning to the next available free space
- Storing in an overflow area
What is the term used for the situation when two or more distinct key values are mapped to the same value in hashing schemes?
What is the term used for the situation when two or more distinct key values are mapped to the same value in hashing schemes?
- Overflows
- Re-organizations
- Buckets
- Collisions (correct)
How are colliding records usually handled in hashing schemes?
How are colliding records usually handled in hashing schemes?
What is the purpose of using the hash function to generate a value that is the address of a bucket where the pair values of records are stored?
What is the purpose of using the hash function to generate a value that is the address of a bucket where the pair values of records are stored?
What is the term used to describe the situation when two or more distinct key values are mapped to the same value in hashing schemes?
What is the term used to describe the situation when two or more distinct key values are mapped to the same value in hashing schemes?
What is the purpose of using the hash function to generate a value that is the address of a bucket where the pair values of records are stored?
What is the purpose of using the hash function to generate a value that is the address of a bucket where the pair values of records are stored?
What is the usual method of direct mapping in direct file organisations?
What is the usual method of direct mapping in direct file organisations?
How are colliding records usually handled in hashing schemes?
How are colliding records usually handled in hashing schemes?
What process is called when a key value is mapped directly to the storage location, avoiding the use of indices?
What process is called when a key value is mapped directly to the storage location, avoiding the use of indices?
