Performance Study of Concurrent Search Trees and Hash Algorithms on Multiprocessors Systems
This study examines the performance of concurrent algorithms for B-trees and linear hashing. B-trees are widely used as an access method for large, single key, database files, stored in lexicographic order on secondary storage devices. Linear hashing is a fast and reliable hash algorithm, suitable f...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
University of North Texas
1996
|
| Subjects: | |
| Online Access: | https://digital.library.unt.edu/ark:/67531/metadc332828/ |