Transaction Processing

15

Access Paths

15.1. Introduction

15.2. Overview of Techniques to Implement Associative Access Paths

15.2.1. Summary

15.3. Associative Access by Hashing

15.3.1. Folding the Key Value into a Numerical Data Type

15.3.2. Criteria for a Good Hash Function

15.3.2.1. The Image Set of the Hashing Function

15.3.2.2. How to Find a Hash Function

15.3.2.3. Estimating the Probability of Page Overflows Due to Collisions

15.3.2.4. Hashing For Nonunique Attributes

15.3.3. Overflow Handling in Hash Files

15.3.3.1. Finding Space for Overflow Tuples

15.3.3.2. Retrieving Overflow Tuples

15.3.4. Local Administration of Pages in a Hash File

15.3.5. Summary of Associative Access Based on Hashing

15.4. B-Trees

15.4.1. B-Trees: The Basic ...