Poster: Distributed Learned Hash Table
Distributed Hash Tables (DHTs) are pivotal in numerous high-impact key-value applications built on distributed networked systems, offering a decentralized architecture that avoids single points of failure and improves data availability. Despite their widespread utility, DHTs face substantial challenges in handling range queries, which are crucial for applications such as storage systems, decentralized databases, content distribution networks, and blockchains. To address this limitation, we present LEAD, a novel system incorporating learned models within DHT structures to significantly optimize range query performance. LEAD utilizes a recursive machine learning model to map and retrieve data across a distributed system while preserving the inherent order of data. Preliminary results indicate LEAD achieves tremendous advantages in system efficiency compared to existing range query methods in large-scale distributed systems while maintaining high scalability and resilience to network churn.
Authors
- Yi Liu (ORCID: https://orcid.org/0000-0002-8839-9508)
- Shengze Wang (ORCID: https://orcid.org/0000-0001-9496-158X)
- Xinshu Zhang (ORCID: https://orcid.org/0000-0003-2263-1201)
- Chen Qian (ORCID: https://orcid.org/0000-0002-6882-9590)
- Liting Hu
Institutions
- University of Nevada, Reno (US)
- University of California, Santa Cruz (US)
Publication Details
- Published
- 2024-10-28
- DOI
- https://doi.org/10.1109/icnp61940.2024.10858529
- Primary Topic
- Algorithms and Data Compression
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation