Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
InformationSystemsVol. 18, No. I, pp. 63-74, 1993 Printed in Great Britain
 

Summary: InformationSystemsVol. 18, No. I, pp. 63-74, 1993
Printed in Great Britain
0306-4379/93 $6.00 + 0.00
Pcrgamon Press Ltd
MULTI-DIRECTORY HASHING
SAKTI PRAMANIK, ANASTASIAANALYTI, HENRY DAVIES and HSIAO-YUGrou
Computer Science Department, Michigan State University, East Lansing, MI 48824, U.S.A.
(Received 10 September 1990; in revised form 10 August 1992)
Abstract-We present a new dynamic hashing scheme for disk-based databases, called Multi-Directory
Hashing (MDH). MDH uses multiple hash directories to access a file. The size of each hash directory
grows dynamically with the file size. The advantages of MDH are enhanced concurrency, improved bucket
utilization and smaller total directory size than single-directory hashing. The expected utilization of MDH
increases monotonically and approaches 100% as the number of hash directories increases. A variation
of MDH, called Main Memory Multi-Directory Hashing (MM-MDH), is also described. MM-MDH
achieves optimal search time in main memory databases. The performance of both methods is analyzed
through theoretical and experimental results.
Key words: Multi-Directory Hashing, extendible hashing, parallel processing, main memory databases,
performance analysis
1. INTRODUCTION
Hashing is a common technique to speed up search in database applications. Several hashing

  

Source: Analyti, Anastasia - Institute of Computer Science, Foundation of Research and Technology, Hellas

 

Collections: Computer Technologies and Information Sciences