The objective of this paper is to develop and analyze high performance hash based search methods for main memory databases. we define optimal search in main memory databases as the search that requires at most one key comparison to locate a record. existing hashing techniques become impractical when they are adapted to yield optimal search in main memory databases because of their large directory size. multi-directory hashing techniques can provide significantly improved directory utilization over single-directory-directory hashing techniques. a multi-directory hashing scheme, called fast search multi-directory hashing, and its generalization, called controlled search multi-directory hashing, are presented. both methods achieve linearly increasing expected directory size with the number of records. their performance is compared to existing alternatives. Index Terms : controlled search, extendible hashing, linear hashing, main memory databases, multidirectory hashing, optimal search, performance analysis.