CISC437 Chapter Notes - Chapter 10.5-10.6: Linked List
17 Apr 2016
School
Department
Course
Professor
Document Summary
Given a set of records, we will discuss how to organize them in a file. Hashing file organization: a hash function is computed on some attribute of each record, the result of the hash function specifies which block the record should be placed. Multitable clustering file organization: records of several relations are stored in the same file, related records of different relations are stored on the same block. A sequential file is designed for efficient processing of records in sorted order based on some search key. A search key is any attribute or set of attributes. Store records in search key order or as close to search key order as possible. Many relational databases store each relation in its own file: good for small, simple databases. Sometimes it is useful to store multiple relations in the same block: joins take less time.
