CN104408165A - High-concurrency data storage method and device - Google Patents
High-concurrency data storage method and device Download PDFInfo
- Publication number
- CN104408165A CN104408165A CN201410743790.2A CN201410743790A CN104408165A CN 104408165 A CN104408165 A CN 104408165A CN 201410743790 A CN201410743790 A CN 201410743790A CN 104408165 A CN104408165 A CN 104408165A
- Authority
- CN
- China
- Prior art keywords
- specific data
- data information
- stored
- cryptographic hash
- calculated value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a high-concurrency data storage method and a high-concurrency data storage device. The high-concurrency data storage method comprises that step 102, specific data information produced when a user accesses an application program is obtained; step 104, the specific data information is stored to a service node, wherein the service node is any one of all service nodes included in multiple servers; step 106, specific data information sets stored in all service nodes are obtained according to rulers at preset time intervals and stored in a database, wherein the specific data information sets are a part of all specific data information stored in all service nodes. By means of the technical scheme, the high-concurrency single-point blockage problem can be effectively avoided, the data can be efficiently and persistently stored in the database, and the safety and reliability of the data can be ensured.
Description
Technical field
The present invention relates to Internet technical field, in particular to a kind of high and date storage method given and a kind of high and data storage device given.
Background technology
At present, in the application of internet, often there will be comparatively fiery short chain and connect, just have that ten hundreds of people clicks, redirect at short notice, therefore, all application all need to support that large user is concurrent, and any one single-point problem all can the performance of influential system; And, for the enterprise made the transition to mobile Internet by traditional software bag enterprise, the contract for fixed output quotas user concurrent base of product of traditional software is originally fixing, not high to the requirement of user concurrent number yet, and the number of users of mobile Internet product end is ever-increasing, and the use of user is continual, all likely occurs that a large amount of users uses at any time, there is single-point problem in any one point, all will the performance of influential system and the experience of user.
Along with the increase of application to high performance demands, solve the high and design proposal of the single-point problem of giving also by original database schema, database is turned to add the pattern of buffer memory, and, that commonly use, high efficiency data operation also needs to complete in internal memory, can be met the demand of mobile Internet application by this implementation pattern.In addition, after Data Update, in order to ensure security, the reliability of data, also need the partial data in buffer memory to be persisted in database.
When development circle is applied, 1,000,000 circles are estimated, 100 general-purpose families, 1000000 models, each user adds at least 50 circles, each model at least 100 comment, according to above demand, system needs support 100,000 user concurrent, and the time of each issued transaction needs at Millisecond, and this application also needs to support that the user of millions posts.And, when the time finally checked by renewal circle, according to the more new interface in direct calling data storehouse, last time of checking is carried out to the technical scheme of persistence, as shown in Figure 1, because the performance requirement of business demand to application is very high, when carrying out performance pressure test, finally check that the time occurs blocked state always by database update.
Therefore, need a kind of high and date storage method given, effectively can avoid height and the single point blockage problem of giving, and can efficiently by data persistence in database, and ensure the safety and reliability of data, improve the things number of system process per second simultaneously, and then improve system performance.
Summary of the invention
Technical matters to be solved by this invention is, a kind of high and date storage method given is provided, by by distributed data storage on the different service nodes of different servers, and adopt the mode of asynchronous reading data by data persistence in database, effectively can avoid height and the single point blockage problem of giving, and can efficiently data persistence be stored in database, and ensure the safety and reliability of data, improve the things number of system process per second simultaneously, and then improve system performance.
According to an aspect of the present invention, provide a kind of high and date storage method given, comprising: step 102, the specific data information produced when obtaining user's access application; Step 104, is stored in service node by described specific data information, and described service node is any one in all service nodes comprised in multiple server; Step 106, obtain the specific data information collection stored in described all service nodes every prefixed time interval by preset rules, and described specific data information collection is stored in database, wherein, described specific data information collection is a part for all described specific data information stored in described all service nodes.
In this technical scheme, by the specific data information that will produce during different user access application (such as, last reading time) distributed store to different server different service nodes (such as, there are 4 servers, each server there are 8 nodes, can certainly be other configurations) enterprising row cache, effectively can avoid height and the single point blockage problem of giving, on the other hand, by part specific data information (the i.e. specific data information collection will all service nodes stored by preset rules every prefixed time interval (such as 5 minutes), such as, the specific data information on server is saved in certain time period) persistent storage is in database, namely by the mode of asynchronous reading data, specific data information is stored in database, can efficiently data persistence be stored in database, and ensure the safety and reliability of data, improve the things number of system process per second simultaneously, and then raising system performance.
In technique scheme, preferably, described step 104 specifically comprises: the first calculated value obtaining described specific data information, and according to pre-defined algorithm, described first calculated value is converted to the first cryptographic hash, and according to described first cryptographic hash, described specific data information is stored in described service node.
In this technical scheme, by pre-defined algorithm (such as consistance hash algorithm) by the specific data information of acquisition (such as, last reading time) the first calculated value (such as, key assignments) be converted to the first cryptographic hash, then according to this first cryptographic hash, the specific data information of correspondence is stored on one of them service node of multiple service nodes of multiple server, namely can effectively realize by the specific data information that produces during different user access application (such as, last reading time) distributed store is to the enterprising row cache of different service nodes of different server, while demand can being read meeting other threads, effectively avoid height and the single point blockage problem of giving.
In technique scheme, preferably, described preset rules specifically comprises: obtain described specific data information and concentrate the second calculated value that all described specific data informations are corresponding, according to described pre-defined algorithm, all described second calculated values are converted to the second corresponding cryptographic hash, wherein, described second cryptographic hash is identical with described first cryptographic hash, and described second calculated value is identical with described first calculated value.
In this technical scheme, by specific data information collection (such as, be saved in the specific data information on server in certain time period) be stored in database before, the second corresponding cryptographic hash is converted to by the second calculated value of each specific data information concentrated by specific data information, and the second calculated value, the second cryptographic hash are identical with the first calculated value, the first cryptographic hash respectively, can for from efficiently specific data information collection being stored in database the prerequisite guarantee providing favourable.
In technique scheme, preferably, described preset rules specifically also comprises: obtain the data length list that all described specific data information that stores in described all service nodes is corresponding, and according to the data length of all described data length lists, by all described data length lists by descending sort; From described all described specific data informations of the data length descending sort by described data list, obtain described customizing messages collection according to described second cryptographic hash, and described customizing messages collection is stored in described database.
In this technical scheme, will by specific data information collection (such as, be saved in the specific data information on server in certain time period) be stored in database before, sorted by all specific data informations stored in Servers-all, effectively can improve the comparison efficiency of specific data information, and then ensure the acquisition efficiency of specific data information collection.
In technique scheme, preferably, described step 106 also comprises: when being stored to after in described database by described customizing messages collection, the described specific data information concentrated by described customizing messages is deleted from the described service node of correspondence.
In this technical scheme, customizing messages collection is being stored into after in database, it is being deleted in the service node of correspondence, so that provide enough storage spaces for the specific data information that buffer memory is new, and then effectively avoiding height and the single point blockage problem of giving.
In technique scheme, preferably, described specific data information is the last reading time of user's access application, and described prefixed time interval is 5 minutes, and described pre-defined algorithm is consistance hash algorithm.
In this technical scheme, specific data information includes but not limited to the last reading time of user's access application; Prefixed time interval includes but not limited to 5 minutes, can arrange according to user's visit capacity, server configuration etc.; Pre-defined algorithm can be consistance hash algorithm, but is not limited thereto.
According to a further aspect in the invention, propose a kind of high and data storage device given, it is characterized in that, comprising: acquisition module, the specific data information produced when obtaining user's access application; First control module, controls described specific data information to be stored in service node, and described service node is any one in all service nodes comprised in multiple server; Second control module, control to obtain by preset rules the specific data information collection stored in described all service nodes every prefixed time interval, and described specific data information collection is stored in database, wherein, described specific data information collection is a part for all described specific data information stored in described all service nodes.
In this technical scheme, by the specific data information that will produce during different user access application (such as, last reading time) distributed store to different server different service nodes (such as, there are 4 servers, each server there are 8 nodes, can certainly be other configurations) enterprising row cache, effectively can avoid height and the single point blockage problem of giving, on the other hand, by part specific data information (the i.e. specific data information collection will all service nodes stored by preset rules every prefixed time interval (such as 5 minutes), such as, the specific data information on server is saved in certain time period) persistent storage is in database, namely by the mode of asynchronous reading data, specific data information is stored in database, can efficiently data persistence be stored in database, and ensure the safety and reliability of data, improve the things number of system process per second simultaneously, and then raising system performance.
In technique scheme, preferably, described first control module specifically comprises: the first computing module, for obtaining the first calculated value of described specific data information, and according to pre-defined algorithm, described first calculated value is converted to the first cryptographic hash, and described first control module also for: control according to described first cryptographic hash, described specific data information to be stored in described service node.
In this technical scheme, by pre-defined algorithm (such as consistance hash algorithm) by the specific data information of acquisition (such as, last reading time) the first calculated value (such as, key assignments) be converted to the first cryptographic hash, then according to this first cryptographic hash, the specific data information of correspondence is stored on one of them service node of multiple service nodes of multiple server, namely can effectively realize by the specific data information that produces during different user access application (such as, last reading time) distributed store is to the enterprising row cache of different service nodes of different server, while demand can being read meeting other threads, effectively avoid height and the single point blockage problem of giving.
In technique scheme, preferably, described second control module specifically comprises: the second computing module, the second calculated value that all described specific data informations are corresponding is concentrated for obtaining described specific data information, and according to described pre-defined algorithm, all described second calculated values are converted to the second corresponding cryptographic hash, wherein, described second cryptographic hash is identical with described first cryptographic hash, and described second calculated value is identical with described first calculated value.
In this technical scheme, by specific data information collection (such as, be saved in the specific data information on server in certain time period) be stored in database before, the second corresponding cryptographic hash is converted to by the second calculated value of each specific data information concentrated by specific data information, and the second calculated value, the second cryptographic hash are identical with the first calculated value, the first cryptographic hash respectively, can for from efficiently specific data information collection being stored in database the prerequisite guarantee providing favourable.
In technique scheme, preferably, described second control module specifically also comprises: order module, for obtaining data length list corresponding to all described specific data information that stores in described all service nodes, and according to the data length of all described data length lists, by all described data length lists by descending sort; And described second control module also for: from described all described specific data informations of the data length descending sort by described data list, obtain described customizing messages collection according to described second cryptographic hash, and described customizing messages collection be stored in described database.
In this technical scheme, will by specific data information collection (such as, be saved in the specific data information on server in certain time period) be stored in database before, sorted by all specific data informations stored in Servers-all, effectively can improve the comparison efficiency of specific data information, and then ensure the acquisition efficiency of specific data information collection.
In technique scheme, preferably, described second control module specifically also comprises: removing module, when being stored to after in described database by described customizing messages collection, deletes from the described service node of correspondence for the described specific data information concentrated by described customizing messages.
In this technical scheme, customizing messages collection is being stored into after in database, it is being deleted in the service node of correspondence, so that provide enough storage spaces for the specific data information that buffer memory is new, and then effectively avoiding height and the single point blockage problem of giving.
In technique scheme, preferably, described specific data information is the last reading time of user's access application, and described prefixed time interval is 5 minutes, and described pre-defined algorithm is consistance hash algorithm.
In this technical scheme, specific data information includes but not limited to the last reading time of user's access application; Prefixed time interval includes but not limited to 5 minutes, can arrange according to user's visit capacity, server configuration etc.; Pre-defined algorithm can be consistance hash algorithm, but is not limited thereto.
Pass through technique scheme, effectively can avoid height and the single point blockage problem of giving, and can efficiently data persistence be stored in database, and ensure the safety and reliability of data, improve the things number of system process per second simultaneously, and then improve system performance.
Accompanying drawing explanation
Fig. 1 shows the direct schematic flow sheet be stored into by data persistence in database in correlation technique;
Fig. 2 shows height according to an embodiment of the invention and the schematic flow sheet of the date storage method given;
Fig. 3 shows height according to an embodiment of the invention and the structural representation of the data storage device given;
Fig. 4 shows height according to another embodiment of the invention and the schematic flow sheet of the date storage method given.
Embodiment
In order to more clearly understand above-mentioned purpose of the present invention, feature and advantage, below in conjunction with the drawings and specific embodiments, the present invention is further described in detail.
Set forth a lot of detail in the following description so that fully understand the present invention, but the present invention can also adopt other to be different from other modes described here and implement, and therefore, the present invention is not limited to the restriction of following public specific embodiment.
Fig. 2 shows height according to an embodiment of the invention and the schematic flow sheet of the date storage method given.
As shown in Figure 2, height according to an embodiment of the invention the date storage method given, comprising: step 102, the specific data information produced when obtaining user's access application; Step 104, is stored in service node by described specific data information, and described service node is any one in all service nodes comprised in multiple server; Step 106, obtain the specific data information collection stored in described all service nodes every prefixed time interval by preset rules, and described specific data information collection is stored in database, wherein, described specific data information collection is a part for all described specific data information stored in described all service nodes.
In this technical scheme, by the specific data information that will produce during different user access application (such as, last reading time) distributed store to different server different service nodes (such as, there are 4 servers, each server there are 8 nodes, can certainly be other configurations) enterprising row cache, effectively can avoid height and the single point blockage problem of giving, on the other hand, by part specific data information (the i.e. specific data information collection will all service nodes stored by preset rules every prefixed time interval (such as 5 minutes), such as, the specific data information on server is saved in certain time period) persistent storage is in database, namely by the mode of asynchronous reading data, specific data information is stored in database, can efficiently data persistence be stored in database, and ensure the safety and reliability of data, improve the things number of system process per second simultaneously, and then raising system performance.
In technique scheme, preferably, described step 104 specifically comprises: the first calculated value obtaining described specific data information, and according to pre-defined algorithm, described first calculated value is converted to the first cryptographic hash, and according to described first cryptographic hash, described specific data information is stored in described service node.
In this technical scheme, by pre-defined algorithm (such as consistance hash algorithm) by the specific data information of acquisition (such as, last reading time) the first calculated value (such as, key assignments) be converted to the first cryptographic hash, then according to this first cryptographic hash, the specific data information of correspondence is stored on one of them service node of multiple service nodes of multiple server, namely can effectively realize by the specific data information that produces during different user access application (such as, last reading time) distributed store is to the enterprising row cache of different service nodes of different server, while demand can being read meeting other threads, effectively avoid height and the single point blockage problem of giving.
In technique scheme, preferably, described preset rules specifically comprises: obtain described specific data information and concentrate the second calculated value that all described specific data informations are corresponding, according to described pre-defined algorithm, all described second calculated values are converted to the second corresponding cryptographic hash, wherein, described second cryptographic hash is identical with described first cryptographic hash, and described second calculated value is identical with described first calculated value.
In this technical scheme, by specific data information collection (such as, be saved in the specific data information on server in certain time period) be stored in database before, the second corresponding cryptographic hash is converted to by the second calculated value of each specific data information concentrated by specific data information, and the second calculated value, the second cryptographic hash are identical with the first calculated value, the first cryptographic hash respectively, can for from efficiently specific data information collection being stored in database the prerequisite guarantee providing favourable.
In technique scheme, preferably, described preset rules specifically also comprises: obtain the data length list that all described specific data information that stores in described all service nodes is corresponding, and according to the data length of all described data length lists, by all described data length lists by descending sort; From described all described specific data informations of the data length descending sort by described data list, obtain described customizing messages collection according to described second cryptographic hash, and described customizing messages collection is stored in described database.
In this technical scheme, will by specific data information collection (such as, be saved in the specific data information on server in certain time period) be stored in database before, sorted by all specific data informations stored in Servers-all, effectively can improve the comparison efficiency of specific data information, and then ensure the acquisition efficiency of specific data information collection.
In technique scheme, preferably, described step 106 also comprises: when being stored to after in described database by described customizing messages collection, the described specific data information concentrated by described customizing messages is deleted from the described service node of correspondence.
In this technical scheme, customizing messages collection is being stored into after in database, it is being deleted in the service node of correspondence, so that provide enough storage spaces for the specific data information that buffer memory is new, and then effectively avoiding height and the single point blockage problem of giving.
In technique scheme, preferably, described specific data information is the last reading time of user's access application, and described prefixed time interval is 5 minutes, and described pre-defined algorithm is consistance hash algorithm.
In this technical scheme, specific data information includes but not limited to the last reading time of user's access application; Prefixed time interval includes but not limited to 5 minutes, can arrange according to user's visit capacity, server configuration etc.; Pre-defined algorithm can be consistance hash algorithm, but is not limited thereto.
Fig. 3 shows height according to an embodiment of the invention and the structural representation of the data storage device given.
As shown in Figure 3, height according to an embodiment of the invention the data storage device given,
Comprise: acquisition module 302, the specific data information produced when obtaining user's access application; First control module 304, controls described specific data information to be stored in service node, and described service node is any one in all service nodes comprised in multiple server; Second control module 306, control to obtain by preset rules the specific data information collection stored in described all service nodes every prefixed time interval, and described specific data information collection is stored in database, wherein, described specific data information collection is a part for all described specific data information stored in described all service nodes.
In this technical scheme, by the specific data information that will produce during different user access application (such as, last reading time) distributed store to different server different service nodes (such as, there are 4 servers, each server there are 8 nodes, can certainly be other configurations) enterprising row cache, effectively can avoid height and the single point blockage problem of giving, on the other hand, by part specific data information (the i.e. specific data information collection will all service nodes stored by preset rules every prefixed time interval (such as 5 minutes), such as, the specific data information on server is saved in certain time period) persistent storage is in database, namely by the mode of asynchronous reading data, specific data information is stored in database, can efficiently data persistence be stored in database, and ensure the safety and reliability of data, improve the things number of system process per second simultaneously, and then raising system performance.
In technique scheme, preferably, described first control module 304 specifically comprises: the first computing module 3042, for obtaining the first calculated value of described specific data information, and according to pre-defined algorithm, described first calculated value is converted to the first cryptographic hash, and described first control module also for: control according to described first cryptographic hash, described specific data information to be stored in described service node.
In this technical scheme, by pre-defined algorithm (such as consistance hash algorithm) by the specific data information of acquisition (such as, last reading time) the first calculated value (such as, key assignments) be converted to the first cryptographic hash, then according to this first cryptographic hash, the specific data information of correspondence is stored on one of them service node of multiple service nodes of multiple server, namely can effectively realize by the specific data information that produces during different user access application (such as, last reading time) distributed store is to the enterprising row cache of different service nodes of different server, while demand can being read meeting other threads, effectively avoid height and the single point blockage problem of giving.
In technique scheme, preferably, described second control module 306 specifically comprises: the second computing module 3062, the second calculated value that all described specific data informations are corresponding is concentrated for obtaining described specific data information, and according to described pre-defined algorithm, all described second calculated values are converted to the second corresponding cryptographic hash, wherein, described second cryptographic hash is identical with described first cryptographic hash, and described second calculated value is identical with described first calculated value.
In this technical scheme, by specific data information collection (such as, be saved in the specific data information on server in certain time period) be stored in database before, the second corresponding cryptographic hash is converted to by the second calculated value of each specific data information concentrated by specific data information, and the second calculated value, the second cryptographic hash are identical with the first calculated value, the first cryptographic hash respectively, can for from efficiently specific data information collection being stored in database the prerequisite guarantee providing favourable.
In technique scheme, preferably, described second control module 306 specifically also comprises: order module 3064, for obtaining data length list corresponding to all described specific data information that stores in described all service nodes, and according to the data length of all described data length lists, by all described data length lists by descending sort; And described second control module 306 also for: from described all described specific data informations of the data length descending sort by described data list, obtain described customizing messages collection according to described second cryptographic hash, and described customizing messages collection be stored in described database.
In this technical scheme, will by specific data information collection (such as, be saved in the specific data information on server in certain time period) be stored in database before, sorted by all specific data informations stored in Servers-all, effectively can improve the comparison efficiency of specific data information, and then ensure the acquisition efficiency of specific data information collection.
In technique scheme, preferably, described second control module 306 specifically also comprises: removing module 3066, when being stored to after in described database by described customizing messages collection, deletes from the described service node of correspondence for the described specific data information concentrated by described customizing messages.
In this technical scheme, customizing messages collection is being stored into after in database, it is being deleted in the service node of correspondence, so that provide enough storage spaces for the specific data information that buffer memory is new, and then effectively avoiding height and the single point blockage problem of giving.
In technique scheme, preferably, described specific data information is the last reading time of user's access application, and described prefixed time interval is 5 minutes, and described pre-defined algorithm is consistance hash algorithm.
In this technical scheme, specific data information includes but not limited to the last reading time of user's access application; Prefixed time interval includes but not limited to 5 minutes, can arrange according to user's visit capacity, server configuration etc.; Pre-defined algorithm can be consistance hash algorithm, but is not limited thereto.
Fig. 4 shows height according to another embodiment of the invention and the schematic flow sheet of the date storage method given.
As shown in Figure 4, height according to another embodiment of the invention the date storage method given, specifically comprise:
Step 402, obtains the last reading time (specific data information) that user clicks inquiry member's circle (application program);
Step 404, obtains the key assignments (the first calculated value) of last reading time;
Step 406, transfers key assignments to consistance cryptographic hash (the first cryptographic hash) according to consistance hash algorithm (pre-defined algorithm);
Step 408, is stored in a service node according to consistance cryptographic hash by last reading time;
Step 410, from all service nodes of Servers-all, obtain the key assignments (the second calculated value) of a collection of last reading time every 5 minutes (prefixed time interval), and transfer key assignments to consistance cryptographic hash (the second cryptographic hash) according to consistance hash algorithm (pre-defined algorithm);
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, by all last reading time of storing in all service nodes of Servers-all by descending sort;
Step 416, all consistance cryptographic hash of a collection of last reading time obtained as required, obtain a collection of last reading time of needs, and are stored in database by this batch of last reading time from sorted all last reading time;
Step 418, this batch last reading time place service node in, this batch of last reading time is deleted.
Therefore, according to technical scheme of the present invention, effectively height can be avoided and the single point blockage problem of giving, and can efficiently data persistence be stored in database, and ensure the safety and reliability of data, improve the things number of system process per second simultaneously, and then improve system performance.
In the present invention, term " first ", " second " object only for describing, and instruction or hint relative importance can not be interpreted as.For the ordinary skill in the art, above-mentioned term concrete meaning in the present invention can be understood as the case may be.
In the description of this instructions, specific features, structure, material or feature that the description of term " embodiment ", " specific embodiment " etc. means to describe in conjunction with this embodiment or example are contained at least one embodiment of the present invention or example.In this manual, identical embodiment or example are not necessarily referred to the schematic representation of above-mentioned term.And the specific features of description, structure, material or feature can combine in an appropriate manner in any one or more embodiment or example.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (12)
1. the high and date storage method given, is characterized in that, comprising:
Step 102, the specific data information produced when obtaining user's access application;
Step 104, is stored in service node by described specific data information, and described service node is any one in all service nodes comprised in multiple server;
Step 106, obtain the specific data information collection stored in described all service nodes every prefixed time interval by preset rules, and described specific data information collection is stored in database, wherein, described specific data information collection is a part for all described specific data information stored in described all service nodes.
2. height according to claim 1 the date storage method given, it is characterized in that, described step 104 specifically comprises:
Obtain the first calculated value of described specific data information, and according to pre-defined algorithm, described first calculated value is converted to the first cryptographic hash, and according to described first cryptographic hash, described specific data information is stored in described service node.
3. height according to claim 1 the date storage method given, it is characterized in that, described preset rules specifically comprises:
Obtain described specific data information and concentrate the second calculated value that all described specific data informations are corresponding, according to described pre-defined algorithm, all described second calculated values are converted to the second corresponding cryptographic hash, wherein, described second cryptographic hash is identical with described first cryptographic hash, and described second calculated value is identical with described first calculated value.
4. height according to claim 3 the date storage method given, it is characterized in that, described preset rules also comprises:
Obtain the data length list that all described specific data information that stores in described all service nodes is corresponding, and according to the data length of all described data length lists, by all described data length lists by descending sort;
From described all described specific data informations of the data length descending sort by described data list, obtain described customizing messages collection according to described second cryptographic hash, and described customizing messages collection is stored in described database.
5. date storage method according to any one of claim 1 to 4, it is characterized in that, described step 106 also comprises: when being stored to after in described database by described customizing messages collection, the described specific data information concentrated by described customizing messages is deleted from the described service node of correspondence.
6. date storage method according to any one of claim 1 to 4, it is characterized in that, described specific data information is the last reading time of user's access application, and described prefixed time interval is 5 minutes, and described pre-defined algorithm is consistance hash algorithm.
7. the high and data storage device given, is characterized in that, comprising:
Acquisition module, the specific data information produced when obtaining user's access application;
First control module, controls described specific data information to be stored in service node, and described service node is any one in all service nodes comprised in multiple server;
Second control module, control to obtain by preset rules the specific data information collection stored in described all service nodes every prefixed time interval, and described specific data information collection is stored in database, wherein, described specific data information collection is a part for all described specific data information stored in described all service nodes.
8. height according to claim 7 the data storage device given, it is characterized in that, described first control module specifically comprises:
First computing module, for obtaining the first calculated value of described specific data information, and according to pre-defined algorithm, described first calculated value is converted to the first cryptographic hash, and described first control module also for: control according to described first cryptographic hash, described specific data information to be stored in described service node.
9. height according to claim 7 the data storage device given, it is characterized in that, described second control module specifically comprises:
Second computing module, the second calculated value that all described specific data informations are corresponding is concentrated for obtaining described specific data information, and according to described pre-defined algorithm, all described second calculated values are converted to the second corresponding cryptographic hash, wherein, described second cryptographic hash is identical with described first cryptographic hash, and described second calculated value is identical with described first calculated value.
10. height according to claim 9 the data storage device given, it is characterized in that, described second control module specifically also comprises:
Order module, for obtaining data length list corresponding to all described specific data information that stores in described all service nodes, and according to the data length of all described data length lists, by all described data length lists by descending sort; And described second control module also for:
From described all described specific data informations of the data length descending sort by described data list, obtain described customizing messages collection according to described second cryptographic hash, and described customizing messages collection is stored in described database.
11. data storage devices according to any one of claim 7 to 10, it is characterized in that, described second control module specifically also comprises:
Removing module, when being stored to after in described database by described customizing messages collection, deletes from the described service node of correspondence for the described specific data information concentrated by described customizing messages.
12. data storage devices according to any one of claim 7 to 10, it is characterized in that, described specific data information is the last reading time of user's access application, and described prefixed time interval is 5 minutes, and described pre-defined algorithm is consistance 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 true CN104408165A (en) | 2015-03-11 |
| CN104408165B 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) |
Cited By (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 (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040230621A1 (en) * | 2003-05-16 | 2004-11-18 | Croisettier Ramanakumari M. | Method and system for altering a sequence number assignment pattern while preserving integrity and high concurrency in a multi-system shared disk environment |
| 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 |
-
2014
- 2014-12-08 CN CN201410743790.2A patent/CN104408165B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040230621A1 (en) * | 2003-05-16 | 2004-11-18 | Croisettier Ramanakumari M. | Method and system for altering a sequence number assignment pattern while preserving integrity and high concurrency in a multi-system shared disk environment |
| 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 |
Cited By (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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104408165B (en) | 2018-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102682059B (en) | Method and system for distributing users to clusters | |
| US8380680B2 (en) | Piecemeal list prefetch | |
| RU2557761C2 (en) | Bottom-up optimised search system and method | |
| CN104866599A (en) | Production method and system of visual report | |
| CN102073540A (en) | Distributed affair submitting method and device thereof | |
| CN107145556B (en) | Universal distributed acquisition system | |
| CN103927338A (en) | Log information storage processing method and log information storage processing device | |
| CN102737065A (en) | Method and device for acquiring data | |
| CN104850627A (en) | Method and apparatus for performing paging display | |
| CN107944000A (en) | Flight freight rate update method, device, electronic equipment, storage medium | |
| CN105978967A (en) | Control information push method and device | |
| CN110457346A (en) | Data query method, apparatus and computer readable storage medium | |
| CN110225087A (en) | Cloud access method, device and storage medium based on global load balancing | |
| CN105208093B (en) | The structure system of resource pool is calculated in a kind of cloud operating system | |
| US20120078971A1 (en) | Data management method | |
| CN109165335A (en) | Internet finance blacklist system and its application method based on big data | |
| CN103377292B (en) | Database result set caching method and device | |
| CN106982128A (en) | Network community construction method | |
| CN104424188A (en) | System and method for updating obtained webpage data | |
| CN114070847B (en) | Method, device, equipment and storage medium for limiting current of server | |
| CN113360500A (en) | Data processing method and device, storage medium and electronic equipment | |
| CN104408165A (en) | High-concurrency data storage method and device | |
| CN103823805A (en) | Community-based related post recommendation system and method | |
| CN104714983A (en) | Generating method and device for distributed indexes | |
| CN115455957A (en) | User touch method, device, electronic equipment and computer readable 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 |