CN110807065A - Memory table implementation method, memory and data node of distributed database - Google Patents
Memory table implementation method, memory and data node of distributed database Download PDFInfo
- Publication number
- CN110807065A CN110807065A CN201911046285.1A CN201911046285A CN110807065A CN 110807065 A CN110807065 A CN 110807065A CN 201911046285 A CN201911046285 A CN 201911046285A CN 110807065 A CN110807065 A CN 110807065A
- Authority
- CN
- China
- Prior art keywords
- data
- space
- memory
- tmpfs
- physical
- 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.)
- Pending
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
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- 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/242—Query formulation
- G06F16/2433—Query languages
- G06F16/2443—Stored procedures
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Computing Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a memory table implementation method, a memory and data nodes of a distributed database. The implementation method of the memory table comprises the following steps: establishing a memory table in a tmpfs space; establishing a physical table in a physical backup space; and synchronizing the data in the memory table to the physical table. By establishing the physical table corresponding to the memory table in the physical backup space and synchronizing the data in the memory table to the physical table, the data of the memory table in the temporary file system can be synchronously backed up to the physical table, the problem that the temporary file system is difficult to retrieve due to data loss of the memory table after power failure, system restart or failure is avoided, and the data security is improved.
Description
Technical Field
The present application relates to the technical field of distributed databases, and in particular, to a method for implementing a memory table, a memory, and a data node of a distributed database.
Background
At present, two schemes are mainly used for realizing a memory table on each independent data node of a distributed database, wherein one scheme is a memory table scheme based on a ramfs file system, and the other scheme is a memory table scheme based on a pgfincore component.
The ramfs file system cannot control the actual data capacity, and if the data is written into the ram, the ram of the operating system may be insufficient and may crash. When a large amount of data is modified or updated, the pgfincore component causes a lot of dirty data blocks to be written back, which further causes more time consumption for writing back the dirty data blocks to the disk, so that the pgfincore component is inefficient in querying data during a large amount of data deletion and update operations.
A temporary file system (tmpfs) is also a memory-based file system, which does not have the above disadvantages and can quickly complete operations such as reading, writing, updating, deleting, etc. of data in a memory, but is established in a volatile memory, and data in a memory table is lost after a power failure, a system restart, or a failure, so that the security of the data in the memory is not high.
Disclosure of Invention
The application mainly provides a memory table implementation method, a memory and a data node of a distributed database, so as to solve the problems that data of a memory table is lost and the security is not high after a temporary file system is powered off, a system is restarted or fails.
In order to solve the technical problem, the application adopts a technical scheme that: a method for implementing a memory table is provided. The implementation method of the memory table comprises the following steps: establishing a memory table in a tmpfs space; establishing a physical table in a physical backup space; and synchronizing the data in the memory table to the physical table.
In order to solve the above technical problem, another technical solution adopted by the present application is: a memory is provided. The memory stores a program that, when executed, enables the method described above.
In order to solve the above technical problem, another technical solution adopted by the present application is: a data node of a distributed database is provided. The data node comprises a processor coupled to a memory for storing a program and a memory for executing the program to implement the method as described above.
The beneficial effect of this application is: different from the prior art, the application discloses a memory table implementation method, a memory and a data node of a distributed database. The physical table corresponding to the memory table is established in the physical backup space, and the data in the memory table is synchronized to the physical table, so that the data of the memory table in the temporary file system can be synchronously backed up to the physical table, the problem that the data of the memory table in the tmpfs space is lost and difficult to retrieve when the memory table is restarted or fails is avoided, the safety of the data in the memory table is guaranteed, and the safety of the data is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative efforts, wherein:
fig. 1 is a schematic flowchart of an embodiment of a method for implementing a memory table provided in the present application;
FIG. 2 is a schematic flow chart further included before S11 in the method flow chart of FIG. 1;
FIG. 3 is a schematic flow chart further included after S13 in the method flow chart of FIG. 1;
FIG. 4 is a schematic diagram of an embodiment of a memory provided herein;
fig. 5 is a schematic structural diagram of an embodiment of a data node of the distributed database provided in the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "first", "second" and "third" in the embodiments of the present application are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first," "second," or "third" may explicitly or implicitly include at least one of the feature. In the description of the present application, "plurality" means at least two, e.g., two, three, etc., unless explicitly specifically limited otherwise. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
Referring to fig. 1, fig. 1 is a schematic flowchart illustrating an embodiment of a method for implementing a memory table provided in the present application. The implementation method of the memory table comprises the following steps:
s11: a memory table is built in the tmpfs space.
A temporary file system (tmpfs) is a memory-based file system. The Ttmps space is arranged in the memory, a memory table is established in the Tmpfs space, and the operations of reading, writing, updating, deleting and the like of the associated data are further realized through the operation on the memory table.
Before establishing the memory table in the tmpfs space, further comprising:
s101: the actual memory capacity of the tmpfs space is allocated according to the size of the available memory.
In this embodiment, a part of the storage space of the disk is divided into a virtual memory, and the virtual memory is used as an available memory for setting a tmpfs space. For example, one third of the available memory size is allocated as the actual memory capacity of the tmpfs space; alternatively, one-fourth or one-second the size of the available memory is allocated as the actual memory capacity of the tmpfs space. The present application does not limit this, and may allocate according to the actual memory capacity requirement of the tmpfs space.
Specifically, in this embodiment, the disk is divided into a tmpfs space, a physical backup space, and a cold data space, where the tmpfs space is a volatile storage space, data in the volatile storage space is lost when the system is restarted or fails, the physical backup space and the cold data space are non-volatile storage spaces, and data in the non-volatile storage space is not lost when the system is restarted or fails.
In other embodiments, a physical memory may also be used as an available memory for setting the tmpfs space, which is not limited in this application.
S102: and mounting the tmpfs directory to the tmpfs space, and setting the size of the tmpfs directory according to the actual memory capacity of the tmpfs space.
And mounting the tmpfs directory to the tmpfs space, namely mounting the tmpfs directory and the tmpfs space by the temporary file system so as to process the data stored in the tmpfs space.
The size of the tmpfs directory is set according to the actual memory capacity of the tmpfs space, in other words, the memory capacity of each memory table is limited by the size set by the tmpfs directory, so as to limit the actual data volume of the memory tables, and avoid the system crash caused by insufficient memory due to excessive data writing in the memory tables.
S103: permission setting is performed for the tmpfs directory.
Permission setting is carried out on the tmpfs directory, and the permission comprises operations of reading, writing, updating, deleting and the like on data.
After the memory table is built in the tmpfs space, the tmpfs directory is also pointed to the memory table. The table structure of the memory table stores the storage position of each data, each data is stored in a tmpfs space, and a tmpfs directory realizes the reading, writing, updating, deleting and the like of each data through the authority operation on the memory table.
S12: a physical table is established within the physical backup space.
The physical backup space is a nonvolatile storage space, and data in the physical backup space cannot be lost when the physical backup space is restarted or a system fails. The table structure of the physical table is substantially the same as the table structure of the memory table, so that the data of the subsequent memory table and the physical table can be synchronized conveniently.
S13: and synchronizing the data in the memory table to the physical table.
The data in the memory table is synchronized to the physical table, so that the problem that the data of the memory table in the tmpfs space is lost and difficult to retrieve when the memory table is restarted or in a fault is solved, and the safety of the data in the memory table is guaranteed.
Specifically, a data synchronization mechanism is established between the memory table and the physical table, for example, a data synchronization technology of the source database PostgresqL is adopted to synchronize the data of the memory table to the physical table located in the physical backup space in real time, thereby ensuring the security of the data of the memory table.
In this embodiment, a publish-subscribe mechanism is used to implement real-time synchronization of data from the memory table to the physical table. When the memory table contains new data, the memory table serves as a publisher of data publishing to send the new data in real time, the physical table starts a subscription mode and serves as a receiver to receive the data sent by the publisher in real time, and the data in the physical table is updated in real time, so that real-time synchronization of the data is achieved.
Furthermore, after the system is restarted or the system is repaired due to a fault, the data in the physical table is restored to the memory table, so that the availability of the temporary file system is guaranteed, and the temporary file system is prevented from being unavailable due to the loss of the data in the memory table.
Specifically, after the system is restarted or the system is repaired, the table structure and the data of the memory table in the tmpfs space are reconstructed according to the physical table, and the data in the physical table is restored to the memory table in a multi-concurrent thread mode, so that the data of the memory table can be quickly restored, and the real-time availability of the temporary file system after the system is restarted or the system is repaired can be guaranteed.
Given that the tmpfs space is limited, if the data footprint within the space exceeds a maximum upper bound, new data will not be able to continue to be written and will cause the system to prompt for error information. Therefore, a data occupancy detection mechanism in the tmpfs space is further established.
In particular, monitoring data occupancy within the tmpfs space is achieved in the following manner.
S14: and confirming whether the data occupation amount in the tmpfs space reaches a preset capacity threshold value.
The method comprises the steps of setting a preset capacity threshold of data occupation amount in a tmpfs space, wherein the preset capacity threshold is 85% of the maximum upper limit of the data occupation amount of the tmpfs space, and the specific setting value of the preset capacity threshold is not limited in the application.
And determining whether the data occupation amount in the tmpfs space reaches a preset capacity threshold, and if so, executing a step S15 to clear the aging data so that the data occupation amount in the tmpfs space is smaller than the preset capacity threshold.
S15: and if the preset capacity threshold is reached, eliminating the data in the tmpfs space from first to last according to the storage time until the data occupation amount is smaller than the preset capacity threshold.
The names of the data stored in the tmpfs space are all provided with time stamps, and therefore the sequence of storing the data according to the time can be judged. When the data occupation amount in the tmpfs space reaches a preset capacity threshold, eliminating the data in the tmpfs space from first to last according to the data storage time until the data occupation amount is smaller than the preset capacity threshold, so as to avoid that the data in the tmpfs space is written too much to cause system error reporting or collapse due to insufficient storage space. Meanwhile, the physical table is updated along with the memory table in real time so as to remove corresponding data backed up in the physical backup space.
Specifically, data in the tmpfs space is transferred to the cold data space from first to last according to the storage time, so that the data in the tmpfs space is removed. Wherein the tmpfs space is a volatile memory space and the physical backup space and the cold data space are non-volatile memory spaces.
Further, if the data occupation amount in the tmpfs space does not reach the preset capacity threshold, confirming whether the data occupation capacity in the tmpfs space reaches the preset capacity threshold again after the interval is set for a time length, and accordingly realizing continuous monitoring on the data in the tmpfs space and ensuring timely cleaning of the aging data in the tmpfs space.
According to the method and the device, the physical table corresponding to the memory table is established in the physical backup space, and the data in the memory table is synchronized to the physical table, so that the data of the memory table in the temporary file system can be synchronously backed up to the physical table, the problem that the data of the memory table in the tmpfs space is lost and difficult to find back when restarting or breaking down is avoided, the safety of the data in the memory table is guaranteed, and the safety of the data is improved.
Based on this, the present application further provides a memory 20, please refer to fig. 4, and fig. 4 is a schematic structural diagram of an embodiment of the memory provided in the present application, in which the memory 20 stores a program 21, and the program 21 can implement the memory table implementation method of any of the above embodiments when executed.
The program 21 may be stored in the memory 20 in the form of a software product, and includes several instructions to make a device or a processor execute all or part of the steps of the methods according to the embodiments of the present application.
The memory 20 is a medium in computer memory for storing some discrete physical quantity. The memory 20 having the storage function includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing the code of the program 21.
Based on this, the present application further provides a data node 30 of a distributed database, please refer to fig. 5, where fig. 5 is a schematic structural diagram of an embodiment of the data node of the distributed database provided in the present application. In this embodiment, the data node 30 includes a processor 32 and a storage 31, the processor 32 is coupled to the storage 31, the storage 31 is used for storing programs, and the processor 32 is used for executing the programs to implement the memory table implementation method of any of the above embodiments.
The data node 30 may be a personal computer or a data server or the like. The processor 32 may also be referred to as a CPU (Central Processing Unit). The processor 32 may be an integrated circuit chip having signal processing capabilities. The processor 32 may also be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application.
The above description is only an example of the present application and is not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings, or which are directly or indirectly applied to other related technical fields, are intended to be included within the scope of the present application.
Claims (11)
1. A method for implementing a memory table, comprising:
establishing a memory table in a tmpfs space;
establishing a physical table in a physical backup space;
and synchronizing the data in the memory table to the physical table.
2. The method of claim 1, wherein synchronizing the data in the memory table to the physical table comprises:
and adopting a publishing and subscribing mechanism to realize the data synchronization from the memory table to the physical table by taking the memory table as a publisher and taking the physical table as a subscriber.
3. The method of claim 1, further comprising:
and restoring the data in the physical table to the memory table.
4. The method of claim 3, wherein the step of restoring the data in the physical table to the memory table comprises:
and restoring the data in the physical table to the memory table in a multi-concurrent thread mode.
5. The method of claim 1, further comprising:
confirming whether the data occupation amount in the tmpfs space reaches a preset capacity threshold value;
and if the preset capacity threshold is reached, eliminating the data in the tmpfs space from first to last according to the storage time until the data occupation amount is smaller than the preset capacity threshold.
6. The method of claim 5, wherein the step of culling data within the tmpfs space from first to last by logging time comprises:
and transferring the data in the tmpfs space to a cold data space from beginning to end according to the storage time, wherein a disk comprises the tmpfs space, the physical backup space and the cold data space, the tmpfs space is a volatile storage space, and the physical backup space and the cold data space are nonvolatile storage spaces.
7. The method of claim 5, further comprising:
and if the preset capacity threshold value is not reached, confirming whether the occupied capacity of the data in the tmpfs space reaches the preset capacity threshold value again after the interval setting time length.
8. The method of claim 1, wherein prior to establishing the memory table in the tmpfs space, further comprising:
distributing the actual memory capacity of the tmpfs space according to the size of the available memory;
mounting a tmpfs directory to the tmpfs space, and setting the size of the tmpfs directory according to the actual memory capacity of the tmpfs space;
and setting the authority for the tmpfs directory.
9. The method of claim 8, wherein the step of establishing a memory table within the tmpfs space comprises:
and pointing the tmpfs directory to the memory table.
10. A memory, characterized in that it stores a program which, when executed, is able to implement the method according to any one of claims 1 to 9.
11. A data node of a distributed database, characterized in that the data node comprises a processor coupled to a memory for storing a program and a memory for executing the program for implementing the method according to any of claims 1-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911046285.1A CN110807065A (en) | 2019-10-30 | 2019-10-30 | Memory table implementation method, memory and data node of distributed database |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911046285.1A CN110807065A (en) | 2019-10-30 | 2019-10-30 | Memory table implementation method, memory and data node of distributed database |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110807065A true CN110807065A (en) | 2020-02-18 |
Family
ID=69489598
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911046285.1A Pending CN110807065A (en) | 2019-10-30 | 2019-10-30 | Memory table implementation method, memory and data node of distributed database |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110807065A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113360534A (en) * | 2021-08-11 | 2021-09-07 | 北京快立方科技有限公司 | Memory recovery method for multi-copy data of memory database |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101944114A (en) * | 2010-09-16 | 2011-01-12 | 深圳天源迪科信息技术股份有限公司 | Data synchronization method between memory database and physical database |
| JP2011186545A (en) * | 2010-03-04 | 2011-09-22 | Nec Corp | Memory database system, speed-up method and program |
| CN104615750A (en) * | 2015-02-12 | 2015-05-13 | 中国农业银行股份有限公司 | Realization method of main memory database under host system |
| CN104699419A (en) * | 2013-12-09 | 2015-06-10 | 陈勋元 | Operation method of distributed memory disk cluster storage system |
| CN105302472A (en) * | 2014-06-16 | 2016-02-03 | 北京天府之国文化发展有限公司 | Operating method for distributed memory disk cluster storage system |
| CN108170768A (en) * | 2017-12-25 | 2018-06-15 | 腾讯科技（深圳）有限公司 | database synchronization method, device and readable medium |
| CN109739823A (en) * | 2018-12-27 | 2019-05-10 | 郑州云海信息技术有限公司 | A kind of method and device for building parallel file system |
-
2019
- 2019-10-30 CN CN201911046285.1A patent/CN110807065A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011186545A (en) * | 2010-03-04 | 2011-09-22 | Nec Corp | Memory database system, speed-up method and program |
| CN101944114A (en) * | 2010-09-16 | 2011-01-12 | 深圳天源迪科信息技术股份有限公司 | Data synchronization method between memory database and physical database |
| CN104699419A (en) * | 2013-12-09 | 2015-06-10 | 陈勋元 | Operation method of distributed memory disk cluster storage system |
| CN105302472A (en) * | 2014-06-16 | 2016-02-03 | 北京天府之国文化发展有限公司 | Operating method for distributed memory disk cluster storage system |
| CN104615750A (en) * | 2015-02-12 | 2015-05-13 | 中国农业银行股份有限公司 | Realization method of main memory database under host system |
| CN108170768A (en) * | 2017-12-25 | 2018-06-15 | 腾讯科技（深圳）有限公司 | database synchronization method, device and readable medium |
| CN109739823A (en) * | 2018-12-27 | 2019-05-10 | 郑州云海信息技术有限公司 | A kind of method and device for building parallel file system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113360534A (en) * | 2021-08-11 | 2021-09-07 | 北京快立方科技有限公司 | Memory recovery method for multi-copy data of memory database |
| CN113360534B (en) * | 2021-08-11 | 2022-05-06 | 北京快立方科技有限公司 | Memory recovery method for multi-copy data of memory database |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102594849B (en) | Data backup and recovery method and device, virtual machine snapshot deleting and rollback method and device | |
| US7840536B1 (en) | Methods and apparatus for dynamic journal expansion | |
| EP3678015B1 (en) | Metadata query method and device | |
| CN103294675B (en) | Data-updating method and device in a kind of distributed memory system | |
| CN107844268B (en) | Data distribution method, data storage method, related device and system | |
| US7882315B2 (en) | Snapshot mechanism in a data processing system and method and apparatus thereof | |
| US8108634B1 (en) | Replicating a thin logical unit | |
| CN107888657A (en) | Low latency distributed memory system | |
| US20180322024A1 (en) | Storage apparatus, storage system, and control method of storage system | |
| CN103152390B (en) | The node configuration method of distributed memory system, device, node and system | |
| US9037819B2 (en) | Source cleaning cascaded volumes using reference counts | |
| WO2016153605A1 (en) | Aggressive data deduplication using lazy garbage collection | |
| CN107817950B (en) | Data processing method and device | |
| CN109376197B (en) | Data synchronization method, server and computer storage medium | |
| CA2978927C (en) | Data check method and storage system | |
| CN110147203B (en) | File management method and device, electronic equipment and storage medium | |
| US10795579B2 (en) | Methods, apparatuses, system and computer program products for reclaiming storage units | |
| EP3147797A1 (en) | Data management method, node and system for database cluster | |
| CN111857602A (en) | Data processing method, data processing device, data node and storage medium | |
| CN105243340A (en) | Method and system for preventing mis-deleting of data in HBase | |
| US9767111B1 (en) | Method and apparatus for managing a dynamic journal using the punch command | |
| CN104793981A (en) | Online snapshot managing method and device for virtual machine cluster | |
| CN115617264A (en) | Distributed storage method and device | |
| CN110807065A (en) | Memory table implementation method, memory and data node of distributed database | |
| CN110737716B (en) | Data writing method and device |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200218 |
|
| RJ01 | Rejection of invention patent application after publication |