LH*TH: New fast Scalable Distributed Data Structures (SDDS)
Aridj Mohamed
TL;DR
This paper introduces a new scalable distributed data structure called LH*TH, which leverages trie hashing to enhance access times in distributed data management systems, building upon the SDDS framework.
Contribution
It proposes a novel LH* bucket organization using trie hashing to improve access times in SDDS-based distributed data structures.
Findings
Improved access request times demonstrated
Enhanced scalability of distributed data structures
Effective organization of LH* buckets with trie hashing
Abstract
Proposed in 1993 the Scalable Distributed Data Structures (SDDSs) became a profile of basis for the data management on Multi computer. In this paper we propose an organization of a LH* bucket based on the trie hashing in order to improve times of different access request.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Advanced Data Storage Technologies · Peer-to-Peer Network Technologies