Concurrency in extendible hashing
type: Item
instance of: scholarly article
title: Concurrency in extendible hashing
zbMATH Open document ID: 0654.68111
DOI: 10.1016/0306-4379(88)90030-0
author: Carla Schlatter Ellis
published in: Information Systems
publication date: 1988-01-01T00:00:00Z
review text: Hashing has long been recognized as a fast method for accessing records by key in large relatively static databases. However, when the amount of data is likely to grow significantly, traditional hashing suffers from performance degradation and may eventually require rehashing all the records into a larger space. Recently, a number of techniques for dynamic hashing have appeared. In this paper, we present a solution to allow for concurrency in one of these dynamic data structures, namely extendible hashfiles. The solution is based on locking protocols and minor modifications in the data structure.
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 4068341
zbMATH Keywords: concurrent algorithms
zbMATH Keywords: concurrency control
zbMATH Keywords: databases
zbMATH Keywords: dynamic hashing
zbMATH Keywords: data structures
zbMATH Keywords: locking
MaRDI profile type: Publication
full work available at URL: 0306-4379(88)90030-0
OpenAlex ID: W2066944352
description: scientific article; zbMATH DE number 4068341