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