CN109739435B - File storage and updating method and device - Google Patents
File storage and updating method and device Download PDFInfo
- Publication number
- CN109739435B CN109739435B CN201811466674.5A CN201811466674A CN109739435B CN 109739435 B CN109739435 B CN 109739435B CN 201811466674 A CN201811466674 A CN 201811466674A CN 109739435 B CN109739435 B CN 109739435B
- Authority
- CN
- China
- Prior art keywords
- storage
- file
- information
- data block
- storage node
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention is applicable to the technical field of data storage, and provides a file storage and updating method and device, wherein the file storage method comprises the steps of receiving a file writing request sent by a client and extracting data block information in the file writing request; and acquiring the state information of the storage node, screening the storage node according to the state information of the storage node, and generating storage address information. According to the file storing and updating method and device, the file to be stored is divided into the plurality of data blocks through the client, and the storage address is allocated to each data block through the management node.
Description
Technical Field
The invention belongs to the technical field of data storage, and particularly relates to a file storage and updating method and device.
Background
As the price of unit storage has decreased, people have begun to tend to save more data in the hope that more advanced data analysis tools can be used to extract value from it at some point in the future. However, the conventional storage media cannot solve the problems of data security and persistence, so that corresponding policies and technologies are required to establish persistence storage on the fragile storage media. The amount of data, whether it is personal or corporate, continues to grow and data storage problems are increasingly prominent. Common enterprises employ centralized storage and use disk mirroring to improve limited data reliability, but with limited capacity available. Some enterprises adopt NAS (Network Attached Storage network attached storage, abbreviated as NAS) and SAN (gigabit rate network, abbreviated as SAN) technologies to store data by providing higher throughput capacity for connection between a server and a storage device by means of a fiber channel and supporting longer distance and more reliable connection, but the cost of the NAS and SAN storage technologies is larger, and even if the enterprises can bear one investment, the enterprises cannot bear the continuous cost caused by continuous capacity expansion and smooth system upgrading. Meanwhile, the NAS and SAN storage technology is difficult to maintain, and professional personnel are required to be consulted or employed for maintenance. The advent of distributed storage has solved the above-described problems to some extent. However, the conventional distributed file system is difficult to meet the demands under new situations in terms of expansibility, reliability, data access performance and the like. For example, with existing distributed storage architecture HDFS (Hadoop Distributed File System distributed file system, HDFS for short), the high throughput data of the HDFS is designed at the cost of a delay, making the HDFS less suitable for applications requiring low delays, e.g., delays no higher than tens of milliseconds.
Disclosure of Invention
In view of the above, the embodiments of the present invention provide a method and apparatus for storing and updating files, so as to solve the problem of long access delay of the distributed file system in the prior art.
According to a first aspect, an embodiment of the present invention provides a file storage method, including: receiving a file writing request sent by a client, and extracting data block information in the file writing request; acquiring state information of a storage node, screening the storage node according to the state information of the storage node, and generating storage address information.
According to the file storage method provided by the embodiment of the invention, the file to be stored is divided into a plurality of data blocks through the client, and the storage address is allocated to each data block through the management node, so that the management node only executes the storage address allocation work, does not need to participate in time-consuming file blocking and specific data block storage work, and transfers a plurality of works originally executed by the management node to the client and the storage node, thereby greatly reducing the workload of the management node, avoiding the access delay of the client and solving the problem of longer access delay of the distributed file system in the prior art.
With reference to the first aspect, in a first implementation manner of the first aspect, before the receiving the file writing request sent by the client, the file storing method further includes: acquiring request time; judging whether the request time is larger than a preset time threshold value or not; and when the request time is greater than a preset time threshold, forwarding the file writing request.
According to the file storage method provided by the embodiment of the invention, the plurality of management nodes are simultaneously arranged, and when the access request time aiming at one management node is longer, the corresponding file writing request is forwarded to other management nodes in time for processing, so that the access delay is further reduced.
With reference to the first aspect, in a second implementation manner of the first aspect, the obtaining state information of a storage node, and filtering the storage node according to the state information of the storage node, to generate storage address information, includes: receiving heartbeat information sent by the storage node, and judging whether the corresponding storage node is effective or not according to the heartbeat information; when the storage node is effective, acquiring corresponding storage information; screening corresponding storage nodes according to the storage information; and generating storage address information according to the screened storage nodes.
According to the file storage method provided by the embodiment of the invention, the current state of the storage node is inspected from two aspects of validity, whether the storage space is abundant and the like, so that the specific storage node for executing data storage at this time is screened out, and the reliability of the data storage is improved.
With reference to the second implementation manner of the first aspect, in a third implementation manner of the first aspect, the obtaining state information of a storage node, and filtering the storage node according to the state information of the storage node, to generate storage address information, further includes: and copying the data blocks in the storage nodes to other storage nodes when the storage nodes are invalid.
According to the file storage method provided by the embodiment of the invention, when the storage node is found invalid, the stored data block is transferred to other storage nodes in time, so that the data loss is avoided, and the reliability of data storage is improved.
With reference to the first aspect, in a fourth implementation manner of the first aspect, after the generating the storage address information, the file storage method further includes: transmitting the data block to a corresponding storage node through the client according to the storage address information; storing the data block by the storage node and copying the data block to at least one other storage node.
According to the file storage method provided by the embodiment of the invention, the data storage is completed through the data transmission between the client and the storage node, and the storage node executes the data backup, so that the data storage work is integrated into zero and is distributed to different objects for processing, the efficiency of data storage is favorably provided, and the delay is reduced.
According to a second aspect, an embodiment of the present invention provides a method for updating a file, including: receiving a file updating request sent by a client, and extracting data block information in the file updating request; the data block is a data block stored by adopting the file storage method according to the first aspect or any implementation manner of the first aspect; and acquiring corresponding updating address information according to the data block information.
According to the file updating method provided by the embodiment of the invention, the corresponding storage address is searched for the data block to be updated through the management node, and because the management node only executes the storage address searching work and does not need to participate in time-consuming data block updating work, the specific updating work originally executed by the management node is transferred to the client and the storage node, so that the workload of the management node is greatly reduced, the access delay of the client is avoided, and the problem of longer access delay of the distributed file system in the prior art is solved.
With reference to the second aspect, in a first implementation manner of the second aspect, after the obtaining corresponding update address information according to the data block information, the file update method further includes: transmitting the updated data block of the data block to a corresponding storage node through the client according to the updated address information; and storing the updated data block through the storage node.
According to the file updating method provided by the embodiment of the invention, the data updating is completed through the data transmission between the client and the storage node, the data is integrated into zero during the finer work, and the data is distributed to different objects for processing, so that the efficiency of data updating is improved, and the time delay is reduced.
According to a third aspect, an embodiment of the present invention provides a file storage device, including: the first input unit is used for receiving a file writing request sent by a client and extracting data block information in the file writing request; the first address allocation unit is used for acquiring the state information of the storage nodes, screening the storage nodes according to the state information of the storage nodes and generating storage address information.
According to a fourth aspect, an embodiment of the present invention provides a file updating apparatus, including: the second input unit is used for receiving a file update request sent by the client and extracting data block information in the file update request; the data block is a data block stored by the file storage method according to any one of claims 1 to 6; and the second address allocation unit is used for acquiring corresponding updated address information according to the data block information.
According to a fifth aspect, an embodiment of the present invention provides a terminal device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps of the file storing method according to the first aspect or any implementation manner of the first aspect when the processor executes the computer program, or the processor implements the steps of the file updating method according to the second aspect or any implementation manner of the second aspect when the processor executes the computer program.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic view of an application scenario according to an embodiment of the present invention;
FIG. 2 is a flowchart of a specific example of a file storage method provided by an embodiment of the present invention;
FIG. 3 is a flowchart of another specific example of a file storage method provided by an embodiment of the present invention;
FIG. 4 is a flowchart of a specific example of a file update method provided by an embodiment of the present invention;
FIG. 5 is a schematic structural diagram of a specific example of a file storage device according to an embodiment of the present invention;
FIG. 6 is a schematic structural diagram of a specific example of a file updating apparatus according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of a specific example of a terminal device according to an embodiment of the present invention.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth such as the particular system architecture, techniques, etc., in order to provide a thorough understanding of the embodiments of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.
In order to illustrate the technical scheme of the invention, the following description is made by specific examples.
Fig. 1 is a schematic diagram of an application scenario in an embodiment of the present invention. In fig. 1, a client 100 is communicatively connected to a management node 200, and the client 100 first sends a file operation request (e.g., a file write request, a file update request, a file read request, etc.); after a certain management node 200 accepts a file operation request, screening or searching a storage node 300 which can provide service for the client 100 correspondingly, and sending an address list of the screened storage node 300 to the client 100; finally, the client 100 and the corresponding storage node 300 cooperate to complete specific operations on the file, such as file writing, file updating, file reading, and the like.
In some embodiments, as shown in FIG. 2, the management node 200 can implement storage of files by performing the following steps:
step S101: and receiving a file writing request sent by the client and extracting data block information in the file writing request. In one embodiment, when the client 100 needs to store a certain file, the client 100 may divide the file into a plurality of data blocks first; then, the client 100 may generate a corresponding file write request according to the data block and transmit the file write request to the randomly selected one of the management nodes 200. How the management node 200 randomly selected by the client 100 is in the idle state, a file write request may be received by the management node 200; however, if the management node 200 is processing other file operation requests, in order to avoid delay caused to the file writing request sent by the current client 100, as shown in fig. 3, forwarding the file writing request may be implemented by performing the following steps, so that other idle management nodes 200 can timely receive the file writing request:
step S100: acquiring the request time and judging whether the request time is larger than a preset time threshold. In practice, the preset time threshold may be a small time, for example, several milliseconds. When the request time is greater than the preset time threshold, executing step S100'; when the request time is less than or equal to the preset time threshold, step S101 is performed.
Step S100': and forwarding the file writing request. The other management node 200 may also perform step S100 before the other management node 200 receives the file write request, thereby determining whether it can receive and process the file write request. By arranging a plurality of management nodes 200, the existing HDFS is improved, and the structure of a single master node is improved to be a structure of a plurality of master nodes, so that when a client intensively initiates file operation requests, long time delay is avoided, and the working efficiency of various operations such as file storage is improved.
Step S102: and acquiring the state information of the storage node, screening the storage node according to the state information of the storage node, and generating storage address information. In filtering the individual storage nodes 300, both availability and remaining storage space may be considered. The validity screening of the storage nodes can be realized by heartbeat information sent to the management node 200 by each storage node 300 periodically; the filtering of the remaining storage space of the storage nodes may be implemented by the data block list that is periodically fed back to the management node 200 by each storage node 300. In a specific embodiment, as shown in fig. 3, the process of step S102 may be implemented by the following sub-steps:
step S1021: and receiving heartbeat information sent by the storage nodes, and judging whether the corresponding storage nodes are effective according to the heartbeat information. Each storage node 300 maintains its contact by sending a heartbeat to the management node 200, for example, heartbeat information may be sent to the management node 200 in a 3 second period. When the management node 200 can continuously receive the heartbeat information of the storage node 300, it can be determined that the corresponding storage node is valid, step S1022 is performed, when the management node 200 continuously receives no heartbeat information of the storage node 300 for a long time, it can be determined that the corresponding storage node is lost, that is, the corresponding storage node is invalid, step S1025 is performed;
step S1022: and acquiring corresponding storage information. In addition to the heartbeat information, each storage node 300 periodically reports relevant information of the data block stored by itself to the management node, which may include identification information and data amount information of the data block. By the current storage information of each storage node 300, it is possible to find out which storage nodes 300 have a larger data size and which storage nodes 300 have a smaller data size, and further identify the storage nodes with a larger remaining storage space.
Step S1023: and screening the corresponding storage nodes according to the storage information. In practical application, the storage node with larger residual storage space can be screened and used as the object of the current file writing request.
Step S1024: and generating storage address information according to the screened storage nodes. The management node 200 may feed back the addresses of the screened storage nodes 300 to the client 100 in the form of a list.
Step S1025: copying the data blocks in the storage node to other storage nodes. To avoid data loss and improve reliability of data storage, when a failed storage node 300 is discovered, the data block in the failed storage node may be actively copied to other valid storage nodes.
Optionally, as shown in fig. 3, the following steps may be added after step S102:
step S103: and sending the data block to the corresponding storage node through the client according to the storage address information. And respectively sending each data block to be stored to different storage nodes 300 according to the storage address information fed back by the management node 200.
Step S104: the data block is stored by the storage node and copied to at least one other storage node. Each storage node 300 receiving the data block is required to copy and back up the data block to other storage nodes while finishing the local storage of the data block, so as to realize the redundant backup of each data block, thereby ensuring the storage safety. In practical applications, the number of redundant backups may be set, which is not limited in this embodiment of the present invention.
According to the file storage method provided by the embodiment of the invention, the file to be stored is divided into a plurality of data blocks through the client, and the storage address is allocated to each data block through the management node, so that the management node only executes the storage address allocation work, does not need to participate in time-consuming file blocking and specific data block storage work, and transfers a plurality of works originally executed by the management node to the client and the storage node, thereby greatly reducing the workload of the management node, avoiding the access delay of the client and solving the problem of longer access delay of the distributed file system in the prior art.
The embodiment of the present invention further provides a file updating method, which is applicable to the management node 200, as shown in fig. 4, and the file updating method may include the following steps:
step S401: and receiving a file updating request sent by the client and extracting data block information in the file updating request. Specifically, the data block is a data block stored by using the file storage method as described in fig. 2 or fig. 3. In a specific embodiment, the management node 200 may also determine whether to receive the file update request by using the method described in step S100, so as to avoid the file update request from being delayed.
Step S402: and acquiring corresponding updating address information according to the data block information. Since each storage node 300 periodically transmits the respective storage information to the management node 200, the management node 200 generates updated address information by searching all storage nodes 300 capable of screening out the data blocks stored to be updated, and listing the addresses of these storage nodes 300.
Optionally, after step S402, the file updating method may further include the steps of:
step S403: and sending the updated data blocks of the data blocks to the corresponding storage nodes through the client according to the updated address information. After receiving the update address information fed back by the management node 200, the client 100 correspondingly sends the update data block of the data block to be updated to each storage node 300 originally storing the update data block, so that the corresponding storage node 300 executes a specific data update task.
Step S404: the update data block is stored by the storage node. Each storage node 300 storing the data block to be updated receives and stores the updated data block, thereby completing the data update task. The corresponding data block stored before can be stored continuously or can be deleted, which is not limited by the embodiment of the invention.
According to the file updating method provided by the embodiment of the invention, the corresponding storage address is searched for the data block to be updated through the management node, and because the management node only executes the storage address searching work and does not need to participate in time-consuming data block updating work, the specific updating work originally executed by the management node is transferred to the client and the storage node, so that the workload of the management node is greatly reduced, the access delay of the client is avoided, and the problem of longer access delay of the distributed file system in the prior art is solved.
It should be understood that, the sequence numbers of the steps in the above method embodiments do not mean the order of execution, and the execution order of the processes should be determined by the functions and the internal logic, and should not be construed as limiting the implementation process of the embodiments of the present invention.
The embodiment of the invention also provides a file storage device, as shown in fig. 5, which may include: a first input unit 501 and a first address allocation unit 502.
The first input unit 501 is configured to receive a file writing request sent by a client, and extract data block information in the file writing request; the specific working process can be described in step S101 in the above method embodiment.
The first address allocation unit 502 is configured to obtain status information of a storage node, screen the storage node according to the status information of the storage node, and generate storage address information; the specific working process can be described in step S102 in the above method embodiment.
The embodiment of the invention also provides a file updating device, as shown in fig. 6, the file updating device may include: a second input unit 601 and a second address allocation unit 602.
The second input unit 601 is configured to receive a file update request sent by a client, and extract data block information in the file update request; the data blocks are stored by adopting a file storage method shown in fig. 2 or 3; the specific working process can be described in step S401 in the above method embodiment.
The second address allocation unit 602 is configured to obtain corresponding update address information according to the data block information; the specific working process can be described in step S402 in the above method embodiment.
The embodiment of the present invention further provides a terminal device, as shown in fig. 7, where the terminal device may include a processor 701 and a memory 702, where the processor 701 and the memory 702 may be connected by a bus or other manner, and in fig. 7, the connection is exemplified by a bus.
The processor 701 may be a central processing unit (Central Processing Unit, CPU). The processor 701 may also be a chip such as another general purpose processor, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a Field programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, or a combination thereof.
The memory 702 is used as a non-transitory computer readable storage medium, and may be used to store a non-transitory software program, a non-transitory computer executable program, and a module, such as program instructions/modules corresponding to a file storing method or a file updating method in an embodiment of the present invention (e.g., the first input unit 501 and the first address allocation unit 502 shown in fig. 5, or the second input unit 601 and the second address allocation unit 602 shown in fig. 6). The processor 701 executes various functional applications of the processor and data processing by executing non-transitory software programs, instructions, and modules stored in the memory 702, that is, implements the file storage method or the file update method in the above-described method embodiments.
Memory 702 may include a storage program area that may store an operating system, at least one application program required for functionality, and a storage data area; the storage data area may store data created by the processor 701, or the like. In addition, the memory 702 may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, memory 702 may optionally include memory located remotely from processor 701, such remote memory being connectable to processor 701 through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The one or more modules are stored in the memory 702, which when executed by the processor 701, performs a file storage method or a file update method as in the embodiments shown in fig. 2-4.
The specific details of the terminal device may be understood correspondingly with reference to the corresponding related descriptions and effects in the embodiments shown in fig. 2 to fig. 4, which are not repeated here.
It will be appreciated by those skilled in the art that implementing all or part of the above-described embodiment method may be implemented by a computer program to instruct related hardware, where the program may be stored in a computer readable storage medium, and the program may include the above-described embodiment method when executed. The storage medium may be a magnetic Disk, an optical disc, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a flash Memory (flash Memory), a Hard Disk (HDD), or a Solid State Drive (SSD); the storage medium may also comprise a combination of memories of the kind described above.
The above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention, and are intended to be included in the scope of the present invention.
Claims (7)
1. A method of storing a file, comprising:
receiving a file writing request sent by a client, and extracting data block information in the file writing request;
acquiring state information of a storage node, screening the storage node according to the state information of the storage node, and generating storage address information;
transmitting the data block to a corresponding storage node through the client according to the storage address information;
storing the data block by the storage node and copying the data block to at least one other storage node;
acquiring request time before the file writing request sent by the receiving client side;
judging whether the request time is larger than a preset time threshold value or not;
when the request time is greater than a preset time threshold, forwarding the file writing request;
the obtaining the state information of the storage node, and screening the storage node according to the state information of the storage node, and generating storage address information includes:
receiving heartbeat information sent by the storage node, and judging whether the corresponding storage node is effective or not according to the heartbeat information;
when the storage node is effective, acquiring corresponding storage information;
screening corresponding storage nodes according to the storage information;
and generating storage address information according to the screened storage nodes.
2. The file storage method as claimed in claim 1, wherein the acquiring the state information of the storage node, and filtering the storage node according to the state information of the storage node, generates the storage address information, further comprises:
and copying the data blocks in the storage nodes to other storage nodes when the storage nodes are invalid.
3. A method for updating a file, comprising:
receiving a file updating request sent by a client, and extracting data block information in the file updating request; the data block is a data block stored by the file storage method according to any one of claims 1 to 2;
and acquiring corresponding updating address information according to the data block information.
4. The file updating method according to claim 3, wherein after said acquiring the corresponding update address information from said data block information, said file updating method further comprises:
transmitting the updated data block of the data block to a corresponding storage node through the client according to the updated address information;
and storing the updated data block through the storage node.
5. A file storage device, comprising:
the first input unit is used for receiving a file writing request sent by a client and extracting data block information in the file writing request;
the first address allocation unit is used for acquiring the state information of the storage nodes, screening the storage nodes according to the state information of the storage nodes and generating storage address information;
after the storage address information is generated, the following steps are added:
transmitting the data block to a corresponding storage node through the client according to the storage address information;
storing the data block by the storage node and copying the data block to at least one other storage node;
before the file writing request sent by the receiving client side, the following steps are added:
acquiring request time;
judging whether the request time is larger than a preset time threshold value or not;
when the request time is greater than a preset time threshold, forwarding the file writing request;
the first address allocation unit is specifically configured to perform the following steps:
receiving heartbeat information sent by the storage node, and judging whether the corresponding storage node is effective or not according to the heartbeat information;
when the storage node is effective, acquiring corresponding storage information;
screening corresponding storage nodes according to the storage information;
and generating storage address information according to the screened storage nodes.
6. A file updating apparatus, comprising:
the second input unit is used for receiving a file update request sent by the client and extracting data block information in the file update request; the data block is a data block stored by the file storage method according to any one of claims 1 to 2;
and the second address allocation unit is used for acquiring corresponding updated address information according to the data block information.
7. Terminal device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the steps of the file storage method according to any of claims 1 to 2 when executing the computer program or the steps of the file update method according to claim 3 or 4 when executing the computer program.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811466674.5A CN109739435B (en) | 2018-12-03 | 2018-12-03 | File storage and updating method and device |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811466674.5A CN109739435B (en) | 2018-12-03 | 2018-12-03 | File storage and updating method and device |
Publications (2)
Publication Number | Publication Date |
---|---|
CN109739435A CN109739435A (en) | 2019-05-10 |
CN109739435B true CN109739435B (en) | 2023-10-13 |
Family
ID=66359220
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201811466674.5A Active CN109739435B (en) | 2018-12-03 | 2018-12-03 | File storage and updating method and device |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN109739435B (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112543213B (en) * | 2019-09-23 | 2022-06-03 | 杭州海康威视数字技术股份有限公司 | Data processing method and device |
CN111046014A (en) * | 2019-12-24 | 2020-04-21 | 广州众鑫达科技有限公司 | File distributed storage system, method and device and electronic equipment |
CN111209263A (en) * | 2020-01-14 | 2020-05-29 | 中国建设银行股份有限公司 | Data storage method, device, equipment and storage medium |
CN111767169B (en) * | 2020-06-28 | 2024-03-26 | 北京百度网讯科技有限公司 | Data processing method, device, electronic equipment and storage medium |
CN116166194B (en) * | 2023-01-16 | 2023-11-03 | 广州辰创科技发展有限公司 | Equipment guarantee maintenance and management method and system |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102843403A (en) * | 2011-06-23 | 2012-12-26 | 盛大计算机(上海)有限公司 | File processing method based on distributed file system, system, and client |
CN105227672A (en) * | 2015-10-13 | 2016-01-06 | 国家电网公司 | The method and system that data store and access |
CN106354840A (en) * | 2016-08-31 | 2017-01-25 | 北京小米移动软件有限公司 | File processing method and device and distributed file system |
CN107948248A (en) * | 2017-11-01 | 2018-04-20 | 平安科技(深圳)有限公司 | Distributed storage method, control server and computer-readable recording medium |
CN108008918A (en) * | 2017-11-30 | 2018-05-08 | 联想(北京)有限公司 | Data processing method, memory node and distributed memory system |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2006316040A (en) * | 2005-05-13 | 2006-11-24 | Genentech Inc | Herceptin(r) adjuvant treatment |
-
2018
- 2018-12-03 CN CN201811466674.5A patent/CN109739435B/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102843403A (en) * | 2011-06-23 | 2012-12-26 | 盛大计算机(上海)有限公司 | File processing method based on distributed file system, system, and client |
CN105227672A (en) * | 2015-10-13 | 2016-01-06 | 国家电网公司 | The method and system that data store and access |
CN106354840A (en) * | 2016-08-31 | 2017-01-25 | 北京小米移动软件有限公司 | File processing method and device and distributed file system |
CN107948248A (en) * | 2017-11-01 | 2018-04-20 | 平安科技(深圳)有限公司 | Distributed storage method, control server and computer-readable recording medium |
CN108008918A (en) * | 2017-11-30 | 2018-05-08 | 联想(北京)有限公司 | Data processing method, memory node and distributed memory system |
Also Published As
Publication number | Publication date |
---|---|
CN109739435A (en) | 2019-05-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109739435B (en) | File storage and updating method and device | |
US10257282B2 (en) | Lock management method in cluster, lock server, and client | |
US10261853B1 (en) | Dynamic replication error retry and recovery | |
US9304815B1 (en) | Dynamic replica failure detection and healing | |
JP6044539B2 (en) | Distributed storage system and method | |
US9917884B2 (en) | File transmission method, apparatus, and distributed cluster file system | |
US20160275123A1 (en) | Pipeline execution of multiple map-reduce jobs | |
US20140181035A1 (en) | Data management method and information processing apparatus | |
US9367261B2 (en) | Computer system, data management method and data management program | |
US20130219405A1 (en) | Apparatus and method for managing data stream distributed parallel processing service | |
CN114338651B (en) | File transmission method, device, electronic equipment and readable storage medium | |
CN105468718B (en) | Data consistency processing method, device and system | |
US20180364948A1 (en) | Data Processing Method, Related Device, and Storage System | |
US9298765B2 (en) | Apparatus and method for handling partially inconsistent states among members of a cluster in an erratic storage network | |
CN113553179A (en) | Distributed key value storage load balancing method and system | |
CN111352943A (en) | Method and device for realizing data consistency, server and terminal | |
CN112099728B (en) | Method and device for executing write operation and read operation | |
US8156374B1 (en) | Problem management for outsized queues | |
US11252121B2 (en) | Message sending method and terminal device | |
CN111225003B (en) | NFS node configuration method and device | |
CN107943615B (en) | Data processing method and system based on distributed cluster | |
CN107547605B (en) | message reading and writing method based on node queue and node equipment | |
CN113810216A (en) | Cluster fault switching method and device and electronic equipment | |
CN106776153B (en) | Job control method and server | |
CN109992447B (en) | Data copying method, device and storage medium |
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 |