ECE356 Lecture Notes - Lecture 13: Modulo Operation, Hash Table, Binary Search Algorithm

• School: University of Waterloo
• Department: Electrical and Computer Engineering
• Course: ECE356
• Professor: Zarnett

Document Summary

We did not go into the details of the options earlier, but we will now be able to do so. Under most circumstances one relation corresponds to one le. However, multiple relations can be in the same le if desired. To start with, we will just have one relation in a le. Remember that these le organizations are not a ected by whether records are of xed or variable length. Simi- larly, whether spanned records is allowed or not does not a ect the le organization. Those sorts of consideration are about how to pack records into a block; this is about the order of the records. The simplest way to order records is: don"t order the records! The heap le has no inherent organization, although some (weak) idea of ordering may exist in the sense that records appear in the le in the order in which they are inserted.