.png){kind=icon}
Return
A Distributed Learned Hash Table
.png){kind=icon}
PRE
AI
DOI：10.1109/TON.2026.3664088.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 LLM serving, distributed storage, databases, content delivery 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 recursive machine learning models as the Learned Hash Function to map and retrieve data across a distributed system while preserving the inherent order of data. LEAD includes the designs to minimize range query latency and message cost while maintaining high scalability and resilience to network churn. Our comprehensive evaluations, conducted in both testbed implementation and simulations, demonstrate that LEAD achieves tremendous advantages in system efficiency compared to existing range query methods in large-scale distributed systems, reducing query latency and message cost by 80% to 90%+. Furthermore, LEAD exhibits scalability and robustness against system churn, providing a robust, scalable structure for efficient data retrieval in distributed key-value systems.
Keywords:
Key-value store
learned hashing
DHT
Journal
I
IF:
0
Papers:
551
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveDBST: A Scalable Peer-to-Peer Distributed Information System Supporting Multi-Attribute Range Query
PREAI
ShareSaveShareSave
ShareSave
View more