CN105491149B - A kind of date storage method and terminal - Google Patents
A kind of date storage method and terminal Download PDFInfo
- Publication number
- CN105491149B CN105491149B CN201510998390.0A CN201510998390A CN105491149B CN 105491149 B CN105491149 B CN 105491149B CN 201510998390 A CN201510998390 A CN 201510998390A CN 105491149 B CN105491149 B CN 105491149B
- Authority
- CN
- China
- Prior art keywords
- node
- target
- 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.)
- Active
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 Transfer Between Computers (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention provides a kind of date storage method and terminals.Wherein, this method comprises: receiving data storage request, data storage request carries target user's mark and user data；Target user's mark is subjected to operation according to preset mapping algorithm, and target user is inquired according to operation result and identifies corresponding target unloading node, target unloading node corresponds to multiple user identifiers；The corresponding target storage node of target unloading node is inquired in memory map assignments, record has one-to-one relationship or many-one corresponding relationship between the memory node of unloading node user data corresponding with unloading node is stored in memory map assignments；The user data that data storage request carries is stored to the storage location that target user's mark is corresponded into target storage node.Through the embodiment of the present invention, it avoids and generates big mapping table when carrying out the distributed storage of mass data, improve the efficiency of target storage node corresponding to inquiry target user.
Description
Technical field
The present invention relates to field of computer technology, and in particular to a kind of date storage method and terminal.
Background technique
Distributed data base system is to logically belong to same system, be physically distributed in computer be connected to the network it is more
Data acquisition system on a node (Node).Node links together in a computer network, and each node is one independent
Database Systems.In distributed data base system, user data is distributed in different storage sections according to certain distribution rule
In point, user accesses every time or needs first to position the memory node where user data when modifying user data, then again from this
Accesses user data in memory node.
Currently, common distribution rule has by record identification distribution, by user activity distribution etc..Wherein, by record mark
Knowing distribution needs service server to safeguard a mapping table, and record has record identification and the corresponding of memory node to close in the mapping table
System, when amount of user data is very big, mapping table also by the very big of change, causes service server to inquire target user in the mapping table
The efficiency of corresponding memory node reduces；Service server, which is also required to, by user activity distribution safeguards a mapping table,
Record has the corresponding relationship of user activity and memory node in mapping table, and when amount of user data is very big, mapping table will also become
It is very big, and and not all Database Systems support the statistical measurement of user activity, lead to answering for such distribution rule
With limited.
Summary of the invention
The embodiment of the invention provides a kind of date storage method and terminals, can be to avoid in progress a large number of users data
Record strip number excessive mapping table is generated when distributed storage, improves the effect of target storage node corresponding to inquiry target user
Rate, to improve the storage efficiency of user data.
In a first aspect, the embodiment of the invention provides a kind of date storage methods, comprising:
Data storage request is received, the data storage request carries target user's mark and user data；
Target user mark is subjected to operation according to preset mapping algorithm, and the mesh is inquired according to operation result
Mark the corresponding target unloading node of user identifier, wherein the target unloading node corresponds to multiple user identifiers；
The corresponding target storage node of the target unloading node is inquired in memory map assignments, in the memory map assignments
Record has the one-to-one relationship or more between the memory node of unloading node user data corresponding with the unloading node is stored
To a corresponding relationship；
The user data that the data storage request is carried is stored into the target storage node described in correspondence
The storage location of target user's mark.
Second aspect, the embodiment of the invention provides a kind of terminals, comprising:
Receiving unit, for receiving data storage request, the data storage request carry target user's mark and user
Data；
First query unit, for identifying the target user according to the progress operation of preset mapping algorithm, and according to
Operation result inquires the target user and identifies corresponding target unloading node, wherein the target unloading node corresponds to multiple
User identifier；
Second query unit, for inquiring the corresponding target storage section of the target unloading node in memory map assignments
Point, record has between the memory node of unloading node user data corresponding with the unloading node is stored in the memory map assignments
One-to-one relationship or many-one corresponding relationship；
Storage unit, the user data for carrying the data storage request are stored to the target to store and be saved
The storage location of target user's mark is corresponded in point.
By implementing the embodiment of the present invention, terminal receives data storage request, the target that will be carried in data storage request
User identifier carries out operation according to preset mapping algorithm, and inquires target user according to operation result and identify corresponding target turn
Node is deposited, and inquires the corresponding target storage node of target unloading node in memory map assignments, and then by data storage request
The user data of middle carrying stores the storage location that target user's mark is corresponded into target storage node.Therefore terminal will be big
It, can be to avoid user identifier in mapping table when amount user data stores multiple memory nodes according to Distributed Storage mode
It is excessive with the corresponding relationship of memory node, it improves terminal and inquires target storage node corresponding to target user in the mapping table
Efficiency, to improve the storage efficiency of user data.
Detailed description of the invention
To describe the technical solutions in the embodiments of the present invention more clearly, make required in being described below to embodiment
Attached drawing is briefly described, it should be apparent that, drawings in the following description are some embodiments of the invention, for ability
For the those of ordinary skill of domain, without creative efforts, it can also be obtained according to these attached drawings other attached
Figure.
Fig. 1 is a kind of flow diagram of date storage method provided in an embodiment of the present invention；
Fig. 2 is the flow diagram of another date storage method provided in an embodiment of the present invention；
Fig. 3 is a kind of structural schematic diagram of terminal provided in an embodiment of the present invention；
Fig. 4 is the structural schematic diagram of another terminal provided in an embodiment of the present invention；
Fig. 5 is a kind of structural schematic diagram of distributed data base system provided in an embodiment of the present invention；
Fig. 6 is the structural schematic diagram of another distributed data base system provided in an embodiment of the present invention；
Fig. 7 is the structural schematic diagram of another terminal provided in an embodiment of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are some of the embodiments of the present invention, instead of all the embodiments.Based on this hair
Embodiment in bright, every other implementation obtained by those of ordinary skill in the art without making creative efforts
Example, shall fall within the protection scope of the present invention.
Referring to Figure 1, Fig. 1 is a kind of flow diagram of date storage method provided in an embodiment of the present invention.Such as Fig. 1 institute
Show, which can include but is not limited to following steps.
S101, data storage request is received, data storage request carries target user's mark and user data.
In the embodiment of the present invention, terminal receives the data storage request of user's input, which carries target
User identifier and user data, terminal extract the target user's mark carried in data storage request and user data, specifically,
Target user mark can be QQ number code, wechat number etc., and target user mark can also be each for QQ number code, wechat number etc.
Binary value after kind number translated.Specifically, user can by the database APP that is installed in terminal (Application,
Application program) in option trigger the data storage request.
S103, target user's mark is subjected to operation according to preset mapping algorithm, and target is inquired according to operation result
The corresponding target unloading node of user identifier, wherein target unloading node corresponds to multiple user identifiers.
In the embodiment of the present invention, after terminal extracts the target user's mark carried in data storage request, target is used
Family mark carries out operation according to preset mapping algorithm, wherein and the preset mapping algorithm may include but be not limited to hash algorithm,
Such as: MD5 algorithm (Message-Digest Algorithm 5, Message-Digest Algorithm 5), except leaving and taking remaining algorithm, square taking in
Algorithm etc..The binary value that target user identifies corresponding random length is mapped as shorter fixation using hash algorithm by terminal
The binary value of length obtains cryptographic Hash, and inquires target user according to operation result (i.e. cryptographic Hash) and identify corresponding target
Unloading node, wherein if distributed data base system corresponding to terminal includes multiple unloading nodes, each unloading node pair
One or more user identifiers are answered, and at least one unloading node corresponds to multiple user identifiers in multiple unloading nodes, and more
The number of a corresponding user identifier of unloading node may be the same or different.For example, the first unloading node corresponding one
A user identifier, corresponding two user identifiers of the second unloading node, corresponding three user identifiers of third unloading node；Alternatively, the
One unloading node, the second unloading node and third unloading node respectively correspond to two user identifiers, etc..It should be noted that
If the mapping algorithm that terminal uses is MD5 algorithm, the number of multiple corresponding user identifiers of unloading node is identical.Therefore
After user identifier is carried out Hash operation, multiple user identifiers can be respectively mapped on different unloading nodes, it can also be with
By on different user identity map to the same unloading node, therefore, a unloading node can correspond to multiple user identifiers, unloading
The quantity of node is less than the quantity of user identifier, big so as to avoid what is generated when user identifier is mapped directly to memory node
Mapping table reduces mapping item number.
For example, if being stored with the corresponding number of users of 12 users in distributed data base system corresponding to terminal
According to the user identifier of 12 users is respectively 1,3,5,6,8,9,12,14,16,17,19 and 20, is preset used by terminal
Hash algorithm be except leaving and taking remaining method, and the parameter of operation is %11, then carries out the user identifier of above-mentioned 12 users respectively
Hash operation, 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, therefore carry out what Hash operation obtained later
12 cryptographic Hash are respectively 1,3,5,6,8,9,1,3,5,6,8 and 9, then know that cryptographic Hash is 1 user identifier 1 and user identifier
12 corresponding target unloading nodes are the unloading node L1 that cryptographic Hash 1 indicates, the user identifier 3 and user identifier that cryptographic Hash is 3
14 corresponding target unloading nodes are the unloading node L3 that cryptographic Hash 3 indicates, the user identifier 5 and user identifier that cryptographic Hash is 5
16 corresponding target unloading nodes are the unloading node L5 that cryptographic Hash 5 indicates, the user identifier 6 and user identifier that cryptographic Hash is 6
17 corresponding target unloading nodes are the unloading node L6 that cryptographic Hash 6 indicates, the user identifier 8 and user identifier that cryptographic Hash is 8
19 corresponding target unloading nodes are the unloading node L8 that cryptographic Hash 8 indicates, the user identifier 9 and user identifier that cryptographic Hash is 9
20 corresponding target unloading nodes are the unloading node L9 that cryptographic Hash 9 indicates.
S105, the corresponding target storage node of target unloading node is inquired in memory map assignments, remember in memory map assignments
Record has one-to-one relationship or many-one pair between the memory node of unloading node user data corresponding with unloading node is stored
It should be related to.
In the embodiment of the present invention, terminal reads memory map assignments, and it is corresponding that target unloading node is inquired in memory map assignments
Target storage node, record has unloading node identification user data corresponding with the storage unloading node in the memory map assignments
One-to-one relationship or many-one corresponding relationship between the mark of memory node, wherein each memory node it is corresponding one or
Multiple unloading nodes.In order to improve the efficiency that terminal reads memory map assignments, memory map assignments can be buffered in distributed number
In memory according to library system, terminal directly reads memory map assignments from the memory of distributed data base system, no longer by dividing
The disk of cloth Database Systems reads memory map assignments, substantially increases the efficiency that terminal reads memory map assignments.
Specifically, memory map assignments can be used such as, but not limited to such as the following table 1 structure:
Table 1
| Unloading node identification | Memory node mark |
| L1 | 502 |
| L3 | 502 |
| L5 | 504 |
| L6 | 504 |
| L8 | 506 |
| L9 | 506 |
As shown in Table 1, unloading node identification is that the unloading node of L1 and L3 corresponds to memory node 502, unloading node identification
Memory node 504 is corresponded to for the unloading node of L5 and L6, unloading node identification is that the unloading node of L8 and L9 corresponds to memory node
506, it follows that the user that user identifier is 1,3,12 and 14 corresponds to memory node 502, user identifier 5,6,16 and 17
User corresponds to memory node 504, and the user of user identifier 8,9,19 and 20 corresponds to memory node 506.Wherein, memory node
Quantity is less than the quantity of unloading node, therefore the quantity of memory node is much less than the quantity of user identifier, so as to avoid inciting somebody to action
User identifier maps directly to the excessive mapping table of the mapping item number generated when memory node, reduces the mapping item in mapping table
Number.
S107, by data storage request carry user data store correspond into target storage node target user identify
Storage location.
In the embodiment of the present invention, each of memory node 502-506 memory node is all stored with multiple user data,
Each user data by the user data Data Identification unique identification, the Data Identification can include but is not limited to user mark
Knowledge and data item identifier.For example, being stored with the age " 18 years old " of user 1 in memory node 502, then " 18 years old " is memory node
The user data stored in 502, the user data is by user identifier " 1 " and data item identifier " age " unique identification.
Specifically, each memory node all safeguards a data mapping tables, and record has each user in data mapping tables
The corresponding relationship of the Data Identification of data and the user data between the storage location in memory node, wherein Data Identification can
The corresponding user data of the unique identification Data Identification.During specific implementation, when memory node 502 is deposited using tables of data
When storing up user data, structure such as, but not limited to as shown in table 2 below is can be used in data mapping tables:
Table 2
| Data Identification | Storage 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 of " user 1, age " is stored in the number stored in memory node 502
According in table 1, Data Identification is that the user data of " user 3, height " is stored in the tables of data 2 stored in memory node 502.
Terminal inquires target user by above-mentioned mapping algorithm and memory map assignments and identifies corresponding target storage node
Afterwards, the user data carried in data storage request is stored to the storage position that target user's mark is corresponded into target storage node
Set, for example, if terminal inquiry to target storage node be memory node 502, and the tables of data 1 specially in memory node 502,
And the user data carried in data storage request is the height " 180cm " of user 1, then terminal deposits user data " 180cm "
It stores up in the tables of data 1 in memory node 502.
It should be noted that the embodiment of the present invention description be data storage when application scenarios, user by terminal from
When reading user data in memory node, terminal executes operation according to the corresponding memory node of user identifier inquiry user identifier
Ibid, details are not described herein again.
As it can be seen that in the method depicted in fig. 1, terminal receives data storage request, by what is carried in data storage request
Target user's mark carries out operation according to preset mapping algorithm, and inquires target user according to operation result and identify corresponding mesh
Unloading node is marked, and inquires the corresponding target storage node of target unloading node in memory map assignments, and then data are stored
The user data carried in request stores the storage location that target user's mark is corresponded into target storage node.Therefore in terminal
It, can be to avoid user in mapping table when a large number of users data are stored multiple memory nodes according to Distributed Storage mode
Mark is excessive with the corresponding relationship of memory node, improves terminal and inquires the storage section of target corresponding to target user in the mapping table
The efficiency of point, to improve the storage efficiency of user data.
Fig. 2 is referred to, Fig. 2 is the flow diagram of another date storage method provided in an embodiment of the present invention.Such as Fig. 2
Shown, which can include but is not limited to following steps.
S201, data storage request is received, data storage request carries target user's mark and user data.
S203, target user's mark is subjected to operation according to preset mapping algorithm, and target is inquired according to operation result
The corresponding target unloading node of user identifier, wherein target unloading node corresponds to multiple user identifiers.
S205, the corresponding target storage node of target unloading node is inquired in memory map assignments, remember in memory map assignments
Record has one-to-one relationship or many-one pair between the memory node of unloading node user data corresponding with unloading node is stored
It should be related to.
S207, by data storage request carry user data store correspond into target storage node target user identify
Storage location.
S201-S207 in the embodiment of the present invention can be found in the S101-S107 of embodiment illustrated in fig. 1, and details are not described herein again.
S209, judged according to the user data stored in target storage node target storage node whether overload, if so,
Execute step S211；If it is not, terminating this process.
In the embodiment of the present invention, terminal judges that target storage node is according to the user data stored in target storage node
No overload thens follow the steps S211 if judging target storage node overload；If it is not, terminating this process.
As an alternative embodiment, judging target storage section according to the user data stored in target storage node
Point whether overload, comprising:
Persistently user data growth rate of the statistics target storage node in every a period of time increases in user data
Target storage node overload is determined when speed is more than default growth rate threshold value.
Specifically, terminal persistently counts user data growth rate of the target storage node in every a period of time,
Target storage node overload is determined when user data growth rate is more than default growth rate threshold value.Wherein, the time cycle
It can be configured according to the specific application environment of terminal.It can be appreciated that cycle duration is shorter, counted user data growth rate
It is more accurate.Default growth rate threshold value can also be configured according to the specific application environment of terminal.
During specific implementation, such as, but not limited to following equation can be used to calculate the number of users of target storage node
According to growth rate: the user data growth rate=(use of the data volume previous cycle statistics of the user data of current period statistics
The data volume of user data)/cycle duration.Above-mentioned cycle duration can be configured according to the specific application environment of terminal.Number of users
It is positive value according to growth rate, shows that user data is increasing in target storage node, and value shows in target storage node more greatly
The growth rate of user data is faster, is negative and shows that user data is being reduced in target storage node.
As another optional embodiment, judge that target stores according to the user data stored in target storage node
Node whether overload, comprising:
The quantity of the user data stored in statistics target storage node, the quantity of user data in target storage node
Target storage node overload is determined when more than preset capacity threshold value.
Specifically, the quantity of the user data stored in terminal statistics target storage node, is used in target storage node
Target storage node overload is determined when the quantity of user data is more than preset capacity threshold value.Wherein, preset capacity threshold value can basis
The specific memory capacity of target storage node is configured, for example, if the memory capacity of target storage node is 200GB, it will
The corresponding preset capacity threshold value of target storage node is set as 180GB etc..
S211, the selected section unloading section from multiple unloading nodes corresponding user data that target storage node is stored
The corresponding user data of point selects at least one storage as user data to be migrated from the memory node of not yet overload
Node selects at least one memory node as storage to be migrated as memory node to be migrated, or from newly-increased memory node
Node, wherein the remaining 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 target storage node overload, terminal is from target storage node institute
The corresponding user data of selected section unloading node is as use to be migrated in the corresponding user data of multiple unloading nodes of storage
User data, and select at least one memory node as memory node to be migrated from the memory node of not yet overload, or from
Select at least one memory node as memory node to be migrated in newly-increased memory node, wherein memory node to be migrated
Remaining total memory capacity is greater than the data volume of user data to be migrated.Wherein, the quantity of memory node to be migrated can be one,
Or it is multiple, the embodiment of the present invention is illustrated so that memory node to be migrated is one as an example.
Specifically, needing to use the part in target storage node if terminal judges target storage node overload
User data carries out Data Migration, that is, needs to carry out dilatation to distributed data base system, or bear distributed data base system
It is loaded into row equilibrium, so that the user data no longer overload in target storage node, to influence system performance.Terminal is from not yet
At least one memory node is selected in the memory node of overload, or at least one is selected from the memory node that system newly increases
It is a, or select from the memory node of not yet overload and the memory node newly increased the storage of at least one not yet overload
Node and at least one memory node newly increased are as memory node to be migrated, if memory node to be migrated is one,
The remaining total memory capacity of the memory node to be migrated need to be greater than the data volume of user data to be migrated, if memory node to be migrated
To be multiple, then the remaining total memory capacity of multiple memory nodes to be migrated need to be greater than the data volume of user data to be migrated.
S213, by migration of subscriber data to be migrated into memory node to be migrated, and update storage mapping table.
In the embodiment of the present invention, terminal into memory node to be migrated, and updates storage migration of subscriber data to be migrated
Mapping table.
For example, if target storage node is memory node 502, the unloading node L1 that terminal is stored from memory node 502
Selected in user data corresponding with L3 the corresponding user 1 of unloading node L1 and the corresponding all customer data of user 12 as to
The data volume of migrated users data, user 1 and the corresponding all customer data of user 12 is 50GB (Gigabyte, gigabyte),
Terminal selects the memory node for being identified as 512 as memory node to be migrated from the memory node newly increased, should be wait move
The memory capacity for moving memory node is 200GB, can accommodate user data to be migrated.Therefore, terminal moves user data to be migrated
It moves on memory node 512 to be migrated, that is, the batch migration of the user data of multiple users is realized, no longer for each use
User data is individually migrated, and the transport efficiency of user data is improved.Terminal is by migration of subscriber data to be migrated to be migrated
After memory node, mapping table is updated storage, unloading node L1 in memory map assignments is corresponded into memory node mark and is revised as wait move
The mark 512 for moving memory node need to be from storage if subsequent need to access user 1 and the corresponding user data of user 12
User 1 and the corresponding user data of user 12 are accessed in node 512.
As it can be seen that in the method depicted in fig. 2, when terminal judges target storage node overload, being stored from target
In the corresponding user data of multiple unloading nodes stored in node the corresponding user data of selected section unloading node be used as to
Migrated users data, and select at least one memory node to save as storage to be migrated from the memory node of not yet overload
Point, or select at least one memory node as memory node to be migrated from newly-increased memory node, and then by use to be migrated
User data is migrated into memory node to be migrated, therefore can be carried out batch for the corresponding user data of multiple user identifiers and be moved
It moves, is gradually migrated without the user data for individual consumer, reduce number and the time of migration of subscriber data, improve
The transport efficiency of user data.
It is above-mentioned to illustrate the method for the embodiment of the present invention, following for convenient for better implementing the embodiment of the present invention
Above scheme is correspondingly also provided below for cooperating the associated terminal for implementing above scheme.
Fig. 3 is referred to, Fig. 3 is a kind of structural schematic diagram of terminal provided in an embodiment of the present invention.As shown in figure 3, the end
End 30 includes: receiving unit 301, the first query unit 303, the second query unit 305 and storage unit 307, wherein
Receiving unit 301, for receiving data storage request, data storage request carry target user's mark and number of users
According to；
First query unit 303, for target user's mark to be carried out operation according to preset mapping algorithm, and according to fortune
It calculates result queries target user and identifies corresponding target unloading node, wherein target unloading node corresponds to multiple user identifiers；
Second query unit 305, for inquiring the corresponding target storage node of target unloading node in memory map assignments,
Record has the one-to-one correspondence between the memory node of unloading node user data corresponding with unloading node is stored in memory map assignments
Relationship or many-one corresponding relationship；
Storage unit 307, the user data for carrying data storage request store into target storage node corresponding
The storage location of target user's mark.
It will be appreciated that the function of each functional unit of the terminal 30 of the present embodiment can be found in the phase of embodiment illustrated in fig. 1
Description is closed, details are not described herein again.
It is the structural schematic diagram of another terminal provided in an embodiment of the present invention please also refer to Fig. 4, Fig. 4.Wherein, Fig. 4
Shown in terminal 30 be that terminal 30 as shown in Figure 3 optimizes.Compared with Fig. 3, terminal 30 described in Fig. 4 includes
Outside receiving unit 301, the first query unit 303, the second query unit 305 and storage unit 307, further include judging unit 309,
Selecting unit 311 and migration units 313, wherein
Judging unit 309, for whether judging target storage node according to the user data stored in target storage node
Overload；
As an alternative embodiment, judging unit 309 is specifically used for:
Persistently user data growth rate of the statistics target storage node in every a period of time increases in user data
Target storage node overload is determined when speed is more than default growth rate threshold value；Or,
The quantity of the user data stored in statistics target storage node, the quantity of user data in target storage node
Target storage node overload is determined when more than preset capacity threshold value.
Selecting unit 311 is stored from target and is saved if judging target storage node overload for judging unit 309
The corresponding user data of selected section unloading node is used as wait move in the corresponding user data of multiple unloading nodes that point is stored
User data is diverted from one use to another, and selects from the memory node of not yet overload at least one memory node as memory node to be migrated,
Or select at least one memory node as memory node to be migrated from newly-increased memory node, wherein storage section to be migrated
The remaining total memory capacity of point is greater than the data volume of user data to be migrated；
Migration units 313 are used for by migration of subscriber data to be migrated into memory node to be migrated, and update storage mapping
Table.
It will be appreciated that the correlation of the function embodiment shown in Figure 2 of each functional unit of the terminal 30 of the present embodiment
Description, details are not described herein again.
Fig. 5 is referred to, Fig. 5 is a kind of structural schematic diagram of distributed data base system provided in an embodiment of the present invention.Such as
Shown in Fig. 5, distributed data base system 500 includes multiple memory node 502-506 and service server 508.Wherein, storage section
It can be connected by bus or other way between point 502-506 and service server 508, wherein to pass through bus in Fig. 5
For 510 connections.Each of memory node 502-506 memory node is all stored with multiple user data, each user
For data by the Data Identification unique identification of the user data, which can include but is not limited to user identifier and data item
Mark.For example, being stored with the age " 18 years old " of user 1 in memory node 502, then " 18 years old " is to store in memory node 502
User data, the user data is by user identifier " 1 " and data item identifier " age " unique identification.Service server 508 can
The business such as registration, data upload, data downloading for realizing user, what service server 508 was also used to be sent according to user
User is needed the user data stored to store into memory node 502-506 by data storage request, or sent according to user
Data access request obtains the user data of user's needs, service server 508 in the present embodiment from memory node 502-506
It can be specially the terminal 30 in above-described embodiment.
Specifically, each memory node all safeguards a data mapping tables, and record has each user in data mapping tables
The corresponding relationship of the Data Identification of data and the user data between the storage location in memory node, wherein Data Identification can
The corresponding user data of the unique identification Data Identification.During specific implementation, when memory node 502 is deposited using tables of data
When storing up user data, such as, but not limited to structure shown in table 2 is can be used in data mapping tables.
It should be noted that improve the effect of the accesses user data from memory node 502-506 of service server 508
Rate can be used memory database to realize at least one of above-mentioned memory node 502-506, i.e., user data is placed on memory
In, to improve the service feature of service server 508.
It should be noted that it should be apparent to a person skilled in the art that the quantity of memory node can basis during specific implementation
Actual needs is configured, and is not limited to quantity shown in Fig. 5.
Service server 508 stores request for receiving data, which carries target user's mark and use
User data, service server 508 extracts the target user's mark carried in data storage request and user data, specifically, should
Target user's mark can be QQ number code, wechat number etc., and target user mark can also be various for QQ number code, wechat number etc.
Binary value after number translated.Target user is identified and carries out operation according to preset mapping algorithm by service server 508,
In, which may include but be not limited to hash algorithm, such as: MD5 algorithm, except leaving and taking remaining algorithm, square taking in
Algorithm etc..The binary value that target user identifies corresponding random length is mapped as by service server 508 using hash algorithm
The binary value of shorter regular length obtains cryptographic Hash, and inquires target user's mark according to operation result (i.e. cryptographic Hash)
Corresponding target unloading node, wherein if distributed data base system corresponding to terminal includes multiple unloading nodes, each
The corresponding one or more user identifiers of unloading node, and at least one unloading node corresponds to multiple users in multiple unloading nodes
Mark, and the number of multiple corresponding user identifiers of unloading node may be the same or different.For example, the first unloading
Node corresponds to a user identifier, corresponding two user identifiers of the second unloading node, the corresponding three users mark of third unloading node
Know；Alternatively, the first unloading node, the second unloading node and third unloading node respectively correspond to two user identifiers, etc..It needs
Illustrate, if the mapping algorithm that terminal uses for MD5 algorithm, the number of multiple corresponding user identifiers of unloading node
It is identical.
Service server 508 is also used to read memory map assignments, and it is corresponding that target unloading node is inquired in memory map assignments
Target storage node, record has unloading node identification user data corresponding with the storage unloading node in the memory map assignments
One-to-one relationship or many-one corresponding relationship between the mark of memory node, wherein each memory node it is corresponding one or
Multiple unloading nodes.In order to improve the efficiency that service server 508 reads memory map assignments, memory map assignments can be buffered in
In the memory of distributed data base system 500, service server 508 is directly read from the memory of distributed data base system 500
Memory map assignments are taken, memory map assignments are no longer read by the disk of distributed data base system 500, substantially increase business clothes
The efficiency for the reading memory map assignments of device 508 of being engaged in.Specifically, such as, but not limited to 1 structure of table can be used in memory map assignments.
It is right that service server 508 is also used to store the user data that data storage request carries into target storage node
The storage location for answering target user to identify.Specifically, service server 508 is inquired by above-mentioned mapping algorithm and memory map assignments
After identifying corresponding target storage node to target user, the user data carried in data storage request is stored to target and is deposited
The storage location of target user's mark is corresponded in storage node, for example, if it is to deposit that service server 508, which inquires target storage node,
Node 502, and the tables of data 1 specially in memory node 502 are stored up, and the user data carried in data storage request is user
1 height " 180cm ", then service server 508 stores user data " 180cm " to the tables of data 1 in memory node 502
In.
It should be noted that application scenarios when description of the embodiment of the present invention is data storage, user are taken by business
When business device 508 reads user data from memory node, service server 508 is corresponding according to user identifier inquiry user identifier
The execution operation of memory node is same as above, and details are not described herein again.
As it can be seen that service server receives data storage request in the distributed data base system described in Fig. 5, will count
Operation is carried out according to preset mapping algorithm according to the target user's mark carried in storage request, and mesh is inquired according to operation result
The corresponding target unloading node of user identifier is marked, and inquires the corresponding target storage section of target unloading node in memory map assignments
Point, and then the user data carried in data storage request is stored and corresponds to depositing for target user's mark into target storage node
Storage space is set.Therefore a large number of users data are stored into multiple memory nodes according to Distributed Storage mode in service server
When, it can be excessive to avoid the corresponding relationship of user identifier in mapping table and memory node, improve service server in the mapping table
The efficiency for inquiring target storage node corresponding to target user, to improve the storage efficiency of user data.
Fig. 6 is referred to, Fig. 6 is the structural schematic diagram of another distributed data base system provided in an embodiment of the present invention.
As shown in fig. 6, distributed data base system 500 includes multiple memory node 502-506, service server 508 and to be migrated deposits
Store up node 512, wherein can be by total between memory node 502-506 and memory node to be migrated 512 and service server 508
Line or other way connection, wherein in Fig. 5 for being connected by bus 510.Memory node 502-506 and business service
The structure and function of device 508 can be found in that memory node 502-506 in embodiment illustrated in fig. 5 is related to service server 508 to be retouched
It states, details are not described herein again.Wherein, service server 508 is also used in memory node 502-506 overload, by memory node
Portion of user data in 502-506 moves in memory node 512 to be migrated, and memory node 512 to be migrated is used for from depositing
The user data migrated out in storage node 502-506 is stored.
Service server 508 is also used to judge that target storage node is according to the user data stored in target storage node
No overload, if judging target storage node overload, service server 508 is stored multiple from target storage node
The corresponding user data of selected section unloading node is as user data to be migrated in the corresponding user data of unloading node, and from
Not yet at least one memory node is selected to deposit in the memory node of overload as memory node 512 to be migrated, or from newly-increased
Select at least one memory node as memory node 512 to be migrated in storage node, wherein memory node 512 to be migrated remains
Remaining total memory capacity is greater than the data volume of user data to be migrated；Service server 508 by migration of subscriber data to be migrated to
It migrates in memory node 512, and updates storage mapping table.Wherein, the quantity of memory node 512 to be migrated can be one,
Can be to be multiple, the embodiment of the present invention is illustrated so that memory node 512 to be migrated is one as an example.
Specifically, needing will be in target storage node if service server 508 judges target storage node overload
Portion of user data carry out Data Migration, that is, need to carry out dilatation to distributed data base system 500, or to distributed data
The load of library system 500 carries out equilibrium, so that the user data no longer overload in target storage node, to influence systematicness
Energy.Service server 508 selects at least one memory node from the memory node of not yet overload, or newly increased from system
At least one is selected in memory node, or is selected at least from the memory node of not yet overload and the memory node newly increased
One not yet memory node of overload and at least one memory node newly increased as memory node 512 to be migrated, if
Memory node 512 to be migrated is one, then the remaining total memory capacity of the memory node 512 to be migrated need to be greater than user to be migrated
The data volume of data, if memory node to be migrated 512 is multiple, the total storage appearance of the residue of multiple memory nodes 512 to be migrated
Amount need to be greater than the data volume of user data to be migrated, for example, if target storage node is memory node 502, service server 508
The corresponding user 1 of unloading node L1 is selected from the corresponding user data of unloading node L1 and L3 stored in memory node 502
With the corresponding all customer data of user 12 as user data to be migrated, user 1 and the corresponding all customer data of user 12
Data volume be 50GB (Gigabyte, gigabyte), service server 508 selected from the memory node newly increased one as
The memory capacity of memory node 512 to be migrated, the memory node 512 to be migrated is 200GB, can accommodate user data to be migrated.
Therefore, service server 508 realizes multiple users by migration of subscriber data to be migrated to memory node 512 to be migrated
User data batch migration, no longer individually migrated for each user data, improve the migration of user data
Efficiency.Service server 508 updates storage mapping table for after migration of subscriber data to be migrated to memory node 512 to be migrated, will
Unloading node L1 corresponds to memory node mark and is revised as 512 in memory map assignments, if subsequent need to be corresponding to user 1 and user 12
User data is accessed, then user 1 and the corresponding user data of user 12 need to be accessed from memory node 512.
As an alternative embodiment, service server 508 persistently counts target storage node in each week time
User data growth rate in phase determines target storage section when user data growth rate is more than default growth rate threshold value
Point overload.Wherein, which can be configured according to the specific application environment of distributed data base system 500.It is not difficult
Understand, cycle duration is shorter, and counted user data growth rate is more accurate.Default growth rate threshold value can also be according to distribution
The specific application environment of Database Systems 500 is configured.
During specific implementation, such as, but not limited to following equation can be used to calculate the number of users of target storage node
According to growth rate: the user data growth rate=(use of the data volume previous cycle statistics of the user data of current period statistics
The data volume of user data)/cycle duration.Above-mentioned cycle duration can be according to the specific application environment of distributed data base system 500
It is configured.User data growth rate is positive value, shows that user data is increasing in target storage node, and value shows more greatly
The growth rate of user data is faster in target storage node, is negative and shows that user data is being reduced in target storage node.
As an alternative embodiment, service server 508 counts the user data stored in target storage node
Quantity, in target storage node the quantity of user data be more than preset capacity threshold value when determine target storage node it is excessively negative
Lotus.Wherein, preset capacity threshold value can be configured according to the specific memory capacity of target storage node, for example, if target stores
The memory capacity of node is 200GB, then sets 180GB etc. for the corresponding preset capacity threshold value of target storage node.
As it can be seen that in the distributed data base system described in Fig. 6, when service server judging goes out target storage node mistake
When load, selected section unloading node is corresponding from the multiple unloading nodes corresponding user data stored in target storage node
User data as user data to be migrated, and at least one memory node is selected from the memory node of not yet overload to make
For memory node to be migrated, or select from newly-increased memory node at least one memory node as memory node to be migrated,
And then by migration of subscriber data to be migrated into memory node to be migrated, therefore the corresponding user of multiple user identifiers can be directed to
Data carry out batch migration, are gradually migrated without the user data for individual consumer, reduce migration of subscriber data
Number and time improve the transport efficiency of user data.
Fig. 7 is referred to, is the structural schematic diagram of another terminal provided by the invention.Wherein, as shown in fig. 7, terminal 70
It may include: 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 components；Input unit
The touch panel of 703 concretely terminals, including touch screen and touch screen, the operation for detecting in terminal touch panel refer to
It enables；Output device 704 may include the display screen (Display) of terminal, for exporting, showing image or data；Memory
705 can be high-speed RAM display, be also possible to non-labile display (non-volatile memory), for example, at least
One disk display, memory 705 optionally can also be that at least one is located remotely from the display of aforementioned processor 701 dress
It sets.As shown in fig. 7, may include operating system, network communication mould in a kind of memory 705 as Computer display medium
Block, Subscriber Interface Module SIM and data recording program.
In terminal 70 shown in Fig. 7, the data that processor 701 can be used for storing in run memory 705 store journey
Sequence, and execute following operation:
Data storage request is received by input unit 703, data storage request carries target user's mark and number of users
According to；
Target user's mark is subjected to operation according to preset mapping algorithm, and target user's mark is inquired according to operation result
Know corresponding target unloading node, wherein target unloading node corresponds to multiple user identifiers；
The corresponding target storage node of target unloading node is inquired in memory map assignments, there is record in memory map assignments turns
Deposit the one-to-one relationship or many-one corresponding relationship between the memory node of node user data corresponding with unloading node is stored；
The user data that data storage request carries is stored and corresponds to depositing for target user's mark into target storage node
Storage space is set.
Further, the execution of processor 701 stores the user data that data storage request carries to target storage node
After the storage location of middle corresponding target user's mark, also execute:
According to the user data stored in target storage node judge target storage node whether overload；
If judging target storage node overload, the multiple unloading nodes stored from target storage node are corresponding
The corresponding user data of selected section unloading node is as user data to be migrated in user data, and depositing from not yet overload
It selects at least one memory node as memory node to be migrated in storage node, or selects at least one from newly-increased memory node
A memory node is as memory node to be migrated, wherein the remaining total memory capacity of memory node to be migrated is greater than use to be migrated
The data volume of user data；
By migration of subscriber data to be migrated into memory node to be migrated, and update storage mapping table.
Further, processor 701, which is executed, judges that target stores according to the user data stored in target storage node
Node whether overload, specifically:
Persistently user data growth rate of the statistics target storage node in every a period of time increases in user data
Target storage node overload is determined when speed is more than default growth rate threshold value；Or,
The quantity of the user data stored in statistics target storage node, the quantity of user data in target storage node
Target storage node overload is determined when more than preset capacity threshold value.
Further, mapping algorithm includes hash algorithm.
Further, memory map assignments are stored in the memory of distributed data base.
It will be appreciated that for details, reference can be made to the contents of Fig. 1 or Fig. 2 embodiment for the execution step of processor 701, herein no longer
It repeats.
In conclusion terminal receive data storage request, by the target user carried in data storage request mark according to
Preset mapping algorithm carries out operation, and according to the corresponding target unloading node of operation result inquiry target user's mark, and
The corresponding target storage node of target unloading node, and then the user that will be carried in data storage request are inquired in memory map assignments
Data store the storage location that target user's mark is corresponded into target storage node.Therefore a large number of users data are pressed in terminal
It, can be to avoid user identifier in mapping table and memory node when storing multiple memory nodes according to Distributed Storage mode
Corresponding relationship is excessive, improves terminal and inquires the efficiency of target storage node corresponding to target user in the mapping table, to mention
The storage efficiency of high user data.
Further, when terminal judges target storage node overload, what is stored from target storage node is multiple
The corresponding user data of selected section unloading node is as user data to be migrated in the corresponding user data of unloading node, and from
Not yet select at least one memory node as memory node to be migrated in the memory node of overload, or from newly-increased storage section
It selects at least one memory node as memory node to be migrated in point, and then migration of subscriber data to be migrated is deposited to be migrated
It stores up in node, therefore batch migration can be carried out for the corresponding user data of multiple user identifiers, without being directed to individual consumer
User data gradually migrated, reduce number and the time of migration of subscriber data, improve user data migration effect
Rate.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the program can be stored in a computer-readable storage medium
In, the program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, the storage medium can be magnetic
Dish, CD, read-only memory (Read-Only Memory, ROM) or random access memory (Random Access
Memory, RAM) etc..
The steps in the embodiment of the present invention can be sequentially adjusted, merged and deleted according to actual needs.
Unit in the terminal of that embodiment of the invention can be combined, divided and deleted according to actual needs.
Above disclosed is only a preferred embodiment of the present invention, cannot limit the power of the present invention with this certainly
Sharp range, those skilled in the art can understand all or part of the processes for realizing the above embodiment, and weighs according to the present invention
Benefit requires made equivalent variations, still belongs to the scope covered by the invention.
Claims (10)
1. a kind of date storage method, which is characterized in that the described method includes:
Data storage request is received, the data storage request carries target user's mark and user data；
Target user mark is subjected to operation according to preset mapping algorithm, and the target is inquired according to operation result and is used
Family identifies corresponding target unloading node, wherein the target unloading node corresponds to multiple user identifiers；
The corresponding target storage node of the target unloading node is inquired in memory map assignments, is recorded in the memory map assignments
There are the one-to-one relationship or many-one between the memory node of unloading node user data corresponding with the unloading node is stored
Corresponding relationship；
The user data that the data storage request is carried, which is stored into the target storage node, corresponds to the target
The storage location of user identifier.
2. the method according to claim 1, wherein the user that the data storage request is carried
Data are stored into the target storage node after the storage location for corresponding to target user's mark, further includes:
According to the user data stored in the target storage node judge the target storage node whether overload；
If judging the target storage node overload, multiple unloading nodes pair for being stored from the target storage node
The corresponding user data of selected section unloading node is as user data to be migrated in the user data answered, and from not yet overload
Memory node in select at least one memory node as memory node to be migrated, or from newly-increased memory node selection to
A few memory node is as the memory node to be migrated, wherein the remaining total memory capacity of the memory node to be migrated
Greater than the data volume of the user data to be migrated；
By the migration of subscriber data to be migrated into the memory node to be migrated, and update the memory map assignments.
3. according to the method described in claim 2, it is characterized in that, described according to the user stored in the target storage node
Data judge the target storage node whether overload, comprising:
User data growth rate of the target storage node in every a period of time is persistently counted, in the user data
Growth rate determines the target storage node overload when being more than default growth rate threshold value；Or,
The quantity for counting the user data stored in the target storage node, the user data in the target storage node
Quantity determines the target storage node overload when being more than preset capacity threshold value.
4. method according to claim 1-3, which is characterized in that the mapping algorithm includes hash algorithm.
5. method according to claim 1-3, which is characterized in that the memory map assignments are stored in distributed number
According in the memory in library.
6. a kind of terminal, which is characterized in that the terminal includes:
Receiving unit, for receiving data storage request, the data storage request carry target user's mark and user data；
First query unit, for target user mark to be carried out operation according to preset mapping algorithm, and according to operation
Target user described in result queries identifies corresponding target unloading node, wherein the target unloading node corresponds to multiple users
Mark；
Second query unit, for inquiring the corresponding target storage node of the target unloading node, institute in memory map assignments
State one recorded between the memory node for having unloading node user data corresponding with the unloading node is stored in memory map assignments
One corresponding relationship or many-one corresponding relationship；
Storage unit, the user data for carrying the data storage request are stored into the target storage node
The storage location of corresponding target user's mark.
7. terminal according to claim 6, which is characterized in that the terminal further include:
Judging unit, for whether judging the target storage node according to the user data stored in the target storage node
Overload；
Selecting unit stores if judging the target storage node overload for the judging unit from the target
In the corresponding user data of multiple unloading nodes that node is stored the corresponding user data of selected section unloading node be used as to
Migrated users data, and select at least one memory node to save as storage to be migrated from the memory node of not yet overload
Point, or select at least one memory node as the memory node to be migrated from newly-increased memory node, wherein it is described to
The remaining total memory capacity for migrating memory node is greater than the data volume of the user data to be migrated；
Migration units, for depositing the migration of subscriber data to be migrated into the memory node to be migrated, and described in update
Store up mapping table.
8. terminal according to claim 7, which is characterized in that the judging unit is specifically used for:
User data growth rate of the target storage node in every a period of time is persistently counted, in the user data
Growth rate determines the target storage node overload when being more than default growth rate threshold value；Or,
The quantity for counting the user data stored in the target storage node, the user data in the target storage node
Quantity determines the target storage node overload when being more than preset capacity threshold value.
9. according to the described in any item terminals of claim 6-8, which is characterized in that the mapping algorithm includes hash algorithm.
10. according to the described in any item terminals of claim 6-8, which is characterized in that the memory map assignments are stored in distribution
In the memory of database.
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 CN105491149A (en) | 2016-04-13 |
| CN105491149B true 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) |
Families Citing this family (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107948234B (en) * | 2016-10-13 | 2021-02-12 | 北京国双科技有限公司 | Data processing method and device |
| CN107241387B (en) * | 2017-05-12 | 2018-11-06 | 腾讯科技（深圳）有限公司 | 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 |
| CN108494870B (en) * | 2018-04-03 | 2022-05-17 | 中国平安人寿保险股份有限公司 | CDN-based dynamic data loading method and device |
| 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 |
| CN111176549B (en) * | 2018-11-13 | 2021-05-18 | 杭州海康威视系统技术有限公司 | 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 |
| 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 |
| 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 |
| CN112966312B (en) | 2021-03-02 | 2024-05-17 | 中国银联股份有限公司 | Data storage method, device, equipment and storage medium |
| CN113037497B (en) * | 2021-03-15 | 2023-08-01 | 中国工商银行股份有限公司 | Block chain-based risk data sharing method and system |
| CN113590346B (en) * | 2021-06-30 | 2022-06-21 | 荣耀终端有限公司 | Method and electronic equipment for processing service request |
Citations (3)
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5303038B2 (en) * | 2009-09-18 | 2013-10-02 | 株式会社日立製作所 | Storage system that eliminates duplicate data |
-
2015
- 2015-12-26 CN CN201510998390.0A patent/CN105491149B/en active Active
Patent Citations (3)
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105491149A (en) | 2016-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105491149B (en) | A kind of date storage method and terminal | |
| CN109144791A (en) | Data conversion storage method, apparatus and data management server | |
| CN107943718B (en) | Method and device for cleaning cache file | |
| CN106170757B (en) | A kind of date storage method and device | |
| CN110347651A (en) | Method of data synchronization, device, equipment and storage medium based on cloud storage | |
| CN111324427A (en) | Task scheduling method and device based on DSP | |
| CN104657164B (en) | Software upgrading treating method and apparatus | |
| CN109377383A (en) | Product data synchronous method, device, computer equipment and storage medium | |
| CN103067479A (en) | Network disk synchronized method and system based on file coldness and hotness | |
| CN109842621A (en) | A kind of method and terminal reducing token storage quantity | |
| KR20170052441A (en) | Centralized distributed systems and methods for managing operations | |
| CN113177050A (en) | Data balancing method, device, query system and storage medium | |
| CN112306411A (en) | Data storage method and device, nonvolatile storage medium and processor | |
| CN108646987B (en) | File volume management method and device, storage medium and terminal | |
| CN110609967B (en) | List generation method and device and storage medium | |
| CN109684381A (en) | Data hot statistics method and device | |
| CN101833585A (en) | Database server operation control system, method and device | |
| CN114745275A (en) | Node updating method and device in cloud service environment and computer equipment | |
| CN108205559A (en) | A kind of data managing method and its equipment | |
| JP2015172862A (en) | Information processing device for controlling data life cycle, data life cycle control method, and program for the same | |
| CN109992468B (en) | Process performance analysis method, device and system and computer storage medium | |
| CN108536759B (en) | Sample playback data access method and device | |
| CN102611725A (en) | Method and device for storing nodes | |
| CN115576947A (en) | Data management method and device, combined library, electronic equipment and storage medium | |
| CN110019372A (en) | Data monitoring method, device, server and storage medium |
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 |
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. |
|
| TR01 | Transfer of patent right |