CN115277735A - Data processing method and device, electronic equipment and storage medium - Google Patents
Data processing method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN115277735A CN115277735A CN202210857497.3A CN202210857497A CN115277735A CN 115277735 A CN115277735 A CN 115277735A CN 202210857497 A CN202210857497 A CN 202210857497A CN 115277735 A CN115277735 A CN 115277735A
- Authority
- CN
- China
- Prior art keywords
- node
- target
- node set
- service data
- 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.)
- Granted
Links
- 238000003672 processing method Methods 0.000 title abstract description 20
- 238000000034 method Methods 0.000 claims abstract description 50
- 238000012545 processing Methods 0.000 claims abstract description 36
- 230000004044 response Effects 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 13
- 238000013500 data storage Methods 0.000 abstract description 6
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 16
- 238000010276 construction Methods 0.000 description 11
- 230000006870 function Effects 0.000 description 6
- 230000005540 biological transmission Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 2
- 230000002085 persistent effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/18—File system types
- G06F16/182—Distributed file systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
- G06F2009/45595—Network integration; Enabling network access in virtual machine instances
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present disclosure relates to a data processing method and apparatus, an electronic device, and a storage medium, wherein the method includes: the method comprises the steps of obtaining a target request message, wherein the target request message is used for requesting processing of target service data, responding to the target request message, and splicing data stored by each node in a target node set into the target service data, wherein each node in the target node set stores part of the target service data, and the storage space occupied by the target service data is larger than that of any node in the target node set. The method and the device solve the technical problems that the storage capacity of a single node is limited and large-amount data storage is difficult to meet in the related technology.
Description
Technical Field
The present disclosure relates to the field of computers, and in particular, to a method and an apparatus for processing data, an electronic device, and a storage medium.
Background
In the related art, as business progresses, more and more data is stored in an intermediate container (such as a ZooKeeper), but the container has a maximum capacity limit, and a large amount of data affects the performance of the intermediate container. For example, in the ZooKeeper, the default capacity of a node is 1M, but it is not recommended to store too large data, which may affect the overall performance of the ZooKeeper, and for the case of storing large-capacity data, the actual data is stored in NFS (Network File System) or HDFS (Distributed File System) File System through a link where the actual data is stored in the node.
However, the data stored by the ZooKeeper node has strong consistency, and using a third-party storage structure requires extra guarantee of consistency between the ZooKeeper and the third-party storage structure, and requires that the third-party storage has the same read-write access capability as the ZooKeeper.
Therefore, the storage capacity of a single node is limited, and the technical problem of large-scale data storage is difficult to satisfy in the related art.
BRIEF SUMMARY OF THE PRESENT DISCLOSURE
The present disclosure provides a data processing method and apparatus, an electronic device, and a storage medium, to at least solve the technical problem in the related art that a single node has a limited storage capacity and is difficult to satisfy the technical problem of mass data storage. The technical scheme of the disclosure is as follows:
according to a first aspect of the embodiments of the present disclosure, there is provided a data processing method, including: acquiring a target request message, wherein the target request message is used for requesting to process target service data; and responding to the target request message, and splicing data stored by each node in a target node set into the target service data, wherein each node in the target node set stores part of the target service data, and the storage space occupied by the target service data is larger than that of any node in the target node set.
In an exemplary embodiment, the assembling, in response to the target request message, data stored by each node in the target node set into the target service data includes: responding to the target request message, and acquiring node configuration information, wherein the node configuration information is used for determining a node set for storing the target service data; and determining the target node set according to the node configuration information, and splicing data stored by each node in the target node set into the target service data.
In an exemplary embodiment, said determining said set of target nodes according to said node configuration information in response to said target request message comprises: under the condition that the target request message indicates that the target service data is requested to be read, acquiring a first node set according to the node configuration information, wherein the first node set comprises nodes in a working state at the current moment; under the condition that the first node set is obtained, determining the first node set as the target node set; and under the condition that the first node set is not acquired, determining a second node set as the target node set, wherein the second node set comprises nodes which are predetermined before the current time and indicated by the node configuration information.
In an exemplary embodiment, after the obtaining of the first set of nodes, the method further includes: comparing whether a first version number of the first node set is consistent with a second version number in the node configuration information or not; determining the first node set as the target node set when the first version number and the second version number are consistent; and determining the second node set as the target node set under the condition that the first version number is not consistent with the second version number.
In an exemplary embodiment, the method further comprises: acquiring node updating indication information, wherein the node updating indication information is used for modifying the number of nodes of a target node set in the node configuration information; and determining the number of the nodes in the target node set according to the node updating indication information.
In an exemplary embodiment, the assembling, in response to the target request message, data stored by each node in the target node set into the target service data includes: under the condition that the target request message indicates that the target service data is requested to be updated, acquiring a third node set according to the node configuration information, wherein the third node set is a mirror image node set corresponding to a first node set at the current time, and the first node set comprises nodes in a working state at the current time; writing the service data to be updated into the third node set; under the condition that the service data to be updated is written into the third node set, updating the third node set into the first node set, and reconfiguring the third node set according to the updated first node set; and assembling the updated data stored by each node in the first node set into the updated target service data.
In an exemplary embodiment, the assembling, in response to the target request message, data stored by each node in the target node set into the target service data includes: under the condition that the target request message indicates that the target service data is requested to be updated, acquiring a fourth node set according to the node configuration information, wherein the fourth node set is a mirror image node set corresponding to a fifth node set at the current time, the fifth node set comprises nodes in a working state at the current time, and the nodes in the fifth node set are nodes predetermined before the current time; writing the service data to be updated into the fourth node set; under the condition that the service data to be updated is written into the fourth node set, updating the fourth node set into the fifth node set, and reconfiguring the fourth node set according to the updated fifth node set; and splicing the updated data stored by each node in the fifth node set into the updated target service data.
In an exemplary embodiment, after obtaining the target request message, the method further includes: under the condition that the target request message is determined to carry the distributed lock, responding to the target request message, and assembling data stored by each node in a target node set into the target service data; and after the data stored by each node in the target node set is assembled into the target service data, releasing the distributed lock carried by the target request message.
According to a second aspect of the embodiments of the present disclosure, there is provided an apparatus for processing data, including: the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a target request message, and the target request message is used for requesting to process target service data; and the assembling module is used for responding to the target request message and assembling data stored by each node in a target node set into the target service data, wherein each node in the target node set stores part of the target service data, and the storage space occupied by the target service data is larger than that of any node in the target node set.
In an exemplary embodiment, the construction module includes: a first obtaining unit, configured to obtain node configuration information in response to the target request message, where the node configuration information is used to determine a node set that stores the target service data; and the first assembling unit is used for determining the target node set according to the node configuration information and assembling data stored by each node in the target node set into the target service data.
In an exemplary embodiment, the first construction unit includes: a first obtaining subunit, configured to, when the target request message indicates that reading of the target service data is requested, obtain a first node set according to the node configuration information, where the first node set includes a node in a working state at a current time; a first determining subunit, configured to determine the first node set as the target node set when the first node set is obtained; a second determining subunit, configured to determine a second node set as the target node set when the first node set is not acquired, where the second node set includes a node that is predetermined before the current time and is indicated by the node configuration information.
In an exemplary embodiment, the first construction unit further comprises: the comparison subunit is configured to compare, after the first node set is obtained, whether a first version number of the first node set is consistent with a second version number in the node configuration information; a third determining subunit, configured to determine the first node set as the target node set when the first version number and the second version number are consistent; a fourth determining subunit, configured to determine the second node set as the target node set when the first version number is inconsistent with the second version number.
In an exemplary embodiment, the first construction unit further comprises: a second obtaining subunit, configured to obtain node update indication information, where the node update indication information is used to modify the number of nodes in the target node set in the node configuration information; and the adjusting subunit is configured to adjust the number of nodes in the target node set according to the node update indication information.
In an exemplary embodiment, the construction module includes: a second obtaining unit, configured to obtain, when the target request message indicates that the target service data is requested to be updated, a third node set according to the node configuration information, where the third node set is a mirror image node set corresponding to a first node set at a current time, and the first node set includes a node in a working state at the current time; a first writing unit, configured to write service data to be updated into the third node set; a first updating unit, configured to update the third node set to the first node set when the to-be-updated service data has been written into the third node set, and reconfigure the third node set according to the updated first node set; and the second assembling unit is used for assembling the updated data stored by each node in the first node set into the updated target service data.
In an exemplary embodiment, the mosaic module comprises: a third obtaining unit, configured to obtain a fourth node set according to the node configuration information when the target request message indicates that the target service data is requested to be updated, where the fourth node set is a mirror image node set corresponding to a fifth node set at a current time, the fifth node set includes nodes in a working state at the current time, and nodes in the fifth node set are nodes predetermined before the current time; a second writing unit, configured to write the service data to be updated into the fourth node set; a second updating unit, configured to update the fourth node set to the fifth node set when the to-be-updated service data has been written into the fourth node set, and reconfigure the fourth node set according to the updated fifth node set; and a third assembling unit, configured to assemble the updated data stored in each node in the fifth node set into the updated target service data.
In an exemplary embodiment, the apparatus further comprises: the processing module is used for responding to the target request message and splicing data stored by each node in a target node set into the target service data under the condition that the distributed lock is carried in the target request message after the target request message is obtained; and the release module is used for releasing the distributed locks carried by the target request messages after the data stored by each node in the target node set is assembled into the target service data.
According to another aspect of the embodiments of the present disclosure, there is provided an electronic device for processing data, including: a processor; a memory for storing the processor-executable instructions; wherein the processor is configured to execute the instructions to implement the data processing method as described above.
According to still another aspect of the embodiments of the present disclosure, there is also provided a computer-readable storage medium having a computer program stored therein, wherein the computer program is configured to execute the above data processing method when running.
According to yet another aspect of an embodiment of the present disclosure, there is also provided a computer program product or a computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the processing method of the data.
The technical scheme provided by the embodiment of the disclosure at least brings the following beneficial effects: the method comprises the steps of obtaining a target request message, wherein the target request message is used for requesting to process target service data; responding to a target request message, assembling data stored by each node in a target node set into target service data, wherein each node in the target node set stores part of the target service data, the storage space occupied by the target service data is larger than that of any node in the target node set, determining the target node set by using the target request message, and assembling the data stored by each node into the target service data, so that the storage space occupied by the target service data is larger than that of any node in the target node set, the utilization rate of the node storage space is improved, and the technical problems that the storage capacity of a single node is limited and a large amount of data is difficult to be stored in the related technology are solved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the disclosure and are not to be construed as limiting the disclosure.
FIG. 1 is a schematic diagram of an application environment illustrating a method of processing data in accordance with an exemplary embodiment;
FIG. 2 is a flow diagram illustrating a method of processing data in accordance with an exemplary embodiment;
FIG. 3 is a schematic diagram illustrating an application scenario of a method for processing data according to an exemplary embodiment;
FIG. 4 is a node configuration information diagram illustrating a method of processing data in accordance with an exemplary embodiment;
FIG. 5 is a flow chart illustrating a method of processing data in accordance with an exemplary embodiment;
FIG. 6 is a flow chart illustrating another method of processing data in accordance with an exemplary embodiment;
FIG. 7 is a flow chart illustrating yet another method of processing data in accordance with an exemplary embodiment;
FIG. 8 is a diagram illustrating a method of processing data in accordance with an exemplary embodiment;
FIG. 9 is a block diagram illustrating a data processing device in accordance with an exemplary embodiment;
FIG. 10 is a block diagram of an electronic device shown in accordance with an example embodiment.
Detailed Description
In order to make the technical solutions of the present disclosure better understood by those of ordinary skill in the art, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the foregoing drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein are capable of operation in sequences other than those illustrated or otherwise described herein. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the disclosure, as detailed in the appended claims.
First, some terms or terms appearing in the description of the embodiments of the present application are applicable to the following explanations:
ZooKeeper (distributed application program coordination service software) is a distributed, open-source distributed application program coordination service, and is software for providing consistency service for distributed applications, and the provided functions include: the ZooKeeper aims to package complex and error-prone key services and provides a simple and easy-to-use interface, a system with high performance and stable functions for users.
The invention is illustrated below with reference to examples:
according to an aspect of the embodiment of the present invention, a method for processing data is provided, and optionally, in this embodiment, the method for processing data may be applied to a hardware environment formed by the server 101 and the terminal device 103 as shown in fig. 1. As shown in fig. 1, a server 101 is connected to a terminal 103 through a network, and may be configured to provide a service for a terminal device or a client installed on the terminal device, where the client may be a video client, an instant messaging client, a browser client, an education client, a game client, or the like. The database 105 may be provided on or separate from the server for providing data storage services for the server 101, such as an image data storage server, and the network may include, but is not limited to: a wired network, a wireless network, wherein the wired network comprises: a local area network, a metropolitan area network, and a wide area network, the wireless network comprising: bluetooth, WIFI, and other networks that enable wireless communication, the terminal device 103 may be a terminal configured with an application program, and may include but is not limited to at least one of the following: the application 107 using the data processing method is displayed through a client installed on the terminal device 103 or the server 101 by using a Mobile phone (such as an Android Mobile phone, an iOS Mobile phone, etc.), a notebook computer, a tablet computer, a palm computer, an MID (Mobile Internet Devices), a PAD, a desktop computer, a smart television, etc., where the server may be a single server, or a server cluster composed of a plurality of servers, or a cloud server.
As shown in fig. 1, the data processing method may be implemented in the terminal device 103 by the following steps:
s1, acquiring a target request message on a terminal device 103, wherein the target request message is used for requesting to process target service data;
and S2, responding to the target request message, and assembling data stored by each node in the target node set into target service data on the terminal equipment 103, wherein each node in the target node set stores part of the target service data, and the storage space occupied by the target service data is larger than that of any node in the target node set.
Optionally, in this embodiment, the data processing method may also be implemented on the server 101 in a similar manner, or may also be implemented asynchronously by the server 101 and the terminal device 103.
The above is only an example, and the present embodiment is not particularly limited.
Optionally, as an optional implementation manner, as shown in fig. 2, the data processing method includes:
s202, acquiring a target request message, wherein the target request message is used for requesting to process target service data;
s204, responding to the target request message, assembling data stored by each node in the target node set into target service data, wherein each node in the target node set stores part of the target service data, and the storage space occupied by the target service data is larger than that of any node in the target node set.
Optionally, in this embodiment, the target request message may include, but is not limited to, a read signal (read signal) used in ZooKeeper, where the request message is used to request processing of target service data determined according to the current service requirement.
Optionally, in this embodiment, the data processing method may be applied to a field including but not limited to cloud computing, and specifically may include but not limited to a cloud storage field.
Among them, cloud computing (cloud computing) is a computing model that distributes computing tasks over a resource pool formed by a large number of computers, so that various application systems can obtain computing power, storage space, and information services as needed. The network that provides the resources is referred to as the "cloud". Resources in the "cloud" appear to the user as being infinitely expandable and available at any time, available on demand, expandable at any time, and paid for on-demand.
As a basic capability provider of cloud computing, a cloud computing resource pool (called as an ifas (Infrastructure as a Service) platform for short is established, and multiple types of virtual resources are deployed in the resource pool and are selectively used by external clients.
According to the logic function division, a Platform as a Service (PaaS a Service) layer can be deployed on an Infrastructure as a Service (IaaS) layer, a Software as a Service (SaaS a Service) layer is deployed on the PaaS layer, and the SaaS layer can be directly deployed on the IaaS layer. PaaS is a platform on which software runs, such as a database, a web container, etc. SaaS is a variety of business software, such as web portal, sms, and mass texting. Generally speaking, saaS and PaaS are upper layers relative to IaaS.
A distributed cloud storage system (hereinafter, referred to as a storage system) refers to a storage system that integrates a large number of storage devices (storage devices are also referred to as storage nodes) of different types in a network through application software or application interfaces to cooperatively work by using functions such as cluster application, grid technology, and a distributed storage file system, and provides a data storage function and a service access function to the outside.
At present, a storage method of a storage system is as follows: logical volumes are created, and when a logical volume is created, physical storage space, which may be the disk composition of a certain storage device or several storage devices, is allocated to each logical volume. The client stores data on a certain logical volume, that is, the data is stored on a file system, the file system divides the data into a plurality of parts, each part is an object, the object not only contains the data but also contains additional information such as data identification (ID, ID entry), the file system writes each object into a physical storage space of the logical volume, and the file system records storage location information of each object, so that when the client requests to access the data, the file system can allow the client to access the data according to the storage location information of each object.
The process of allocating physical storage space for the logical volume by the storage system specifically includes: physical storage space is divided in advance into stripes according to a group of capacity measures of objects stored in a logical volume (the measures often have a large margin with respect to the capacity of the actual objects to be stored) and Redundant Array of Independent Disks (RAID), and one logical volume can be understood as one stripe, thereby allocating physical storage space to the logical volume.
Optionally, in this embodiment, the nodes in the target node set may include, but are not limited to, a znode node (that is, a data node in a ZooKeeper), where each node in the target node set stores part of the target service data, and it may be understood that, by storing part of the target service data in each node in the node set respectively, and assembling each part of the target service data into complete target service data in a splicing manner for subsequent use, where a storage space occupied by the target service data is larger than a storage space of any node in the target node set, it may be understood that the storage space occupied by the target service data cannot be stored in any single node in the target node set, and at least two nodes need to be used for storage, and subsequent data splicing is performed to implement use of the target service data.
For example, fig. 3 is an application scenario schematic diagram of a data processing method shown according to an exemplary embodiment, and as shown in fig. 3, the application scenario schematic diagram includes a plurality of Znode nodes, where a Znode node may be a temporary node or a persistent node, the Znode nodes are nodes in the target node set, each Znode node is configured to store part of target service data, when a target request message is obtained, the part of service data stored in the Znode nodes are spliced to obtain the target service data, and in a ZooKeeper, the node is called a Znode, and the Znode nodes are divided into two types: 1. persistent node, 2, temporary node.
It should be noted that "/Java,/Java/zk,/Java/mq" shown in fig. 3 are all acquisition paths of the Znode node, that is, the partial target service data may be stored in a corresponding node through the paths.
The above is merely an example, and the embodiments of the present application are not limited in any way.
According to the embodiment, the target request message is acquired, wherein the target request message is used for requesting to process the target service data; responding to a target request message, assembling data stored by each node in a target node set into target service data, wherein each node in the target node set stores part of target service data, and the storage space occupied by the target service data is larger than that of any node in the target node set.
In an exemplary embodiment, the assembling, in response to the target request message, data stored by each node in the target node set into the target service data includes:
responding to the target request message, and acquiring node configuration information, wherein the node configuration information is used for determining a node set for storing the target service data;
and determining the target node set according to the node configuration information, and assembling data stored by each node in the target node set into the target service data.
Optionally, in this embodiment, the node configuration information may include, but is not limited to, information indicating an order of magnitude of the service data, information indicating a currently operating node, information of a candidate node, information of a bottom candidate node, and the like.
Fig. 4 is a schematic diagram illustrating node configuration information of a data processing method according to an exemplary embodiment, as shown in fig. 4, including information such as "+ size", "+ wordzenode list", "+ candndatezknodelist", "+ backwormworkzknodelist" to indicate the magnitude of the above traffic data, information for indicating the currently operating node, information of a candidate node, information of a bottom candidate node, and the like.
The above description is merely an example, and the embodiments of the present application are not limited in any way.
According to the embodiment, the node configuration information is determined according to the target request message, and then the node set required to be used can be determined according to the node configuration information, so that the utilization rate of the node storage space is improved, and the technical problems that in the related technology, the storage capacity of a single node is limited and the storage of a large amount of data is difficult to satisfy are solved.
In an exemplary embodiment, said determining said set of target nodes in accordance with said node configuration information in response to said target request message comprises:
under the condition that the target request message indicates that the target service data is requested to be read, acquiring a first node set according to the node configuration information, wherein the first node set comprises nodes in a working state at the current moment;
under the condition that the first node set is obtained, determining the first node set as the target node set;
and under the condition that the first node set is not acquired, determining a second node set as the target node set, wherein the second node set comprises nodes which are predetermined before the current time and indicated by the node configuration information.
Optionally, in this embodiment, the target request message indicates that the target service data is requested to be read, which may be understood that the target request message is a read signal, the read signal is used to read the target service data, after the read signal is received, the node configuration information may be read first, the first node set in the working state at the current time is obtained from the node configuration information first, when the first node set is obtained successfully, the partial target service data are read from the first node set respectively, and finally, the read service data are assembled into complete target service data for downstream use.
Optionally, in this embodiment, when the first node set in the working state at the current time is obtained from the node configuration information first, and when obtaining the first node set fails, a second node set is obtained, where the second node set is a bottom node set indicated by the node configuration information, the node set is a node set predetermined before the current time, service data stored in the second node set is the same as service data stored in the first node set that is currently working, at this time, the partial target service data is read from the second node set, and finally, the read service data is assembled into complete target service data for downstream use.
For example, fig. 5 is a schematic diagram illustrating a method for processing data according to an exemplary embodiment, which, as shown in fig. 5, may include, but is not limited to, the following steps:
s1, acquiring a read signal (corresponding to the target request message);
s2, zk configuration information reading (corresponding to the aforementioned node configuration information);
s3, acquiring a working zk node set (corresponding to the first node set);
s4, reading data in the node set under the condition of successful acquisition, and assembling the data into complete data;
and S5, under the condition of failure of acquisition, acquiring the zk node set (corresponding to the second node set), reading data in the zk node set, and assembling the data into complete data.
The above is merely an example, and the present embodiment is not limited in any way.
In an exemplary embodiment, after the obtaining of the first set of nodes, the method further includes:
comparing whether the first version number of the first node set is consistent with the second version number in the node configuration information;
determining the first node set as the target node set when the first version number is consistent with the second version number;
and determining the second node set as the target node set under the condition that the first version number is not consistent with the second version number.
Optionally, in this embodiment, the method may include, but is not limited to, comparing, according to the obtained first node set that is working, whether a version number of the node set is consistent with a version number recorded in the node configuration information:
1) If the data in each node is consistent, reading the data in each node, and finally splicing the data into complete data for service use;
2) And if the data are inconsistent, acquiring the zk nodes at the bottom of the pocket, and splicing the zk nodes into complete data for service use.
In an exemplary embodiment, the method further comprises:
acquiring node updating indication information, wherein the node updating indication information is used for modifying the number of nodes of a target node set in the node configuration information;
and adjusting the number of the nodes in the target node set according to the node updating indication information.
Optionally, in this embodiment, the node update indication information may include, but is not limited to, indicating the number of nodes in a target node set in modified node configuration information, where a preset number of extension nodes are configured in advance, and when a load of the target node set at the current time meets a preset condition, obtaining the node update indication information to indicate a client of the monitoring node to modify node configuration information, and adjusting the number of nodes currently operating.
By the embodiment, the pre-configured expansion nodes are adopted, and the architecture realized by a plurality of ZooKeeper nodes is utilized, so that the horizontal expansion and dynamic capacity expansion of the number of nodes can be supported, and the horizontal expansion can be realized only by modifying the number of nodes of the target node set configured in the node configuration information subsequently, and the limitation of the storage capacity of a single node is solved.
In an exemplary embodiment, the assembling, in response to the target request message, data stored by each node in a target node set into the target service data includes:
under the condition that the target request message indicates that the target service data is requested to be updated, acquiring a third node set according to the node configuration information, wherein the third node set is a mirror image node set corresponding to a first node set at the current time, and the first node set comprises nodes in a working state at the current time;
writing the service data to be updated into the third node set;
under the condition that the service data to be updated is written into the third node set, updating the third node set into the first node set, and reconfiguring the third node set according to the updated first node set;
and assembling the updated data stored by each node in the first node set into the updated target service data.
Optionally, in this embodiment, the target request message may include, but is not limited to, a concurrent update signal, the third node set may be understood as a preconfigured candidate node set, the candidate node set is recorded in the node configuration information, and the candidate node set is a mirror node set of the first node set, and when a new node set does not entirely replace a working first node set, read configurations are guaranteed to be data of the same version by using a copy-on-write (copy-on-write) manner, so that a situation that read data is unavailable and a data version is inconsistent is avoided. The copyOnWrite idea is realized by redundantly writing a candidate node set (corresponding to the third node set) onto the candidate node set during data writing operation, and writing the re-written node configuration information successfully, so that when writing data of the candidate node set, reading and writing of normal working data are not influenced, and data formed by each data node set is a snapshot of complete data.
For example, fig. 6 is a schematic diagram illustrating another data processing method according to an exemplary embodiment, which, as shown in fig. 6, may include, but is not limited to, the following steps:
s1, acquiring an update signal (corresponding to the target request message);
s2, acquiring a signal of a redis lock through a redis distributed lock module;
s3, zk configuration information reading (corresponding to the aforementioned node configuration information);
s4, acquiring a candidate zk node set (corresponding to the third node set);
s5, under the condition that the candidate zk node set is successfully obtained, filling the candidate zk nodes with data needing to be filled;
s6, updating node configuration information, changing the candidate zk node set into a working zk node set, and changing the working zk node set into a candidate zk node set;
s7, releasing a redis lock under the condition that the candidate zk node set fails to be acquired or the node configuration information is updated.
The above is merely an example, and the present embodiment is not limited in any way.
In an exemplary embodiment, the assembling, in response to the target request message, data stored by each node in the target node set into the target service data includes:
under the condition that the target request message indicates that the target service data is requested to be updated, acquiring a fourth node set according to the node configuration information, wherein the fourth node set is a mirror image node set corresponding to a fifth node set at the current time, the fifth node set comprises nodes in a working state at the current time, and the nodes in the fifth node set are nodes predetermined before the current time;
writing the service data to be updated into the fourth node set;
under the condition that the service data to be updated is written into the fourth node set, updating the fourth node set into the fifth node set, and reconfiguring the fourth node set according to the updated fifth node set;
and assembling the updated data stored by each node in the fifth node set into the updated target service data.
Optionally, in this embodiment, the fifth node set is a node set predetermined before the current time, and may be understood as a bottom node set, that is, the currently used target service data may be stored in a node at a preset time, so as to maintain the storage of normal data when the first node set cannot be used.
Optionally, in this embodiment, the fourth node set is a mirror image set of the fifth node set, that is, after the fifth node set performs service processing, a backup is redundant and used as a candidate node set of the fifth node set.
For example, fig. 7 is a schematic diagram illustrating yet another data processing method according to an exemplary embodiment, and as shown in fig. 7, may include, but is not limited to, the following steps:
s1, acquiring a bottom-pocketed task signal (a bottom-pocketed task corresponding to the target request message);
s2, acquiring a signal of a redis lock through a redis distributed lock module;
s3, zk configuration information reading (corresponding to the aforementioned node configuration information);
s4, acquiring a candidate pocket bottom zk node set (corresponding to the fourth node set);
s5, under the condition that the candidate pocket bottom zk node set is successfully acquired, filling the candidate pocket bottom zk nodes with data needing to be filled;
s6, updating node configuration information, changing the candidate pocket bottom zk node set into a working pocket bottom zk node set, and changing the working pocket bottom zk node set into a candidate pocket bottom zk node set;
s7, releasing a redis lock under the condition that the candidate pocket bottom zk node set fails to be acquired or the updating of the node configuration information is completed.
In an exemplary embodiment, after obtaining the target request message, the method further comprises:
under the condition that the target request message is determined to carry the distributed lock, responding to the target request message, and assembling data stored by each node in a target node set into the target service data;
and after the data stored by each node in the target node set is assembled into the target service data, releasing the distributed lock carried by the target request message.
Fig. 8 is a schematic diagram illustrating a method of processing data according to an exemplary embodiment, where, as shown in fig. 8, a Redis distributed lock includes:
the setNx syntax of timeout is adopted. setNx (set if not exit) is a key which is set when a value does not exist in redis, and only one key can be successfully set when a value is set simultaneously by multiple threads, so that the uniqueness of the lock is ensured. Meanwhile, the overtime time is set, so that the redis lock can be released under the condition that the overtime is not released, and the robustness of the redis lock is optimized.
FIG. 9 is a block diagram illustrating a data processing apparatus according to an example embodiment. Referring to fig. 8, the apparatus includes an acquisition module 902, and a construction module 904.
The obtaining module 902 is configured to obtain a target request message, where the target request message is used to request processing of target service data;
the assembling module 904 is configured to, in response to the target request message, assemble data stored by each node in a target node set into the target service data, where each node in the target node set stores part of the target service data, and a storage space occupied by the target service data is larger than a storage space of any node in the target node set.
In an exemplary embodiment, the mosaic module comprises:
a first obtaining unit, configured to obtain node configuration information in response to the target request message, where the node configuration information is used to determine a node set that stores the target service data;
and the first assembling unit is used for determining the target node set according to the node configuration information and assembling data stored by each node in the target node set into the target service data.
In an exemplary embodiment, the first construction unit includes:
a first obtaining subunit, configured to, when the target request message indicates that reading of the target service data is requested, obtain a first node set according to the node configuration information, where the first node set includes a node in a working state at a current time;
a first determining subunit, configured to determine the first node set as the target node set when the first node set is obtained;
a second determining subunit, configured to determine a second node set as the target node set when the first node set is not acquired, where the second node set includes a node that is predetermined before the current time and is indicated by the node configuration information.
In an exemplary embodiment, the first construction unit further comprises:
the comparison subunit is configured to compare, after the first node set is obtained, whether a first version number of the first node set is consistent with a second version number in the node configuration information;
a third determining subunit, configured to determine the first node set as the target node set when the first version number and the second version number are consistent;
a fourth determining subunit, configured to determine the second node set as the target node set when the first version number and the second version number are not consistent.
In an exemplary embodiment, the first construction unit further comprises:
a second obtaining subunit, configured to obtain node update indication information, where the node update indication information is used to modify the number of nodes in the target node set in the node configuration information;
and the adjusting subunit is configured to adjust the number of nodes in the target node set according to the node update indication information.
In an exemplary embodiment, the construction module includes:
a second obtaining unit, configured to obtain, when the target request message indicates that the target service data is requested to be updated, a third node set according to the node configuration information, where the third node set is a mirror image node set corresponding to a first node set at a current time, and the first node set includes a node in a working state at the current time;
a first writing unit, configured to write service data to be updated into the third node set;
a first updating unit, configured to update the third node set to the first node set when the to-be-updated service data has been written into the third node set, and reconfigure the third node set according to the updated first node set;
and the second assembling unit is used for assembling the updated data stored by each node in the first node set into the updated target service data.
In an exemplary embodiment, the construction module includes:
a third obtaining unit, configured to obtain a fourth node set according to the node configuration information when the target request message indicates that the target service data is requested to be updated, where the fourth node set is a mirror image node set corresponding to a fifth node set at a current time, the fifth node set includes nodes in a working state at the current time, and nodes in the fifth node set are nodes predetermined before the current time;
a second writing unit, configured to write the service data to be updated into the fourth node set;
a second updating unit, configured to update the fourth node set to the fifth node set when the service data to be updated has been written into the fourth node set, and reconfigure the fourth node set according to the updated fifth node set;
and the third assembling unit is used for assembling the updated data stored by each node in the fifth node set into the updated target service data.
In an exemplary embodiment, the apparatus further comprises:
the processing module is used for responding to the target request message and splicing data stored by each node in a target node set into the target service data under the condition that the distributed lock is carried by the target request message after the target request message is obtained;
and the release module is used for releasing the distributed locks carried by the target request messages after the data stored by each node in the target node set is assembled into the target service data.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
According to another aspect of the embodiment of the present invention, there is also provided an electronic device for implementing the data processing method, where the electronic device may be the terminal device or the server shown in fig. 1. The present embodiment takes the electronic device as a server as an example for explanation. As shown in fig. 10, the electronic device comprises a memory 1002 and a processor 1004, the memory 1002 having stored therein a computer program, the processor 1004 being arranged to execute the steps of any of the method embodiments described above by means of the computer program.
Optionally, in this embodiment, the electronic device may be located in at least one network device of a plurality of network devices of a computer network.
Optionally, in this embodiment, the processor may be configured to execute the following steps by a computer program:
s1, acquiring a target request message, wherein the target request message is used for requesting to process target service data;
and S2, responding to the target request message, assembling data stored by each node in the target node set into target service data, wherein each node in the target node set stores part of the target service data, and the storage space occupied by the target service data is larger than that of any node in the target node set.
Optionally, in this embodiment, the processor may be further configured to execute, by the computer program, the following steps:
s1, acquiring a target request message, wherein the target request message is used for requesting to process target service data;
and S2, responding to the target request message, assembling data stored by each node in the target node set into target service data, wherein each node in the target node set stores part of the target service data, and the storage space occupied by the target service data is larger than that of any node in the target node set.
Alternatively, it can be understood by those skilled in the art that the structure shown in fig. 10 is only an illustration, and the electronic device may also be a terminal device such as a smart phone (e.g., an Android phone, an iOS phone, etc.), a tablet computer, a palmtop computer, a Mobile Internet Device (MID), a PAD, and the like. Fig. 10 is a diagram illustrating a structure of the electronic device. For example, the electronics may also include more or fewer components (e.g., network interfaces, etc.) than shown in FIG. 10, or have a different configuration than shown in FIG. 10.
The memory 1002 may be used to store software programs and modules, such as program instructions/modules corresponding to the data processing method and apparatus in the embodiments of the present invention, and the processor 1004 executes various functional applications and data processing by running the software programs and modules stored in the memory 1002, that is, implements the data processing method described above. The memory 1002 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 1002 can further include memory located remotely from the processor 1004, which can be coupled to the terminal over 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 memory 1002 may be, but not limited to, specifically configured to store information such as historical user data. As an example, as shown in fig. 10, the memory 1002 may include, but is not limited to, an obtaining module 902 and a splicing module 904 in a processing device that includes the data. In addition, the data processing device may further include, but is not limited to, other module units in the data processing device, which is not described in this example again.
Optionally, the above-mentioned transmission device 1006 is used for receiving or sending data via a network. Examples of the network may include a wired network and a wireless network. In one example, the transmission device 1006 includes a Network adapter (NIC) that can be connected to a router via a Network cable and other Network devices so as to communicate with the internet or a local area Network. In one example, the transmission device 1006 is a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.
In addition, the electronic device further includes: a display 1008, configured to display the target service data; and a connection bus 1010 for connecting the respective module components in the electronic apparatus.
In other embodiments, the terminal device or the server may be a node in a distributed system, where the distributed system may be a blockchain system, and the blockchain system may be a distributed system formed by connecting a plurality of nodes through a network communication. The nodes may form a Peer-To-Peer (P2P) network, and any type of computing device, such as a server, a terminal, and other electronic devices, may become a node in the blockchain system by joining the Peer-To-Peer network.
In an exemplary embodiment, there is also provided a computer program product comprising computer programs/instructions which, when executed by a processor, implement the above-described information transmission method.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice in the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.
Claims (10)
1. A method for processing data, comprising:
acquiring a target request message, wherein the target request message is used for requesting to process target service data;
and responding to the target request message, and splicing data stored by each node in a target node set into the target service data, wherein each node in the target node set stores part of the target service data, and the storage space occupied by the target service data is larger than that of any node in the target node set.
2. The method of claim 1, wherein the assembling data stored by each node in the target node set into the target service data in response to the target request message comprises:
responding to the target request message, and acquiring node configuration information, wherein the node configuration information is used for determining a node set for storing the target service data;
and determining the target node set according to the node configuration information, and splicing data stored by each node in the target node set into the target service data.
3. The method of claim 2, wherein the determining the set of target nodes according to the node configuration information in response to the target request message comprises:
under the condition that the target request message indicates that the target service data is requested to be read, acquiring a first node set according to the node configuration information, wherein the first node set comprises nodes in a working state at the current moment;
under the condition that the first node set is obtained, determining the first node set as the target node set;
determining a second node set as the target node set under the condition that the first node set is not acquired, wherein the second node set comprises nodes which are predetermined before the current time and indicated by the node configuration information.
4. The method of claim 3, wherein after obtaining the first set of nodes, the method further comprises:
comparing whether the first version number of the first node set is consistent with the second version number in the node configuration information;
determining the first node set as the target node set when the first version number is consistent with the second version number;
and determining the second node set as the target node set under the condition that the first version number is not consistent with the second version number.
5. The method of claim 2, further comprising:
acquiring node updating indication information, wherein the node updating indication information is used for modifying the number of nodes of a target node set in the node configuration information;
and determining the number of the nodes in the target node set according to the node updating indication information.
6. The method of claim 1, wherein the assembling data stored in each node in the target node set into the target service data in response to the target request message comprises:
under the condition that the target request message indicates that the target service data is requested to be updated, acquiring a third node set according to the node configuration information, wherein the third node set is a mirror image node set corresponding to a first node set at the current time, and the first node set comprises nodes in a working state at the current time;
writing the service data to be updated into the third node set;
under the condition that the service data to be updated is written into the third node set, updating the third node set into the first node set, and reconfiguring the third node set according to the updated first node set;
and assembling the updated data stored by each node in the first node set into the updated target service data.
7. An apparatus for processing data, comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a target request message, and the target request message is used for requesting to process target service data;
and the assembling module is used for responding to the target request message and assembling data stored by each node in a target node set into the target service data, wherein each node in the target node set stores part of the target service data, and the storage space occupied by the target service data is larger than that of any node in the target node set.
8. An electronic device, comprising:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the instructions to implement a method of processing data as claimed in any one of claims 1 to 6.
9. A computer-readable storage medium, wherein instructions in the computer-readable storage medium, when executed by a processor of an electronic device, enable the electronic device to perform the method of processing data of any of claims 1 to 6.
10. A computer program product comprising a computer program, characterized in that the computer program, when being executed by a processor, implements a method of processing data according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210857497.3A CN115277735B (en) | 2022-07-20 | 2022-07-20 | Data processing method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210857497.3A CN115277735B (en) | 2022-07-20 | 2022-07-20 | Data processing method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115277735A true CN115277735A (en) | 2022-11-01 |
| CN115277735B CN115277735B (en) | 2023-11-28 |
Family
ID=83766655
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210857497.3A Active CN115277735B (en) | 2022-07-20 | 2022-07-20 | Data processing method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115277735B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115866039A (en) * | 2022-11-29 | 2023-03-28 | 北京达佳互联信息技术有限公司 | Message processing method and device, electronic equipment and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100293334A1 (en) * | 2009-05-15 | 2010-11-18 | Microsoft Corporation | Location updates for a distributed data store |
| US20150324371A1 (en) * | 2013-12-31 | 2015-11-12 | Huawei Technologies Co., Ltd. | Data Processing Method and Device in Distributed File Storage System |
| CN110474963A (en) * | 2019-07-17 | 2019-11-19 | 中国平安人寿保险股份有限公司 | A kind of resource access method based on zookeeper, system, medium and electronic equipment |
| CN111143382A (en) * | 2019-12-13 | 2020-05-12 | 新华三大数据技术有限公司 | Data processing method, system and computer readable storage medium |
| CN111212123A (en) * | 2019-12-26 | 2020-05-29 | 天津中科曙光存储科技有限公司 | ZooKeeper-based Lunmap management method |
| CN111737018A (en) * | 2020-08-26 | 2020-10-02 | 腾讯科技（深圳）有限公司 | ZooKeeper configuration file storage processing method, device, equipment and medium thereof |
| CN112162846A (en) * | 2020-11-27 | 2021-01-01 | 腾讯科技（深圳）有限公司 | Transaction processing method, device and computer readable storage medium |
| CN113297166A (en) * | 2020-07-27 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Data processing system, method and device |
| CN113448938A (en) * | 2021-07-20 | 2021-09-28 | 恒安嘉新（北京）科技股份公司 | Data processing method and device, electronic equipment and storage medium |
-
2022
- 2022-07-20 CN CN202210857497.3A patent/CN115277735B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100293334A1 (en) * | 2009-05-15 | 2010-11-18 | Microsoft Corporation | Location updates for a distributed data store |
| US20150324371A1 (en) * | 2013-12-31 | 2015-11-12 | Huawei Technologies Co., Ltd. | Data Processing Method and Device in Distributed File Storage System |
| CN110474963A (en) * | 2019-07-17 | 2019-11-19 | 中国平安人寿保险股份有限公司 | A kind of resource access method based on zookeeper, system, medium and electronic equipment |
| CN111143382A (en) * | 2019-12-13 | 2020-05-12 | 新华三大数据技术有限公司 | Data processing method, system and computer readable storage medium |
| CN111212123A (en) * | 2019-12-26 | 2020-05-29 | 天津中科曙光存储科技有限公司 | ZooKeeper-based Lunmap management method |
| CN113297166A (en) * | 2020-07-27 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Data processing system, method and device |
| CN111737018A (en) * | 2020-08-26 | 2020-10-02 | 腾讯科技（深圳）有限公司 | ZooKeeper configuration file storage processing method, device, equipment and medium thereof |
| CN112162846A (en) * | 2020-11-27 | 2021-01-01 | 腾讯科技（深圳）有限公司 | Transaction processing method, device and computer readable storage medium |
| CN113448938A (en) * | 2021-07-20 | 2021-09-28 | 恒安嘉新（北京）科技股份公司 | Data processing method and device, electronic equipment and storage medium |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115866039A (en) * | 2022-11-29 | 2023-03-28 | 北京达佳互联信息技术有限公司 | Message processing method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115277735B (en) | 2023-11-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9667750B2 (en) | Client-initiated leader election in distributed client-server systems | |
| US11853587B2 (en) | Data storage system with configurable durability | |
| CN102088490B (en) | Data storage method, device and system | |
| US9350682B1 (en) | Compute instance migrations across availability zones of a provider network | |
| US20140207918A1 (en) | Instance host configuration | |
| JP2015506523A (en) | Dynamic load balancing in a scalable environment | |
| US11262918B1 (en) | Data storage system with uneven drive wear reduction | |
| CN111399764B (en) | Data storage method, data reading device, data storage equipment and data storage medium | |
| CN111831232A (en) | Data storage method and device, storage medium and electronic device | |
| US10929041B1 (en) | Block-storage service supporting multi-attach | |
| US10990464B1 (en) | Block-storage service supporting multi-attach and health check failover mechanism | |
| CN105095103A (en) | Storage device management method and device used for cloud environment | |
| CN112559461A (en) | File transmission method and device, storage medium and electronic equipment | |
| CN111209090A (en) | Method and assembly for creating virtual machine in cloud platform and server | |
| US11461053B2 (en) | Data storage system with separate interfaces for bulk data ingestion and data access | |
| CN115277735B (en) | Data processing method and device, electronic equipment and storage medium | |
| CN107948229B (en) | Distributed storage method, device and system | |
| US11336723B1 (en) | Replicating data volume updates from clients accessing the data volume across fault tolerance zones | |
| EP4379543A1 (en) | Cloud desktop data migration method, service node, management node, server, electronic device, and computer-readable storage medium | |
| CN114172917B (en) | Distributed cache system and deployment method thereof | |
| CN107491551B (en) | Method and device for realizing client access of distributed file system | |
| CN111722783B (en) | Data storage method and device | |
| US11121981B1 (en) | Optimistically granting permission to host computing resources | |
| CN112800029A (en) | Method for overall migration of ceph cluster | |
| CN118193478A (en) | Storage space allocation method and server |
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 |