June 1990 - Vol. 33 No. 6

June 1990 issue cover image

Features

Practice

Concurrent operations on extendible hashing and its performance

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 directly 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.

Recent Issues

  1. March 2025 cover
    March 2025 Vol. 68 No. 3
  2. February 2025 cover
    February 2025 Vol. 68 No. 2
  3. January 2025 cover
    January 2025 Vol. 68 No. 1
  4. December 2024 CACM cover
    December 2024 Vol. 67 No. 12