B+-Trees and Hashing Techniques for Storage and Index .pptVIP

B+-Trees and Hashing Techniques for Storage and Index Structures Covers Chapters [[8]], 10, 11 Third Edition Last updated: January 30, 2003 Alternative File Organizations Many alternatives exist, each ideal for some situation , and not so good in others: Heap files: Suitable when typical access is a file scan retrieving all records. Sorted Files: Best if records must be retrieved in some order, or only a `range’ of records is needed. Hashed Files: Good for equality selections. File is a collection of buckets. Bucket = primary page plus zero or more overflow pages. Hashing function h: h(r