CN111737254B - Method and device for improving application cache utilization rate - Google Patents
Method and device for improving application cache utilization rate Download PDFInfo
- Publication number
- CN111737254B CN111737254B CN202010472351.8A CN202010472351A CN111737254B CN 111737254 B CN111737254 B CN 111737254B CN 202010472351 A CN202010472351 A CN 202010472351A CN 111737254 B CN111737254 B CN 111737254B
- Authority
- CN
- China
- Prior art keywords
- leaf node
- data record
- node
- data
- cache
- 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
- 238000000034 method Methods 0.000 title claims abstract description 46
- 230000004992 fission Effects 0.000 claims description 27
- 238000010276 construction Methods 0.000 claims description 13
- 238000003780 insertion Methods 0.000 description 11
- 230000037431 insertion Effects 0.000 description 11
- 230000008569 process Effects 0.000 description 11
- 238000012217 deletion Methods 0.000 description 4
- 230000037430 deletion Effects 0.000 description 4
- 230000014759 maintenance of location Effects 0.000 description 3
- 230000009471 action Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
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
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
Abstract
The invention discloses a method and a device for improving the utilization rate of an application cache, which increase an expiration time for each data record in the cache; setting a global timer for the cache; the global timer scans the data in the cache at regular time, and the expired data is determined according to the expiration time of each data record; and deleting the expired data. The invention uses a global timer to carry out global scanning, reduces the number of data recording timers, accelerates the time interval for judging the data expiration and does not passively wait for detecting whether the data expiration is expired. In addition, the invention constructs indexes for the cached data by using the data expiration time, finds the corresponding data records according to the indexes when deleting in batch, and then deletes in batch, thereby improving the deleting efficiency.
Description
Technical Field
The invention relates to the field of application cache, in particular to a method and a device for improving application cache utilization rate.
Background
When an enterprise application provides services externally, the performance of the application often affects the user experience. There are many factors that affect the application performance, among which CPU, memory, IO, etc. are more common. The operation speed of the CPU is far higher than the read-write speed of the magnetic disk. Therefore, in order to improve the performance of the application, a common practice at present is to put frequently-accessed data into a cache, and when the same data is accessed again next time, the data is firstly searched from the cache, and if corresponding data is found in the cache, the hard disk does not need to be read, so that the IO times of the disk are reduced. Caching is increasingly used in projects, but if the cache expiration policy is not well planned, it results in a large amount of useless data being stored in the cache for a long time. Therefore, the application cannot effectively utilize the cache and finally needs to continuously access the disk. Resulting in a performance degradation of the application.
In order to delete useless data in the cache timely and efficiently, a cache expiration mechanism needs to be introduced, and the following two common methods are currently used.
The method comprises the following steps: active deletion
According to the method, when the data records are read into the cache from the hard disk for the first time, a timer is distributed for each data record, and the expiration time of the data records is monitored in real time. If the current time reaches the expiration time point of the data record, the timer triggers a data deleting action to automatically delete the data record from the cache and release the cache space so that a new data record can be loaded.
The disadvantages of this method are: the timer can monitor the expiration time of the data record in real time, so that the current time needs to be continuously compared with the expiration time, and CPU resources are greatly occupied. Meanwhile, the timer itself also occupies a part of the memory space, and if one timer is allocated to each data record, a large amount of memory space is also occupied, which results in a reduction in the number of real data records that can be cached in the memory.
The second method comprises the following steps: passive deletion
After the data record expires, the data record is not immediately deleted from the cache, but is determined to expire the next time the data is accessed. If the expiration time is reached, then the delete operation is de-expired. This has the advantage of eliminating the need to assign a timer to each data record, reducing the CPU burden.
The method has the following defects: however, this method has its own disadvantage that once a data record is not accessed all the time, the record is never deleted and always occupies the buffer space. Over time, there is still a large amount of useless data in the cache, resulting in degraded application performance.
Disclosure of Invention
In order to solve the above problems, the present invention provides a method and an apparatus for improving the utilization rate of an application cache, which increase the expiration time for each data record, and use a global timer to perform global scanning, thereby effectively improving the utilization rate of the cache.
The technical scheme of the invention is as follows: a method for improving application cache utilization rate comprises the following steps:
adding an expiration time for each data record in the cache;
setting a global timer for the cache;
the global timer scans the data in the cache at regular time, and the expired data is determined according to the expiration time of each data record;
and deleting the expired data.
Further, the method comprises the following steps:
and constructing an index tree by using the expiration time of each data record, marking the expiration time of the data record by using the key of each node in the index tree, and taking the corresponding value as real address information of the corresponding data record in the cache.
Further, constructing an index tree by using the expiration time of each data record specifically includes:
and finding the position to be inserted into the index tree according to the expiration time of the data record, and inserting the data record into the corresponding leaf node.
Further, finding a position to be inserted into the index tree according to the expiration time of the data record, and inserting the data record into the corresponding leaf node, specifically including:
judging the number of leaf nodes of a right subtree in the current branch;
if the right subtree in the current branch only has 1 leaf node and the number of elements in the leaf node does not reach the upper limit, inserting the data record into the leaf node;
if the right subtree in the current branch only has 1 leaf node and the number of elements in the leaf node reaches the upper limit, judging whether the leaf node points to a father node;
if the leaf node does not point to the father node, the fission operation is carried out, the last element in the leaf node is lifted to the father node, meanwhile, a new leaf node is formed by the fission of the father node, and the data record is inserted into the new leaf node;
if the leaf node points to the father node, a new leaf node is dynamically added under the leaf node, and the data record is inserted into the new leaf node;
if the right subtree in the current branch has 1 leaf node and a dynamically-increased leaf node under the leaf node, and the number of elements in the dynamically-increased leaf node does not reach the upper limit, inserting a data record into the dynamically-increased leaf node;
if the right sub-tree in the current branch has 1 leaf node and a dynamically-increased leaf node under the leaf node, and the number of elements in the dynamically-increased leaf node reaches the upper limit, node fission operation is performed, the last element in the first leaf node under the right sub-tree is lifted to a parent node, a new leaf node is formed by parent node fission, and a data record is inserted into the new leaf node formed by fission.
Further, the global timer scans the data in the cache at regular time, and determines the expired data according to the expiration time of each data record, which specifically includes:
finding the closest time point in the index tree according to the current time;
the real cache data corresponding to the index before the time point is the outdated data.
Further, the method comprises the steps of:
converting the expiration time into a time stamp form to form an expiration time stamp;
when the index tree is constructed, the time stamp of each data record is utilized for construction, namely the key of each node in the index tree is the expiration time stamp of the data record.
Further, in the method, an expiration time is added to the data record when the data record is loaded from the disk into the cache.
Further, the expiration time is the current time + the retention time.
The technical scheme of the invention also comprises a device for improving the utilization rate of the application cache, which comprises,
an expiration time increase module: adding an expiration time for each data record in the cache;
a global timer setting module: setting a global timer for the cache;
an expired data determination module: the global timer scans the data in the cache at regular time, and the expired data is determined according to the expiration time of each data record;
an expired data deleting module: and deleting the expired data.
Further, the method also comprises the following steps of,
the index tree construction module: and constructing an index tree by using the expiration time of each data record, marking the expiration time of the data record by using the key of each node in the index tree, and taking the corresponding value as real address information of the corresponding data record in the cache.
According to the method and the device for improving the utilization rate of the application cache, the global timer is used for global scanning, the number of data recording timers is reduced, the time interval for judging the expiration of data is accelerated, and the method and the device are not required to wait for detecting whether the data is expired passively. In addition, the invention constructs indexes for the cached data by using the data expiration time (based on the B + tree algorithm and improved on the basis), finds corresponding data records according to the indexes when deleting in batches, and then deletes in batches, thereby improving the deleting efficiency.
Drawings
FIG. 1 is a schematic flow chart of a method according to an embodiment of the present invention.
FIG. 2 is a conventional B + tree index building process.
FIG. 3 is an improved B + tree index building process of the present invention.
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings by way of specific examples, which are illustrative of the present invention and are not limited to the following embodiments.
Example one
As shown in fig. 1, the present embodiment provides a method for improving application cache utilization, including the following steps:
s1, adding an expiration time for each data record in the cache;
s2, setting a global timer for the cache;
s3, scanning the data in the cache regularly by using a global timer, and determining overdue data according to the overdue time of each data record;
and S4, deleting the expired data.
The method adds an expiration time to each data record, only uses one timer to carry out global scanning, reduces the number of the data record timers on one hand, accelerates the judgment of the time interval of data expiration on the other hand, and does not passively wait for detecting whether the data is expired or not.
Specifically, the application accesses a certain data record, and if the corresponding data record does not exist in the cache, the data record is loaded into the cache from the disk. At the same time, an expiration time is added for each data record. Note that the expiration time represents the absolute time at which the data expires. The expiration time is calculated as the current time + the retention time. For example, if the current time is 13 o 'clock 30 minutes at 5/25/2020 and the retention time is 30 minutes, the expiration time of the piece of data is 14 o' clock 00 minutes at 5/25/2020.
In consideration of the influence of slow deletion caused by simultaneous expiration of a large amount of data, the invention constructs an index for cached data by using the data expiration time in the cache (based on a B + tree algorithm and improves the B + tree algorithm). When deleting in batches, the corresponding data records are found according to the indexes, and then deleting in batches is carried out, so that the deleting efficiency is improved.
Specifically, an index tree is constructed by using the expiration time of each data record, the expiration time of each data record is marked by the key of each node in the index tree, and the corresponding value is real address information of the corresponding data record in the cache. When the cache timer carries out global scanning to judge which records are expired, only the closest time point in the index tree is found according to the current time, and the real cache data corresponding to the index before the time is deleted. The index tree is constructed based on the B + tree algorithm and improved on the basis, and due to the characteristics of the tree structure, the index of the expired data can be quickly found, so that useless cache is efficiently deleted, and the cache utilization rate is improved.
It should be noted that, in order to construct the index, the expiration time is converted into a timestamp form, for example, the timestamp corresponding to 5/25/2020/14/00 is 1590386400. When the index tree is constructed, the time stamp of each data record is utilized for construction, namely the key of each node in the index tree is the overdue time stamp of the data record.
The improved B + tree algorithm of the present invention is described below. For the convenience of understanding the technical solution, the construction algorithm of the traditional B + tree needs to be known first. For simplicity of the algorithm description, we illustrate a 3 rd order B + tree, assuming the insertion order is [3,7,9,23,45]. In a 3 rd order B + tree, there are at most 3 subtrees per node and at most 2 elements per node. The leaf nodes under each branch necessarily point to an upper node.
As shown in FIG. 2, the conventional construction process for the index tree with the insertion order of [3,7,9,23,45].
The core of the B + tree construction is the fission of nodes. For example, during the third step of inserting 9, since each node in the 3 rd order B + tree stores 2 elements at most, when 9 is inserted, the node already has two elements, 3 and 7. The middle element needs to be promoted up to the parent node. The original node is split into two child nodes at the moment, the values of the child nodes on the left side are all smaller than those of the parent node, and the values of the child nodes on the right side are all larger than or equal to those of the parent node. Similarly, in the fifth insertion step 45, two node fissions are required to complete the insertion.
The fission process of the node is complex and time-consuming. Therefore, in order to increase the response speed of the application, the number of fissions needs to be reduced. The method reduces the node fission frequency by expanding the upper limit of the leaf node element, so that the index construction speed is improved, and the application performance is improved.
The index construction process of the invention is as follows:
and finding the position to be inserted into the index tree according to the expiration time of the data record, and inserting the data record into the corresponding leaf node.
It should be noted that index establishment is performed when an application reads a data record from a disk and puts the data record into a cache.
Specifically inserting which node when inserting, including the following steps:
s101, judging the number of leaf nodes of a right subtree in the current branch;
s102, if the right subtree in the current branch only has 1 leaf node and the number of elements in the leaf node does not reach the upper limit, inserting a data record into the leaf node;
s103, if the right subtree in the current branch only has 1 leaf node and the number of elements in the leaf node reaches the upper limit, judging whether the leaf node points to a father node;
s103-1, if the leaf node does not point to the father node, performing fission operation, lifting the last element in the leaf node to the father node, simultaneously, fissuring a new leaf node from the father node, and inserting a data record into the new leaf node;
s103-2, if the leaf node points to the father node, dynamically adding a new leaf node under the leaf node, and inserting the data record into the new leaf node; insert 23
S104, if the right subtree in the current branch has 1 leaf node and one dynamically-increased leaf node under the leaf node, and the number of elements in the dynamically-increased leaf node does not reach the upper limit, inserting a data record into the dynamically-increased leaf node;
s105, if the right sub-tree in the current branch has 1 leaf node and one dynamically-increased leaf node under the leaf node, and the number of elements in the dynamically-increased leaf node reaches an upper limit, node fission operation is carried out, the last element in the first leaf node under the right sub-tree is lifted to a father node, a new leaf node is formed by parent node fission, and a data record is inserted into the new leaf node formed by fission.
As shown in FIG. 3, the specific insertion process is shown by taking the sequential insertion [3,7,9,23,45] as an example.
The above step S102 corresponds to the insertion 3 and 7, the step S103-1 corresponds to the insertion 9, the step S103-2 corresponds to the insertion 23, the step S104 corresponds to the insertion 45, and the step S105 is a process (not shown in the figure) of inserting data after the insertion 45. In step S105, the first leaf node, i.e. the leaf node where 7 and 9 are located, the fission process refers to 9 as the parent node where 7 is located, then the leaf node where 7 is located (i.e. the leaf node where 7 and 9 are located before fission) is used as the left sub-tree, and the new leaf node that the parent node has been fissured is used as the right sub-tree.
As can be seen from the process of inserting 23 in step S103-2, the improved index tree construction process of the present invention expands leaf nodes. Compared with the traditional index tree construction process, the same group of data is inserted, the traditional B + tree is fissured twice, and the method is fissured once. As the amount of data increases, the number of fissions may decrease significantly.
Example two
Based on the first embodiment, this embodiment provides an apparatus for improving application cache utilization, which can implement the method in the first embodiment, and includes the following functional modules:
an expiration time increase module: adding an expiration time for each data record in the cache;
a global timer setting module: setting a global timer for the cache;
an expired data determination module: the global timer scans the data in the cache at regular time, and determines the overdue data according to the overdue time of each data record;
an expired data deleting module: and deleting the expired data.
In addition, in order to realize the quick deletion of a large amount of data, the embodiment constructs the data records into indexes.
The device also comprises an index tree construction module: and constructing an index tree by using the expiration time of each data record, marking the expiration time of the data record by using the key of each node in the index tree, and taking the corresponding value as real address information of the corresponding data record in the cache.
The above disclosure is only for the preferred embodiments of the present invention, but the present invention is not limited thereto, and any non-inventive changes that can be made by those skilled in the art and several modifications and amendments made without departing from the principle of the present invention shall fall within the protection scope of the present invention.
Claims (6)
1. A method for improving application cache utilization rate is characterized by comprising the following steps:
adding an expiration time for each data record in the cache;
setting a global timer for the cache;
the global timer scans the data in the cache at regular time, and the expired data is determined according to the expiration time of each data record;
deleting the expired data;
the method also includes the steps of:
constructing an index tree by using the expiration time of each data record, marking the expiration time of each data record by using the key of each node in the index tree, and using the corresponding value as real address information of the corresponding data record in the cache;
the method for constructing the index tree by using the expiration time of each data record specifically comprises the following steps:
finding the position of the index tree to be inserted according to the expiration time of the data record, and inserting the data record into the corresponding leaf node, wherein the method comprises the following steps:
judging the number of leaf nodes of a right subtree in the current branch;
if the right subtree in the current branch only has 1 leaf node and the number of elements in the leaf node does not reach the upper limit, inserting a data record into the leaf node;
if the right subtree in the current branch only has 1 leaf node and the number of elements in the leaf node reaches the upper limit, judging whether the leaf node points to a father node;
if the leaf node does not point to the father node, the fission operation is carried out, the last element in the leaf node is lifted to the father node, meanwhile, a new leaf node is formed by the fission of the father node, and the data record is inserted into the new leaf node;
if the leaf node points to a father node, a new leaf node is dynamically added under the leaf node, and a data record is inserted into the new leaf node;
if the right subtree in the current branch has 1 leaf node and a dynamically-increased leaf node under the leaf node, and the number of elements in the dynamically-increased leaf node does not reach the upper limit, inserting a data record into the dynamically-increased leaf node;
if the right subtree in the current branch has 1 leaf node and a dynamically-increased leaf node under the leaf node, and the number of elements in the dynamically-increased leaf node reaches the upper limit, a node fission operation is performed, the last element in the first leaf node under the right subtree is lifted to a parent node, a new leaf node is formed by the fission of the parent node, and a data record is inserted into the new leaf node formed by the fission.
2. The method according to claim 1, wherein the global timer periodically scans data in the cache, and determines the expired data according to the expiration time of each data record, and specifically includes:
finding the closest time point in the index tree according to the current time;
the real cache data corresponding to the index before the time point is the outdated data.
3. The method for improving application cache utilization according to claim 2, further comprising the steps of:
converting the expiration time into a time stamp form to form an expiration time stamp;
when the index tree is constructed, the time stamp of each data record is utilized for construction, namely the key of each node in the index tree is the expiration time stamp of the data record.
4. The method of claim 3, wherein an expiration time is added to the data record when the data record is loaded from disk into the cache.
5. The method of claim 4, wherein the expiration time is the current time + the reserved time.
6. An apparatus for improving utilization rate of application cache, comprising,
an expiration time increase module: adding an expiration time for each data record in the cache;
a global timer setting module: setting a global timer for the cache;
an expired data determination module: the global timer scans the data in the cache at regular time, and determines the overdue data according to the overdue time of each data record;
an expired data deleting module: deleting the expired data;
the index tree construction module: constructing an index tree by using the expiration time of each data record, marking the expiration time of each data record by using the key of each node in the index tree, and using the corresponding value as real address information of the corresponding data record in the cache;
the method for constructing the index tree by using the expiration time of each data record specifically comprises the following steps:
finding the position of the index tree to be inserted according to the expiration time of the data record, and inserting the data record into the corresponding leaf node, wherein the method comprises the following steps:
judging the number of leaf nodes of a right subtree in the current branch;
if the right subtree in the current branch only has 1 leaf node and the number of elements in the leaf node does not reach the upper limit, inserting the data record into the leaf node;
if the right subtree in the current branch only has 1 leaf node and the number of elements in the leaf node reaches the upper limit, judging whether the leaf node points to a father node;
if the leaf node does not point to the father node, the fission operation is carried out, the last element in the leaf node is lifted to the father node, meanwhile, a new leaf node is formed by the fission of the father node, and the data record is inserted into the new leaf node;
if the leaf node points to a father node, a new leaf node is dynamically added under the leaf node, and a data record is inserted into the new leaf node;
if the right subtree in the current branch has 1 leaf node and one dynamically-increased leaf node under the leaf node, and the number of elements in the dynamically-increased leaf node does not reach the upper limit, inserting a data record into the dynamically-increased leaf node;
if the right subtree in the current branch has 1 leaf node and a dynamically-increased leaf node under the leaf node, and the number of elements in the dynamically-increased leaf node reaches the upper limit, a node fission operation is performed, the last element in the first leaf node under the right subtree is lifted to a parent node, a new leaf node is formed by the fission of the parent node, and a data record is inserted into the new leaf node formed by the fission.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010472351.8A CN111737254B (en) | 2020-05-29 | 2020-05-29 | Method and device for improving application cache utilization rate |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010472351.8A CN111737254B (en) | 2020-05-29 | 2020-05-29 | Method and device for improving application cache utilization rate |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111737254A CN111737254A (en) | 2020-10-02 |
| CN111737254B true CN111737254B (en) | 2022-12-23 |
Family
ID=72647983
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010472351.8A Active CN111737254B (en) | 2020-05-29 | 2020-05-29 | Method and device for improving application cache utilization rate |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111737254B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105100282B (en) * | 2015-09-06 | 2021-06-08 | 浪潮软件股份有限公司 | Timer tool under tobacco cloud platform |
| CN113253922B (en) * | 2021-03-12 | 2023-07-25 | 北京百度网讯科技有限公司 | Cache management method, device, electronic equipment and computer readable storage medium |
| CN115657954B (en) * | 2022-11-01 | 2023-06-20 | 昆仑数智科技有限责任公司 | Data processing method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101315628A (en) * | 2007-06-01 | 2008-12-03 | 华为技术有限公司 | Internal memory database system and method and device for implementing internal memory data base |
| CN105653198A (en) * | 2014-11-13 | 2016-06-08 | 杭州迪普科技有限公司 | Data processing method and device |
-
2020
- 2020-05-29 CN CN202010472351.8A patent/CN111737254B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101315628A (en) * | 2007-06-01 | 2008-12-03 | 华为技术有限公司 | Internal memory database system and method and device for implementing internal memory data base |
| CN105653198A (en) * | 2014-11-13 | 2016-06-08 | 杭州迪普科技有限公司 | Data processing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111737254A (en) | 2020-10-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111737254B (en) | Method and device for improving application cache utilization rate | |
| CN108319654B (en) | Computing system, cold and hot data separation method and device, and computer readable storage medium | |
| CN102981971B (en) | A kind of phase transition storage loss equalizing method of quick response | |
| CN101169790A (en) | Matrix type data caching method and device based on WEB application | |
| CN106776378A (en) | It is a kind of to clear up data cached method and device | |
| CN108595347B (en) | Cache control method and device and computer readable storage medium | |
| WO2020033446A1 (en) | Techniques for maintaining statistics in a database system | |
| CN109582686B (en) | Method, device, system and application for ensuring consistency of distributed metadata management | |
| CA2722320A1 (en) | Paging hierarchical data | |
| CN111694863B (en) | Database cache refreshing method, system and device | |
| CN106326040B (en) | Snapshot metadata management method and device | |
| JP2004524632A (en) | System and method for reorganizing stored data | |
| CN111625203A (en) | Method, system, device and medium for hierarchical storage | |
| CN116521688B (en) | Key prefix operation KEY value method based on Redis cluster | |
| CN114416677A (en) | Cold storage data updating method, device, equipment and storage medium | |
| CN112463073A (en) | Object storage distributed quota method, system, equipment and storage medium | |
| CN110413689B (en) | Multi-node data synchronization method and device for memory database | |
| JP2001282599A (en) | Method and device for managing data and recording medium with data management program stored therein | |
| CN111694806A (en) | Transaction log caching method, device, equipment and storage medium | |
| WO2020238748A1 (en) | Data synchronization processing method and apparatus, electronic device and computer storage medium | |
| CN115167778A (en) | Storage management method, system and server | |
| CN101650735B (en) | Data initial state restoring method, data initial state restoring device and single sign-on system | |
| CN109948098B (en) | Data filtering method, and method and device for recording cache information | |
| CN113177031B (en) | Processing method and device for database shared cache, electronic equipment and medium | |
| CN112131234A (en) | Method, system, equipment and medium for optimizing data cache concurrency |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | 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 |