![]()
Diya Kapoor
Independent Researcher
India
Abstract
Efficient data retrieval in distributed databases remains a critical challenge due to data distribution across multiple nodes, network latency, and potential load imbalance. This paper explores the application of hashing techniques to enhance retrieval speed and balance query loads in distributed database systems. We analyze different hashing methods, including consistent hashing and static hashing, for their impact on lookup times and system scalability. A comparative statistical study of retrieval latency and load distribution is presented. Experimental results indicate that consistent hashing significantly improves data retrieval efficiency by minimizing rehashing overhead and balancing query loads, especially in dynamic distributed environments. The study concludes that hashing-based data partitioning strategies offer scalable solutions for improving distributed database performance.
Keywords
Distributed databases, data retrieval efficiency, hashing techniques, consistent hashing, data partitioning, load balancing.
References
- Karger, D., Lehman, E., Leighton, F.T., Panigrahy, R., Levine, M., & Lewin, D. (1997). Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 654–663.
- Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., & Balakrishnan, H. (2001). Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 11(1), 17–32.
- Zhang, Y., Zhao, H., & Li, Z. (2015). Load balancing in distributed databases: A survey. Journal of Network and Computer Applications, 58, 87–95.
- Li, M., & Chen, Y. (2018). Efficient data retrieval in distributed systems using consistent hashing. International Journal of Distributed Systems and Technologies, 9(4), 15–27.
- Wang, J., Zhou, X., & Xu, L. (2019). Adaptive hashing techniques for dynamic distributed databases. IEEE Transactions on Parallel and Distributed Systems, 30(5), 1123–1135.
- Thaler, D., & Ravishankar, C. (1998). Using name-based mappings to increase hit rates. Proceedings IEEE INFOCOM, 1377–1384.