Linear hashing Number of buckets grow by at most 1   Linear growth Both primary and overflow buckets   Overflow buckets are chained Familyof hash functions     n is initial number of buckets   doubles the range of Load factor decides when to split Split pointer decides which bucket to split   is independent of overflowing bucket   At level , is between 0 and   is incremented and if at end, is reset to 0 Records in splitting bucket are rehashed using   Equal chance of being in old and new buckets