Performance analysis of a main memory multi-directory hashing technique (Q1209985): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q127064121, #quickstatements; #temporary_batch_1722428282777 |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the performance evaluation of extendible hashing and trie searching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic hashing / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90118-s / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2063575096 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127064121 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:20, 31 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Performance analysis of a main memory multi-directory hashing technique |
scientific article |
Statements
Performance analysis of a main memory multi-directory hashing technique (English)
0 references
16 May 1993
0 references
Hashing permits fast access to both disk-based and main memory-based databases. The retrieval time in main memory databases consists of the time to follow the address pointers plus the time to compare the key values. We define optimal search in main memory databases as the search that requires at most one key comparison to locate a record. Extendible hashing becomes impractical when it is adapted to yield optimal search because of its large directory size. Multi-directory hashing techniques can provide significantly improved directory utilization over extendible hashing. The objective of the paper is to analyze the directory utilization of a main memory hashing technique, called Extendible Root Multi-Directory Hashing (ERMH), ERMH uses a tree-structured hash directory of height one. The size of the leaf subdirectories is fixed and the root subdirectory expands to allow for more records. ERMH requires at most one key comparison to locate a record and its expected directory size is \(O(m^{4/3})\), where \(m\) is the number of inserted records.
0 references
main memory databases
0 references
Extendible hashing
0 references
Multi-directory hashing
0 references