Given a fixed‐length record file that is ordered B on the key field. The file needs disk blocks to R store number of records. Find the average access time needed to access any record of the given file using binary search.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. log₂ B
Explanation
Binary search over B ordered blocks needs about log₂ B block accesses.
More Database Management Systems questions
- Given the following STUDENT‐COURSE scheme: STUDENT (Rollno, Name, courseno) COURSE (courseno, coursename, capacity), where Rollno is the pr…
- Given STUDENT(Rollno, Name, Courseno) and COURSE(Courseno, Coursename, Capacity) with 5 and 3 records, R = STUDENT × COURSE is computed. Ma…
- A B tree indexes a database file with search key 10 bytes, block 1024 bytes, record pointer 9 bytes and block pointer 8 bytes. If K is the…
- Given R(x, y, z, w) with F = {x → y, z → w}, where all attributes are atomic: A. R is in First Normal Form. B. R is in Second Normal Form.…
- A company is consuming parts in the manufacturing of other products. Each of the part is either manufactured within the company or purchase…
- A transaction may be in one of the following states during its execution life cycle in concurrent execution environment. A. FAILED B. TERMI…