CN105491149A - Data storage method and terminal - Google Patents
Data storage method and terminal Download PDFInfo
- Publication number
- CN105491149A CN105491149A CN201510998390.0A CN201510998390A CN105491149A CN 105491149 A CN105491149 A CN 105491149A CN 201510998390 A CN201510998390 A CN 201510998390A CN 105491149 A CN105491149 A CN 105491149A
- Authority
- CN
- China
- Prior art keywords
- memory node
- node
- data
- user data
- memory
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention provides a data storage method and a terminal. The data storage method comprises steps of receiving a data storage request, wherein the data storage request carries a target user identifier and user data, performing operation on a target user identifier according to a preset mapping algorithm, inquiring a target unloading node corresponding to a target user identifier according to an operation result, wherein the target unloading node corresponds to a plurality of user identifiers, inquiring a target storage node corresponding to the target unloading node in a storage mapping table, wherein an one-to-one correspondence relation or a several-for-one correspondence relation between the unloading node and the storage unloading node is recorded in the storage mapping table, and storing the user data carried by the data storage request in a storage position corresponding to the target user identifier in the target storage node. Through the embodiment, the invention avoids the generation of a large mapping table in the process of substantial data distribution storage, and improves the target storage node efficiency corresponding to the inquiry target user.
Description
Technical field
The present invention relates to field of computer technology, be specifically related to a kind of date storage method and terminal.
Background technology
Distributed data base system belongs to same system in logic, the data acquisition system on multiple nodes (Node) that the active computer network that physically distributes connects.Node links together in a computer network, and each node is independently Database Systems.In distributed data base system, user data is distributed in different memory nodes according to certain distribution rule, user needs the memory node at first consumer positioning data place when accessing at every turn or revise user data, and then from this memory node accesses user data.
At present, common distribution rule has by record identification distribution, by user's liveness distribution etc.Wherein, service server is needed to safeguard a mapping table by record identification distribution, record the corresponding relation of record identification and memory node in the mapping table, when amount of user data is very large, mapping table is also very large by what become, causes the efficiency of the memory node of service server in the mapping table corresponding to query aim user to reduce; Also service server is needed to safeguard a mapping table by the distribution of user's liveness, record the corresponding relation of user's liveness and memory node in the mapping table, when amount of user data is very large, mapping table is also very large by what become, and and not all Database Systems all support the statistical measurement of user's liveness, cause the application of this kind of distribution rule limited.
Summary of the invention
Embodiments provide a kind of date storage method and terminal, can avoid producing the too much mapping table of record number when carrying out the distributed storage of a large number of users data, improve the efficiency of the target memory node corresponding to query aim user, thus improve the storage efficiency of user data.
First aspect, embodiments provides a kind of date storage method, comprising:
Receive data storage request, described data storage request carries targeted customer's mark and user data;
Described targeted customer's mark is carried out computing according to the mapping algorithm preset, and inquires about according to operation result the target unloading node that described targeted customer identifies correspondence, wherein, the corresponding multiple user ID of described target unloading node;
The target memory node that described target unloading node is corresponding is inquired about, the one-to-one relationship between the memory node recording unloading node in described memory map assignments and store described unloading node respective user data or many-one corresponding relation in memory map assignments;
The memory location of corresponding described targeted customer's mark in the described storage of subscriber data that described data storage request is carried to described target memory node.
Second aspect, embodiments provides a kind of terminal, comprising:
Receiving element, for receiving data storage request, described data storage request carries targeted customer's mark and user data;
First query unit, for described targeted customer's mark is carried out computing according to the mapping algorithm preset, and inquires about according to operation result the target unloading node that described targeted customer identifies correspondence, wherein, and the corresponding multiple user ID of described target unloading node;
Second query unit, for inquiring about target memory node corresponding to described target unloading node in memory map assignments, the one-to-one relationship between the memory node recording unloading node in described memory map assignments and store described unloading node respective user data or many-one corresponding relation;
Memory cell, for the described storage of subscriber data memory location that corresponding described targeted customer identifies to described target memory node of described data storage request being carried.
By implementing the embodiment of the present invention, terminal receives data storage request, the targeted customer carried in data storage request mark is carried out computing according to the mapping algorithm preset, and the target unloading node corresponding according to operation result query aim user ID, and the target memory node that query aim unloading node is corresponding in memory map assignments, and then the storage of subscriber data memory location that corresponding targeted customer identifies to target memory node of will carry in data storage request.Therefore when a large number of users data are stored into multiple memory node according to Distributed Storage mode by terminal, the corresponding relation of user ID and memory node in mapping table can be avoided too much, improve the efficiency of the target memory node of terminal in the mapping table corresponding to query aim user, thus improve the storage efficiency of user data.
Accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme in the embodiment of the present invention, below the accompanying drawing used required in describing embodiment is briefly described, apparently, accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the schematic flow sheet of a kind of date storage method that the embodiment of the present invention provides;
Fig. 2 is the schematic flow sheet of the another kind of date storage method that the embodiment of the present invention provides;
Fig. 3 is the structural representation of a kind of terminal that the embodiment of the present invention provides;
Fig. 4 is the structural representation of the another kind of terminal that the embodiment of the present invention provides;
Fig. 5 is the structural representation of a kind of distributed data base system that the embodiment of the present invention provides;
Fig. 6 is the structural representation of the another kind of distributed data base system that the embodiment of the present invention provides;
Fig. 7 is the structural representation of the another kind of terminal that the embodiment of the present invention provides.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, be clearly and completely described the technical scheme in the embodiment of the present invention, obviously, described embodiment is the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
Refer to Fig. 1, Fig. 1 is the schematic flow sheet of a kind of date storage method that the embodiment of the present invention provides.As shown in Figure 1, this date storage method can include but not limited to following steps.
S101, reception data storage request, data storage request carries targeted customer's mark and user data.
In the embodiment of the present invention, terminal receives the data storage request of user's input, this data storage request carries targeted customer's mark and user data, terminal extracts targeted customer's mark and user data of carrying in data storage request, concrete, this targeted customer mark can be QQ number, micro-signal code etc., and this targeted customer mark can also be the binary value after the various number translated such as QQ number, micro-signal code.Concrete, user can trigger this data storage request by the option in the database APP (Application, application program) that installs in terminal.
S103, targeted customer's mark is carried out computing according to the mapping algorithm preset, and the target unloading node corresponding according to operation result query aim user ID, wherein, the corresponding multiple user ID of target unloading node.
In the embodiment of the present invention, after terminal extracts targeted customer's mark of carrying in data storage request, targeted customer's mark is carried out computing according to the mapping algorithm preset, wherein, this mapping algorithm preset can include but not limited to hash algorithm, such as: MD5 algorithm (Message-DigestAlgorithm5, Message-Digest Algorithm 5), except leaving and taking remaining algorithm, square getting middle algorithm etc.The binary value that terminal adopts hash algorithm targeted customer to be identified corresponding random length is mapped as the binary value of shorter regular length, obtain cryptographic Hash, and the target unloading node corresponding according to operation result (i.e. cryptographic Hash) query aim user ID, wherein, if the distributed data base system corresponding to terminal comprises multiple unloading node, the then corresponding one or more user ID of each unloading node, and in multiple unloading node, have the corresponding multiple user ID of a unloading node at least, and the number of each self-corresponding user ID of multiple unloading node can be identical, also can be different.Such as, the corresponding user ID of the first unloading node, corresponding two user ID of the second unloading node, corresponding three user ID of the 3rd unloading node; Or the first unloading node, the second unloading node and the 3rd unloading node be corresponding two user ID separately, etc.It should be noted that, if the mapping algorithm that terminal adopts is MD5 algorithm, then the number of each self-corresponding user ID of multiple unloading node is identical.Therefore after user ID being carried out Hash operation, multiple user ID can be mapped to respectively on different unloading nodes, also can by different user identity map on same unloading node, therefore, a unloading node may correspond to multiple user ID, the quantity of unloading node is less than the quantity of user ID, thus avoids the large mapping table produced when user ID being mapped directly to memory node, reduces mapping number.
For example, if store user data corresponding to 12 users in the distributed data base system corresponding to terminal, the user ID of these 12 users is respectively 1, 3, 5, 6, 8, 9, 12, 14, 16, 17, 19 and 20, the hash algorithm preset that terminal adopts is except leaving and taking remaining method, and the parameter of computing is %11, then the user ID of above-mentioned 12 users is carried out Hash operation respectively, i.e. 1%11=1,3%11=3, 5%11=5,6%11=6,8%11=8, 9%11=9,12%11=1,14%11=3, 16%11=5,17%11=6,19%11=8, 20%11=9,12 cryptographic Hash obtained after therefore carrying out Hash operation are respectively 1, 3, 5, 6, 8, 9, 1, 3, 5, 6, 8 and 9, then known cryptographic Hash is the user ID 1 of 1 and the target unloading node of user ID 12 correspondence is the unloading node L1 that cryptographic Hash 1 indicates, cryptographic Hash is the user ID 3 of 3 and the target unloading node of user ID 14 correspondence is the unloading node L3 that cryptographic Hash 3 indicates, cryptographic Hash is the user ID 5 of 5 and the target unloading node of user ID 16 correspondence is the unloading node L5 that cryptographic Hash 5 indicates, cryptographic Hash is the user ID 6 of 6 and the target unloading node of user ID 17 correspondence is the unloading node L6 that cryptographic Hash 6 indicates, cryptographic Hash is the user ID 8 of 8 and the target unloading node of user ID 19 correspondence is the unloading node L8 that cryptographic Hash 8 indicates, and cryptographic Hash is the user ID 9 of 9 and the target unloading node of user ID 20 correspondence is the unloading node L9 that cryptographic Hash 9 indicates.
S105, the target memory node that query aim unloading node is corresponding in memory map assignments, record the one-to-one relationship between unloading node and the memory node storing unloading node respective user data or many-one corresponding relation in memory map assignments.
In the embodiment of the present invention, terminal reads memory map assignments, the target memory node that query aim unloading node is corresponding in memory map assignments, record unloading node identification in this memory map assignments and store these unloading node respective user data memory node mark between one-to-one relationship or many-one corresponding relation, wherein, the corresponding one or more unloading node of each memory node.The efficiency of memory map assignments is read in order to improve terminal, can memory map assignments be buffered in the internal memory of distributed data base system, terminal directly reads memory map assignments from the internal memory of distributed data base system, no longer read memory map assignments by the disk of distributed data base system, substantially increase the efficiency that terminal reads memory map assignments.
Specifically, memory map assignments can adopt such as but not limited to such as following table 1 structure:
Table 1
| Unloading node identification | Memory node identifies |
| L1 | 502 |
| L3 | 502 |
| L5 | 504 |
| L6 | 504 |
| L8 | 506 |
| L9 | 506 |
As shown in Table 1, unloading node identification is the unloading node corresponding stored node 502 of L1 and L3, unloading node identification is the unloading node corresponding stored node 504 of L5 and L6, unloading node identification is the unloading node corresponding stored node 506 of L8 and L9, it can thus be appreciated that, user ID is user's corresponding stored node 502 of 1,3,12 and 14, and user ID is user's corresponding stored node 504 of 5,6,16 and 17, and user ID is user's corresponding stored node 506 of 8,9,19 and 20.Wherein, the quantity of memory node is less than the quantity of unloading node, therefore the quantity of memory node is less than the quantity of user ID more, thus avoids the too much mapping table of the mapping number that produces when user ID being mapped directly to memory node, reduces the mapping number in mapping table.
S107, the storage of subscriber data memory location that corresponding targeted customer identifies to target memory node that data storage request is carried.
In the embodiment of the present invention, each memory node in memory node 502-506 stores multiple user data, each user data is by the Data Identification unique identification of this user data, and this Data Identification can include but not limited to user ID and data item identifier.Such as, store the age " 18 years old " of user 1 in memory node 502, then " 18 years old " is the user data stored in memory node 502, and this user data is by user ID " 1 " and data item identifier " age " unique identification.
Specifically, each memory node all safeguards a data mapping tables, record the corresponding relation between the Data Identification of each user data and the memory location of this user data in memory node in data mapping tables, wherein Data Identification can user data corresponding to this Data Identification of unique identification.In specific implementation process, when memory node 502 adopts tables of data to store user data, data mapping tables can adopt such as but not limited to structure as shown in table 2 below:
Table 2
| Data Identification | Memory location |
| User 1, age | Tables of data 1 |
| User 3, height | Tables of data 2 |
As shown in Table 2, Data Identification is that the user data at " user 1, age " is kept in the tables of data 1 stored in memory node 502, and Data Identification is that the user data of " user 3, height " is kept in the tables of data 2 stored in memory node 502.
Terminal inquires after targeted customer identifies corresponding target memory node by above-mentioned mapping algorithm and memory map assignments, by the storage of subscriber data memory location that corresponding targeted customer identifies to target memory node of carrying in data storage request, such as, if terminal inquiry is memory node 502 to target memory node, and the tables of data 1 be specially in memory node 502, and the user data carried in data storage request is the height " 180cm " of user 1, then user data " 180cm " is stored in the tables of data 1 in memory node 502 by terminal.
It should be noted that, what the embodiment of the present invention described is application scenarios when data store, when user reads user data by terminal from memory node, terminal is the same according to the executable operations of the memory node of user ID inquiring user mark correspondence, repeats no more herein.
Visible, in the method described by Fig. 1, terminal receives data storage request, the targeted customer carried in data storage request mark is carried out computing according to the mapping algorithm preset, and the target unloading node corresponding according to operation result query aim user ID, and the target memory node that query aim unloading node is corresponding in memory map assignments, and then the storage of subscriber data memory location that corresponding targeted customer identifies to target memory node of will carry in data storage request.Therefore when a large number of users data are stored into multiple memory node according to Distributed Storage mode by terminal, the corresponding relation of user ID and memory node in mapping table can be avoided too much, improve the efficiency of the target memory node of terminal in the mapping table corresponding to query aim user, thus improve the storage efficiency of user data.
Refer to Fig. 2, Fig. 2 is the schematic flow sheet of the another kind of date storage method that the embodiment of the present invention provides.As shown in Figure 2, this date storage method can include but not limited to following steps.
S201, reception data storage request, data storage request carries targeted customer's mark and user data.
S203, targeted customer's mark is carried out computing according to the mapping algorithm preset, and the target unloading node corresponding according to operation result query aim user ID, wherein, the corresponding multiple user ID of target unloading node.
S205, the target memory node that query aim unloading node is corresponding in memory map assignments, record the one-to-one relationship between unloading node and the memory node storing unloading node respective user data or many-one corresponding relation in memory map assignments.
S207, the storage of subscriber data memory location that corresponding targeted customer identifies to target memory node that data storage request is carried.
S201-S207 in the embodiment of the present invention can the S101-S107 of embodiment shown in Figure 1, repeats no more herein.
S209, to judge the whether overload of target memory node according to the user data stored in target memory node, if so, perform step S211; If not, process ends.
In the embodiment of the present invention, terminal judges the whether overload of target memory node according to the user data stored in target memory node, if judge the overload of target memory node, then performs step S211; If not, process ends.
As the optional execution mode of one, judge the whether overload of target memory node according to the user data stored in target memory node, comprising:
Continue the user data growth rate of statistics target memory node in every a period of time, judge the overload of target memory node when user data growth rate exceedes default growth rate threshold value.
Concrete, terminal continues the user data growth rate of statistics target memory node in every a period of time, judges the overload of target memory node when user data growth rate exceedes default growth rate threshold value.Wherein, this time cycle can be arranged according to the embody rule environment of terminal.Be understood that, cycle duration is shorter, and the user data growth rate calculated is more accurate.Preset growth rate threshold value also to arrange according to the embody rule environment of terminal.
In specific implementation process, can to adopt such as but not limited to following formula to calculate the user data growth rate of target memory node: user data growth rate=(data volume of the user data of the last cycle statistics of data volume of the user data of current period statistics)/cycle duration.Above-mentioned cycle duration can be arranged according to the embody rule environment of terminal.User data growth rate be on the occasion of, to show in target memory node that user data is in growth, and value showing that more greatly the growth rate of user data in target memory node is faster, showing that in target memory node, user data is reducing for bearing.
As the optional execution mode of another kind, judge the whether overload of target memory node according to the user data stored in target memory node, comprising:
The quantity of the user data stored in statistics target memory node, judges the overload of target memory node when the quantity of user data exceedes preset capacity threshold value in target memory node.
Concrete, the quantity of the user data stored in terminal statistics target memory node, judges the overload of target memory node when the quantity of user data exceedes preset capacity threshold value in target memory node.Wherein, preset capacity threshold value can be arranged according to the concrete memory capacity of target memory node, such as, if the memory capacity of target memory node is 200GB, then preset capacity threshold value corresponding for target memory node is set to 180GB etc.
Select user data that part unloading node is corresponding as user data to be migrated the user data that S211, the multiple unloading nodes stored from target memory node are corresponding, and select at least one memory node as memory node to be migrated from not yet overladen memory node, or select at least one memory node as memory node to be migrated from newly-increased memory node, wherein, the residue total memory capacity of memory node to be migrated is greater than the data volume of user data to be migrated.
In the embodiment of the present invention, if terminal judges goes out the overload of target memory node, select user data that part unloading node is corresponding as user data to be migrated the user data that then multiple unloading nodes of storing from target memory node of terminal are corresponding, and select at least one memory node as memory node to be migrated from not yet overladen memory node, or select at least one memory node as memory node to be migrated from newly-increased memory node, wherein, the residue total memory capacity of memory node to be migrated is greater than the data volume of user data to be migrated.Wherein, the quantity of memory node to be migrated can be one, also can be multiple, and the embodiment of the present invention is one for memory node to be migrated and is described.
Concrete, if terminal judges goes out the overload of target memory node, the portion of user data in target memory node is then needed to carry out Data Migration, namely need to carry out dilatation to distributed data base system, or equilibrium is carried out to the load of distributed data base system, to make the user data no longer overload in target memory node, thus influential system performance.Terminal selects at least one memory node from not yet overladen memory node, or at least one is selected from the memory node that system newly increases, or from not yet overladen memory node and the memory node that newly increases, select at least one not yet overladen memory node and memory node that at least one newly increases as memory node to be migrated, if memory node to be migrated is one, then the residue total memory capacity of this memory node to be migrated need be greater than the data volume of user data to be migrated, if memory node to be migrated is multiple, then the residue total memory capacity of multiple memory node to be migrated need be greater than the data volume of user data to be migrated.
S213, by migration of subscriber data to be migrated in memory node to be migrated, and upgrade memory map assignments.
In the embodiment of the present invention, migration of subscriber data to be migrated in memory node to be migrated, and is upgraded memory map assignments by terminal.
Such as, if target memory node is memory node 502, select all customer data of user 1 that unloading node L1 is corresponding and user 12 correspondence as user data to be migrated in the user data that unloading node L1 and L3 that terminal stores from memory node 502 is corresponding, the data volume of all customer data of user 1 and user 12 correspondence is 50GB (Gigabyte, gigabyte), terminal selects one to be designated the memory node of 512 as memory node to be migrated from the memory node newly increased, the memory capacity of this memory node to be migrated is 200GB, user data to be migrated can be held.Therefore, terminal, by migration of subscriber data to be migrated to memory node 512 to be migrated, namely achieves the batch migration of the user data of multiple user, no longer moves separately for each user data, improve the transport efficiency of user data.Terminal is by after migration of subscriber data to be migrated to memory node to be migrated, upgrade memory map assignments, unloading node L1 corresponding stored node identification in memory map assignments is revised as the mark 512 of memory node to be migrated, need access the user data of user 1 and user 12 correspondence if follow-up, then need access the user data of user 1 and user 12 correspondence from memory node 512.
Visible, in the method described by Fig. 2, when terminal judges goes out the overload of target memory node, select user data that part unloading node is corresponding as user data to be migrated in the user data that the multiple unloading nodes stored from target memory node are corresponding, and select at least one memory node as memory node to be migrated from not yet overladen memory node, or select at least one memory node as memory node to be migrated from newly-increased memory node, and then by migration of subscriber data to be migrated to memory node to be migrated, therefore batch migration can be carried out for the user data that multiple user ID is corresponding, successively move without the need to the user data for individual consumer, decrease number of times and the time of migration of subscriber data, improve the transport efficiency of user data.
The above-mentioned method illustrating the embodiment of the present invention, below for the ease of implementing the such scheme of the embodiment of the present invention better, correspondingly, is also provided for coordinating the associated terminal implementing such scheme below.
Refer to Fig. 3, Fig. 3 is the structural representation of a kind of terminal that the embodiment of the present invention provides.As shown in Figure 3, this terminal 30 comprises: receiving element 301, first query unit 303, second query unit 305 and memory cell 307, wherein,
Receiving element 301, for receiving data storage request, data storage request carries targeted customer's mark and user data;
First query unit 303, for targeted customer's mark is carried out computing according to the mapping algorithm preset, and the target unloading node corresponding according to operation result query aim user ID, wherein, the corresponding multiple user ID of target unloading node;
Second query unit 305, for the target memory node that query aim unloading node in memory map assignments is corresponding, in memory map assignments, record the one-to-one relationship between unloading node and the memory node storing unloading node respective user data or many-one corresponding relation;
Memory cell 307, for the storage of subscriber data memory location that corresponding targeted customer identifies to target memory node of data storage request being carried.
Will be understood that, the function of each functional unit of the terminal 30 of the present embodiment can the associated description of embodiment shown in Figure 1, repeats no more herein.
Please also refer to the structural representation that Fig. 4, Fig. 4 are the another kind of terminals that the embodiment of the present invention provides.Wherein, the terminal 30 shown in Fig. 4 is that terminal 30 is as shown in Figure 3 optimized and obtains.Compared with Fig. 3, the terminal 30 described by Fig. 4 comprises outside receiving element 301, first query unit 303, second query unit 305 and memory cell 307, also comprises judging unit 309, selected cell 311 and migration units 313, wherein,
Judging unit 309, for judging the whether overload of target memory node according to the user data stored in target memory node;
As the optional execution mode of one, judging unit 309 specifically for:
Continue the user data growth rate of statistics target memory node in every a period of time, judge the overload of target memory node when user data growth rate exceedes default growth rate threshold value; Or,
The quantity of the user data stored in statistics target memory node, judges the overload of target memory node when the quantity of user data exceedes preset capacity threshold value in target memory node.
Selected cell 311, if judge the overload of target memory node for judging unit 309, select user data that part unloading node is corresponding as user data to be migrated the user data that the multiple unloading nodes then stored from target memory node are corresponding, and select at least one memory node as memory node to be migrated from not yet overladen memory node, or select at least one memory node as memory node to be migrated from newly-increased memory node, wherein, the residue total memory capacity of memory node to be migrated is greater than the data volume of user data to be migrated;
Migration units 313, for by migration of subscriber data to be migrated in memory node to be migrated, and upgrade memory map assignments.
Will be understood that, the associated description of the function embodiment shown in Figure 2 of each functional unit of the terminal 30 of the present embodiment, repeats no more herein.
Refer to Fig. 5, Fig. 5 is the structural representation of a kind of distributed data base system that the embodiment of the present invention provides.As shown in Figure 5, distributed data base system 500 comprises multiple memory node 502-506 and service server 508.Wherein, be connected by bus or alternate manner between memory node 502-506 with service server 508, wherein, to be connected by bus 510 in Fig. 5.Each memory node in memory node 502-506 stores multiple user data, and each user data is by the Data Identification unique identification of this user data, and this Data Identification can include but not limited to user ID and data item identifier.Such as, store the age " 18 years old " of user 1 in memory node 502, then " 18 years old " is the user data stored in memory node 502, and this user data is by user ID " 1 " and data item identifier " age " unique identification.Service server 508 can be used for the business such as registration, data upload, data download realizing user, user needs the storage of subscriber data stored in memory node 502-506 by the data storage request of service server 508 also for sending according to user, or from memory node 502-506, the user data of user's needs is obtained according to the data access request that user sends, in the present embodiment, service server 508 can be specially the terminal 30 in above-described embodiment.
Specifically, each memory node all safeguards a data mapping tables, record the corresponding relation between the Data Identification of each user data and the memory location of this user data in memory node in data mapping tables, wherein Data Identification can user data corresponding to this Data Identification of unique identification.In specific implementation process, when memory node 502 adopts tables of data to store user data, data mapping tables can adopt such as but not limited to structure shown in table 2.
It should be noted that, for improving the efficiency of service server 508 accesses user data from memory node 502-506, memory database can be used to realize at least one in above-mentioned memory node 502-506, be placed in internal memory by user data, to improve the service feature of service server 508.
It should be noted that those skilled in the art it should be understood that in specific implementation process, the quantity of memory node can be arranged according to actual needs, and is not limited to the quantity shown in Fig. 5.
Service server 508 is for receiving data storage request, this data storage request carries targeted customer's mark and user data, service server 508 extracts targeted customer's mark and user data of carrying in data storage request, concrete, this targeted customer mark can be QQ number, micro-signal code etc., and this targeted customer mark can also be the binary value after the various number translated such as QQ number, micro-signal code.Targeted customer's mark is carried out computing according to the mapping algorithm preset by service server 508, and wherein, this mapping algorithm preset can include but not limited to hash algorithm, such as: MD5 algorithm, except leaving and taking remaining algorithm, square getting middle algorithm etc.The binary value that service server 508 adopts hash algorithm targeted customer to be identified corresponding random length is mapped as the binary value of shorter regular length, obtain cryptographic Hash, and the target unloading node corresponding according to operation result (i.e. cryptographic Hash) query aim user ID, wherein, if the distributed data base system corresponding to terminal comprises multiple unloading node, the then corresponding one or more user ID of each unloading node, and in multiple unloading node, have the corresponding multiple user ID of a unloading node at least, and the number of each self-corresponding user ID of multiple unloading node can be identical, also can be different.Such as, the corresponding user ID of the first unloading node, corresponding two user ID of the second unloading node, corresponding three user ID of the 3rd unloading node; Or the first unloading node, the second unloading node and the 3rd unloading node be corresponding two user ID separately, etc.It should be noted that, if the mapping algorithm that terminal adopts is MD5 algorithm, then the number of each self-corresponding user ID of multiple unloading node is identical.
Service server 508 is also for reading memory map assignments, the target memory node that query aim unloading node is corresponding in memory map assignments, record unloading node identification in this memory map assignments and store these unloading node respective user data memory node mark between one-to-one relationship or many-one corresponding relation, wherein, the corresponding one or more unloading node of each memory node.The efficiency of memory map assignments is read in order to improve service server 508, memory map assignments can be buffered in the internal memory of distributed data base system 500, service server 508 directly reads memory map assignments from the internal memory of distributed data base system 500, no longer read memory map assignments by the disk of distributed data base system 500, substantially increase the efficiency that service server 508 reads memory map assignments.Specifically, memory map assignments can adopt such as but not limited to table 1 structure.
The storage of subscriber data memory location that to target memory node corresponding targeted customer identify of service server 508 also for data storage request is carried.Concrete, service server 508 inquires after targeted customer identifies corresponding target memory node by above-mentioned mapping algorithm and memory map assignments, by the storage of subscriber data memory location that corresponding targeted customer identifies to target memory node of carrying in data storage request, such as, if it is memory node 502 that service server 508 inquires target memory node, and the tables of data 1 be specially in memory node 502, and the user data carried in data storage request is the height " 180cm " of user 1, then user data " 180cm " is stored in the tables of data 1 in memory node 502 by service server 508.
It should be noted that, what the embodiment of the present invention described is application scenarios when data store, when user reads user data by service server 508 from memory node, service server 508 is the same according to the executable operations of the memory node of user ID inquiring user mark correspondence, repeats no more herein.
Visible, in the distributed data base system described by Fig. 5, service server receives data storage request, the targeted customer carried in data storage request mark is carried out computing according to the mapping algorithm preset, and the target unloading node corresponding according to operation result query aim user ID, and the target memory node that query aim unloading node is corresponding in memory map assignments, and then the storage of subscriber data memory location that corresponding targeted customer identifies to target memory node of will carry in data storage request.Therefore when a large number of users data are stored into multiple memory node according to Distributed Storage mode by service server, the corresponding relation of user ID and memory node in mapping table can be avoided too much, improve the efficiency of the target memory node of service server in the mapping table corresponding to query aim user, thus improve the storage efficiency of user data.
Refer to Fig. 6, Fig. 6 is the structural representation of the another kind of distributed data base system that the embodiment of the present invention provides.As shown in Figure 6, distributed data base system 500 comprises multiple memory node 502-506, service server 508 and memory node to be migrated 512, wherein, memory node 502-506 and being connected by bus or alternate manner between memory node to be migrated 512 with service server 508, wherein, in Fig. 5 to be connected by bus 510.The 26S Proteasome Structure and Function of memory node 502-506 and service server 508 can the associated description of memory node 502-506 and service server 508 in embodiment shown in Figure 5, repeats no more herein.Wherein, service server 508 is also for when memory node 502-506 overload, moved to by portion of user data in memory node 502-506 in memory node 512 to be migrated, memory node 512 to be migrated is for storing the user data moved out from memory node 502-506.
Service server 508 is also for judging the whether overload of target memory node according to the user data stored in target memory node, if judge the overload of target memory node, select user data that part unloading node is corresponding as user data to be migrated the user data that then multiple unloading nodes of storing from target memory node of service server 508 are corresponding, and from not yet overladen memory node, select at least one memory node as memory node 512 to be migrated, or select at least one memory node as memory node 512 to be migrated from newly-increased memory node, wherein, the residue total memory capacity of memory node 512 to be migrated is greater than the data volume of user data to be migrated, migration of subscriber data to be migrated in memory node 512 to be migrated, and is upgraded memory map assignments by service server 508.Wherein, the quantity of memory node 512 to be migrated can be one, also can be multiple, and the embodiment of the present invention is one for memory node 512 to be migrated and is described.
Concrete, if service server 508 judges the overload of target memory node, the portion of user data in target memory node is then needed to carry out Data Migration, namely need to carry out dilatation to distributed data base system 500, or equilibrium is carried out to the load of distributed data base system 500, to make the user data no longer overload in target memory node, thus influential system performance.Service server 508 selects at least one memory node from not yet overladen memory node, or at least one is selected from the memory node that system newly increases, or from not yet overladen memory node and the memory node that newly increases, select at least one not yet overladen memory node and memory node that at least one newly increases as memory node 512 to be migrated, if memory node 512 to be migrated is one, then the residue total memory capacity of this memory node 512 to be migrated need be greater than the data volume of user data to be migrated, if memory node 512 to be migrated is multiple, then the residue total memory capacity of multiple memory node to be migrated 512 need be greater than the data volume of user data to be migrated, such as, if target memory node is memory node 502, select all customer data of user 1 that unloading node L1 is corresponding and user 12 correspondence as user data to be migrated in the user data that unloading node L1 and L3 that service server 508 stores from memory node 502 is corresponding, the data volume of all customer data of user 1 and user 12 correspondence is 50GB (Gigabyte, gigabyte), service server 508 selects one as memory node 512 to be migrated from the memory node newly increased, the memory capacity of this memory node 512 to be migrated is 200GB, user data to be migrated can be held.Therefore, service server 508, by migration of subscriber data to be migrated to memory node 512 to be migrated, namely achieves the batch migration of the user data of multiple user, no longer moves separately for each user data, improve the transport efficiency of user data.Service server 508 is by after migration of subscriber data to be migrated to memory node 512 to be migrated, upgrade memory map assignments, unloading node L1 corresponding stored node identification in memory map assignments is revised as 512, need access the user data of user 1 and user 12 correspondence if follow-up, then need access the user data of user 1 and user 12 correspondence from memory node 512.
As the optional execution mode of one, service server 508 continues the user data growth rate of statistics target memory node in every a period of time, judges the overload of target memory node when user data growth rate exceedes default growth rate threshold value.Wherein, this time cycle can be arranged according to the embody rule environment of distributed data base system 500.Be understood that, cycle duration is shorter, and the user data growth rate calculated is more accurate.Preset growth rate threshold value also to arrange according to the embody rule environment of distributed data base system 500.
In specific implementation process, can to adopt such as but not limited to following formula to calculate the user data growth rate of target memory node: user data growth rate=(data volume of the user data of the last cycle statistics of data volume of the user data of current period statistics)/cycle duration.Above-mentioned cycle duration can be arranged according to the embody rule environment of distributed data base system 500.User data growth rate be on the occasion of, to show in target memory node that user data is in growth, and value showing that more greatly the growth rate of user data in target memory node is faster, showing that in target memory node, user data is reducing for bearing.
As the optional execution mode of one, service server 508 adds up the quantity of the user data stored in target memory node, judges the overload of target memory node when the quantity of user data exceedes preset capacity threshold value in target memory node.Wherein, preset capacity threshold value can be arranged according to the concrete memory capacity of target memory node, such as, if the memory capacity of target memory node is 200GB, then preset capacity threshold value corresponding for target memory node is set to 180GB etc.
Visible, in the distributed data base system described by Fig. 6, when service server judging goes out the overload of target memory node, select user data that part unloading node is corresponding as user data to be migrated in the user data that the multiple unloading nodes stored from target memory node are corresponding, and select at least one memory node as memory node to be migrated from not yet overladen memory node, or select at least one memory node as memory node to be migrated from newly-increased memory node, and then by migration of subscriber data to be migrated to memory node to be migrated, therefore batch migration can be carried out for the user data that multiple user ID is corresponding, successively move without the need to the user data for individual consumer, decrease number of times and the time of migration of subscriber data, improve the transport efficiency of user data.
Referring to Fig. 7, is the structural representation of another kind of terminal provided by the invention.Wherein, as shown in Figure 7, terminal 70 can comprise: at least one processor 701, such as CPU, at least one bus 702, at least one input unit 703 and at least one output device 704, memory 705.Wherein, bus 702 is for realizing the communication connection between these assemblies; Input unit 703 specifically can be the contact panel of terminal, comprises touch-screen and touch screen, the operational order on sense terminals contact panel; Output device 704 can comprise the display screen (Display) of terminal, for exporting, showing image or data; Memory 705 can be high-speed RAM display, also can be non-labile display (non-volatilememory), such as at least one disk display, memory 705 can also be optionally that at least one is positioned at the display unit away from aforementioned processor 701.As shown in Figure 7, operating system, network communication module, Subscriber Interface Module SIM and data recording program can be comprised in the memory 705 as a kind of Computer display medium.
In the terminal 70 shown in Fig. 7, processor 701 may be used for the data recording program stored in run memory 705, and performs following operation:
Receive data storage request by input unit 703, data storage request carries targeted customer's mark and user data;
Targeted customer's mark is carried out computing according to the mapping algorithm preset, and the target unloading node corresponding according to operation result query aim user ID, wherein, the corresponding multiple user ID of target unloading node;
The target memory node that query aim unloading node is corresponding in memory map assignments, records the one-to-one relationship between unloading node and the memory node storing unloading node respective user data or many-one corresponding relation in memory map assignments;
The memory location of corresponding targeted customer's mark in the storage of subscriber data that data storage request is carried to target memory node.
Further, processor 701 also performs after performing the memory location of storage of subscriber data corresponding targeted customer's mark to target memory node of data storage request being carried:
The whether overload of target memory node is judged according to the user data stored in target memory node;
If judge the overload of target memory node, select user data that part unloading node is corresponding as user data to be migrated the user data that the multiple unloading nodes then stored from target memory node are corresponding, and select at least one memory node as memory node to be migrated from not yet overladen memory node, or select at least one memory node as memory node to be migrated from newly-increased memory node, wherein, the residue total memory capacity of memory node to be migrated is greater than the data volume of user data to be migrated;
By migration of subscriber data to be migrated in memory node to be migrated, and upgrade memory map assignments.
Further, processor 701 performs and judges the whether overload of target memory node according to the user data stored in target memory node, is specially:
Continue the user data growth rate of statistics target memory node in every a period of time, judge the overload of target memory node when user data growth rate exceedes default growth rate threshold value; Or,
The quantity of the user data stored in statistics target memory node, judges the overload of target memory node when the quantity of user data exceedes preset capacity threshold value in target memory node.
Further, mapping algorithm comprises hash algorithm.
Further, memory map assignments is stored in the internal memory of distributed data base.
Will be understood that, the execution step of processor 701 specifically see the content of Fig. 1 or Fig. 2 embodiment, can repeat no more herein.
In sum, terminal receives data storage request, the targeted customer carried in data storage request mark is carried out computing according to the mapping algorithm preset, and the target unloading node corresponding according to operation result query aim user ID, and the target memory node that query aim unloading node is corresponding in memory map assignments, and then the storage of subscriber data memory location that corresponding targeted customer identifies to target memory node of will carry in data storage request.Therefore when a large number of users data are stored into multiple memory node according to Distributed Storage mode by terminal, the corresponding relation of user ID and memory node in mapping table can be avoided too much, improve the efficiency of the target memory node of terminal in the mapping table corresponding to query aim user, thus improve the storage efficiency of user data.
Further, when terminal judges goes out the overload of target memory node, select user data that part unloading node is corresponding as user data to be migrated in the user data that the multiple unloading nodes stored from target memory node are corresponding, and select at least one memory node as memory node to be migrated from not yet overladen memory node, or select at least one memory node as memory node to be migrated from newly-increased memory node, and then by migration of subscriber data to be migrated to memory node to be migrated, therefore batch migration can be carried out for the user data that multiple user ID is corresponding, successively move without the need to the user data for individual consumer, decrease number of times and the time of migration of subscriber data, improve the transport efficiency of user data.
One of ordinary skill in the art will appreciate that all or part of flow process realized in above-described embodiment method, that the hardware that can carry out instruction relevant by computer program has come, described program can be stored in a computer read/write memory medium, this program, when performing, can comprise the flow process of the embodiment as above-mentioned each side method.Wherein, described storage medium can be magnetic disc, CD, read-only store-memory body (Read-OnlyMemory, ROM) or random store-memory body (RandomAccessMemory, RAM) etc.
Step in embodiment of the present invention method can be carried out order according to actual needs and be adjusted, merges and delete.
Unit in embodiment of the present invention terminal can carry out merging, divide and deleting according to actual needs.
Above disclosedly be only a kind of preferred embodiment of the present invention, certainly the interest field of the present invention can not be limited with this, one of ordinary skill in the art will appreciate that all or part of flow process realizing above-described embodiment, and according to the equivalent variations that the claims in the present invention are done, still belong to the scope that invention is contained.
Claims (10)
1. a date storage method, is characterized in that, described method comprises:
Receive data storage request, described data storage request carries targeted customer's mark and user data;
Described targeted customer's mark is carried out computing according to the mapping algorithm preset, and inquires about according to operation result the target unloading node that described targeted customer identifies correspondence, wherein, the corresponding multiple user ID of described target unloading node;
The target memory node that described target unloading node is corresponding is inquired about, the one-to-one relationship between the memory node recording unloading node in described memory map assignments and store described unloading node respective user data or many-one corresponding relation in memory map assignments;
The memory location of corresponding described targeted customer's mark in the described storage of subscriber data that described data storage request is carried to described target memory node.
2. method according to claim 1, is characterized in that, after the memory location that in described described storage of subscriber data of described data storage request being carried to described target memory node, corresponding described targeted customer identifies, also comprises:
The whether overload of described target memory node is judged according to the user data stored in described target memory node;
If judge the overload of described target memory node, select user data that part unloading node is corresponding as user data to be migrated the user data that the multiple unloading nodes then stored from described target memory node are corresponding, and select at least one memory node as memory node to be migrated from not yet overladen memory node, or select at least one memory node as described memory node to be migrated from newly-increased memory node, wherein, the residue total memory capacity of described memory node to be migrated is greater than the data volume of described user data to be migrated;
By described migration of subscriber data to be migrated in described memory node to be migrated, and upgrade described memory map assignments.
3. method according to claim 2, is characterized in that, the described user data according to storing in described target memory node judges the whether overload of described target memory node, comprising:
Continue the user data growth rate of the described target memory node of statistics in every a period of time, judge the overload of described target memory node when described user data growth rate exceedes default growth rate threshold value; Or,
Add up the quantity of the user data stored in described target memory node, when the quantity of user data exceedes preset capacity threshold value in described target memory node, judge the overload of described target memory node.
4. the method according to any one of claim 1-3, is characterized in that, described mapping algorithm comprises hash algorithm.
5. the method according to any one of claim 1-3, is characterized in that, described memory map assignments is stored in the internal memory of described distributed data base.
6. a terminal, is characterized in that, described terminal comprises:
Receiving element, for receiving data storage request, described data storage request carries targeted customer's mark and user data;
First query unit, for described targeted customer's mark is carried out computing according to the mapping algorithm preset, and inquires about according to operation result the target unloading node that described targeted customer identifies correspondence, wherein, and the corresponding multiple user ID of described target unloading node;
Second query unit, for inquiring about target memory node corresponding to described target unloading node in memory map assignments, the one-to-one relationship between the memory node recording unloading node in described memory map assignments and store described unloading node respective user data or many-one corresponding relation;
Memory cell, for the described storage of subscriber data memory location that corresponding described targeted customer identifies to described target memory node of described data storage request being carried.
7. terminal according to claim 6, is characterized in that, described terminal also comprises:
Judging unit, for judging the whether overload of described target memory node according to the user data stored in described target memory node;
Selected cell, if judge the overload of described target memory node for described judging unit, select user data that part unloading node is corresponding as user data to be migrated the user data that the multiple unloading nodes then stored from described target memory node are corresponding, and select at least one memory node as memory node to be migrated from not yet overladen memory node, or select at least one memory node as described memory node to be migrated from newly-increased memory node, wherein, the residue total memory capacity of described memory node to be migrated is greater than the data volume of described user data to be migrated,
Migration units, for by described migration of subscriber data to be migrated in described memory node to be migrated, and upgrade described memory map assignments.
8. terminal according to claim 7, is characterized in that, described judging unit specifically for:
Continue the user data growth rate of the described target memory node of statistics in every a period of time, judge the overload of described target memory node when described user data growth rate exceedes default growth rate threshold value; Or,
Add up the quantity of the user data stored in described target memory node, when the quantity of user data exceedes preset capacity threshold value in described target memory node, judge the overload of described target memory node.
9. the terminal according to any one of claim 6-8, is characterized in that, described mapping algorithm comprises hash algorithm.
10. the terminal according to any one of claim 6-8, is characterized in that, described memory map assignments is stored in the internal memory of described distributed data base.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510998390.0A CN105491149B (en) | 2015-12-26 | 2015-12-26 | A kind of date storage method and terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510998390.0A CN105491149B (en) | 2015-12-26 | 2015-12-26 | A kind of date storage method and terminal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105491149A true CN105491149A (en) | 2016-04-13 |
| CN105491149B CN105491149B (en) | 2019-04-23 |
Family
ID=55677859
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510998390.0A Active CN105491149B (en) | 2015-12-26 | 2015-12-26 | A kind of date storage method and terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105491149B (en) |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107241387A (en) * | 2017-05-12 | 2017-10-10 | 腾讯科技（深圳）有限公司 | The processing method of request of data, apparatus and system |
| CN107798257A (en) * | 2017-11-17 | 2018-03-13 | 郑州云海信息技术有限公司 | A kind of MD5 values storage method and storage system |
| CN107948234A (en) * | 2016-10-13 | 2018-04-20 | 北京国双科技有限公司 | The processing method and processing device of data |
| CN108062350A (en) * | 2017-11-08 | 2018-05-22 | 深圳市金立通信设备有限公司 | A kind of data processing method, node device and computer-readable medium |
| CN108494870A (en) * | 2018-04-03 | 2018-09-04 | 中国平安人寿保险股份有限公司 | Dynamic data loading method based on CDN and device |
| CN108769123A (en) * | 2018-04-27 | 2018-11-06 | 国信优易数据有限公司 | A kind of data system and data processing method |
| CN108829897A (en) * | 2018-07-03 | 2018-11-16 | 沈文策 | Date storage method and data-storage system |
| CN109800236A (en) * | 2019-01-28 | 2019-05-24 | 上海雷腾软件股份有限公司 | Support the distributed caching method and equipment of multinode |
| CN109918450A (en) * | 2019-03-20 | 2019-06-21 | 江苏瑞中数据股份有限公司 | Based on the distributed parallel database and storage method under analysis classes scene |
| CN110300158A (en) * | 2019-06-05 | 2019-10-01 | 黄疆 | Method and system based on AD domain mapping access NAS |
| CN110505277A (en) * | 2019-07-18 | 2019-11-26 | 北京奇艺世纪科技有限公司 | A kind of data cache method, device and client |
| CN110602159A (en) * | 2019-07-30 | 2019-12-20 | 广州力挚网络科技有限公司 | Data processing method and system |
| CN111176549A (en) * | 2018-11-13 | 2020-05-19 | 杭州海康威视系统技术有限公司 | Data storage method and device based on cloud storage and storage medium |
| CN111708808A (en) * | 2020-06-10 | 2020-09-25 | 中国建设银行股份有限公司 | Distributed service system and service summarizing and inquiring method, device and equipment thereof |
| CN112486982A (en) * | 2020-11-17 | 2021-03-12 | 中信银行股份有限公司 | Data acquisition method, device and storage medium |
| CN112966312A (en) * | 2021-03-02 | 2021-06-15 | 中国银联股份有限公司 | Data storage method, device, equipment and storage medium |
| CN113037497A (en) * | 2021-03-15 | 2021-06-25 | 中国工商银行股份有限公司 | Risk data sharing method and system based on block chain |
| CN113590346A (en) * | 2021-06-30 | 2021-11-02 | 荣耀终端有限公司 | Method and electronic equipment for processing service request |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101505472A (en) * | 2008-02-05 | 2009-08-12 | 华为技术有限公司 | User data server system and apparatus |
| CN102129442A (en) * | 2010-09-20 | 2011-07-20 | 华为技术有限公司 | Distributed database system and data accessing method |
| CN102647335A (en) * | 2011-02-22 | 2012-08-22 | 中国移动通信集团公司 | Data routing method, device and system |
| US20140304242A1 (en) * | 2009-09-18 | 2014-10-09 | Hitachi, Ltd. | Storage system for eliminating duplicated data |
-
2015
- 2015-12-26 CN CN201510998390.0A patent/CN105491149B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101505472A (en) * | 2008-02-05 | 2009-08-12 | 华为技术有限公司 | User data server system and apparatus |
| US20140304242A1 (en) * | 2009-09-18 | 2014-10-09 | Hitachi, Ltd. | Storage system for eliminating duplicated data |
| CN102129442A (en) * | 2010-09-20 | 2011-07-20 | 华为技术有限公司 | Distributed database system and data accessing method |
| CN102647335A (en) * | 2011-02-22 | 2012-08-22 | 中国移动通信集团公司 | Data routing method, device and system |
Cited By (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107948234A (en) * | 2016-10-13 | 2018-04-20 | 北京国双科技有限公司 | The processing method and processing device of data |
| CN107948234B (en) * | 2016-10-13 | 2021-02-12 | 北京国双科技有限公司 | Data processing method and device |
| CN107241387A (en) * | 2017-05-12 | 2017-10-10 | 腾讯科技（深圳）有限公司 | The processing method of request of data, apparatus and system |
| CN108062350A (en) * | 2017-11-08 | 2018-05-22 | 深圳市金立通信设备有限公司 | A kind of data processing method, node device and computer-readable medium |
| CN107798257B (en) * | 2017-11-17 | 2020-04-03 | 郑州云海信息技术有限公司 | MD5 value storage method and storage system |
| CN107798257A (en) * | 2017-11-17 | 2018-03-13 | 郑州云海信息技术有限公司 | A kind of MD5 values storage method and storage system |
| CN108494870A (en) * | 2018-04-03 | 2018-09-04 | 中国平安人寿保险股份有限公司 | Dynamic data loading method based on CDN and device |
| CN108494870B (en) * | 2018-04-03 | 2022-05-17 | 中国平安人寿保险股份有限公司 | CDN-based dynamic data loading method and device |
| CN108769123A (en) * | 2018-04-27 | 2018-11-06 | 国信优易数据有限公司 | A kind of data system and data processing method |
| CN108769123B (en) * | 2018-04-27 | 2021-07-13 | 国信优易数据股份有限公司 | Data system and data processing method |
| CN108829897A (en) * | 2018-07-03 | 2018-11-16 | 沈文策 | Date storage method and data-storage system |
| WO2020098654A1 (en) * | 2018-11-13 | 2020-05-22 | 杭州海康威视系统技术有限公司 | Data storage method and device based on cloud storage, and storage medium |
| CN111176549B (en) * | 2018-11-13 | 2021-05-18 | 杭州海康威视系统技术有限公司 | Data storage method and device based on cloud storage and storage medium |
| CN111176549A (en) * | 2018-11-13 | 2020-05-19 | 杭州海康威视系统技术有限公司 | Data storage method and device based on cloud storage and storage medium |
| CN109800236A (en) * | 2019-01-28 | 2019-05-24 | 上海雷腾软件股份有限公司 | Support the distributed caching method and equipment of multinode |
| CN109918450B (en) * | 2019-03-20 | 2024-01-09 | 江苏瑞中数据股份有限公司 | Distributed parallel database based on analysis type scene and storage method |
| CN109918450A (en) * | 2019-03-20 | 2019-06-21 | 江苏瑞中数据股份有限公司 | Based on the distributed parallel database and storage method under analysis classes scene |
| CN110300158A (en) * | 2019-06-05 | 2019-10-01 | 黄疆 | Method and system based on AD domain mapping access NAS |
| CN110505277B (en) * | 2019-07-18 | 2022-04-26 | 北京奇艺世纪科技有限公司 | Data caching method and device and client |
| CN110505277A (en) * | 2019-07-18 | 2019-11-26 | 北京奇艺世纪科技有限公司 | A kind of data cache method, device and client |
| CN110602159A (en) * | 2019-07-30 | 2019-12-20 | 广州力挚网络科技有限公司 | Data processing method and system |
| CN111708808A (en) * | 2020-06-10 | 2020-09-25 | 中国建设银行股份有限公司 | Distributed service system and service summarizing and inquiring method, device and equipment thereof |
| CN112486982A (en) * | 2020-11-17 | 2021-03-12 | 中信银行股份有限公司 | Data acquisition method, device and storage medium |
| CN112966312A (en) * | 2021-03-02 | 2021-06-15 | 中国银联股份有限公司 | Data storage method, device, equipment and storage medium |
| CN112966312B (en) * | 2021-03-02 | 2024-05-17 | 中国银联股份有限公司 | Data storage method, device, equipment and storage medium |
| CN113037497A (en) * | 2021-03-15 | 2021-06-25 | 中国工商银行股份有限公司 | Risk data sharing method and system based on block chain |
| CN113037497B (en) * | 2021-03-15 | 2023-08-01 | 中国工商银行股份有限公司 | Block chain-based risk data sharing method and system |
| CN113590346A (en) * | 2021-06-30 | 2021-11-02 | 荣耀终端有限公司 | Method and electronic equipment for processing service request |
| CN113590346B (en) * | 2021-06-30 | 2022-06-21 | 荣耀终端有限公司 | Method and electronic equipment for processing service request |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105491149B (en) | 2019-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105491149A (en) | Data storage method and terminal | |
| KR101792582B1 (en) | Efficient query processing using histograms in a columnar database | |
| US11151052B2 (en) | Reading sequential data from memory using a pivot table | |
| CN106170757B (en) | A kind of date storage method and device | |
| CN111813805A (en) | Data processing method and device | |
| CA3128540A1 (en) | Cache system hotspot data access method, apparatus, computer device and storage medium | |
| CN113051250A (en) | Database cluster capacity expansion method and device, electronic equipment and storage medium | |
| CN109697019B (en) | Data writing method and system based on FAT file system | |
| CN115840731A (en) | File processing method, computing device and computer storage medium | |
| CN104933051A (en) | File storage space recovery method and device | |
| CN111803917A (en) | Resource processing method and device | |
| CN111399936A (en) | BMC customization method, system, equipment and readable storage medium | |
| CN103559247A (en) | Data service processing method and device | |
| CN108205559A (en) | A kind of data managing method and its equipment | |
| CN104408126A (en) | Persistent writing method, device and system of database | |
| CN114995770B (en) | Data processing method, device, equipment, system and readable storage medium | |
| CN101442833A (en) | Communication terminal device, access controlling method, and smart card | |
| CN108536759B (en) | Sample playback data access method and device | |
| CN113342781B (en) | Data migration method, device, equipment and storage medium | |
| CN105321124A (en) | Hadoop-based electric power cloud platform design scheme | |
| CN115576863A (en) | Data reading and writing method, storage device and storage medium | |
| CN111858590B (en) | Storage system metadata organization method, system, terminal and storage medium | |
| JP2019028572A (en) | Information processing apparatus, information processing system, information processing method, and information processing program | |
| CN114579404A (en) | Cold and hot page statistical method and device | |
| CN103279575A (en) | Method and device for processing file information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210426 Address after: DESAY No. 9789 building, 518057 Guangdong city of Shenzhen province Nanshan District Guangdong streets Shennan Road sign layer 17 layer (natural layer 15) No. 1702-1703 Patentee after: Shenzhen Microphone Holdings Co.,Ltd. Address before: 518040, 21 floor, Times Technology Building, 7028 Shennan Road, Futian District, Guangdong, Shenzhen Patentee before: DONGGUAN GOLDEX COMMUNICATION TECHNOLOGY Co.,Ltd. |