Performance Study of Concurrent Search Trees and Hash Algorithms on Multiprocessors Systems
Description:
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 for accessing records stored unordered in buckets. This dissertation presents performance results on implementations of concurrent Bunk-tree and linear hashing algorithms, using lock-based, partitione…
more
Date:
May 1996
Creator:
Demuynck, Marie-Anne