Dynamic Hashing Schemes

R. J. Enbody; H. C. Du

doi:10.1145/46157.330532

Dynamic Hashing Schemes

R. J. Enbody, H. C. Du

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

88 Scopus citations

Abstract

A new type of dynamic file access called dynamic hashing has recently emerged. It promises the flexibility of handling dynamic files while preserving the fast access times expected from hashing. Such a fast, dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic hashing schemes and examines their critical design issues.

Original language	English (US)
Pages (from-to)	85-113
Number of pages	29
Journal	ACM Computing Surveys (CSUR)
Volume	20
Issue number	2
DOIs	https://doi.org/10.1145/46157.330532
State	Published - Jul 1 1988

Keywords

dynamic hashing

Access

10.1145/46157.330532

OpenUrl availability

Full text

Cite this

@article{8dcf282cdc0048d987bae22078f8db1d,

title = "Dynamic Hashing Schemes",

abstract = "A new type of dynamic file access called dynamic hashing has recently emerged. It promises the flexibility of handling dynamic files while preserving the fast access times expected from hashing. Such a fast, dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic hashing schemes and examines their critical design issues.",

keywords = "dynamic hashing",

author = "Enbody, {R. J.} and Du, {H. C.}",

year = "1988",

month = jul,

day = "1",

doi = "10.1145/46157.330532",

language = "English (US)",

volume = "20",

pages = "85--113",

journal = "ACM Computing Surveys (CSUR)",

issn = "0360-0300",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - Dynamic Hashing Schemes

AU - Enbody, R. J.

AU - Du, H. C.

PY - 1988/7/1

Y1 - 1988/7/1

N2 - A new type of dynamic file access called dynamic hashing has recently emerged. It promises the flexibility of handling dynamic files while preserving the fast access times expected from hashing. Such a fast, dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic hashing schemes and examines their critical design issues.

AB - A new type of dynamic file access called dynamic hashing has recently emerged. It promises the flexibility of handling dynamic files while preserving the fast access times expected from hashing. Such a fast, dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic hashing schemes and examines their critical design issues.

KW - dynamic hashing

UR - http://www.scopus.com/inward/record.url?scp=0024030226&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024030226&partnerID=8YFLogxK

U2 - 10.1145/46157.330532

DO - 10.1145/46157.330532

M3 - Article

AN - SCOPUS:0024030226

SN - 0360-0300

VL - 20

SP - 85

EP - 113

JO - ACM Computing Surveys (CSUR)

JF - ACM Computing Surveys (CSUR)

IS - 2

ER -

Dynamic Hashing Schemes

Abstract

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this