CN109726252A - A kind of data managing method and relevant apparatus of distributed data collection - Google Patents
A kind of data managing method and relevant apparatus of distributed data collection Download PDFInfo
- Publication number
- CN109726252A CN109726252A CN201811645982.4A CN201811645982A CN109726252A CN 109726252 A CN109726252 A CN 109726252A CN 201811645982 A CN201811645982 A CN 201811645982A CN 109726252 A CN109726252 A CN 109726252A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- locking range
- destination subset
- highest
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Abstract
This application discloses a kind of data managing methods of distributed data collection, comprising: when receiving destination subset increase request, management node increases the highest node ID for requesting to determine destination subset according to destination subset；Data locking range is determined according to the highest node ID；The corresponding data for being concentrated distributed data according to the data locking range carries out data to target device and synchronizes, to increase destination subset in the target device.It has been determined by the highest node ID in destination subset and has carried out the synchronous range of data, and then realized that carrying out data to target device synchronizes, and improves the acquisition efficiency of subset data.Disclosed herein as well is data management system, server and the computer readable storage mediums of a kind of distributed data collection, have the above beneficial effect.
Description
Technical field
This application involves distributed data collection technical field, in particular to a kind of data management side of distributed data collection
Method, data management system, server and computer readable storage medium.
Background technique
With the continuous development of information technology, there is the distributed computing technology of decentralization.Go out on the basis of distributed
The data storage technology based on distributed computing technology is showed.
In the above distributed data storage scheme, entire distribution is saved typically in same tissue network
Formula data set.And distributed data concentration can classify according to different administration authority or data distribution.For example,
The data source of the distributed data collection is company A, the community B and C hospital, and it is total that the data of all of above tissue pass through this
Distributed data collection is managed and data save.But when any one tissue needs to obtain corresponding target data
When collection, the data of asynchronous all a whole set of distributed data collection, otherwise collect its desired data from source again.But
All copy data not only need more storage resources, and the speed of data acquisition is also very slow, and efficiency is extremely low.And it weighs
It is new to obtain data, it needs to re-start data from each data source header and synchronizes, also face the lower problem of data acquisition efficiency.
Therefore, how efficiency obtain faster destination subset data be those skilled in the art concern Important Problems.
Summary of the invention
The purpose of the application is to provide data managing method, data management system, the server of a kind of distributed data collection
And computer readable storage medium, it has been determined by the highest node ID in destination subset and has carried out the synchronous range of data, into
And realize that carrying out data to target device synchronizes, and improves the acquisition efficiency of subset data.
In order to solve the above technical problems, the application provides a kind of data managing method of distributed data collection, comprising:
When receiving destination subset increase request, management node increases according to destination subset requests to determine destination subset
Highest node ID；
Data locking range is determined according to the highest node ID；
The corresponding data for being concentrated distributed data according to the data locking range carries out data to target device and synchronizes,
To increase destination subset in the target device.
Optionally, data locking range is determined according to the highest node ID, comprising:
It is searched, is obtained more in all nodes according to encoding relation between the highest node ID and slave node ID
A slave node；
The multiple slave node is added to the data locking range.
Optionally, data locking range is determined according to the highest node ID, comprising:
It is searched in node subordinate relation chained list according to the highest node ID, obtains multiple slave nodes；
The multiple slave node is added to the data locking range.
Optionally, data locking range is determined according to the highest node ID, comprising:
The corresponding multiple slave nodes of highest node are determined in node relationships figure according to the highest node ID；
The multiple slave node is added to the data locking range.
Optionally, further includes:
When receiving destination subset removal request, management node determines corresponding according to the destination subset removal request
Data locking range；
The data locking range is deleted from the synchronous list of data.
The application also provides a kind of data management system of distributed data collection, comprising:
Highest node determining module, for being increased according to destination subset and being requested when receiving destination subset increase request
Determine the highest node ID of destination subset；
Data locking range determining module, for determining data locking range according to the highest node ID；
Destination subset synchronization module, corresponding data for being concentrated distributed data according to the data locking range to
Target device carries out data and synchronizes, to increase destination subset in the target device.
Optionally, the data locking range determining module, comprising:
Encoding relation searching unit, for being owned according to encoding relation between the highest node ID and slave node ID
It is searched in node, obtains multiple slave nodes；
Data locking range acquiring unit, for the multiple slave node to be added to the data locking range.
Optionally, the data locking range determining module, comprising:
Subordinate relation chained list searching unit, for being looked into node subordinate relation chained list according to the highest node ID
It looks for, obtains multiple slave nodes；
Data locking range acquiring unit, for the multiple slave node to be added to the data locking range.
The application also provides a kind of server, comprising:
Memory, for storing computer program；
Processor, the step of data managing method as described above is realized when for executing the computer program.
The application also provides a kind of computer readable storage medium, and calculating is stored on the computer readable storage medium
The step of machine program, the computer program realizes data managing method as described above when being executed by processor.
The data managing method of a kind of distributed data collection provided herein, comprising: increase when receiving destination subset
When adding request, management node increases the highest node ID for requesting to determine destination subset according to destination subset；According to the highest section
Point ID determines data locking range；Corresponding data distributed data concentrated according to the data locking range is to target device
It is synchronous to carry out data, to increase destination subset in the target device.
By when receive destination subset increase request after, when it needs to be determined that destination subset data area when, due to every
Layer data is constructed according to tree structure, it is only necessary to determine the node of top layer of the destination subset in tree structure is
Can, that is, highest node, the data after the highest node in all slave nodes are the data for needing to synchronize,
It is further assured that according to the highest node ID of the highest node and carries out data locking range, it is finally same according to the data
The data of corresponding data i.e. destination subset are synchronized in target device by step range, that is, directly in target device
Partial data is got from existing destination subset, improves the efficiency for obtaining destination subset data.
The application also provides data management system, server and the computer-readable storage medium of a kind of distributed data collection
Matter has the above beneficial effect, and this will not be repeated here.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The embodiment of application for those of ordinary skill in the art without creative efforts, can also basis
The attached drawing of offer obtains other attached drawings.
Fig. 1 is a kind of flow chart of the data managing method of distributed data collection provided by the embodiment of the present application；
Fig. 2 is a kind of structural schematic diagram of the data management system of distributed data collection provided by the embodiment of the present application.
Specific embodiment
The core of the application is to provide data managing method, data management system, the server of a kind of distributed data collection
And computer readable storage medium, it has been determined by the highest node ID in destination subset and has carried out the synchronous range of data, into
And realize that carrying out data to target device synchronizes, and improves the acquisition efficiency of subset data.
To keep the purposes, technical schemes and advantages of the embodiment of the present application clearer, below in conjunction with the embodiment of the present application
In attached drawing, the technical scheme in the embodiment of the application is clearly and completely described, it is clear that described embodiment is
Some embodiments of the present application, instead of all the embodiments.Based on the embodiment in the application, those of ordinary skill in the art
Every other embodiment obtained without making creative work, shall fall in the protection scope of this application.
In the scheme of the distributed data collection of the prior art, entire point is saved typically in same tissue network
Cloth data set.And distributed data concentration can classify according to different administration authority or data distribution.Example
Such as, the data source of the distributed data collection is company A, the community B and C hospital, and the data of all of above tissue pass through this
Total distributed data collection is managed and data save.But when any one tissue goes to obtain corresponding number of targets
When according to subset, the data of asynchronous all a whole set of distributed data collection, otherwise collect its desired data from source again.But
It is all to copy data not only to need more storage resources, and the speed of data acquisition is also very slow, efficiency is extremely low.
And data are reacquired, it is synchronous to need to re-start data from each data source header, also faces that data acquisition efficiency is lower to ask
Topic.
Therefore, the application provides a kind of data managing method of distributed data collection, receives destination subset increasing by working as
After adding request, when it needs to be determined that destination subset data area when, since every layer data is constructed according to tree structure, only
It needs to be determined that the node of top layer of the destination subset in tree structure, that is, highest node, the highest node with
The data in all slave nodes are the data for needing to synchronize afterwards, further according to the highest section of the highest node
Point ID, which is assured that, carries out data locking range, finally according to the data locking range that corresponding data i.e. target are sub
The data of collection are synchronized in target device, that is, get part number from existing destination subset directly in target device
According to, improve obtain destination subset data efficiency.
Referring to FIG. 1, Fig. 1 is a kind of stream of the data managing method of distributed data collection provided by the embodiment of the present application
Cheng Tu.
In the present embodiment, this method may include:
S101, when receiving destination subset increase request, management node increases according to destination subset requests to determine target
The highest node ID of subset；
This step mainly when receiving destination subset increase request, increases according to destination subset and requests to determine highest section
Point ID.
Wherein, it is the request instruction that destination subset request of data direction management node is sent that destination subset, which increases request,
In, destination subset requesting party can be the target device of storage destination subset, is also possible to distributed server cluster, does not do and have
Body limits.Management node passes through the request received and is assured that target that destination subset requesting party and needs obtain
Collect range.Specifically, destination subset requesting party can be the address of requesting party, it is also possible to the MAC Address of requesting party, it can be with
It is the unique ID code of requesting party, it is not limited here.In addition, destination subset range can pass through destination subset requesting party
Permission determine, for example, destination subset requesting party concentrates the data that may only check a part in total distributed data, that
The corresponding destination subset of the data of the part is destination subset data required for destination subset requesting method.Or target
Subset, which increases in request, contains the highest node ID of destination subset, at this time, it may be necessary to according to the permission of destination subset requesting party
The whether available highest node ID of destination subset requesting party is judged, if so, can execute according to the highest node ID
S102。
The distributed data collection that management node is managed in the present embodiment is the level distribution number built with tree structure
According to collection.Wherein, each node does not separately maintain the same data subset, but one number of all node maintenances in each level
According to subset, the performance pressures that each separate nodes carry out data subset maintenance are reduced.
On this basis, each destination subset is exactly every in the tree structure for the distributed data collection of the whole
All bifurcateds of a subsequent connection of bifurcation, therefore, when the data model for being determined that the bifurcation is assured that the destination subset
It encloses.The bifurcation is exactly highest node in destination subset, therefore, the available highest node to the highest node of this step
ID, which is assured that, carries out the synchronous data area of data.
S102 determines data locking range according to highest node ID；
On the basis of S101, this step is intended to determine data locking range according to the highest node ID.
Wherein, data locking range is primarily referred to as the subsequent all slave nodes for including of the highest node.
Accordingly, it is determined that the method for slave node, it can be according to the coding rule between highest node ID and slave node ID
It determines, is also possible to determine from the relationship chained list of highest node ID, it can also be from the bifurcated knot of whole distributed data collection
It is determined in composition, it is seen then that as long as the ID for getting highest node in this step is assured that data locking range, and really
Fixed method is not unique, is not specifically limited herein.
Optionally, this step may include:
Step 1, it is searched, is obtained in all nodes according to encoding relation between highest node ID and slave node ID
Multiple slave nodes；
Step 2, multiple slave nodes are added to data locking range.
Mainly determine that data are same by the encoding relation between highest node ID and slave node ID in this optinal plan
Walk range.In the distributed frame of the present embodiment, child node determines the son according to the father node ID of father node connected to it
The child node ID of node, that is to say, that can have the subordinate relation between father node in child node ID.Accordingly, it is possible to pass through
Highest node ID finds the slave node ID with it there are subordinate relation, to determine multiple slave nodes.It is finally that this is more
A slave node is added to the data locking range.
Optionally, this step may include:
Step 1, it is searched in node subordinate relation chained list according to highest node ID, obtains multiple slave nodes；
Step 2, multiple slave nodes are added to data locking range.
This optinal plan is mainly to pass through the subordinate relation chained list for indicating the subordinate relation between node, according to the highest section
Point ID is searched, and multiple slave nodes are obtained.In general, in management node after node is added, it can be by the node and its
Subordinate relation between his father node records, and obtains the subordinate relation chained list.Wherein, illustrate between each node from
Category relationship, therefore searched from the subordinate relation chained list by highest node ID and obtain multiple slave nodes.It finally will be multiple
Slave node is added to the data locking range.
Optionally, this step may include:
Step 1, the corresponding multiple slave nodes of highest node are determined in node relationships figure according to highest node ID；
Step 2, multiple slave nodes are added to data locking range.
This optinal plan mainly determines multiple slave nodes from node relationships figure, and is added to the synchronous model of data
In enclosing.Wherein, node relationships figure is mainly management node when being managed operation, and the relationship between node is visualized
Processing, obtained node relationships figure.Management node can not only get the pass of the subordinate between node from the node relationships figure
System, technical staff can also be directly viewable to the subordinate relation node from the node relationships figure.
S103, the corresponding data for being concentrated distributed data according to data locking range are same to target device progress data
Step, to increase destination subset in target device.
On the basis of S102, this step is intended to carry out data to target device according to obtained data locking range same
Step.
When data locking range has been determined, exactly determines and the data in which node are subjected to data simultaneously operating, into
And the data subset of these nodes is synchronized in target device by data synchronization mechanism.When the corresponding distribution of management node
In data set when the data variation of the destination subset, the data of the destination subset in corresponding target device can also synchronize variation,
Target device at this time, that is, destination subset requesting party can directly get corresponding data from target device, so as to from
Former distributed data concentration gets same data.
Optionally, the present embodiment can also include:
Step 1, when receiving destination subset removal request, management node is determined according to destination subset removal request and is corresponded to
Data locking range；
Step 2, data locking range is deleted from the synchronous list of data.
A kind of method for rejecting destination subset is mainly described in this optinal plan, is mainly according to mesh in this optinal plan
Subset removal request is marked, determines data locking range, then delete the data locking range from the synchronous list of data.When not to this
After destination subset synchronizes, just represents and eliminate the destination subset in the target device.
It further, can will be in target device by the data synchronization mechanism in order to improve the safety of data storage
Destination subset carry out Force Deletion.
To sum up, the present embodiment pass through when receive destination subset increase request after, when it needs to be determined that destination subset data
When range, since every layer data is constructed according to tree structure, it is only necessary to determine the destination subset is in tree structure
The node of top layer, that is, highest node, the data after the highest node in all slave nodes are needs
The data synchronized are further assured that progress data locking range according to the highest node ID of the highest node,
Finally the data of corresponding data i.e. destination subset are synchronized in target device according to the data locking range, that is,
Partial data is got from existing destination subset directly in target device, improves the efficiency for obtaining destination subset data.
On the basis of a upper embodiment, the present embodiment is mainly to provide a kind of data of more specific distributed data collection
Management method specifically applies the method in distributed electronic account book environment.Wherein, distributed electronic account book just refers to point
Cloth data set, dividing account book is exactly destination subset.This method divides highest node ID in account book by first determining, so as to determine into
The data locking range that row divides account book data to add, and then realizing will divide account book to be added in target device, and realize local
Divide account book synchronous with the data for dividing the account book time of target device.
In the present embodiment, this method comprises:
Step 1, when receiving point account book and increasing request, according to dividing account book to increase, request is determining to divide account book to management node
Highest node ID；
Step 2, data locking range is determined according to highest node ID；
Step 3, the corresponding data concentrated distributed data according to data locking range is same to target device progress data
Step divides account book to increase in target device.
More specifically, the present embodiment mainly may include that level is divided to account book increase and level that account book is divided to reject two aspects.
Level in the present embodiment divides account book to be exactly to divide account book in a upper method.
1, level divides account book to increase:
Step 1, the level is specified to divide the highest section of account book according to the range of management (or permission) of the level by management node
Point ID, and related change record is retained in the father node of ID management account book.
Step 2, data synchronization mechanism divides the highest node ID of account book according to above-mentioned level, determines that the level divides the number of account book
According to set relation, and then obtain data locking range.
Step 3, data synchronization mechanism is required according to newly-increased data are synchronous, divides account book to carry out data the level synchronous.
2, level divides account book to reject:
Step 1, the administrative power for dividing account book of specified level is abolished by management node, and divides the father node of account book in the level
It manages and retains related change record in account book.
Step 2, data synchronization mechanism modifies data locking range according to above-mentioned requirements, and stopping divides account book to carry out the level
Data update.When necessary, data synchronization mechanism is allowed to divide account book to carry out Force Deletion the level.
The embodiment of the present application provides a kind of data managing method of distributed data collection, can receive a point account by working as
This increase request when, since every layer of account book is constructed according to tree structure in level distribution account book, when it needs to be determined that
When the data area of account book is divided in part, it is only necessary to determine this divides the node of top layer of the account book in tree structure, also
It is highest node, the data after the highest node in all slave nodes are the data for needing to synchronize, further
The highest node ID according to the highest node be assured that carry out data locking range, finally according to the data locking range
The data of account book are namely divided to be synchronized in target device corresponding data, that is, directly from existing directly in target device
The distributed account book having gets partial data, improves the efficiency for obtaining and dividing account book data.
A kind of data management system of distributed data collection provided by the embodiments of the present application is introduced below, is hereafter retouched
A kind of data management system for the distributed data collection stated and a kind of above-described data managing method of distributed data collection
Reference can be corresponded to each other.
Referring to FIG. 2, Fig. 2 is a kind of knot of the data management system of distributed data collection provided by the embodiment of the present application
Structure schematic diagram.
In the present embodiment, which may include:
Highest node determining module 100, for being asked according to destination subset increase when receiving destination subset increase request
Seek the highest node ID of determining destination subset；
Data locking range determining module 200, for determining data locking range according to highest node ID；
Destination subset synchronization module 300, corresponding data for being concentrated distributed data according to data locking range to
Target device carries out data and synchronizes, to increase destination subset in target device.
Optionally, the data locking range determining module 200 may include:
Encoding relation searching unit is used for according to encoding relation between highest node ID and slave node ID in all nodes
In searched, obtain multiple slave nodes；
Data locking range acquiring unit, for multiple slave nodes to be added to data locking range.
Optionally, the data locking range determining module 200 may include:
Subordinate relation chained list searching unit, for being searched in node subordinate relation chained list according to highest node ID,
Obtain multiple slave nodes；
Data locking range acquiring unit, for multiple slave nodes to be added to data locking range.
The embodiment of the present application also provides a kind of server, comprising:
Memory, for storing computer program；
Processor realizes the step of data managing method as described above in Example when for executing the computer program
Suddenly.
The embodiment of the present application also provides a kind of computer readable storage medium, stores on the computer readable storage medium
There is computer program, the computer program realizes data managing method as described above in Example when being executed by processor
Step.
The computer readable storage medium may include: USB flash disk, mobile hard disk, read-only memory (Read-Only
Memory, ROM), random access memory (Random Access Memory, RAM), magnetic or disk etc. is various to deposit
Store up the medium of program code.
Each embodiment is described in a progressive manner in specification, the highlights of each of the examples are with other realities
The difference of example is applied, the same or similar parts in each embodiment may refer to each other.For device disclosed in embodiment
Speech, since it is corresponded to the methods disclosed in the examples, so being described relatively simple, related place is referring to method part illustration
?.
Professional further appreciates that, unit described in conjunction with the examples disclosed in the embodiments of the present disclosure
And algorithm steps, can be realized with electronic hardware, computer software, or a combination of the two, in order to clearly demonstrate hardware and
The interchangeability of software generally describes each exemplary composition and step according to function in the above description.These
Function is implemented in hardware or software actually, the specific application and design constraint depending on technical solution.Profession
Technical staff can use different methods to achieve the described function each specific application, but this realization is not answered
Think beyond scope of the present application.
The step of method described in conjunction with the examples disclosed in this document or algorithm, can directly be held with hardware, processor
The combination of capable software module or the two is implemented.Software module can be placed in random access memory (RAM), memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
Data managing method to a kind of distributed data collection provided herein, data management system, service above
Device and computer readable storage medium are described in detail.Used herein principle and reality of the specific case to the application
The mode of applying is expounded, the description of the example is only used to help understand the method for the present application and its core ideas.It answers
It, for those skilled in the art, can also be to this under the premise of not departing from the application principle when pointing out
Some improvement and modification can also be carried out for application, these improvement and modification are also fallen into the protection scope of the claim of this application.
Claims (10)
1. a kind of data managing method of distributed data collection characterized by comprising
When receiving destination subset increase request, management node increases the highest for requesting to determine destination subset according to destination subset
Node ID；
Data locking range is determined according to the highest node ID；
The corresponding data for being concentrated distributed data according to the data locking range carries out data to target device and synchronizes, so as to
Increase destination subset in the target device.
2. data managing method according to claim 1, which is characterized in that determine that data are same according to the highest node ID
Walk range, comprising:
Searched in all nodes according to encoding relation between the highest node ID and slave node ID, obtain it is multiple from
Belong to node；
The multiple slave node is added to the data locking range.
3. data managing method according to claim 1, which is characterized in that determine that data are same according to the highest node ID
Walk range, comprising:
It is searched in node subordinate relation chained list according to the highest node ID, obtains multiple slave nodes；
The multiple slave node is added to the data locking range.
4. data managing method according to claim 1, which is characterized in that determine that data are same according to the highest node ID
Walk range, comprising:
The corresponding multiple slave nodes of highest node are determined in node relationships figure according to the highest node ID；
The multiple slave node is added to the data locking range.
5. data managing method according to claim 1, which is characterized in that further include:
When receiving destination subset removal request, management node determines corresponding data according to the destination subset removal request
Locking range；
The data locking range is deleted from the synchronous list of data.
6. a kind of data management system of distributed data collection characterized by comprising
Highest node determining module, for increasing request according to destination subset and determining when receiving destination subset increase request
The highest node ID of destination subset；
Data locking range determining module, for determining data locking range according to the highest node ID；
Destination subset synchronization module, corresponding data for being concentrated distributed data according to the data locking range is to target
Equipment carries out data and synchronizes, to increase destination subset in the target device.
7. data management system according to claim 6, which is characterized in that the data locking range determining module, packet
It includes:
Encoding relation searching unit is used for according to encoding relation between the highest node ID and slave node ID in all nodes
In searched, obtain multiple slave nodes；
Data locking range acquiring unit, for the multiple slave node to be added to the data locking range.
8. data management system according to claim 6, which is characterized in that the data locking range determining module, packet
It includes:
Subordinate relation chained list searching unit, for being searched in node subordinate relation chained list according to the highest node ID,
Obtain multiple slave nodes；
Data locking range acquiring unit, for the multiple slave node to be added to the data locking range.
9. a kind of server characterized by comprising
Memory, for storing computer program；
Processor realizes such as data managing method described in any one of claim 1 to 5 when for executing the computer program
The step of.
10. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program is realized when the computer program is executed by processor such as data managing method described in any one of claim 1 to 5
Step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811645982.4A CN109726252A (en) | 2018-12-29 | 2018-12-29 | A kind of data managing method and relevant apparatus of distributed data collection |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811645982.4A CN109726252A (en) | 2018-12-29 | 2018-12-29 | A kind of data managing method and relevant apparatus of distributed data collection |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109726252A true CN109726252A (en) | 2019-05-07 |
Family
ID=66298563
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811645982.4A Pending CN109726252A (en) | 2018-12-29 | 2018-12-29 | A kind of data managing method and relevant apparatus of distributed data collection |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109726252A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110347886A (en) * | 2019-06-21 | 2019-10-18 | 政采云有限公司 | Distributed set membership element lookup method |
| CN111580378A (en) * | 2020-04-27 | 2020-08-25 | 广东尚研电子科技有限公司 | Off-line high-precision clock control method and clock device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7194492B2 (en) * | 2001-10-29 | 2007-03-20 | Emc Corporation | Method and apparatus for efficiently copying distributed data files |
| CN1983237A (en) * | 2005-12-15 | 2007-06-20 | 北京凯诚高清电子技术有限公司 | Method and device for playing cross-platform distributed network controllable multi-medium |
| CN102693324A (en) * | 2012-01-09 | 2012-09-26 | 西安电子科技大学 | Distributed database synchronization system, synchronization method and node management method |
| CN102866995A (en) * | 2011-07-05 | 2013-01-09 | 中兴通讯股份有限公司 | File access method for PPN (Peer-to-Peer Network), management method and distributed file system |
| CN107291876A (en) * | 2017-06-19 | 2017-10-24 | 华中科技大学 | A kind of DDM method |
| CN107807787A (en) * | 2016-09-08 | 2018-03-16 | 北京京东尚科信息技术有限公司 | A kind of distributed data storage method and system |
-
2018
- 2018-12-29 CN CN201811645982.4A patent/CN109726252A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7194492B2 (en) * | 2001-10-29 | 2007-03-20 | Emc Corporation | Method and apparatus for efficiently copying distributed data files |
| CN1983237A (en) * | 2005-12-15 | 2007-06-20 | 北京凯诚高清电子技术有限公司 | Method and device for playing cross-platform distributed network controllable multi-medium |
| CN102866995A (en) * | 2011-07-05 | 2013-01-09 | 中兴通讯股份有限公司 | File access method for PPN (Peer-to-Peer Network), management method and distributed file system |
| CN102693324A (en) * | 2012-01-09 | 2012-09-26 | 西安电子科技大学 | Distributed database synchronization system, synchronization method and node management method |
| CN107807787A (en) * | 2016-09-08 | 2018-03-16 | 北京京东尚科信息技术有限公司 | A kind of distributed data storage method and system |
| CN107291876A (en) * | 2017-06-19 | 2017-10-24 | 华中科技大学 | A kind of DDM method |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110347886A (en) * | 2019-06-21 | 2019-10-18 | 政采云有限公司 | Distributed set membership element lookup method |
| CN110347886B (en) * | 2019-06-21 | 2022-03-25 | 政采云有限公司 | Distributed parent-child relationship element searching method |
| CN111580378A (en) * | 2020-04-27 | 2020-08-25 | 广东尚研电子科技有限公司 | Off-line high-precision clock control method and clock device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11120026B1 (en) | System and method for executing queries on multi-graphics processing unit systems | |
| CN102779185B (en) | High-availability distribution type full-text index method | |
| US10275489B1 (en) | Binary encoding-based optimizations at datastore accelerators | |
| CN102971724B (en) | The method and apparatus relevant with the management based on modular virtual resource in data center environment | |
| KR20220097956A (en) | Method and apparatus for managing IOT devices, and server and storage medium thereof | |
| CN104253831A (en) | Method and system for deploying application in cloud computing environment | |
| CN106960020B (en) | A kind of method and apparatus creating concordance list | |
| CN111182037B (en) | Mapping method and device of virtual network | |
| CN107800808A (en) | A kind of data-storage system based on Hadoop framework | |
| US10191663B1 (en) | Using data store accelerator intermediary nodes and write control settings to identify write propagation nodes | |
| US20230367749A1 (en) | Data migration method and apparatus, device, medium, and computer product | |
| US20190339873A1 (en) | Distributed data storage system with automatic snapshots, user snapshots and soft delete | |
| CN111966494A (en) | Resource scheduling method and device, storage medium and electronic equipment | |
| CN109150964B (en) | Migratable data management method and service migration method | |
| CN112162846A (en) | Transaction processing method, device and computer readable storage medium | |
| CN109726252A (en) | A kind of data managing method and relevant apparatus of distributed data collection | |
| CN110008174A (en) | A kind of catalogue deriving method, system and relevant apparatus | |
| US11575647B1 (en) | Distributed network address allocation management | |
| JP2018513454A (en) | Efficient performance of insert and point query operations in the column store | |
| US7752225B2 (en) | Replication and mapping mechanism for recreating memory durations | |
| Kumar et al. | An extended approach to Non-Replicated dynamic fragment allocation in distributed database systems | |
| CN106856509A (en) | A kind of processing method and system of the large-scale data based on KNL clusters | |
| CN108604231A (en) | Mirror processing method and computing device | |
| CN114930281A (en) | Dynamic adaptive partition partitioning | |
| US20210373998A1 (en) | Namespace indices in dispersed storage networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190507 |
|
| RJ01 | Rejection of invention patent application after publication |