| | |
Summary: Information Processing Letters 45 (1993) 191-197
Elsevier
22 March 1993
Performance analysis of a main memory
multi-directory hashing technique *
Anastasia Analyti and Sakti Pramanik
Computer Science Department, Michigan State Uniuersity, East Lansing, MI 48824, USA
Communicated by K. Ikeda
Received 12 May 1992
Revised 28 September 1992
Analyti, A. and S. Pramanik, Performance analysis of a main memory multi-directory hashing technique, Information
Processing Letters 45 (1993) 191-197.
Optimal search in main memory databases requires at most one key comparison to locate a record. Extendible hashing
becomes impractical when it is adapted to yield optimal search in main memory databases because of its large directory size.
Multi-directory hashing techniques can provide significantly improved directory utilization over extendible hashing. The
objective of this paper is to analyze the directory utilization of a main memory multi-directory hashing technique, called
Extendible Root Multi-Directory Hashing.
Keywords: Databases; extendible hashing; main memory databases; multi-directory hashing; optimal search; performance
analysis
1. Introduction
|
