-
- Ronald Fagin
- IBM Research Lab, San Jose, CA
-
- Jurg Nievergelt
- Institut Informatik, Zurich, Switzerland
-
- Nicholas Pippenger
- IBM T. J. Watson Research Center, Yorktown Heights, NY
-
- H. Raymond Strong
- IBM Research Lab, San Jose, CA
この論文をさがす
説明
<jats:p>Extendible hashing is a new access technique, in which the user is guaranteed no more than two page faults to locate the data associated with a given unique identifier, or key. Unlike conventional hashing, extendible hashing has a dynamic structure that grows and shrinks gracefully as the database grows and shrinks. This approach simultaneously solves the problem of making hash tables that are extendible and of making radix search trees that are balanced. We study, by analysis and simulation, the performance of extendible hashing. The results indicate that extendible hashing provides an attractive alternative to other access methods, such as balanced trees.</jats:p>
収録刊行物
-
- ACM Transactions on Database Systems
-
ACM Transactions on Database Systems 4 (3), 315-344, 1979-09
Association for Computing Machinery (ACM)
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1363951796109632256
-
- NII論文ID
- 80000357333
-
- NII書誌ID
- AA00042640
-
- ISSN
- 15574644
- 03625915
-
- データソース種別
-
- Crossref
- CiNii Articles