CN114338716A - Distributed storage method for user original data in flexible service scene - Google Patents
Distributed storage method for user original data in flexible service scene Download PDFInfo
- Publication number
- CN114338716A CN114338716A CN202111523335.8A CN202111523335A CN114338716A CN 114338716 A CN114338716 A CN 114338716A CN 202111523335 A CN202111523335 A CN 202111523335A CN 114338716 A CN114338716 A CN 114338716A
- Authority
- CN
- China
- Prior art keywords
- original data
- data information
- information
- distributed
- local
- 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
- 238000000034 method Methods 0.000 title claims abstract description 49
- 230000032683 aging Effects 0.000 claims abstract description 19
- 230000015654 memory Effects 0.000 claims description 24
- 230000002159 abnormal effect Effects 0.000 claims description 17
- 238000004891 communication Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 8
- 238000013507 mapping Methods 0.000 claims description 6
- 238000012163 sequencing technique Methods 0.000 claims description 2
- 238000012545 processing Methods 0.000 abstract description 18
- 238000013500 data storage Methods 0.000 abstract description 6
- 238000010276 construction Methods 0.000 description 13
- 230000006870 function Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000009825 accumulation Methods 0.000 description 2
- 238000012549 training Methods 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004140 cleaning Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
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
Abstract
The invention discloses a distributed storage method of user original data in a flexible serviceman scene, which comprises the steps of acquiring aging information corresponding to local original data information when the local original data information is newly added in a first distributed node, and determining first region information of the first distributed node; broadcasting local original data information in a preset peer-to-peer network, and determining each second distributed node receiving the local original data information; and selecting a preset number of third distributed nodes from the second distributed nodes based on the first region information, determining the storage time of the local original data information based on the time effectiveness information, and storing the local original data information into the third distributed nodes. The invention realizes that the mobility of the flexible working place is considered, so that the original data information can be directly called when the working personnel flow to other adjacent flexible working places, repeated redundant data does not need to be stored, and the data storage processing efficiency is improved.
Description
Technical Field
The application relates to the technical field of intelligent storage, in particular to a distributed storage method for user original data in a flexible service scene.
Background
At present, a large number of flexible service workers exist in urban construction sites, urban road cleaning and other urban flexible service places, in order to solve the problems of salary of the service workers, counterfeiting of middleman information and the like, the service workers are gradually required to perform real-name authentication through face attendance equipment during attendance checking, training and other operations, and original data need to be stored in order to ensure that information can be traced back. In a construction site system, attendance photos, payroll, training records, etc. need to be saved, which results in a large amount of data to be stored in an information system. Now, a client-side and server-side mode is generally adopted, and the client-side is responsible for generating original data, then sending the original data to the server-side, and storing and processing the original data by the server in a centralized manner. In addition to the common problems of a centralized data storage method that both the requirement for processing login and bandwidth are high, the data cannot be guaranteed not to be illegally tampered, redundant backup needs to be performed at a server end, and the like, due to the particularity of a flexible working place, workers in the centralized data storage method can frequently change, the residence time of each worker cannot be long, and the server still stores corresponding original data after the workers leave the flexible working place, so that the accumulation of redundant useless data is caused, and the data storage processing efficiency of the server is affected.
Disclosure of Invention
In order to solve the above problem, an embodiment of the present application provides a distributed storage method for user raw data in a flexible task work scenario.
In a first aspect, an embodiment of the present application provides a method for distributed storage of user raw data in a flexible service scenario, where the method includes:
when local original data information is newly added in a first distributed node, acquiring timeliness information corresponding to the local original data information, and determining first region information of the first distributed node;
broadcasting the local original data information in a preset peer-to-peer network, and determining each second distributed node receiving the local original data information;
and selecting a preset number of third distributed nodes from the second distributed nodes based on the first region information, determining storage time of the local original data information based on the aging information, and storing the local original data information into the third distributed nodes.
Preferably, after there is a new local original data information added to the first distributed node, the method further includes:
generating a file identification mark based on the local original data information;
and constructing a mapping relation between the local original data information and the file identification mark.
Preferably, after the storing the local original data information into each of the third distribution nodes, the method further includes:
communicating each file identification mark in each third distributed node every time a first preset time passes;
and when an abnormal file identification mark which cannot be matched exists, generating abnormal information based on the abnormal file identification mark, and determining an abnormal third distributed node corresponding to the abnormal file identification mark.
Preferably, the method further comprises:
when an original data calling request is received, determining the file identification corresponding to the original data calling request;
and sending a calling instruction to the third distributed node corresponding to the file identification mark to control the first distributed node and the third distributed node to carry out encryption communication.
Preferably, the method further comprises:
when an original data calling request is received, determining the file identification corresponding to the original data calling request;
and sending a calling instruction to the third distributed node corresponding to the file identification mark to control the first distributed node and the third distributed node to carry out encryption communication.
Preferably, the determining the storage time of the local raw data information based on the aging information includes:
and determining first time corresponding to the aging information, and adding the first time and preset second time to obtain the storage time of the local original data information.
Preferably, the method further comprises:
when repeated original data information is detected in the storage time, updating the storage time based on the repeated original data information, and adjusting the third distributed nodes used for storing the local original data information corresponding to the repeated original data information, so that each adjusted third distributed node is matched with the second local information corresponding to the repeated original data information.
In a second aspect, an embodiment of the present application provides a distributed storage apparatus for user raw data in a flexible service scenario, where the apparatus includes:
the acquisition module is used for acquiring aging information corresponding to local original data information when the local original data information is newly added to a first distributed node, and determining first region information of the first distributed node;
the broadcast module is used for broadcasting the local original data information in a preset peer-to-peer network and determining each second distributed node receiving the local original data information;
and the selecting module is used for selecting a preset number of third distributed nodes from the second distributed nodes based on the first region information, determining the storage time of the local original data information based on the aging information, and storing the local original data information into the third distributed nodes.
In a third aspect, an embodiment of the present application provides an electronic device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor executes the computer program to implement the steps of the method as provided in the first aspect or any one of the possible implementation manners of the first aspect.
In a fourth aspect, the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method as provided in the first aspect or any one of the possible implementations of the first aspect.
The invention has the beneficial effects that: by means of distributed storage of original data information, the nodes are backed up with each other to ensure safe storage of files, and network communication problems of the nodes are ensured through a P2P peer-to-peer network. In addition, in consideration of the mobility of the flexible work place, the original data information is provided with storage time and is preferentially distributed to the nodes matched with the region information of the original data information, so that the original data information can be directly called when workers flow to other adjacent flexible work places, repeated redundant data does not need to be stored, and the data storage processing efficiency is improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
Fig. 1 is a schematic flowchart of a distributed storage method for user raw data in a flexible service scenario according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a distributed storage apparatus for user raw data in a flexible service scenario according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application.
In the following description, the terms "first" and "second" are used for descriptive purposes only and are not intended to indicate or imply relative importance. The following description provides embodiments of the present application, where different embodiments may be substituted or combined, and thus the present application is intended to include all possible combinations of the same and/or different embodiments described. Thus, if one embodiment includes feature A, B, C and another embodiment includes feature B, D, then this application should also be considered to include an embodiment that includes one or more of all other possible combinations of A, B, C, D, even though this embodiment may not be explicitly recited in text below.
The following description provides examples, and does not limit the scope, applicability, or examples set forth in the claims. Changes may be made in the function and arrangement of elements described without departing from the scope of the disclosure. Various examples may omit, substitute, or add various procedures or components as appropriate. For example, the described methods may be performed in an order different than the order described, and various steps may be added, omitted, or combined. Furthermore, features described with respect to some examples may be combined into other examples.
Referring to fig. 1, fig. 1 is a schematic flowchart of a method for distributed storage of user raw data in a flexible service scenario according to an embodiment of the present application. In an embodiment of the present application, the method includes:
s101, when local original data information is newly added to a first distributed node, acquiring aging information corresponding to the local original data information, and determining first region information of the first distributed node.
The execution main body of the application can be a cloud server.
In the embodiment of the application, each distributed node can correspond to an equipment terminal in a flexible service place, the on-site terminal equipment is accessed into a special safe virtual network through a distributed system guide node, and the terminal equipment is added into the distributed system node after generating an original file. Specifically, when a face image for attendance checking and local original data information such as an electronic contract of a worker on a construction site are input for the first time in the equipment terminal, the cloud server detects that the local original data information is newly added to the corresponding first distributed node, and obtains aging information corresponding to the local original data information and first region information of the first distributed node. The time and the number of days of work of the staff in the flexible work place are related to the timeliness information, the local original data information to be stored is determined, and after the timeliness information is exceeded, the cloud server can delete the local original data information. The first region information indicates the specific region position of the distributed node, so that the storage position of the local original data information can be determined conveniently in the follow-up process.
S102, broadcasting the local original data information in a preset peer-to-peer network, and determining each second distributed node receiving the local original data information.
The Peer-to-Peer network may be understood as a Peer-to-Peer computer network in the embodiments of the present application, and is a distributed application architecture for distributing tasks and workloads among peers (peers), and is a networking or network form formed by a Peer-to-Peer computing model in an application layer. Such as a P2P network, etc.
In the embodiment of the application, the cloud server broadcasts the local original data information in the peer-to-peer network, and as long as the node is not abnormal, the node receives the broadcast information. The cloud server determines the received second distributed nodes, which are all nodes that can be used to store local raw data information.
S103, selecting a preset number of third distributed nodes from the second distributed nodes based on the first region information, determining storage time of the local original data information based on the aging information, and storing the local original data information into the third distributed nodes.
In the embodiment of the application, the cloud server selects a preset number (for example, 2) of third distributed nodes from the second distributed nodes as storage points by using the first region information as a standard, and caches the local original data information after determining the storage time of the local original data information according to the aging information, so as to ensure the data storage safety. The selection standard of the third distributed node can be a node which is closer to a node where local original data information is located in the geographical position, and the mobility of the staff in the construction site is considered, so that after the staff in the construction site finishes working for several days, the next temporary work is most likely to be continuously searched nearby, therefore, the third distributed node is selected based on the standard, on one hand, the efficiency of information calling is improved due to the closer distance, on the other hand, when the staff in the construction site really go to the location of the third distributed node for next working hour, the stored original data information can be directly used, and the collection of multiple items of data of the staff in the construction site is not required to be repeated.
In one possible implementation manner, after there is a new local original data information added in the first distributed node, the method further includes:
generating a file identification mark based on the local original data information;
and constructing a mapping relation between the local original data information and the file identification mark.
In the embodiment of the application, the cloud server can also generate a unique file identification for the local original data information, and construct a mapping relation between the file identification and the local original data information, so that in the processing process of a large amount of information, the cloud server can quickly determine the local original data information to be searched according to the file identification.
In an embodiment, after storing the local raw data information into each of the third distribution nodes, the method further includes:
communicating each file identification mark in each third distributed node every time a first preset time passes;
and when an abnormal file identification mark which cannot be matched exists, generating abnormal information based on the abnormal file identification mark, and determining an abnormal third distributed node corresponding to the abnormal file identification mark.
In the embodiment of the application, the third distributed nodes storing the local original data information back up with each other, that is, after a first preset time elapses, the third distributed nodes communicate file identification identifiers with each other to determine whether the file identification identifiers of the nodes change, and when the change indicates that the local original data information in the node is illegally tampered, abnormal information is generated to warn an administrator, and the third distributed node in which the abnormality occurs is determined.
In one embodiment, the method further comprises:
when an original data calling request is received, determining the file identification corresponding to the original data calling request;
and sending a calling instruction to the third distributed node corresponding to the file identification mark to control the first distributed node and the third distributed node to carry out encryption communication.
In the embodiment of the application, when a worker needs to perform work attendance checking and other operations, the cloud server receives the original data calling request, namely, the cloud server indicates that the terminal equipment needs to call the original data information to perform work attendance checking and face recognition and other operations. Therefore, the cloud server determines the third distributed node stored in the original data information according to the file identification mark and sends a calling instruction to the third distributed node, so that the two nodes can be in encrypted communication to perform attendance checking verification. By the method, the computing and storing capacities of a large number of terminal devices corresponding to each node can be better utilized, and the storing and processing cost of the server is reduced.
In an embodiment, the selecting a preset number of third distributed nodes from each of the second distributed nodes based on the first regional information includes:
sequencing each second distributed node from near to far according to the distance from the first region information;
and sequentially selecting a preset number of third distributed nodes from the second distributed nodes according to the sorting sequence.
In the embodiment of the application, the cloud server sorts the nodes according to the distance from the nodes to the first region information, and then selects the third distributed nodes according to the sorting order, so that the third distributed nodes selected for storing the original data information are the nodes closest to the first distributed nodes. On the one hand, the efficiency of information calling is improved due to the fact that the distance is short, on the other hand, when the building site personnel really go to the location of the third distributed node for next work hour, the stored original data information can be directly used, and the multiple data of the building site personnel do not need to be repeatedly collected.
In one possible embodiment, the determining the storage time of the local raw data information based on the aging information includes:
and determining first time corresponding to the aging information, and adding the first time and preset second time to obtain the storage time of the local original data information.
In an embodiment of the present application, the first time corresponding to the time efficiency information may represent the number of days or the market of work of the worksite personnel at the worksite according to the contract requirement. Considering that the construction site personnel is likely to go to other nearby work-taking places for new work-taking after the completion of the contract departure, the second time is preset as the time taken by the construction site personnel to find the new work-taking place. The finally generated storage time can indicate the time that the local original data information can be stored in the third distributed node, if the construction site personnel really go to other work-holding places in the storage time, the cloud server can directly call the stored local original data information, unnecessary information processing procedures are reduced, and if the condition that the data needs to be called does not occur after the storage time, the local original data information is considered to be useless, the local original data information can be deleted, and the accumulation of useless redundant information is reduced.
In one embodiment, the method further comprises:
when repeated original data information is detected in the storage time, updating the storage time based on the repeated original data information, and adjusting the third distributed nodes used for storing the local original data information corresponding to the repeated original data information, so that each adjusted third distributed node is matched with the second local information corresponding to the repeated original data information.
In the embodiment of the application, for the situation that the construction site personnel really go to other work-taking places within the storage time, when the corresponding new work-taking place registers the basic information in the original data information, the cloud server detects that the information is the repeated original data information. At the moment, because the construction site personnel sign a new contract, the work needs to be carried out in a new working place for a certain time, the cloud server can update the storage time according to the contract information in the repeated original data information, and re-determine a third distributed node matched with the second regional information of the node where the new working place is located, so that the previously stored local original data is directly transmitted to the new third distributed node, repeated processing procedures are reduced, and the data processing and transmission efficiency is improved.
The following describes in detail a distributed storage apparatus for user raw data in a flexible service scenario provided by an embodiment of the present application with reference to fig. 2. It should be noted that, the distributed storage apparatus for user raw data in the flexible service scenario shown in fig. 2 is used to execute the method of the embodiment shown in fig. 1 of the present application, for convenience of description, only the portion related to the embodiment of the present application is shown, and details of the specific technology are not disclosed, please refer to the embodiment shown in fig. 1 of the present application.
Referring to fig. 2, fig. 2 is a schematic structural diagram of a distributed storage apparatus for user raw data in a flexible service scenario according to an embodiment of the present application. As shown in fig. 2, the apparatus includes:
an obtaining module 201, configured to obtain, when there is a new local original data information added to a first distributed node, time efficiency information corresponding to the local original data information, and determine first region information of the first distributed node;
a broadcasting module 202, configured to broadcast the local raw data information in a preset peer-to-peer network, and determine each second distributed node that receives the local raw data information;
a selecting module 203, configured to select a preset number of third distributed nodes from each of the second distributed nodes based on the first region information, determine storage time of the local original data information based on the aging information, and store the local original data information in each of the third distributed nodes.
In one implementation, the obtaining module 201 further includes:
the identification generation unit is used for generating a file identification based on the local original data information;
and the mapping construction unit is used for constructing the mapping relation between the local original data information and the file identification mark.
In one embodiment, the selecting module 203 further comprises:
the intercommunication unit is used for intercommunicating the file identification marks in the third distributed nodes every time a first preset time passes;
and the exception processing unit is used for generating exception information based on the exception file identification mark and determining an exception third distributed node corresponding to the exception file identification mark when the exception file identification mark which cannot be matched exists.
In one embodiment, the apparatus further comprises:
the receiving module is used for determining the file identification mark corresponding to the original data calling request when the original data calling request is received;
and the calling module is used for sending a calling instruction to the third distributed node corresponding to the file identification mark so as to control the first distributed node and the third distributed node to carry out encryption communication.
In one embodiment, the selecting module 203 comprises:
the sorting unit is used for sorting the second distributed nodes from near to far according to the distance between the second distributed nodes and the first region information;
and the selecting unit is used for sequentially selecting a preset number of third distributed nodes from the second distributed nodes according to the sorting sequence.
In one embodiment, the selecting module 203 further comprises:
and the calculating unit is used for determining the first time corresponding to the aging information, and adding the first time and a preset second time to obtain the storage time of the local original data information.
In one embodiment, the apparatus further comprises:
an updating module, configured to update the storage time based on the repeated original data information when the repeated original data information is detected within the storage time, and adjust the third distributed nodes used for storing the local original data information corresponding to the repeated original data information, so that each adjusted third distributed node matches with the second local information corresponding to the repeated original data information
It is clear to a person skilled in the art that the solution according to the embodiments of the present application can be implemented by means of software and/or hardware. The "unit" and "module" in this specification refer to software and/or hardware that can perform a specific function independently or in cooperation with other components, where the hardware may be, for example, a Field-Programmable Gate Array (FPGA), an Integrated Circuit (IC), or the like.
Each processing unit and/or module in the embodiments of the present application may be implemented by an analog circuit that implements the functions described in the embodiments of the present application, or may be implemented by software that executes the functions described in the embodiments of the present application.
Referring to fig. 3, a schematic structural diagram of an electronic device according to an embodiment of the present application is shown, where the electronic device may be used to implement the method in the embodiment shown in fig. 1. As shown in fig. 3, the electronic device 300 may include: at least one central processor 301, at least one network interface 304, a user interface 303, a memory 305, at least one communication bus 302.
Wherein a communication bus 302 is used to enable the connection communication between these components.
The user interface 303 may include a Display screen (Display) and a Camera (Camera), and the optional user interface 303 may further include a standard wired interface and a wireless interface.
The network interface 304 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface), among others.
The central processor 301 may include one or more processing cores. The central processor 301 connects various parts within the entire electronic device 300 using various interfaces and lines, and performs various functions of the terminal 300 and processes data by executing or executing instructions, programs, code sets, or instruction sets stored in the memory 305 and calling data stored in the memory 305. Alternatively, the central Processing unit 301 may be implemented in at least one hardware form of Digital Signal Processing (DSP), Field-Programmable Gate Array (FPGA), and Programmable Logic Array (PLA). The CPU 301 may integrate one or a combination of a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), a modem, and the like. Wherein, the CPU mainly processes an operating system, a user interface, an application program and the like; the GPU is used for rendering and drawing the content required to be displayed by the display screen; the modem is used to handle wireless communications. It is understood that the modem may not be integrated into the cpu 301, but may be implemented by a single chip.
The Memory 305 may include a Random Access Memory (RAM) or a Read-Only Memory (Read-Only Memory). Optionally, the memory 305 includes a non-transitory computer-readable medium. The memory 305 may be used to store instructions, programs, code sets, or instruction sets. The memory 305 may include a stored program area and a stored data area, wherein the stored program area may store instructions for implementing an operating system, instructions for at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing the various method embodiments described above, and the like; the storage data area may store data and the like referred to in the above respective method embodiments. The memory 305 may alternatively be at least one storage device located remotely from the central processor 301. As shown in fig. 3, memory 305, which is a type of computer storage medium, may include an operating system, a network communication module, a user interface module, and program instructions.
In the electronic device 300 shown in fig. 3, the user interface 303 is mainly used for providing an input interface for a user to obtain data input by the user; the central processing unit 301 may be configured to invoke a distributed storage application program of the user raw data in the flexible task work scenario stored in the storage 305, and specifically perform the following operations:
when local original data information is newly added in a first distributed node, acquiring timeliness information corresponding to the local original data information, and determining first region information of the first distributed node;
broadcasting the local original data information in a preset peer-to-peer network, and determining each second distributed node receiving the local original data information;
and selecting a preset number of third distributed nodes from the second distributed nodes based on the first region information, determining storage time of the local original data information based on the aging information, and storing the local original data information into the third distributed nodes.
The present application also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the above-described method. The computer-readable storage medium may include, but is not limited to, any type of disk including floppy disks, optical disks, DVD, CD-ROMs, microdrive, and magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implementing, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of some service interfaces, devices or units, and may be an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable memory. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a memory, and including several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned memory comprises: various media capable of storing program codes, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by a program, which is stored in a computer-readable memory, and the memory may include: flash disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.
The above description is only an exemplary embodiment of the present disclosure, and the scope of the present disclosure should not be limited thereby. That is, all equivalent changes and modifications made in accordance with the teachings of the present disclosure are intended to be included within the scope of the present disclosure. Embodiments of the present disclosure will be readily apparent to those skilled in the art from consideration of the specification and practice of the disclosure 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 within 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.
Claims (10)
1. A distributed storage method for user raw data in a flexible service scene is characterized by comprising the following steps:
when local original data information is newly added in a first distributed node, acquiring timeliness information corresponding to the local original data information, and determining first region information of the first distributed node;
broadcasting the local original data information in a preset peer-to-peer network, and determining each second distributed node receiving the local original data information;
and selecting a preset number of third distributed nodes from the second distributed nodes based on the first region information, determining storage time of the local original data information based on the aging information, and storing the local original data information into the third distributed nodes.
2. The method of claim 1, wherein after the local original data information is newly added to the first distributed node, further comprising:
generating a file identification mark based on the local original data information;
and constructing a mapping relation between the local original data information and the file identification mark.
3. The method of claim 2, wherein after storing the local raw data information in each of the third distribution nodes, further comprising:
communicating each file identification mark in each third distributed node every time a first preset time passes;
and when an abnormal file identification mark which cannot be matched exists, generating abnormal information based on the abnormal file identification mark, and determining an abnormal third distributed node corresponding to the abnormal file identification mark.
4. The method of claim 2, further comprising:
when an original data calling request is received, determining the file identification corresponding to the original data calling request;
and sending a calling instruction to the third distributed node corresponding to the file identification mark to control the first distributed node and the third distributed node to carry out encryption communication.
5. The method of claim 1, wherein the selecting a preset number of third distributed nodes from the second distributed nodes based on the first regional information comprises:
sequencing each second distributed node from near to far according to the distance from the first region information;
and sequentially selecting a preset number of third distributed nodes from the second distributed nodes according to the sorting sequence.
6. The method of claim 1, wherein said determining a storage time for the local raw data information based on the age information comprises:
and determining first time corresponding to the aging information, and adding the first time and preset second time to obtain the storage time of the local original data information.
7. The method of claim 6, further comprising:
when repeated original data information is detected in the storage time, updating the storage time based on the repeated original data information, and adjusting the third distributed nodes used for storing the local original data information corresponding to the repeated original data information, so that each adjusted third distributed node is matched with the second local information corresponding to the repeated original data information.
8. A distributed storage device for user raw data in a handyman scenario, the device comprising:
the acquisition module is used for acquiring aging information corresponding to local original data information when the local original data information is newly added to a first distributed node, and determining first region information of the first distributed node;
the broadcast module is used for broadcasting the local original data information in a preset peer-to-peer network and determining each second distributed node receiving the local original data information;
and the selecting module is used for selecting a preset number of third distributed nodes from the second distributed nodes based on the first region information, determining the storage time of the local original data information based on the aging information, and storing the local original data information into the third distributed nodes.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method according to any of claims 1-7 are implemented when the computer program is executed by the processor.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111523335.8A CN114338716B (en) | 2021-12-14 | 2021-12-14 | Distributed storage method for user original data in flexible attendant scene |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111523335.8A CN114338716B (en) | 2021-12-14 | 2021-12-14 | Distributed storage method for user original data in flexible attendant scene |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114338716A true CN114338716A (en) | 2022-04-12 |
| CN114338716B CN114338716B (en) | 2024-02-13 |
Family
ID=81050281
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111523335.8A Active CN114338716B (en) | 2021-12-14 | 2021-12-14 | Distributed storage method for user original data in flexible attendant scene |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114338716B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080027897A1 (en) * | 2005-03-29 | 2008-01-31 | Brother Kogyo Kabushiki Kaisha | Information processing apparatus, information processing method and recording medium |
| CN110290192A (en) * | 2019-06-18 | 2019-09-27 | 贝富（广州）新技术有限公司 | The storage of data distribution formula and data capture method, device based on block chain |
| CN111262916A (en) * | 2020-01-10 | 2020-06-09 | 深圳市网心科技有限公司 | Data distributed storage method and device, storage node and storage medium |
| US20210216214A1 (en) * | 2020-01-13 | 2021-07-15 | Cisco Technology, Inc. | Master data placement in distributed storage systems |
-
2021
- 2021-12-14 CN CN202111523335.8A patent/CN114338716B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080027897A1 (en) * | 2005-03-29 | 2008-01-31 | Brother Kogyo Kabushiki Kaisha | Information processing apparatus, information processing method and recording medium |
| CN110290192A (en) * | 2019-06-18 | 2019-09-27 | 贝富（广州）新技术有限公司 | The storage of data distribution formula and data capture method, device based on block chain |
| CN111262916A (en) * | 2020-01-10 | 2020-06-09 | 深圳市网心科技有限公司 | Data distributed storage method and device, storage node and storage medium |
| US20210216214A1 (en) * | 2020-01-13 | 2021-07-15 | Cisco Technology, Inc. | Master data placement in distributed storage systems |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114338716B (en) | 2024-02-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106843828B (en) | Interface display and loading method and device | |
| CN110569251A (en) | Data processing method, related equipment and computer readable storage medium | |
| TW202001590A (en) | Method and management system of distributed computation | |
| CN109981279B (en) | Block chain system, communication method, device, equipment and medium | |
| CN109886693B (en) | Consensus realization method, device, equipment and medium for block chain system | |
| CN111698315B (en) | Data processing method and device for block and computer equipment | |
| CN110995513A (en) | Data sending and receiving method in Internet of things system, Internet of things equipment and platform | |
| US11032666B2 (en) | System, mobile terminal device, server, program, and method for visit confirmation | |
| CN110895603B (en) | Multi-system account information integration method and device | |
| CN111507717A (en) | Data processing method, device, block node and computer readable storage medium | |
| CN110866289A (en) | Data processing method and device based on block chain, server and storage medium | |
| CN111314174A (en) | Network dial testing method and device based on block chain and SDN edge computing network system | |
| CN111488626A (en) | Data processing method, device, equipment and medium based on block chain | |
| CN104750524A (en) | Upgraded data package transmitting method and device and data package upgrading method and device | |
| CN110796367A (en) | Equipment information management method and device based on information remote identification and terminal | |
| US10979392B2 (en) | Preventing unauthorized access to secure enterprise information systems using a multi-filtering and randomizing control system | |
| CN114338716A (en) | Distributed storage method for user original data in flexible service scene | |
| CN116703071A (en) | Resource sharing method, device and equipment and storage medium | |
| CN111683164B (en) | IP address configuration method and VPN service system | |
| CN105335362A (en) | Real-time data processing method and system, and instant processing system | |
| CN107909460B (en) | Position synchronization method, device, data center and storage medium | |
| CN113312669A (en) | Password synchronization method, device and storage medium | |
| CN111030874A (en) | Service arranging method, equipment, storage medium and device | |
| CN109785129A (en) | Data capture method, device, equipment and computer readable storage medium | |
| CN110287265B (en) | Login request processing method and device, server and readable 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 |