학술논문

Concurrent Operations on Extendible Hashing and its Performance.
Document Type
Article
Source
Communications of the ACM. Jun90, Vol. 33 Issue 6, p681-694. 14p. 8 Diagrams, 8 Graphs.
Subject
*HASHING
*ALGORITHMS
*COMPUTER science
*COMPUTER programming
*COMPUTER storage devices
*ELECTRONIC file management
Language
ISSN
0001-0782
Abstract
Extendible hashing is a dynamic data structure which accommodates expansion and contraction of any stored data efficiently. In this article, an algorithm has been developed for managing concurrent operations on extendible hashing by achieving optimal memory utilization by supporting directory expansion and contraction, page split, and merge. The results of this study have been encouraging in the sense that it seems to provide a higher degree of concurrency compared to other algorithms on an extendible hash file. [ABSTRACT FROM AUTHOR]