Affiliation:
1. Hewlett-Packard Labs, 1501 Page Mill Road, Palo Alto, CA
Abstract
LH* generalizes Linear Hashing to parallel or distributed RAM and disk files. An LH* file can be created from objects provided by any number of distributed and autonomous clients. It can grow gracefully, one bucket at a time, to virtually any number of servers. The number of messages per insertion is one in general, and three in the worst case. The number of messages per retrieval is two in general, and four in the worst case. The load factor can be about constant, 65-95%, depending on the file parameters. The file can also support parallel operations. An LH* file can be much faster than a single site disk file, and/or can hold a much larger number of objects. It can be more efficient than any file with a centralized directory, or a static parallel or distributed hash file.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. DynaHash: Efficient Data Rebalancing in Apache AsterixDB;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05
2. Benchmarking Hashing Algorithms for Load Balancing in a Distributed Database Environment;Advances in Model and Data Engineering in the Digitalization Era;2022
3. Runtime and compiler support for HAMTs;Proceedings of the 17th ACM SIGPLAN International Symposium on Dynamic Languages;2021-10-19
4. Concurrency Control Protocol for Parallel B-Tree Structures That Improves the Efficiency of Request Transfers and SMOs within a Node;IEICE Transactions on Information and Systems;2018
5. Fast LH $$*$$ ∗;International Journal of Parallel Programming;2015-07-23