 This means that time-sensitive applications are less affected by table growth than by standard full-table rehashes.Extendible hashing was described by Ronald Fagin in 1979.Practically all modern filesystems use either extendible hashing or B-trees.