The application relates to a
graph database adjacency list cache management method based on dynamic weights, which comprises the following steps: receiving a request for querying a node
adjacency list, generating a new cache item according to the
adjacency list of the node if the request is not hit, determining the inherent weight of the cache item based on the inherent attributes of the node, setting the heat value of the cache item as an
initial heat value, and obtaining the comprehensive weight of the cache item based on the inherent weight and the heat value; if the request is hit, obtaining the historical heat value of the cache item, determining a new heat value based on a smooth increment strategy and the historical heat value, performing weighted summation on the new heat value and the inherent weight of the cache item to obtain the comprehensive weight of the cache item, and deleting the cache item with the minimum comprehensive weight under the condition that the cache space is insufficient. Through the application, the problem of low
cache hit rate of a
graph database is solved, the inherent weight avoids the adjacency
list of a super node from being occupied by common nodes, the heat value can take into account the common nodes that are suddenly popular, and the overall
cache hit rate is improved.