This document discusses different indexing and hashing techniques. It describes ISAM which allows both sequential and random access to records through indexes. It then explains static hashing which uses a fixed hash function and dynamic hashing techniques like extendible hashing and linear hashing which allow the hash table to expand. Extendible hashing uses a directory to point to the logical structure while linear hashing expands the hash table one slot at a time. Finally, it briefly introduces B+ trees which are balanced search trees used for range queries through index and data pages.