Industrial Internet Identifier Resolution Caching Method, Public Recursive Nodes and Devices

By combining in-memory and disk databases, and dynamically scheduling data based on update time and query frequency, the problems of excessive load on recursive nodes and low caching efficiency are solved, achieving more efficient data storage and retrieval.

CN116881212BActive Publication Date: 2026-04-03CHINA UNITED NETWORK COMM GRP CO LTD
3 Cites 0 Cited by

Patent Information

Application Number
CN202310838991.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-07-10
Publication Date
2026-04-03
Estimated Expiration
2043-07-10

AI Technical Summary

Technical Problem

In existing technologies, the differences in application load among recursive nodes lead to problems such as excessive load on some recursive nodes and low caching efficiency.

Method used

A caching method combining in-memory databases and disk databases is adopted. A sorting factor is set according to the arrival time and hit count of the identified data, and the data is dynamically scheduled between the two. Data with more recent update time and more frequent queries is stored in the in-memory database first, so as to improve query speed and caching efficiency.

Benefits of technology

By dynamically scheduling data storage, the cache query speed is improved, the load pressure on recursive nodes is reduced, and the problem of low cache efficiency caused by application load differences is solved.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

This invention provides an industrial internet identifier resolution caching method, a public recursive node, a device, and a medium, relating to the field of network technology. The method includes: responding to the arrival of first identifier data, determining whether the in-memory database has free space; if so, storing it in both the in-memory database and the disk database; otherwise, storing it directly in the disk database; recording the arrival time of the first identifier data in the disk database and setting the hit count to a preset initial value; responding to an identifier data query request and finding the requested second identifier data in the disk database, updating the arrival time of the second identifier data to the current time and incrementing the hit count by one; sorting all identifier data based on a set sorting factor; and selecting a corresponding number of identifier data from the disk database and writing them to the in-memory database according to the sorting result and the current free space size of the in-memory database. This invention can solve the current technical problems of excessive load on recursive nodes and low caching efficiency.
Need to check novelty before this filing date? Find Prior Art