Discussion
The ................... file organization provides very fast access to any arbitrary record of a file.
Answer: D
Very fast access to any record is given by hashed file organisation.
A hash function computes the address (bucket) of a record directly from its key, so a record can be located in about one disk access on average, whatever the size of the file.
A B-tree index needs a search down the tree, in a number of steps that grows logarithmically with the file. Sequential files must be scanned, and ordered files allow binary search but not direct access. All are slower for arbitrary single-record lookups than hashing.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development