CHDAER:Consistent Hashing-based Data Allocation for Efficient Recommendation in Edge Environment

With the rapid development of the mobile internet, there is an increasing demand for quick access to effective data. Consequently, more research is focusing on data processing and optimization of recommendation systems in edge computing environments. However, in traditional edge computing environments, recommendation systems typically depend on frequent data query interactions among all edge servers to obtain results, which increases time delays. This issue is further exacerbated by the need to process large amounts of data within edge storage systems. To address this challenge, we propose an efficient recommendation method based on data allocation. Specifically, during the data allocation process, we first extract similar features of users, ensuring that the characteristics of some user data align as closely as possible with the overall user feature distribution. Then, using an improved consistent hashing algorithm, we achieve a uniform data layout, allowing the recommendation system to efficiently and accurately provide recommendations by querying data from the nearest edge server to the user. Finally, extensive experiments on real datasets show that our method significantly reduces time delays and improves the accuracy of recommendation results.

Authors

Institutions

Publication Details

Published
2024-10-20
DOI
https://doi.org/10.1145/3627673.3679809
Citations
1
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CHDAER:Consistent Hashing-based Data Allocation for Efficient Recommendation in Edge Environment

Xiaolong Xu, Chao Yan, Wanchun Dou, Xiaokang Zhou et al.
1 citations
Caching and Content Delivery
0.35
article

CHDAER:Consistent Hashing-based Data Allocation for Efficient Recommendation in Edge Environment

Xiaolong Xu, Chao Yan, Wanchun Dou, Xiaokang Zhou, Xuyun Zhang, Lianyong Qi, Feng Zhu, Rong Jiang
article en
1 citations

Abstract

With the rapid development of the mobile internet, there is an increasing demand for quick access to effective data. Consequently, more research is focusing on data processing and optimization of recommendation systems in edge computing environments. However, in traditional edge computing environments, recommendation systems typically depend on frequent data query interactions among all edge servers to obtain results, which increases time delays. This issue is further exacerbated by the need to process large amounts of data within edge storage systems. To address this challenge, we propose an efficient recommendation method based on data allocation. Specifically, during the data allocation process, we first extract similar features of users, ensuring that the characteristics of some user data align as closely as possible with the overall user feature distribution. Then, using an improved consistent hashing algorithm, we achieve a uniform data layout, allowing the recommendation system to efficiently and accurately provide recommendations by querying data from the nearest edge server to the user. Finally, extensive experiments on real datasets show that our method significantly reduces time delays and improves the accuracy of recommendation results.

Nanjing University of Information Science and Technology (CN), Qufu Normal University (CN), China University of Petroleum, East China (CN), Yunnan University of Finance And Economics (CN), Kansai University (JP), Nanjing University (CN), Macquarie University (AU)
Openalex Percentile: Top 38%
Caching and Content Delivery
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.