Simulation of large-scale power database cache conflict handling based on frequent itemsets

Read full text Summarise with VIRAT
Authors: Jiaqi Zhou, Hongyan Zhang, Dan Wang, Weilin Zhang
Cited by: 0
References: 2

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Abstract This paper proposes a simulation method based on frequent itemsets to address the issue of imbalanced cache conflict handling caused by uneven data distribution in power databases. Firstly, the decision equilibrium coefficient is introduced to evaluate database load and identify conflict patterns; Secondly, frequent itemsets are mined, and conflict object sets are constructed by combining joint variables and cross entropy loss functions; Then, the conflicting objects are dispersed to different cache locations through permutation functions, and uniqueness checks are performed to ensure the validity of the mapping. The experimental results show that this method significantly improves the cache hit rate and achieves better cache load balancing performance compared to traditional strategies.

Fields of Study & Subjects

Advanced Database Systems and Queries Caching and Content Delivery Data Mining Algorithms and Applications

Publication details

Journal / source
Journal of Physics Conference Series
Volume
3192
Issue
1
Pages
012027–012027
Publication date
1 March 2026
Language
EN