CN104408165B - Date storage method and device under high concurrent - Google Patents
Date storage method and device under high concurrent Download PDFInfo
- Publication number
- CN104408165B CN104408165B CN201410743790.2A CN201410743790A CN104408165B CN 104408165 B CN104408165 B CN 104408165B CN 201410743790 A CN201410743790 A CN 201410743790A CN 104408165 B CN104408165 B CN 104408165B
- Authority
- CN
- China
- Prior art keywords
- specific data
- data information
- stored
- cryptographic hash
- collection
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
Abstract
The present invention provides the data storage device under the date storage method under a kind of high concurrent and a kind of high concurrent, wherein, the date storage method under the high concurrent includes：Step 102, specific data information caused by user's access application is obtained；Step 104, the specific data information is stored into service node, the service node is any one in all service nodes included in multiple servers；Step 106, the specific data information collection stored in all service nodes is obtained every prefixed time interval by preset rules, and the specific data information collection is stored into database, wherein, the specific data information collection is a part for all specific data informations stored in all service nodes.By technical scheme, the single point blockage problem that can be effectively prevented under high concurrent, and can be efficiently by data persistence storage into database, and ensure the safety and reliability of data.
Description
Technical field
The present invention relates to Internet technical field, in particular to the date storage method under a kind of high concurrent and one
Data storage device under kind high concurrent.
Background technology
At present, in the application of internet, often occur that more hot short chain connects, just have number in a short time with ten thousand
The people of meter clicks on, redirects, and therefore, all applications are required for supporting that large user is concurrent, any one single-point problem can all influence
The performance of system；Moreover, for the enterprise to make the transition from traditional software bag enterprise to mobile Internet, traditional software is contracted for fixed output quotas product
User concurrent number substantially fix, the requirement to user concurrent number is not also high, and the number of users at mobile Internet product end is
It is ever-increasing, and the use of user is continual, is likely to substantial amounts of user's use, any one point occur at any time
There are problems that single-point, will all influence the performance of system and the experience of user.
With increase of the application to high performance demands, solve the problems, such as the designing scheme of single-point under high concurrent also by original
Database schema, turns to the pattern that database adds caching, moreover, common, efficient data operation is also required in memory
Complete, can meet the needs of mobile Internet is applied by this implementation pattern.In addition, after data update, in order to ensure
Security, the reliability of data, it is also necessary to which the partial data in caching is persisted in database.
In development circle in application, having estimated 1,000,000 circles, 100 general-purpose families, 1,000,000 models, each user adds
Enter at least 50 circles, at least 100 comments of each model, according to above demand, system needs to support 100,000 user concurrents, often
The time of a issued transaction is required in Millisecond, and this application also needs to support the user of millions to post.Moreover, more
When new circle finally checks the time, according to directly invoking the more new interface of database to finally checking that the time carries out persistence
Technical solution, as shown in Figure 1, since business demand is very high to the performance requirement of application, when carrying out performance pressure test, passes through
Database update finally checks that blocked state occurs always in the time.
Therefore, it is necessary to the date storage method under a kind of high concurrent, the single point blockage that can be effectively prevented under high concurrent
Problem, and can be efficiently by data persistence into database, and ensure the safety and reliability of data, improve at the same time
The things number of system processing per second, and then improve system performance.
The content of the invention
The technical problems to be solved by the invention are, there is provided the date storage method under a kind of high concurrent, by by number
Stored according to distribution onto the different service nodes of different servers, and by lasting data by the way of asynchronous reading data
Change into database, the single point blockage problem that can be effectively prevented under high concurrent, and can be efficiently by data persistence
Store in database, and ensure the safety and reliability of data, while improve the things number of system processing per second, Jin Erti
High system performance.
According to an aspect of the invention, there is provided the date storage method under a kind of high concurrent, including：Step 102, obtain
Take specific data information caused by the access application of family；Step 104, the specific data information is stored to service and saved
In point, the service node is any one in all service nodes included in multiple servers；Step 106, by default rule
Then obtain the specific data information collection stored in all service nodes every prefixed time interval, and by the specific data
Information collection is stored into database, wherein, the specific data information collection is all institutes for being stored in all service nodes
State a part for specific data information.
In the technical scheme, by by specific data information caused by different user access application (such as most
Reading time afterwards) the different service nodes of distribution storage to different server (for example have 4 servers, have on each server
8 nodes, naturally it is also possible to be other configurations) on cached, the single point blockage problem that can be effectively prevented under high concurrent；
On the other hand, the part by will be stored every prefixed time interval (such as 5 minutes) by preset rules on all service nodes
Specific data information (i.e. specific data information collection, such as, the specific data information being saved in some period on server)
Persistent storage, i.e., can by way of asynchronous reading data by specific data information storage into database into database
Efficiently to store data persistence into database, and ensure the safety and reliability of data, while it is every to improve system
The things number of second processing, and then improve system performance.
In the above-mentioned technical solutions, it is preferable that the step 104 specifically includes：Obtain the of the specific data information
One calculated value, and first calculated value is converted into the first cryptographic Hash according to pre-defined algorithm, and according to first Hash
Value stores the specific data information into the service node.
In the technical scheme, by pre-defined algorithm (such as uniformity hash algorithm) by the specific data information of acquisition
First calculated value (such as key assignments) of (such as last reading time) is converted to the first cryptographic Hash, then according to first Hash
Value is by corresponding specific data information storage to one of service node of multiple service nodes of multiple servers, you can
Specific data information caused by different user access application (such as last reading time) is distributed with effectively realizing
Store and cached on the different service nodes of different server, can be had while meeting that other threads read demand
Avoid to effect the single point blockage problem under high concurrent.
In the above-mentioned technical solutions, it is preferable that the preset rules specifically include：The specific data information is obtained to concentrate
Corresponding second calculated value of all specific data informations, changes all second calculated values according to the pre-defined algorithm
For corresponding second cryptographic Hash, wherein, second cryptographic Hash is identical with first cryptographic Hash, second calculated value and institute
It is identical to state the first calculated value.
In the technical scheme, by specific data information collection (such as the spy being saved in some period on server
Determine data message) storage into database before, pass through the of each specific data information for concentrating specific data information
Two calculated values are converted to corresponding second cryptographic Hash, and the second calculated value, the second cryptographic Hash are breathed out with the first calculated value, first respectively
Uncommon value is identical, can be from efficiently providing the storage of specific data information collection to favourable premise guarantee into database.
In the above-mentioned technical solutions, it is preferable that the preset rules specifically further include：Obtain in all service nodes
The corresponding data length list of all specific data informations of storage, and according to the data of all data length lists
Length, all data length lists are arranged in descending order；According to second cryptographic Hash from the number by the data list
The customizing messages collection is obtained in all specific data informations according to the arrangement of length descending, and by the customizing messages
Collection is stored into the database.
In the technical scheme, (for example will be saved in by specific data information collection in some period on server
Specific data information) storage into database before, pass through all specific data informations for being stored in Servers-all and carry out
Sequence, can effectively improve the comparison efficiency of specific data information, and then ensure the acquisition efficiency of specific data information collection.
In the above-mentioned technical solutions, it is preferable that the step 106 further includes：Stored when by the customizing messages collection to institute
After stating in database, the specific data information that the customizing messages is concentrated is deleted from the corresponding service node.
In the technical scheme, after by the storage of customizing messages collection into database, by it in corresponding service node
Delete, in order to provide enough memory spaces to cache new specific data information, and then be effectively prevented under high concurrent
Single point blockage problem.
In the above-mentioned technical solutions, it is preferable that the specific data information is read for the last of user's access application
Time, the prefixed time interval is 5 minutes, and the pre-defined algorithm is uniformity hash algorithm.
In the technical scheme, when specific data information includes but not limited to the last reading of user's access application
Between；Prefixed time interval includes but not limited to 5 minutes, can be configured according to user's visit capacity, server configuration etc.；It is predetermined
Algorithm can be uniformity hash algorithm, but not limited to this.
A kind of according to another aspect of the invention, it is proposed that data storage device under high concurrent, it is characterised in that bag
Include：Acquisition module, obtains specific data information caused by user's access application；First control module, control is by described in
Specific data information is stored into service node, and the service node is in all service nodes included in multiple servers
Any one；Second control module, controls and is stored by preset rules every in prefixed time interval acquisition all service nodes
Specific data information collection, and the specific data information collection is stored into database, wherein, the specific data information collection
A part for all specific data informations stored in all service nodes.
In the technical scheme, by by specific data information caused by different user access application (such as most
Reading time afterwards) the different service nodes of distribution storage to different server (for example have 4 servers, have on each server
8 nodes, naturally it is also possible to be other configurations) on cached, the single point blockage problem that can be effectively prevented under high concurrent；
On the other hand, the part by will be stored every prefixed time interval (such as 5 minutes) by preset rules on all service nodes
Specific data information (i.e. specific data information collection, such as, the specific data information being saved in some period on server)
Persistent storage, i.e., can by way of asynchronous reading data by specific data information storage into database into database
Efficiently to store data persistence into database, and ensure the safety and reliability of data, while it is every to improve system
The things number of second processing, and then improve system performance.
In the above-mentioned technical solutions, it is preferable that first control module specifically includes：First computing module, for obtaining
The first calculated value of the specific data information is taken, and first calculated value is converted into the first Hash according to pre-defined algorithm
Value, and first control module are additionally operable to：Control according to first cryptographic Hash by the specific data information store to
In the service node.
In the technical scheme, by pre-defined algorithm (such as uniformity hash algorithm) by the specific data information of acquisition
First calculated value (such as key assignments) of (such as last reading time) is converted to the first cryptographic Hash, then according to first Hash
Value is by corresponding specific data information storage to one of service node of multiple service nodes of multiple servers, you can
Specific data information caused by different user access application (such as last reading time) is distributed with effectively realizing
Store and cached on the different service nodes of different server, can be had while meeting that other threads read demand
Avoid to effect the single point blockage problem under high concurrent.
In the above-mentioned technical solutions, it is preferable that second control module specifically includes：Second computing module, for obtaining
The specific data information is taken to concentrate corresponding second calculated value of all specific data informations, and according to the pre-defined algorithm
All second calculated values are converted into corresponding second cryptographic Hash, wherein, second cryptographic Hash and first Hash
It is worth identical, second calculated value is identical with first calculated value.
In the technical scheme, by specific data information collection (such as the spy being saved in some period on server
Determine data message) storage into database before, pass through the of each specific data information for concentrating specific data information
Two calculated values are converted to corresponding second cryptographic Hash, and the second calculated value, the second cryptographic Hash are breathed out with the first calculated value, first respectively
Uncommon value is identical, can be from efficiently providing the storage of specific data information collection to favourable premise guarantee into database.
In the above-mentioned technical solutions, it is preferable that second control module specifically further includes：Sorting module, for obtaining
The corresponding data length list of all specific data informations stored in all service nodes, and according to all described
The data length of data length list, all data length lists are arranged in descending order；And second control module
It is additionally operable to：According to second cryptographic Hash from the described all described specific of the data length descending arrangement by the data list
The customizing messages collection is obtained in data message, and the customizing messages collection is stored into the database.
In the technical scheme, (for example will be saved in by specific data information collection in some period on server
Specific data information) storage into database before, pass through all specific data informations for being stored in Servers-all and carry out
Sequence, can effectively improve the comparison efficiency of specific data information, and then ensure the acquisition efficiency of specific data information collection.
In the above-mentioned technical solutions, it is preferable that second control module specifically further includes：Removing module, when by described in
After customizing messages collection is stored into the database, for by the specific data information that the customizing messages is concentrated from correspondence
The service node in delete.
In the technical scheme, after by the storage of customizing messages collection into database, by it in corresponding service node
Delete, in order to provide enough memory spaces to cache new specific data information, and then be effectively prevented under high concurrent
Single point blockage problem.
In the above-mentioned technical solutions, it is preferable that the specific data information is read for the last of user's access application
Time, the prefixed time interval is 5 minutes, and the pre-defined algorithm is uniformity hash algorithm.
In the technical scheme, when specific data information includes but not limited to the last reading of user's access application
Between；Prefixed time interval includes but not limited to 5 minutes, can be configured according to user's visit capacity, server configuration etc.；It is predetermined
Algorithm can be uniformity hash algorithm, but not limited to this.
Through the above technical solutions, the single point blockage problem that can be effectively prevented under high concurrent, and can be efficiently
By data persistence storage into database, and ensure the safety and reliability of data, while improve system processing per second
Things number, and then improve system performance.
Brief description of the drawings
Fig. 1 shows direct by data persistence storage to the flow diagram in database in correlation technique；
Fig. 2 shows the flow diagram of the date storage method under high concurrent according to an embodiment of the invention；
Fig. 3 shows the structure diagram of the data storage device under high concurrent according to an embodiment of the invention；
Fig. 4 shows the flow signal of the date storage method under high concurrent according to another embodiment of the invention
Figure.
Embodiment
It is to better understand the objects, features and advantages of the present invention, below in conjunction with the accompanying drawings and specific real
Mode is applied the present invention is further described in detail.
Many details are elaborated in the following description to facilitate a thorough understanding of the present invention, still, the present invention may be used also
To be implemented using other different from other modes described here, therefore, the present invention is not limited to following public specific real
Apply the limitation of example.
Fig. 2 shows the flow diagram of the date storage method under high concurrent according to an embodiment of the invention.
As shown in Fig. 2, the date storage method under high concurrent according to an embodiment of the invention, including：Step
102, obtain specific data information caused by user's access application；Step 104, by the specific data information store to
In service node, the service node is any one in all service nodes included in multiple servers；Step 106, press
Preset rules obtain the specific data information collection stored in all service nodes every prefixed time interval, and by the spy
Determine data message collection to store into database, wherein, stored in specific data information collection all service nodes
A part for all specific data informations.
In the technical scheme, by by specific data information caused by different user access application (such as most
Reading time afterwards) the different service nodes of distribution storage to different server (for example have 4 servers, have on each server
8 nodes, naturally it is also possible to be other configurations) on cached, the single point blockage problem that can be effectively prevented under high concurrent；
On the other hand, the part by will be stored every prefixed time interval (such as 5 minutes) by preset rules on all service nodes
Specific data information (i.e. specific data information collection, such as, the specific data information being saved in some period on server)
Persistent storage, i.e., can by way of asynchronous reading data by specific data information storage into database into database
Efficiently to store data persistence into database, and ensure the safety and reliability of data, while it is every to improve system
The things number of second processing, and then improve system performance.
In the above-mentioned technical solutions, it is preferable that the step 104 specifically includes：Obtain the of the specific data information
One calculated value, and first calculated value is converted into the first cryptographic Hash according to pre-defined algorithm, and according to first Hash
Value stores the specific data information into the service node.
In the technical scheme, by pre-defined algorithm (such as uniformity hash algorithm) by the specific data information of acquisition
First calculated value (such as key assignments) of (such as last reading time) is converted to the first cryptographic Hash, then according to first Hash
Value is by corresponding specific data information storage to one of service node of multiple service nodes of multiple servers, you can
Specific data information caused by different user access application (such as last reading time) is distributed with effectively realizing
Store and cached on the different service nodes of different server, can be had while meeting that other threads read demand
Avoid to effect the single point blockage problem under high concurrent.
In the above-mentioned technical solutions, it is preferable that the preset rules specifically include：The specific data information is obtained to concentrate
Corresponding second calculated value of all specific data informations, changes all second calculated values according to the pre-defined algorithm
For corresponding second cryptographic Hash, wherein, second cryptographic Hash is identical with first cryptographic Hash, second calculated value and institute
It is identical to state the first calculated value.
In the technical scheme, by specific data information collection (such as the spy being saved in some period on server
Determine data message) storage into database before, pass through the of each specific data information for concentrating specific data information
Two calculated values are converted to corresponding second cryptographic Hash, and the second calculated value, the second cryptographic Hash are breathed out with the first calculated value, first respectively
Uncommon value is identical, can be from efficiently providing the storage of specific data information collection to favourable premise guarantee into database.
In the above-mentioned technical solutions, it is preferable that the preset rules specifically further include：Obtain in all service nodes
The corresponding data length list of all specific data informations of storage, and according to the data of all data length lists
Length, all data length lists are arranged in descending order；According to second cryptographic Hash from the number by the data list
The customizing messages collection is obtained in all specific data informations according to the arrangement of length descending, and by the customizing messages
Collection is stored into the database.
In the technical scheme, (for example will be saved in by specific data information collection in some period on server
Specific data information) storage into database before, pass through all specific data informations for being stored in Servers-all and carry out
Sequence, can effectively improve the comparison efficiency of specific data information, and then ensure the acquisition efficiency of specific data information collection.
In the above-mentioned technical solutions, it is preferable that the step 106 further includes：Stored when by the customizing messages collection to institute
After stating in database, the specific data information that the customizing messages is concentrated is deleted from the corresponding service node.
In the technical scheme, after by the storage of customizing messages collection into database, by it in corresponding service node
Delete, in order to provide enough memory spaces to cache new specific data information, and then be effectively prevented under high concurrent
Single point blockage problem.
In the above-mentioned technical solutions, it is preferable that the specific data information is read for the last of user's access application
Time, the prefixed time interval is 5 minutes, and the pre-defined algorithm is uniformity hash algorithm.
In the technical scheme, when specific data information includes but not limited to the last reading of user's access application
Between；Prefixed time interval includes but not limited to 5 minutes, can be configured according to user's visit capacity, server configuration etc.；It is predetermined
Algorithm can be uniformity hash algorithm, but not limited to this.
Fig. 3 shows the structure diagram of the data storage device under high concurrent according to an embodiment of the invention.
As shown in figure 3, the data storage device under high concurrent according to an embodiment of the invention,
Including：Acquisition module 302, obtains specific data information caused by user's access application；First control mould
Block 304, controls and stores the specific data information into service node, is included in the multiple servers of service node
Any one in all service nodes；Second control module 306, control is as described in preset rules every prefixed time interval acquisition
The specific data information collection stored in all service nodes, and the specific data information collection is stored into database, wherein,
The specific data information collection is a part for all specific data informations stored in all service nodes.
In the technical scheme, by by specific data information caused by different user access application (such as most
Reading time afterwards) the different service nodes of distribution storage to different server (for example have 4 servers, have on each server
8 nodes, naturally it is also possible to be other configurations) on cached, the single point blockage problem that can be effectively prevented under high concurrent；
On the other hand, the part by will be stored every prefixed time interval (such as 5 minutes) by preset rules on all service nodes
Specific data information (i.e. specific data information collection, such as, the specific data information being saved in some period on server)
Persistent storage, i.e., can by way of asynchronous reading data by specific data information storage into database into database
Efficiently to store data persistence into database, and ensure the safety and reliability of data, while it is every to improve system
The things number of second processing, and then improve system performance.
In the above-mentioned technical solutions, it is preferable that first control module 304 specifically includes：First computing module 3042,
First calculated value is converted to first for obtaining the first calculated value of the specific data information, and according to pre-defined algorithm
Cryptographic Hash, and first control module are additionally operable to：Control deposits the specific data information according to first cryptographic Hash
Storage is into the service node.
In the technical scheme, by pre-defined algorithm (such as uniformity hash algorithm) by the specific data information of acquisition
First calculated value (such as key assignments) of (such as last reading time) is converted to the first cryptographic Hash, then according to first Hash
Value is by corresponding specific data information storage to one of service node of multiple service nodes of multiple servers, you can
Specific data information caused by different user access application (such as last reading time) is distributed with effectively realizing
Store and cached on the different service nodes of different server, can be had while meeting that other threads read demand
Avoid to effect the single point blockage problem under high concurrent.
In the above-mentioned technical solutions, it is preferable that second control module 306 specifically includes：Second computing module 3062,
Corresponding second calculated value of all specific data informations is concentrated for obtaining the specific data information, and according to described pre-
Determine algorithm and all second calculated values are converted into corresponding second cryptographic Hash, wherein, second cryptographic Hash and described the
One cryptographic Hash is identical, and second calculated value is identical with first calculated value.
In the technical scheme, by specific data information collection (such as the spy being saved in some period on server
Determine data message) storage into database before, pass through the of each specific data information for concentrating specific data information
Two calculated values are converted to corresponding second cryptographic Hash, and the second calculated value, the second cryptographic Hash are breathed out with the first calculated value, first respectively
Uncommon value is identical, can be from efficiently providing the storage of specific data information collection to favourable premise guarantee into database.
In the above-mentioned technical solutions, it is preferable that second control module 306 specifically further includes：Sorting module 3064, is used
In obtaining the corresponding data length list of stored in all service nodes all specific data informations, and according to institute
There is the data length of the data length list, all data length lists are arranged in descending order；And second control
Molding block 306 is additionally operable to：According to second cryptographic Hash from the institute of the data length descending arrangement by the data list
Have and the customizing messages collection is obtained in the specific data information, and the customizing messages collection is stored into the database.
In the technical scheme, (for example will be saved in by specific data information collection in some period on server
Specific data information) storage into database before, pass through all specific data informations for being stored in Servers-all and carry out
Sequence, can effectively improve the comparison efficiency of specific data information, and then ensure the acquisition efficiency of specific data information collection.
In the above-mentioned technical solutions, it is preferable that second control module 306 specifically further includes：Removing module 3066, when
After the customizing messages collection is stored into the database, for the specific data information for concentrating the customizing messages
Deleted from the corresponding service node.
In the technical scheme, after by the storage of customizing messages collection into database, by it in corresponding service node
Delete, in order to provide enough memory spaces to cache new specific data information, and then be effectively prevented under high concurrent
Single point blockage problem.
In the above-mentioned technical solutions, it is preferable that the specific data information is read for the last of user's access application
Time, the prefixed time interval is 5 minutes, and the pre-defined algorithm is uniformity hash algorithm.
In the technical scheme, when specific data information includes but not limited to the last reading of user's access application
Between；Prefixed time interval includes but not limited to 5 minutes, can be configured according to user's visit capacity, server configuration etc.；It is predetermined
Algorithm can be uniformity hash algorithm, but not limited to this.
Fig. 4 shows the flow signal of the date storage method under high concurrent according to another embodiment of the invention
Figure.
As shown in figure 4, the date storage method under high concurrent according to another embodiment of the invention, specifically includes：
Step 402, obtain user click on inquiry member's circle (application program) last reading time (certain number it is believed that
Breath)；
Step 404, the key assignments (the first calculated value) of last reading time is obtained；
Step 406, key assignments is switched to by uniformity cryptographic Hash (the first Hash according to uniformity hash algorithm (pre-defined algorithm)
Value)；
Step 408, last reading time is stored into a service node according to uniformity cryptographic Hash；
Step 410, every 5 minutes (prefixed time interval) obtained from all service nodes of Servers-all it is a collection of most
The key assignments (the second calculated value) of reading time afterwards, and key assignments is switched to by uniformity according to uniformity hash algorithm (pre-defined algorithm) and is breathed out
Uncommon value (the second cryptographic Hash)；
Step 412, the data length list of the last reading time stored in all service nodes of Servers-all；
Step 414, according to the data length of each data length list, will be deposited in all service nodes of Servers-all
All last reading times of storage sort in descending order；
Step 416, all uniformity cryptographic Hash of a collection of last reading time obtained as needed, from sorted institute
There is a collection of last reading time that needs are obtained in last reading time, and this batch of last reading time is stored to database
In；
Step 418, in the service node where this batch of last reading time, this batch of last reading time is deleted.
Therefore, technique according to the invention scheme, the single point blockage problem that can be effectively prevented under high concurrent, Yi Jike
Efficiently to store data persistence into database, and ensure the safety and reliability of data, while it is every to improve system
The things number of second processing, and then improve system performance.
In the present invention, term " first ", " second " are only used for the purpose described, and it is not intended that instruction or hint phase
To importance.For the ordinary skill in the art, above-mentioned term can be understood as the case may be in the present invention
Concrete meaning.
In the description of this specification, the description of term " one embodiment ", " specific embodiment " etc. means to combine the reality
The particular features, structures, materials, or characteristics for applying example or example description are contained at least one embodiment of the present invention or example.
In the present specification, schematic expression of the above terms is not necessarily referring to identical embodiment or example.Moreover, description
Particular features, structures, materials, or characteristics can combine in an appropriate manner in any one or more embodiments or example.
The foregoing is only a preferred embodiment of the present invention, is not intended to limit the invention, for the skill of this area
For art personnel, the invention may be variously modified and varied.Within the spirit and principles of the invention, that is made any repaiies
Change, equivalent substitution, improvement etc., should all be included in the protection scope of the present invention.
Claims (10)
- A kind of 1. date storage method under high concurrent, it is characterised in that including：Step 102, specific data information caused by user's access application is obtained；Step 104, the specific data information is stored into service node, the service node is to be included in multiple servers All service nodes in any one；Step 106, obtain the certain number that is stored in all service nodes every prefixed time interval by preset rules it is believed that Breath collection, and the specific data information collection is stored into database, wherein, the specific data information collection is all clothes A part for all specific data informations stored in business node；The step 104 specifically includes：The first calculated value of the specific data information is obtained, and first calculated value is converted to first according to pre-defined algorithm Cryptographic Hash, and stored the specific data information into the service node according to first cryptographic Hash.
- 2. the date storage method under high concurrent according to claim 1, it is characterised in that the preset rules are specifically wrapped Include：Obtain the specific data information and concentrate corresponding second calculated value of all specific data informations, according to described predetermined All second calculated values are converted to corresponding second cryptographic Hash by algorithm, wherein, second cryptographic Hash and described first Cryptographic Hash is identical, and second calculated value is identical with first calculated value.
- 3. the date storage method under high concurrent according to claim 2, it is characterised in that the preset rules are also wrapped Include：Obtain the corresponding data length list of stored in all service nodes all specific data informations, and according to The data length of all data length lists, all data length lists are arranged in descending order；According to second cryptographic Hash from all certain numbers of the data length descending arrangement by the data list It is believed that obtaining the customizing messages collection in breath, and the customizing messages collection is stored into the database.
- 4. date storage method according to any one of claim 1 to 3, it is characterised in that the step 106 is also wrapped Include：After the customizing messages collection is stored into the database, the certain number that the customizing messages is concentrated it is believed that Breath is deleted from the corresponding service node.
- 5. date storage method according to any one of claim 1 to 3, it is characterised in that the specific data information For the last reading time of user's access application, the prefixed time interval is 5 minutes, and the pre-defined algorithm is one Cause property hash algorithm.
- A kind of 6. data storage device under high concurrent, it is characterised in that including：Acquisition module, obtains specific data information caused by user's access application；First control module, controls and stores the specific data information into service node, and the service node is multiple clothes Any one in business device in all service nodes for including；Second control module, controls the spy for obtaining every prefixed time interval by preset rules and being stored in all service nodes Determine data message collection, and the specific data information collection is stored into database, wherein, the specific data information collection is institute State a part for all specific data informations stored in all service nodes；First control module specifically includes：First computing module, for obtaining the first calculated value of the specific data information, and according to pre-defined algorithm by described One calculated value is converted to the first cryptographic Hash, and first control module is additionally operable to：Control will according to first cryptographic Hash The specific data information is stored into the service node.
- 7. the data storage device under high concurrent according to claim 6, it is characterised in that the second control module tool Body includes：Second computing module, based on obtaining all specific data informations corresponding second of the specific data information concentration Calculation value, and all second calculated values are converted into corresponding second cryptographic Hash according to the pre-defined algorithm, wherein, described Two cryptographic Hash are identical with first cryptographic Hash, and second calculated value is identical with first calculated value.
- 8. the data storage device under high concurrent according to claim 7, it is characterised in that the second control module tool Body further includes：Sorting module, for obtaining the corresponding data length of stored in all service nodes all specific data informations List is spent, and according to the data length of all data length lists, all data length lists are arranged in descending order； And second control module is additionally operable to：According to second cryptographic Hash from all certain numbers of the data length descending arrangement by the data list It is believed that obtaining the customizing messages collection in breath, and the customizing messages collection is stored into the database.
- 9. the data storage device according to any one of claim 6 to 8, it is characterised in that second control module Specifically further include：Removing module, after the customizing messages collection is stored into the database, for concentrate the customizing messages The specific data information is deleted from the corresponding service node.
- 10. the data storage device according to any one of claim 6 to 8, it is characterised in that the specific data information For the last reading time of user's access application, the prefixed time interval is 5 minutes, and the pre-defined algorithm is one Cause property hash algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410743790.2A CN104408165B (en) | 2014-12-08 | 2014-12-08 | Date storage method and device under high concurrent |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410743790.2A CN104408165B (en) | 2014-12-08 | 2014-12-08 | Date storage method and device under high concurrent |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104408165A CN104408165A (en) | 2015-03-11 |
| CN104408165B true CN104408165B (en) | 2018-04-13 |
Family
ID=52645796
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410743790.2A Active CN104408165B (en) | 2014-12-08 | 2014-12-08 | Date storage method and device under high concurrent |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104408165B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106934037A (en) * | 2017-03-15 | 2017-07-07 | 郑州云海信息技术有限公司 | A kind of high concurrent realizes the method that database quickly loads data |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103152352A (en) * | 2013-03-15 | 2013-06-12 | 北京邮电大学 | Perfect information security and forensics monitoring method and system based on cloud computing environment |
| CN103299331A (en) * | 2010-08-27 | 2013-09-11 | 黑鹰网络股份有限公司 | Prepaid card with savings feature |
| CN103870570A (en) * | 2014-03-14 | 2014-06-18 | 广州携智信息科技有限公司 | HBase (Hadoop database) data usability and durability method based on remote log backup |
| CN104156380A (en) * | 2014-03-04 | 2014-11-19 | 深圳信息职业技术学院 | Distributed memory Hash indexing method and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6968432B2 (en) * | 2003-05-16 | 2005-11-22 | International Business Machines Corporation | Method and system for altering a sequence number assignment pattern while preserving integrity and high concurrency in a multi-system shared disk environment |
-
2014
- 2014-12-08 CN CN201410743790.2A patent/CN104408165B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103299331A (en) * | 2010-08-27 | 2013-09-11 | 黑鹰网络股份有限公司 | Prepaid card with savings feature |
| CN103152352A (en) * | 2013-03-15 | 2013-06-12 | 北京邮电大学 | Perfect information security and forensics monitoring method and system based on cloud computing environment |
| CN104156380A (en) * | 2014-03-04 | 2014-11-19 | 深圳信息职业技术学院 | Distributed memory Hash indexing method and system |
| CN103870570A (en) * | 2014-03-14 | 2014-06-18 | 广州携智信息科技有限公司 | HBase (Hadoop database) data usability and durability method based on remote log backup |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104408165A (en) | 2015-03-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8539597B2 (en) | Securing sensitive data for cloud computing | |
| US8380680B2 (en) | Piecemeal list prefetch | |
| CN109034988B (en) | Accounting entry generation method and device | |
| CN107315776A (en) | A kind of data management system based on cloud computing | |
| CN102682059A (en) | Method and system for distributing users to clusters | |
| US10893091B2 (en) | Management of asynchronous content post and media file transmissions | |
| US20190372880A1 (en) | Deserialization service | |
| CN104850627A (en) | Method and apparatus for performing paging display | |
| CN110795315A (en) | Method and device for monitoring service | |
| US8352442B2 (en) | Determination of an updated data source from disparate data sources | |
| CN113051480A (en) | Resource pushing method and device, electronic equipment and storage medium | |
| US11362997B2 (en) | Real-time policy rule evaluation with multistage processing | |
| US9830377B1 (en) | Methods and systems for hierarchical blocking | |
| EP2972970B1 (en) | Locale-based sorting on mobile devices | |
| CN104408165B (en) | Date storage method and device under high concurrent | |
| Gohil et al. | A performance analysis of MapReduce applications on big data in cloud based Hadoop | |
| WO2018001120A1 (en) | Method and device facilitating expansion of primary payment instruments | |
| US20210209103A1 (en) | Data segment-based indexing | |
| CN113641706A (en) | Data query method and device | |
| Camacho-Rodríguez et al. | Web data indexing in the cloud: efficiency and cost reductions | |
| CN111339743A (en) | Account generating method and device | |
| CN112990991A (en) | Method and device for merging invoices | |
| Ofer et al. | Applying deep learning to object store caching | |
| US11750392B1 (en) | Authenticated index data structure with back-pointers | |
| CN113835780A (en) | Event response method and device |
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 |