Implement a two-level linear index for variable-length records as illustrated by Figures 10.1 and 10.2. Assume that
Question:
Implement a two-level linear index for variable-length records as illustrated by Figures 10.1 and 10.2.
Assume that disk blocks are 1024 bytes in length.
Records in the database file should typically range between 20 and 200 bytes, including a 4-byte key value. Each record of the index file should store a key value and the byte offset in the database file for the first byte of the corresponding record. The top-level index (stored in memory) should be a simple array storing the lowest key value on the corresponding block in the index file.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Practical Introduction To Data Structures And Algorithm Analysis Java Edition
ISBN: 9780136609117
1st Edition
Authors: Clifford A. Shaffer
Question Posted: