Skip to Main Content
A novel extension to binary-tree table organization suitable for external storage providing successful searches for nearly full tables requiring less than two accesses is presented. The generalizes the "efficient ordering of hash tables" effort presented in 1979. Both the experimental and analytical results demonstrate the reductions possible. This method places no restrictions on the the table configuration parameters and requires no additional space per bucket. The insertion runtime is larger slightly than for ordinary external double hashing.