CN106469172B - The data-updating method and device of distributed file system - Google Patents
The data-updating method and device of distributed file system Download PDFInfo
- Publication number
- CN106469172B CN106469172B CN201510512344.5A CN201510512344A CN106469172B CN 106469172 B CN106469172 B CN 106469172B CN 201510512344 A CN201510512344 A CN 201510512344A CN 106469172 B CN106469172 B CN 106469172B
- Authority
- CN
- China
- Prior art keywords
- data
- index
- node
- back end
- new data
- 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
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)
Abstract
The application discloses the data-updating method and device of a kind of distributed file system, the method comprise the steps that obtaining more new data, by the tail portion of more new data write-in current data node, and corresponding index information is updated in the back end；The more new data is written to the tail portion of the check-node, and updates corresponding index information in the check-node.High-performance is realized in the data updating process of distributed file system by the application, is not take up computing resource and the consistent effect of data.
Description
Technical field
This application involves the data-updating methods and dress of field of computer technology more particularly to a kind of distributed file system
It sets.
Background technique
With the continuous development of Internet, the data on internet increase at burst.Cost is also higher and higher.Very much
Distribute file system achievees the purpose that data encoding to reduce cost by Erasure Code (correcting and eleting codes) algorithm.It is being distributed
It can not be applied in production environment using Erasure Code more new algorithm there are many problems in formula file system, but business
Realize in the update operation for be unableing to do without file again, so how to solve the problems, such as also to get over brought by Erasure Code more new algorithm
Come more urgent.
Assuming that the parameter of Erasure Code coding are as follows: back end M, checkpoint N, then prior art algorithm is scarce
Point has:
(1) performance is low；
A reads and writes disk often: disk reads M-1 parts of data, to M+N parts of data of disk write；
B network data transmission amount is big: receiving M-1 parts of data from network, sends M-1+N parts of data to network；
(2) computing resource waste is serious, and CPU needs to calculate M parts of data；
(3) data are irrecoverable when partially failing in renewal process；For example, after the completion of calculating, toward disk on when writing data,
If there is failure just will appear problems.
In conclusion carrying out data update using Erasure Code more new algorithm in Distribute file system leads to cost
High, the problems such as performance is low, consistency is difficult to ensure, it is therefore necessary to propose that improved technological means solves the above problems.
Summary of the invention
The main purpose of the application is to provide the data-updating method and device of a kind of distributed file system, to overcome
Distribute file system existing in the prior art, which carries out data update, to be led to that cost is high, performance is low, consistency is difficult to ensure etc. and asks
Topic.
A kind of data-updating method of distributed file system, the distributed field system are proposed according to the embodiment of the present application
System includes multiple back end and at least one check-node, which comprises more new data is obtained, by the update number
According to the tail portion of write-in current data node, and corresponding index information is updated in the back end；It will the more new data
The tail portion of the check-node is written, and updates corresponding index information in the check-node.
Wherein, described that corresponding index information is updated in the back end, comprising: to update depositing for the back end
Store up the occupied end position in space；The index for finding former data corresponding with the more new data, by the index modification
For the index of the more new data.
Wherein, further includes: by the more new data, former data corresponding with the more new data identification information, when
The identification information of preceding back end is sent to the check-node, wherein the identification information of the back end includes: disk mark
Knowledge, IP address, port information.
Wherein, described that corresponding index information is updated in the check-node, comprising: to update quilt in the check-node
Occupy the end position of memory space.
Wherein, further includes: index corresponding with the back end is gone out according to the identification information-enquiry of the back end
Information；According to the identification information of former data corresponding with the more new data, looked into the index information of the back end
The index modification is the index of the more new data by the index for finding former data.
A kind of data update apparatus of distributed file system, the distributed document are also proposed according to the embodiment of the present application
System includes multiple back end and at least one check-node, described device include:
Module is obtained, for obtaining more new data；Back end update module, for the more new data to be written currently
The tail portion of back end, and corresponding index information is updated in the back end；Check-node update module is used for institute
The tail portion that the check-node is written in more new data is stated, and updates corresponding index information in the check-node.
Wherein, the back end update module is also used to, and updates the occupied knot of memory space of the back end
Beam position；The index modification is the more new data by the index for finding former data corresponding with the more new data
Index.
Wherein, further includes: data transmission blocks, for more new data, original corresponding with the more new data by described in
The identification information of data, the identification information of current data node are sent to the check-node, wherein the mark of the back end
Knowing information includes: disk mark, IP address, port information.
Wherein, the check-node update module is also used to, and updates the knot of occupied memory space in the check-node
Beam position.
Wherein, the check-node update module is also used to, and is gone out and this according to the identification information-enquiry of the back end
The corresponding index information of back end；According to the identification information of former data corresponding with the more new data, in the number
It is the index of the more new data by the index modification according to the index for finding former data in the index information of node.
According to the above-mentioned technical proposal of the application, by the tail that more new data is written to back end and check-node
Portion solves with disk space and carries out the existing defect of data update using Erasure Code more new algorithm, in distributed text
High-performance is effectively realized in the data updating process of part system, is not take up computing resource and the consistent effect of data.
Detailed description of the invention
The drawings described herein are used to provide a further understanding of the present application, constitutes part of this application, this Shen
Illustrative embodiments and their description please are not constituted an undue limitation on the present application for explaining the application.In the accompanying drawings:
Fig. 1 is the architecture diagram according to the distributed file system of the embodiment of the present application；
Fig. 2 is the schematic diagram according to the storage management of the back end of the embodiment of the present application；
Fig. 3 is the schematic diagram according to the storage management of the check-node of the embodiment of the present application；
Fig. 4 is the flow chart according to the data-updating method of the distributed file system of the embodiment of the present application；
Fig. 5 is the schematic diagram updated according to the data of the embodiment of the present application；
Fig. 6 is the structural block diagram according to the data update apparatus of the distributed file system of the application one embodiment；
Fig. 7 is the structural block diagram according to the data update apparatus of the distributed file system of another embodiment of the application.
Specific embodiment
To keep the purposes, technical schemes and advantages of the application clearer, below in conjunction with the application specific embodiment and
Technical scheme is clearly and completely described in corresponding attached drawing.Obviously, described embodiment is only the application one
Section Example, instead of all the embodiments.Based on the embodiment in the application, those of ordinary skill in the art are not doing
Every other embodiment obtained under the premise of creative work out, shall fall in the protection scope of this application.
A kind of data-updating method of distributed file system is provided according to the embodiment of the present application.
The application is built upon on distributed file system, and with reference to Fig. 1, distributed file system is by least one master control
Node (or being control node), at least one client and multiple memory nodes form, between the device of above-mentioned three types
It is in communication with each other by network.Each node is an independent physical machine, and main controlled node is mainly used for positioning memory node, often
A memory node is responsible for managing one piece of disk.
Wherein, memory node includes storage initial data memory node and storage verification data memory node two types:
Initial data memory node, referred to as back end are stored, for storing initial data.Initial data is according to predetermined
Size (such as 1M) is cut into different data patch, and each fritter has a unique number relative to current data node
(ID)。
The function of back end specifically includes that (1) receives and forwards from main controlled node, other back end and/or visitor
The network data at family end；(2) data and index information on hyperdisk.
In practical applications, the index information of back end specifically includes: magnetic disc ID, coding initial position and end-of-encode
Position, the end position (incremented by successively) of occupied memory space, all data blocks index.With reference to Fig. 2, each data block 21
An all corresponding index 22, the index of data block includes: data block identifier (ID), data block starting position, end of data block position
It sets.In one embodiment of the application, it can be existed by the index information of data block with rapidly locating file (data block)
Position in back end.
With reference to Fig. 3, storage verification data memory node, referred to as check-node, storage pass through Erasure Code algorithm
More new data 32 caused by the verification data 31 and update file of generation, wherein by more new data write-in check-node
Tail portion.
Check-node and the data type that back end not only stores are different, but also the type of the index information stored
It is different.As shown in figure 3, check-node would generally record the coding start bit of check-node in index data most starting position 33
It sets, end position, the occupied end position of memory space (incremented by successively), then the position 44 after starting position 33 is deposited
Store up the index information of other all back end.As shown in figure 3, the disk mark of each back end is recorded in check-node respectively
Knowledge, IP address, the corresponding verification data block of the data block of port information (disc information) and the back end index.Its
In, the index for verifying data block may include: verification data block identifier (ID), verification data BOB(beginning of block) position, verification data block
End position.In practical applications, by verify data block index can quickly location and check data block in check-node
Position.
The stream of the data-updating method of distributed file system according to the application one embodiment is shown with reference to Fig. 4, Fig. 4
Cheng Tu.
Step S402 obtains more new data, by the tail portion of more new data write-in current data node, and in the number
According to updating corresponding index information in node；
Behind the tail portion of more new data write-in back end, the memory space of back end changes, it is therefore desirable to right
The end position of the occupied memory space of back end is updated；Also, after data update, it is also necessary to update former data
The position being directed toward is indexed, specifically: the starting position of the more new data being updated to N, end position is updated to N and adds update number
N, which is updated to, according to length, the occupied end position of memory space adds update data length；Wherein, N is memory space quilt before updating
The end position of occupancy.
Then, by the more new data, identification information, the current data section of former data corresponding with the more new data
The identification information of point is sent to the check-node, wherein the identification information of the back end includes: disk mark, IP
Location, port information.
The more new data is written the tail portion of the check-node, and updated in the check-node by step S404
Corresponding index information.
After check-node receives more new data, data supplementing to oneself tail portion then needs to update check-node
Index information, specifically: corresponding with back end index letter is gone out according to the identification information-enquiry of the back end
Breath；According to the identification information of former data corresponding with the more new data, searched in the index information of the back end
It is the index of the more new data by the index modification to the index of former data.
The occupied end position of memory space is updated to N first and adds new data length；Then according to the data section
Point identification information-enquiry go out index information relevant to the back end, by the starting position of the more new data be updated to N,
End position is updated to N and adds update data length.
The example updated below with reference to the data of Fig. 5 detailed description distributed file system.
In one embodiment of the application, the distributed file system can be TFS (Taobao File
System, Taobao's file system), TFS system is with the storage that data block (Block) is that unit manages data file, each data
Block has a globally unique identification information (ID).When storing small documents, multiple small documents can be stored in same number
According in block, while TFS system supports the update to file to operate.TFS system establishes the rope according to this document in storage file
Fuse breath., index information is without Erasure Code coding, back end (the verification section being copied directly to where check block
Point) in.
Erasure Code coding only is carried out to the truthful data of each data block in an encoding process, not to each data
The index information of block encodes.The index information of each data block can copy to each check block (check-node), and store and arrive school
It tests in the index file of block.
In order to briefly describe update data stream journey, setting distributed file system includes 3 back end and 1 verification section
Point (only to show 2 back end in concise Fig. 5), coding starting position is 0, end position M, and memory space is occupied
End position is N.Assuming that the data block that number is 2 is updated to back end 1, more new data (new data) is obtained in advance,
It is as follows to the more new technological process of the 2 number blocks (i.e. former data) of back end 1 with reference to Fig. 5:
(1) new data is appended to the tail portion of oneself by back end 1, updates the relevant index information of 2 number blocks.In number
According in node 1, the index of 2 number blocks is to index 2, and before the update, index 2 is directed toward (the phantom line segments institute i.e. in figure of data blocks 2
Show)；After update, need to index 2 direction more new datas, that is, the starting position of index 2 is updated to N, end position more
It is newly N+ new data length (i.e. in figure shown in real segment), it is long that the occupied end position of memory space is updated to N+ new data
Degree；
(2) back end 1 passes through network for new data, the former identification information of data and the relevant information of back end 1
(magnetic disc ID, IP address, port numbers PORT) is sent to check-node 1；
(3) in check-node 1, before the update, index 2 is directed toward data block 2 (i.e. in figure shown in phantom line segments)；Update it
Afterwards, after check-node 1 receives new data, new data is appended to the tail portion of oneself first, while it is occupied to update storage space
End position is N+ new data length；Rope relevant to back end 1 is inquired by magnetic disc ID, IP address, port numbers
Fuse breath, the more index information of new data block 2, index 2 are directed toward more new data (i.e. in figure shown in real segment).
It can be realized technical effect below according to an embodiment of the present application:
(1) high-performance；
The number of read-write disk only accounts for (2/ (M-1+M+N)=2/ (3-1+3+1)=2/6=33.33% of original scheme；
Network biography amount only accounts for (2/ (M-1+M+N)=2/ (3-1+3+1)=2/6=33.33% of original scheme；
(2) it is not take up computing resource, it is only necessary in disk end supplemental data；
(3) it will appear the data unanimous circumstances that user sees when partially failing in renewal process.
A kind of data update apparatus of distributed file system, the distributed document are also provided according to the embodiment of the present application
System includes multiple back end and at least one check-node.
Fig. 6 is according to the structural block diagram of the data update apparatus of the distributed file system of the application one embodiment, such as
Shown in Fig. 6, described device includes:
Module 610 is obtained, for obtaining more new data；
Back end update module 620, for the more new data to be written to the tail portion of current data node, and described
Corresponding index information is updated in back end；
Further, the occupied knot of memory space that the back end update module 620 updates the back end
Beam position；The index modification is the more new data by the index for finding former data corresponding with the more new data
Index.Specifically, the starting position of the more new data is updated to N, end position be updated to N add update data length,
The occupied end position of memory space is updated to N and adds update data length；Wherein, N is occupied memory space before updating
End position.
Check-node update module 630, for the more new data to be written to the tail portion of the check-node, and described
Corresponding index information is updated in check-node.
Further, the check-node update module 630 updates the knot of occupied memory space in the check-node
Beam position；Go out index information corresponding with the back end according to the identification information-enquiry of the back end；According to institute
The identification information for stating the corresponding former data of more new data, finds the rope of former data in the index information of the back end
Draw, is the index of the more new data by the index modification.Specifically, the occupied end position of memory space is updated to
N adds new data length；Go out index information relevant to the back end according to the identification information-enquiry of the back end；By institute
The starting position for stating more new data is updated to N, end position is updated to N and adds update data length.
With reference to the structure that Fig. 7, Fig. 7 are according to the data update apparatus of the distributed file system of another embodiment of the application
Block diagram, described device include: obtaining module 710, back end update module 720, check-node update module 730, data
Sending module 740.
Wherein, module 710, back end update module 720, check-node update module 730 are obtained respectively and shown in Fig. 6
Acquisition module 610, back end update module 620, check-node update module 630 it is similar, repeat no more.
As shown in fig. 7, data transmission blocks 740, for more new data, original corresponding with the more new data by described in
The identification information of data, the identification information of current data node are sent to the check-node, wherein the mark of the back end
Knowing information includes: disk mark, IP address, port information.
The operating procedure of method of the invention and the structure feature of device are corresponding, can be cross-referenced, no longer repeat one by one.
In conclusion according to the above-mentioned technical proposal of the application, by the way that back end and verification is written in more new data
The tail portion of node solves with disk space and carries out the existing defect of data update using Erasure Code more new algorithm,
High-performance is effectively realized in the data updating process of distributed file system, is not take up computing resource and data are consistent
Effect.
It will be understood by those skilled in the art that embodiments herein can provide as method, system or computer program product.
Therefore, complete hardware embodiment, complete software embodiment or embodiment combining software and hardware aspects can be used in the application
Form.It is deposited moreover, the application can be used to can be used in the computer that one or more wherein includes computer usable program code
The shape for the computer program product implemented on storage media (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.)
Formula.
In a typical configuration, calculating equipment includes one or more processors (CPU), input/output interface, net
Network interface and memory.
Memory may include the non-volatile memory in computer-readable medium, random access memory (RAM) and/or
The forms such as Nonvolatile memory, such as read-only memory (ROM) or flash memory (flash RAM).Memory is computer-readable medium
Example.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by any method
Or technology come realize information store.Information can be computer readable instructions, data structure, the module of program or other data.
The example of the storage medium of computer includes, but are not limited to phase change memory (PRAM), static random access memory (SRAM), moves
State random access memory (DRAM), other kinds of random access memory (RAM), read-only memory (ROM), electric erasable
Programmable read only memory (EEPROM), flash memory or other memory techniques, read-only disc read only memory (CD-ROM) (CD-ROM),
Digital versatile disc (DVD) or other optical storage, magnetic cassettes, tape magnetic disk storage or other magnetic storage devices
Or any other non-transmission medium, can be used for storage can be accessed by a computing device information.As defined in this article, it calculates
Machine readable medium does not include temporary computer readable media (transitory media), such as the data-signal and carrier wave of modulation.
It should also be noted that, the terms "include", "comprise" or its any other variant are intended to nonexcludability
It include so that the process, method, commodity or the equipment that include a series of elements not only include those elements, but also to wrap
Include other elements that are not explicitly listed, or further include for this process, method, commodity or equipment intrinsic want
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including described want
There is also other identical elements in the process, method of element, commodity or equipment.
The above description is only an example of the present application, is not intended to limit this application.For those skilled in the art
For, various changes and changes are possible in this application.All any modifications made within the spirit and principles of the present application are equal
Replacement, improvement etc., should be included within the scope of the claims of this application.
Claims (10)
1. a kind of data-updating method of distributed file system, the distributed file system include multiple back end and
At least one check-node, which is characterized in that the described method includes:
More new data is obtained, by the tail portion of more new data write-in current data node, and is updated in the back end
Corresponding index information；
The more new data is written to the tail portion of the check-node, and by the index modification of former data in the check-node
For the index of the more new data.
2. the method according to claim 1, wherein described update corresponding index letter in the back end
Breath, comprising:
Update the occupied end position of memory space of the back end；
The index modification is the rope of the more new data by the index for finding former data corresponding with the more new data
Draw.
3. the method according to claim 1, wherein further include:
By the mark of the more new data, the identification information of former data corresponding with the more new data, current data node
Information is sent to the check-node, wherein the identification information of the back end includes: disk mark, IP address, port letter
Breath.
4. according to the method described in claim 3, it is characterized in that, described update corresponding index letter in the check-node
Breath, comprising:
Update the end position of occupied memory space in the check-node.
5. according to the method described in claim 4, it is characterized by further comprising:
Go out index information corresponding with the back end according to the identification information-enquiry of the back end；
According to the identification information of former data corresponding with the more new data, searched in the index information of the back end
It is the index of the more new data by the index modification to the index of former data.
6. a kind of data update apparatus of distributed file system, the distributed file system include multiple back end and
At least one check-node, which is characterized in that described device includes:
Module is obtained, for obtaining more new data；
Back end update module, for the more new data to be written to the tail portion of current data node, and in the data section
Corresponding index information is updated in point；
Check-node update module is saved for the more new data to be written to the tail portion of the check-node, and in the verification
By the index of the index modification of former data more new data for described in point.
7. device according to claim 6, which is characterized in that the back end update module is also used to, described in update
The occupied end position of the memory space of back end；The index of former data corresponding with the more new data is found,
It is the index of the more new data by the index modification.
8. device according to claim 6, which is characterized in that further include:
Data transmission blocks, for by the identification information of the more new data, former data corresponding with the more new data, when
The identification information of preceding back end is sent to the check-node, wherein the identification information of the back end includes: disk mark
Knowledge, IP address, port information.
9. device according to claim 8, which is characterized in that the check-node update module is also used to, described in update
The end position of occupied memory space in check-node.
10. device according to claim 9, which is characterized in that the check-node update module is also used to, according to described
The identification information-enquiry of back end goes out index information corresponding with the back end；According to corresponding with the more new data
Former data identification information, the index of former data is found in the index information of the back end, by the index modification
For the index of the more new data.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510512344.5A CN106469172B (en) | 2015-08-19 | 2015-08-19 | The data-updating method and device of distributed file system |
| PCT/CN2016/094322 WO2017028721A1 (en) | 2015-08-19 | 2016-08-10 | Data update method and device in distributed file system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510512344.5A CN106469172B (en) | 2015-08-19 | 2015-08-19 | The data-updating method and device of distributed file system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106469172A CN106469172A (en) | 2017-03-01 |
| CN106469172B true CN106469172B (en) | 2019-07-23 |
Family
ID=58050718
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510512344.5A Active CN106469172B (en) | 2015-08-19 | 2015-08-19 | The data-updating method and device of distributed file system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN106469172B (en) |
| WO (1) | WO2017028721A1 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110245166B (en) * | 2019-05-21 | 2023-09-26 | 创新先进技术有限公司 | Data checking method and device |
| CN114398659A (en) * | 2021-10-28 | 2022-04-26 | 上海哔哩哔哩科技有限公司 | Resource checking method, device, equipment and storage medium |
| CN114676166B (en) * | 2022-05-26 | 2022-10-11 | 阿里巴巴（中国）有限公司 | Data processing method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101996250A (en) * | 2010-11-15 | 2011-03-30 | 中国科学院计算技术研究所 | Hadoop-based mass stream data storage and query method and system |
| CN102681793A (en) * | 2012-04-16 | 2012-09-19 | 华中科技大学 | Local data updating method based on erasure code cluster storage system |
| CN102799679A (en) * | 2012-07-24 | 2012-11-28 | 河海大学 | Hadoop-based massive spatial data indexing updating system and method |
| US8726129B1 (en) * | 2004-07-23 | 2014-05-13 | Hewlett-Packard Development Company, L.P. | Methods of writing and recovering erasure coded data |
| CN104102558A (en) * | 2014-07-13 | 2014-10-15 | 中国人民解放军国防科学技术大学 | Erasure code based file appending method |
| CN104376053A (en) * | 2014-11-04 | 2015-02-25 | 南京信息工程大学 | Storage and retrieval method based on massive meteorological data |
-
2015
- 2015-08-19 CN CN201510512344.5A patent/CN106469172B/en active Active
-
2016
- 2016-08-10 WO PCT/CN2016/094322 patent/WO2017028721A1/en active Application Filing
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8726129B1 (en) * | 2004-07-23 | 2014-05-13 | Hewlett-Packard Development Company, L.P. | Methods of writing and recovering erasure coded data |
| CN101996250A (en) * | 2010-11-15 | 2011-03-30 | 中国科学院计算技术研究所 | Hadoop-based mass stream data storage and query method and system |
| CN102681793A (en) * | 2012-04-16 | 2012-09-19 | 华中科技大学 | Local data updating method based on erasure code cluster storage system |
| CN102799679A (en) * | 2012-07-24 | 2012-11-28 | 河海大学 | Hadoop-based massive spatial data indexing updating system and method |
| CN104102558A (en) * | 2014-07-13 | 2014-10-15 | 中国人民解放军国防科学技术大学 | Erasure code based file appending method |
| CN104376053A (en) * | 2014-11-04 | 2015-02-25 | 南京信息工程大学 | Storage and retrieval method based on massive meteorological data |
Non-Patent Citations (1)
| Title |
|---|
| 基于GE码的HDFS优化方案;朱媛媛 等;《计算机应用》;20130301;第33卷(第3期);730-733 |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2017028721A1 (en) | 2017-02-23 |
| CN106469172A (en) | 2017-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108810041B (en) | Data writing and capacity expansion method and device for distributed cache system | |
| US10055216B2 (en) | Minimizing image copying during partition updates | |
| CN103473277B (en) | The Snapshot Method and device of file system | |
| JP6264666B2 (en) | Data storage method, data storage device, and storage device | |
| CN106469172B (en) | The data-updating method and device of distributed file system | |
| CN103780638A (en) | Data synchronization method and system | |
| CN101741730A (en) | Method and equipment for downloading file and method and system for providing file downloading service | |
| CN105338078A (en) | Data storage method and device used for storing system | |
| CN108512649B (en) | Processing method and device for reverse hash link of block chain | |
| CN105550306A (en) | Multi-copy data reading/writing method and system | |
| CN107798063B (en) | Snapshot processing method and snapshot processing device | |
| CN109492049B (en) | Data processing, block generation and synchronization method for block chain network | |
| CN108510268B (en) | Annular block chain structure, data processing method and device | |
| CN103152390A (en) | Method and device and nodes and system for node configuration of distributed storage system | |
| CN104580439A (en) | Method for achieving uniform data distribution in cloud storage system | |
| CN106682021A (en) | Database migration method and device | |
| CN115146002A (en) | Cross-data-center data synchronization method and device | |
| CN110059088B (en) | Data attribute identification method, device and equipment in block chain type account book | |
| CN105204782B (en) | A kind of method and device for realizing data storage | |
| CN107547378B (en) | VPN route learning method and device | |
| CN111858145B (en) | Method, apparatus and computer program product for data backup and restore | |
| CN105279166A (en) | File management method and system | |
| CN106569986B (en) | Character string replacing method and device | |
| CN104598463A (en) | Method and method for switching database | |
| CN104216666A (en) | Method and device for managing writing of disk data |
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 |