Design and implementation of DDH: A distributed dynamic hashing algorithm-Reference-Cited by-同舟云学术

Design and implementation of DDH: A distributed dynamic hashing algorithm

Published:1993 Issue: Volume: Page:101-114
ISSN:0302-9743
Container-title:Foundations of Data Organization and Algorithms
language:
Short-container-title:

Author:

Devine Robert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57301-1_7.pdf

Reference10 articles.

1. AT&T, DBM(3X), Unix Programmer's Manual, System V.3, pp. 506–8, 1985.

2. Ronald Fagin, Jurg Nievergelt, Nicholas Pippenger, and H. Raymond Strong, “Extensible Hashing — A Fast Access Method for Dynamic Files”, ACM Transactions on Database Systems, Volume 4, No. 3, pp. 315–34, September 1979.

3. Richard Golding, “Accessing Replicated Data in a Large-Scale Distributed System”, University of California at Santa Cruz technical report, June 1991.

4. H.I.Hsiao and David DeWitt, “Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines”, Proceedings of the 6th International Conference on Data Engineering, February 1990.

5. Per Larson, “Dynamic Hashing”, BIT, 1978 Vol. 18(2), pp. 184–201.

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Backgrounds of Searchable Storage;Searchable Storage in Cloud Computing;2019

2. 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

3. A Load Balancing Method For Massive Data Processing Under Cloud Computing Environment;Intelligent Automation & Soft Computing;2017-04-20

4. Fast LH $$*$$ ∗;International Journal of Parallel Programming;2015-07-23

5. Virtual and Consistent Hyperbolic Tree: A New Structure for Distributed Database Management;Networked Systems;2015