CN105653556B - Data aging method and device - Google Patents
Data aging method and device Download PDFInfo
- Publication number
- CN105653556B CN105653556B CN201410674791.6A CN201410674791A CN105653556B CN 105653556 B CN105653556 B CN 105653556B CN 201410674791 A CN201410674791 A CN 201410674791A CN 105653556 B CN105653556 B CN 105653556B
- Authority
- CN
- China
- Prior art keywords
- memory data
- activity
- data
- indication table
- access
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a data aging method and a data aging device, relates to the technical field of computers, and aims to solve the problems that in the prior art, the aging efficiency of memory database data is low, conflict is easy, and data isolated points are possibly generated. The method comprises the following steps: each program operation unit respectively maintains an activity indication table for memory data used by the program operation unit in real time, and the activity indication table is used for arranging indexes of the memory data into a series of data nodes according to the access activity of the memory data; and each program operation unit releases the memory data with the access activity lower than a preset access threshold according to the corresponding activity indication table.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a data aging method and apparatus.
Background
A Memory Database (Memory Database System) is a resource management method commonly used in current real-time communication devices, when a certain process or thread accesses a certain data in the Memory Database, the data is in a use state, and other processes and threads cannot operate the data. But the in-memory database itself does not provide data aging functionality to release infrequently used data.
In the prior art, generally, each product creates an independent aging thread according to its own business logic, and cyclically scans each data table in the database by calling a query interface of the database, deletes data that meets an aging condition, and recovers a corresponding memory space.
However, the above method needs to occupy an independent CPU thread to implement resource aging, which not only puts higher requirements on the CPU performance, but also easily causes the lock conflict between the aging daemon thread and the service data processing thread, that is, either one of the aging thread and the service data processing thread locks the memory data being accessed by the aging daemon thread, thereby preventing the other from accessing the memory data and affecting the normal operation of the other. Therefore, the lock conflict reduces the system performance on one hand, and also causes data orphan on the other hand, that is, when the aging thread accesses a certain memory data, but the memory data is frequently locked by the service data processing thread and cannot be accessed, the memory data cannot be released for a long time, which results in difficult resource recovery. In addition, the aging method must scan the whole data table, the scanning period is long, and the aging efficiency is low.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a data aging method and device, so as to solve the problems in the prior art that the aging efficiency of the memory database is low, the memory database is easy to conflict, and data orphans may be generated.
In one aspect, the present invention provides a data aging method, including: each program operation unit respectively maintains an activity indication table for memory data used by the program operation unit in real time, and the activity indication table is used for arranging indexes of the memory data into a series of data nodes according to the access activity of the memory data; and each program operation unit releases the memory data with the access activity lower than a preset access threshold according to the corresponding activity indication table.
Optionally, the program execution unit includes a thread and/or a process.
Optionally, the maintaining, in real time, the activity indicator table for the memory data used by each program running unit includes: when each program operation unit accesses the memory data of a preset type for the first time, creating a corresponding activity indication table for the memory data of the preset type, and placing an index of the accessed memory data as a data node at the tail of the activity indication table; each program operation unit accesses the preset type of memory data each time: under the condition that the index of the accessed memory data already exists in the corresponding activity indication table, updating the data node corresponding to the accessed memory data to the tail of the corresponding activity indication table; and under the condition that the index of the accessed memory data is not in the corresponding activity indication table, creating a data node corresponding to the accessed memory data, and placing the created data node at the tail end of the corresponding activity indication table.
Optionally, the activity indication table is specifically configured to: and arranging the indexes of the memory data into a series of data nodes according to the sequence of the access activity of the memory data from low to high.
Optionally, the releasing, by each program running unit according to the corresponding activity indicator table, the memory data with the access activity lower than the preset access threshold includes: each program operation unit respectively starts aging operation; each program operation unit determines whether the access activity of the memory data corresponding to the head node of the activity indication table is lower than the preset access threshold value; under the condition that the access activity of the memory data corresponding to the head node is lower than the preset access threshold, releasing the head node and the memory data corresponding to the head node, continuously determining whether the access activity of the memory data corresponding to the next node of the activity indication table is lower than the preset access threshold or not until the access activity of the memory data corresponding to the node of the activity indication table is higher than or equal to the preset access threshold, and exiting the aging operation; and exiting the aging operation under the condition that the access activity of the memory data corresponding to the head node is higher than or equal to the preset access threshold.
In another aspect, the present invention further provides a data aging apparatus, including: the maintenance unit is used for respectively maintaining an activity indication table for the memory data used by each program operation unit in real time, and the activity indication table arranges the indexes of the memory data into a series of data nodes according to the access activity of the memory data; and the releasing unit is used for releasing the memory data with the access activity lower than a preset access threshold according to the corresponding activity indication tables respectively.
Optionally, the program execution unit includes a thread and/or a process.
Optionally, the maintenance unit is specifically configured to: when each program operation unit accesses the memory data of a preset type for the first time, creating a corresponding activity indication table for the memory data of the preset type, and placing an index of the accessed memory data as a data node at the tail of the activity indication table; each program operation unit accesses the preset type of memory data each time: under the condition that the index of the accessed memory data already exists in the corresponding activity indication table, updating the data node corresponding to the accessed memory data to the tail of the corresponding activity indication table; and under the condition that the index of the accessed memory data is not in the corresponding activity indication table, creating a data node corresponding to the accessed memory data, and placing the created data node at the tail end of the corresponding activity indication table.
Optionally, the activity indication table is specifically configured to arrange the indexes of the memory data into a series of data nodes according to a sequence of access activity of the memory data from low to high.
Optionally, the release unit is specifically configured to: respectively starting aging operation for each program operation unit; determining whether the access activity of the memory data corresponding to the head node of the activity indication table is lower than the preset access threshold value or not for each program operation unit; under the condition that the access activity of the memory data corresponding to the head node is lower than the preset access threshold, releasing the head node and the memory data corresponding to the head node, continuously determining whether the access activity of the memory data corresponding to the next node of the activity indication table is lower than the preset access threshold or not until the access activity of the memory data corresponding to the node of the activity indication table is higher than or equal to the preset access threshold, and exiting the aging operation; and exiting the aging operation under the condition that the access activity of the memory data corresponding to the head node is higher than or equal to the preset access threshold.
According to the data aging method and device provided by the embodiment of the invention, each program operation unit respectively maintains the activity indicator table for the memory data used by the program operation unit in real time, and then the memory data with the access activity lower than the preset access threshold is released according to the corresponding activity indicator table, so that on one hand, by executing the aging program in each program operation unit, lock conflict and data arc points caused by the operation of a single aging thread are effectively avoided; on the other hand, because the data nodes in the activity indication table are arranged according to the access activity of the corresponding memory data, the first data node which does not need to be released can be easily determined, and all the data nodes which do not need to be released can be determined by taking the node as a boundary, so that the aging program can be directly quitted, the aging program can be completed without scanning the whole memory database, and the aging efficiency is greatly improved.
Drawings
FIG. 1 is a flow chart of a data aging method provided by an embodiment of the invention;
FIG. 2 is a diagram illustrating the organization of resources in an activity indicator table according to a preferred embodiment of the present invention;
FIG. 3 is a flowchart of the creation of an activity indication table in the preferred embodiment of the present invention;
FIG. 4 is a flowchart of the updating of the liveness indication table in the preferred embodiment of the present invention;
FIG. 5 is a flow chart of data fast aging using an activity indication table in the preferred embodiment of the present invention;
fig. 6 is a schematic structural diagram of a data aging apparatus according to an embodiment of the present invention.
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are merely illustrative of the invention and do not limit the invention.
As shown in fig. 1, an embodiment of the present invention provides a data aging method, including:
s11, each program operation unit maintains an activity indication table in real time for the memory data used by the program operation unit, and the activity indication table is used for arranging the indexes of the memory data into a series of data nodes according to the access activity of the memory data;
and S12, each program operation unit releases the memory data with the access activity lower than a preset access threshold according to the corresponding activity indication table.
In the data aging method provided by the embodiment of the invention, each program operation unit respectively maintains the activity indicator table for the memory data used by the program operation unit in real time, and then the memory data with the access activity lower than the preset access threshold value is released according to the corresponding activity indicator table, so that on one hand, by executing the aging program in each program operation unit, lock conflict and data arc points caused by the operation of a single aging thread are effectively avoided; on the other hand, because the data nodes in the activity indication table are arranged according to the access activity of the corresponding memory data, the first data node which does not need to be released can be easily determined, and all the data nodes which do not need to be released can be determined by taking the node as a boundary, so that the aging program can be directly quitted, the aging program can be completed without scanning the whole memory database, and the aging efficiency is greatly improved.
It should be noted that, in the embodiment of the present invention, a program operation unit refers to a unit that can relatively independently complete a certain function, and may include a process or a thread. A program may include one or more program execution units, each of which may require various data to be called during execution. For example, a user needs to query a call charge detail list, which may include a user thread for querying the user and a charge thread for querying the charge, the user thread needs to access a user identity database, and the charge thread needs to access a short message charging database, a telephone charging database, a network traffic charging database, and other value-added service databases, which may all reside in a memory to form a memory database. The memory database may be an internal component or a combination of an external component and an internal component, which is not limited in the embodiments of the present invention. The calling frequency of each memory data item in each type of memory data can be represented by access activity, and the higher the calling frequency is, the more active the memory data item is. According to different concerns of the user on the frequency degree in different time ranges, the access activity degree also has multiple expression modes, and after one memory data is accessed, the corresponding access activity degree is correspondingly updated.
In step S11, each program operation unit maintains an activity indicator table for the memory data used by itself in real time, that is, the user thread maintains an activity indicator table for the user identity database, and the query thread maintains an activity indicator table for the corresponding short message charging database, the telephone charging database, the network traffic charging database, and other value added service databases. The data activity indication table may be organized as shown in FIG. 2.
Specifically, the step of maintaining the activity indicator table in real time for the memory data used by each program running unit may specifically include:
when each program operation unit accesses the memory data of a preset type for the first time, creating a corresponding activity indication table for the memory data of the preset type, and placing an index of the accessed memory data as a data node at the tail of the activity indication table;
each program operation unit accesses the preset type of memory data each time:
under the condition that the index of the accessed memory data already exists in the corresponding activity indication table, updating the data node corresponding to the accessed memory data to the tail of the corresponding activity indication table;
and under the condition that the index of the accessed memory data is not in the corresponding activity indication table, creating a data node corresponding to the accessed memory data, and placing the created data node at the tail end of the corresponding activity indication table.
Still taking the procedure of user's telephone fee inquiry as an example for explanation, when the user thread accesses the user identity database for the first time, a corresponding activity indication table is created for the database, and the index (e.g. index serial number 22) of the accessed user identity data is placed at the end of the activity indication table as a data node. As the program runs, the subscriber program may also access other subscriber identity data, whose corresponding index sequence numbers are, for example, 8 and 14 in sequence, and then when accessing data corresponding to index sequence numbers 8 and 14, the data nodes corresponding to 8 and 14 are also placed at the end of the liveness indication table in sequence. After the thread accesses the user identity data with the sequence number of 22 again, the data node corresponding to the sequence number of 22 is placed at the end of the activity indication table, and the process is repeated in this way, so that the memory data corresponding to the data node arranged at the end of the activity indication table is always most active. That is to say, the liveness indication table arranges the indexes of the memory data into a series of data nodes according to the sequence of the access liveness of the memory data from low to high. Similarly, the query thread maintains several such liveness indication tables in a similar manner.
Of course, in other embodiments of the present invention, the activity indication table may also arrange the indexes of the memory data into a series of data nodes according to the order of the access activity of the memory data from high to low, as long as the first data node that does not need to be released can be easily determined and all the data nodes that do not need to be released can be determined with the node as a boundary, which is not limited in the embodiments of the present invention.
Optionally, in step S12, releasing, by each program operating unit according to the corresponding activity indicator table, the memory data with an access activity lower than the preset access threshold may include:
each program operation unit respectively starts aging operation;
each program operation unit determines whether the access activity of the memory data corresponding to the head node of the activity indication table is lower than the preset access threshold value;
under the condition that the access activity of the memory data corresponding to the head node is lower than the preset access threshold, releasing the head node and the memory data corresponding to the head node, continuously determining whether the access activity of the memory data corresponding to the next node of the activity indication table is lower than the preset access threshold or not until the access activity of the memory data corresponding to the node of the activity indication table is higher than or equal to the preset access threshold, and exiting the aging operation;
and exiting the aging operation under the condition that the access activity of the memory data corresponding to the head node is higher than or equal to the preset access threshold.
Specifically, for the telephone charge query program in the foregoing embodiment, after the user thread and the query thread perform corresponding operations, the aging operations may be respectively started, and it is determined whether the access activity of the head node of the activity indication table corresponding to each user thread is lower than the preset access threshold, so as to determine whether to release corresponding memory data. For example, if the preset access threshold is 1 time accessed in the last 1 minute, the access activity of the memory data corresponding to the head node is 0 time accessed in the last 1 minute, and 1 time accessed in the last 2 minutes, and the access activity of the memory data corresponding to the head node is lower than the preset access threshold, so as to release the head node and the memory data corresponding to the head node, and use the next data node of the head node as a new head node, and continuously determine whether the access activity of the memory data corresponding to the new head node is lower than the preset access threshold. If the access activity of the memory data corresponding to the new head node is accessed once in the last 30 seconds and is higher than the preset access threshold, it can be determined that the access activity of the memory data corresponding to the data nodes after the new head node is higher than the preset access threshold, and therefore, the aging program is directly exited without examining the remaining data nodes and the memory data corresponding to the data nodes one by one. In this embodiment, the access activity of the memory data corresponding to the data node is measured by the reciprocal of the time interval between the current time and the latest access to the memory data, but the present invention is not limited thereto, and other indicators that represent the access activity of the data or the resource, such as the historical access times, the average access interval, the average access frequency, and the like, may also be weighted differently and incorporated into the access activity investigation system. The embodiments of the present invention are not limited thereto.
The data aging method provided by the invention is explained in detail by specific examples.
As shown in FIG. 3, the liveness indication table may be created as follows.
Step 201, a data node is created using a database interface.
At step 202, the activity level of the thread indicates that the table is empty, and then the current data node is taken as the first node of the table.
And step 203, according to the liveness definition, the newly created data node has the highest liveness, and the newly created data node is moved to the tail part of the liveness indication table.
As shown in FIG. 4, the liveness indication table may be updated as follows.
Step 301, a data node is queried using a database interface.
And step 302, according to the liveness definition, the newly inquired data node has the highest liveness, and the newly inquired data node is moved to the tail part of the liveness indication table.
In this embodiment, the data nodes are adjusted in position in the activity indication table after being queried, which is equivalent to dynamically implementing activity sorting of the data nodes. The nodes with low access frequency can slowly focus on the head position of the indication list.
As shown in fig. 5, a thread or process may perform fast aging of resources as follows.
Step 401, acquiring a head node of an activity indication table on a thread, and starting scanning from the head node. The head node is the least active node as defined by the liveness indication table.
Step 402, if the current node is not empty and reaches the aging condition, the database interface is called to delete the current node, otherwise, the step 404 is skipped.
In step 403, the head node of the current indication table is updated to be the next node, and then the scanning of the next node is continued in step 401.
And step 404, if the head node of the current table is empty, indicating that the current indication table is empty, and exiting the current aging process. If the current head node does not reach the aging condition, the head node is the least active node according to the definition of the activity indication table, so that the subsequent nodes cannot reach the aging condition necessarily, and the current aging process can be directly exited.
It should be noted that, in the data activity indication table in the foregoing embodiment, multiple copies may be instantiated in each thread according to business needs, and each data table type may correspond to one activity indication table.
Correspondingly, as shown in fig. 6, an embodiment of the present invention further provides a data aging apparatus, including:
a maintenance unit 60, configured to maintain an activity indicator table in real time for the memory data used by each program operation unit, where the activity indicator table arranges indexes of the memory data into a series of data nodes according to access activity of the memory data;
and the releasing unit 62 is configured to release the memory data with the access activity lower than the preset access threshold according to the corresponding activity indication table maintained by the maintaining unit 60.
In the data aging device provided in the embodiment of the present invention, the maintenance unit 60 can respectively maintain the activity indicator table for the memory data used by each program operation unit in real time, and the release unit 62 can release the memory data with the access activity lower than the preset access threshold according to the corresponding activity indicator table, so that, on one hand, by executing the aging program in each program operation unit, lock conflicts and data orphans caused by running a separate aging thread are effectively avoided; on the other hand, because the data nodes in the activity indication table are arranged according to the access activity of the corresponding memory data, the first data node which does not need to be released can be easily determined, and all the data nodes which do not need to be released can be determined by taking the node as a boundary, so that the aging program can be directly quitted, the aging program can be completed without scanning the whole memory database, and the aging efficiency is greatly improved.
It should be noted that, in this embodiment, a program running unit refers to a unit that can relatively independently complete a certain function, and may include a process or a thread. A program may include one or more program execution units, each of which may require various data to be called during execution.
Optionally, the maintenance unit 20 may be specifically configured to:
when each program operation unit accesses the memory data of a preset type for the first time, creating a corresponding activity indication table for the memory data of the preset type, and placing an index of the accessed memory data as a data node at the tail of the activity indication table;
each program operation unit accesses the preset type of memory data each time:
under the condition that the index of the accessed memory data already exists in the corresponding activity indication table, updating the data node corresponding to the accessed memory data to the tail of the corresponding activity indication table;
and under the condition that the index of the accessed memory data is not in the corresponding activity indication table, creating a data node corresponding to the accessed memory data, and placing the created data node at the tail end of the corresponding activity indication table.
Optionally, the activity indication table is specifically configured to arrange the indexes of the memory data into a series of data nodes according to a sequence of access activity of the memory data from low to high.
Optionally, the releasing unit 62 may be specifically configured to:
respectively starting aging operation for each program operation unit;
determining whether the access activity of the head node of the activity indication table is lower than the preset access threshold value or not for each program operation unit;
under the condition that the access activity of the memory data corresponding to the head node is lower than the preset access threshold, releasing the head node and the memory data corresponding to the head node, continuously determining whether the access activity of the memory data corresponding to the next node of the activity indication table is lower than the preset access threshold or not until the access activity of the memory data corresponding to the node of the activity indication table is higher than or equal to the preset access threshold, and exiting the aging operation;
exiting the aging operation if the head node access liveness is greater than or equal to the preset access threshold.
Although the preferred embodiments of the present invention have been disclosed for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible, and the scope of the invention should not be limited to the embodiments described above.
Claims (8)
1. A method of data aging, comprising:
each program operation unit respectively maintains an activity indication table for memory data used by the program operation unit in real time, and the activity indication table is used for arranging indexes of the memory data into a series of data nodes according to the access activity of the memory data;
each program operation unit releases memory data with access activity lower than a preset access threshold according to the corresponding activity indication table;
the releasing, by each program running unit according to the corresponding activity indicator table, the memory data with the access activity lower than a preset access threshold includes:
each program operation unit respectively starts aging operation;
each program operation unit determines whether the access activity of the memory data corresponding to the head node of the activity indication table is lower than the preset access threshold value;
under the condition that the access activity of the memory data corresponding to the head node is lower than the preset access threshold, releasing the head node and the memory data corresponding to the head node, continuously determining whether the access activity of the memory data corresponding to the next node of the activity indication table is lower than the preset access threshold or not until the access activity of the memory data corresponding to the node of the activity indication table is higher than or equal to the preset access threshold, and exiting the aging operation;
and exiting the aging operation under the condition that the access activity of the memory data corresponding to the head node is higher than or equal to the preset access threshold.
2. The method of claim 1, wherein the unit of program execution comprises a thread and/or a process.
3. The method according to claim 1 or 2, wherein the step of maintaining the activity indicator table in real time for the memory data used by each program running unit comprises:
when each program operation unit accesses the memory data of a preset type for the first time, creating a corresponding activity indication table for the memory data of the preset type, and placing an index of the accessed memory data as a data node at the tail of the activity indication table;
each program operation unit accesses the preset type of memory data each time:
under the condition that the index of the accessed memory data already exists in the corresponding activity indication table, updating the data node corresponding to the accessed memory data to the tail of the corresponding activity indication table;
and under the condition that the index of the accessed memory data is not in the corresponding activity indication table, creating a data node corresponding to the accessed memory data, and placing the created data node at the tail end of the corresponding activity indication table.
4. The method according to claim 1 or 2, wherein the liveness indication table is specifically configured to:
and arranging the indexes of the memory data into a series of data nodes according to the sequence of the access activity of the memory data from low to high.
5. A data aging apparatus, comprising:
the maintenance unit is used for respectively maintaining an activity indication table for the memory data used by each program operation unit in real time, and the activity indication table arranges the indexes of the memory data into a series of data nodes according to the access activity of the memory data;
the release unit is used for releasing the memory data with the access activity lower than a preset access threshold according to the corresponding activity indication tables respectively;
the release unit is specifically configured to:
respectively starting aging operation for each program operation unit;
determining whether the access activity of the memory data corresponding to the head node of the activity indication table is lower than the preset access threshold value or not for each program operation unit;
under the condition that the access activity of the memory data corresponding to the head node is lower than the preset access threshold, releasing the head node and the memory data corresponding to the head node, continuously determining whether the access activity of the memory data corresponding to the next node of the activity indication table is lower than the preset access threshold or not until the access activity of the memory data corresponding to the node of the activity indication table is higher than or equal to the preset access threshold, and exiting the aging operation;
and exiting the aging operation under the condition that the access activity of the memory data corresponding to the head node is higher than or equal to the preset access threshold.
6. The apparatus of claim 5, wherein the unit of program execution comprises a thread and/or a process.
7. The device according to claim 5 or 6, wherein the maintenance unit is specifically configured to:
when each program operation unit accesses the memory data of a preset type for the first time, creating a corresponding activity indication table for the memory data of the preset type, and placing an index of the accessed memory data as a data node at the tail of the activity indication table;
each program operation unit accesses the preset type of memory data each time:
under the condition that the index of the accessed memory data already exists in the corresponding activity indication table, updating the data node corresponding to the accessed memory data to the tail of the corresponding activity indication table;
and under the condition that the index of the accessed memory data is not in the corresponding activity indication table, creating a data node corresponding to the accessed memory data, and placing the created data node at the tail end of the corresponding activity indication table.
8. The apparatus according to claim 5 or 6, wherein the activity indication table is specifically configured to arrange the indexes of the memory data into a series of data nodes in an order from low to high of access activity of the memory data.
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410674791.6A CN105653556B (en) | 2014-11-21 | 2014-11-21 | Data aging method and device |
PCT/CN2015/080504 WO2016078388A1 (en) | 2014-11-21 | 2015-06-01 | Data aging method and apparatus |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410674791.6A CN105653556B (en) | 2014-11-21 | 2014-11-21 | Data aging method and device |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105653556A CN105653556A (en) | 2016-06-08 |
CN105653556B true CN105653556B (en) | 2021-03-12 |
Family
ID=56013223
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410674791.6A Active CN105653556B (en) | 2014-11-21 | 2014-11-21 | Data aging method and device |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN105653556B (en) |
WO (1) | WO2016078388A1 (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106657249B (en) * | 2016-10-25 | 2019-07-09 | 杭州迪普科技股份有限公司 | Update the method and device of cache resources |
CN110162958B (en) * | 2018-10-18 | 2023-04-18 | 腾讯科技(深圳)有限公司 | Method, apparatus and recording medium for calculating comprehensive credit score of device |
CN110389958B (en) * | 2019-07-26 | 2022-05-17 | 迈普通信技术股份有限公司 | Method and device for dynamically adjusting aging frequency of hardware table entry and computer storage medium |
CN111752951B (en) * | 2020-06-28 | 2023-09-08 | 中国银行股份有限公司 | Database table processing method and device |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070067575A1 (en) * | 2005-09-20 | 2007-03-22 | Morris John M | Method of managing cache memory based on data temperature |
US8086804B2 (en) * | 2008-09-24 | 2011-12-27 | Oracle America, Inc. | Method and system for optimizing processor performance by regulating issue of pre-fetches to hot cache sets |
CN101620618B (en) * | 2009-07-24 | 2011-11-30 | 中兴通讯股份有限公司 | Method and device for maintaining data stored in memory |
US8914599B2 (en) * | 2010-10-12 | 2014-12-16 | Red Hat, Inc. | Lock amortization in a data counter |
CN103810115B (en) * | 2012-11-15 | 2017-10-13 | 深圳市腾讯计算机系统有限公司 | The management method and device of a kind of memory pool |
CN103150259B (en) * | 2013-03-22 | 2016-03-30 | 华为技术有限公司 | A kind of method for recovering internal storage and device |
CN103440207B (en) * | 2013-07-31 | 2017-02-22 | 北京智谷睿拓技术服务有限公司 | Caching method and caching device |
CN103914265B (en) * | 2014-04-09 | 2016-11-23 | 江苏物联网研究发展中心 | Cluster fine granularity EMS memory management process |
-
2014
- 2014-11-21 CN CN201410674791.6A patent/CN105653556B/en active Active
-
2015
- 2015-06-01 WO PCT/CN2015/080504 patent/WO2016078388A1/en active Application Filing
Also Published As
Publication number | Publication date |
---|---|
CN105653556A (en) | 2016-06-08 |
WO2016078388A1 (en) | 2016-05-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105677240B (en) | Data-erasure method and system | |
CN110609865B (en) | Information synchronization method, device and system | |
CN107273540B (en) | Distributed search and index updating method, system, server and computer equipment | |
JP6103037B2 (en) | Computer system | |
CN106302632B (en) | Downloading method of basic mirror image and management node | |
EP2933723A1 (en) | Method, device and terminal equipment for cleaning up memory | |
CN105653556B (en) | Data aging method and device | |
CN110543512B (en) | Information synchronization method, device and system | |
CN112104486A (en) | Kubernetes container-based network endpoint slicing method and system | |
CN110990142A (en) | Concurrent task processing method and device, computer equipment and storage medium | |
CN111797091A (en) | Method and device for querying data in database, electronic equipment and storage medium | |
CN113553339B (en) | Data query method, middleware, electronic device and storage medium | |
CN111913793A (en) | Distributed task scheduling method, device, node equipment and system | |
EP3422186B1 (en) | Method, device and system for preventing memory data loss | |
CN115525631A (en) | Database data migration method, device, equipment and storage medium | |
US10402370B2 (en) | Information processing method and electronic apparatus | |
CN107729421B (en) | The execution method, apparatus and storage medium of storing process | |
CN107526690B (en) | Method and device for clearing cache | |
CN110633302A (en) | Processing method and device for massive structured data | |
CN111090513B (en) | Method for detecting link health state of Internet of vehicles platform terminal and storage medium | |
CN113297002B (en) | Database working mode switching method and device | |
CN113268487B (en) | Data statistical method, device and computer readable storage medium | |
CN108762928B (en) | Processing method and system for elastic scaling service during execution operation | |
CN113253931B (en) | Method suitable for automatically switching and using cloud data disk for rabbitmq | |
CN115686583B (en) | Mass Internet of things equipment upgrading method and device, electronic equipment and storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |