Labeled graph partitioning scheme for distributed edge caching

Published: 2024, Last Modified: 13 Nov 2024Future Gener. Comput. Syst. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•Demonstrate limits of traditional schemes for distributed edge cache graph data.•A graph partitioning scheme is proposed to ensure high hit cache rates and low edge cuts.•Exploit frequent query patterns to mine hot graph data for edge caching.•Conduct comprehensive experiments to evaluate performance and efficiency metrics.
Loading