CN101334795A - Data storage method and device - Google Patents
Data storage method and device Download PDFInfo
- Publication number
- CN101334795A CN101334795A CNA2008101354741A CN200810135474A CN101334795A CN 101334795 A CN101334795 A CN 101334795A CN A2008101354741 A CNA2008101354741 A CN A2008101354741A CN 200810135474 A CN200810135474 A CN 200810135474A CN 101334795 A CN101334795 A CN 101334795A
- Authority
- CN
- China
- Prior art keywords
- dimension
- cache table
- data
- cache
- key table
- 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
- 238000013500 data storage Methods 0.000 title claims abstract description 43
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000012217 deletion Methods 0.000 claims description 10
- 230000037430 deletion Effects 0.000 claims description 10
- 230000007704 transition Effects 0.000 claims description 3
- 230000008859 change Effects 0.000 abstract description 3
- 238000012423 maintenance Methods 0.000 abstract description 3
- 238000012946 outsourcing Methods 0.000 description 13
- 230000008569 process Effects 0.000 description 11
- 238000010586 diagram Methods 0.000 description 9
- 239000000047 product Substances 0.000 description 4
- 238000007726 management method Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 239000012467 final product Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000005728 strengthening Methods 0.000 description 1
- 230000009885 systemic effect Effects 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a data storage method and a corresponding apparatus. The method includes the following steps: dimensions used for establishing a cache table are defined in a key table and the dimensions include at least one dimension member; cache tables corresponding to each dimension member in the dimensions are respectively established and the structure of the cache table is identical to that of the key table; received data corresponding to each dimension member are stored in the cache tables established for all the dimension members; the data stored in the cache tables are written into corresponding positions in the key table. The invention splits the key table including a plurality of dimensions and then establishes a plurality of cache tables to relieve the impact on the system capability when the number of concurrent users is high; and the invention adopts the cache tables to store data by classification to enhance the usability of the system and reduce the maintenance cost with little change to the previous system.
Description
Technical field
The present invention relates to technical field of data storage, particularly a kind of date storage method and device.
Background technology
ERP (Enterprise Resource Planning, Enterprise Resources Plan) is meant and is based upon on the infotech basis, with systematized management thought, provides the management platform of decision-making operation means for business decision layer and employee.Usually the data of ERP software are stored with the form of table by the mode of database, and table is the set that is used for the unified management related data, is equivalent to a data storage container.In the prior art, by table storage data the time, if there is the identical data in a plurality of user's use tables the same time, then can too much cause systemic breakdown because of EMS memory occupation, for the problem that prevents to cause owing to system performance, need guarantee the consistance of data by the mode of lock, promptly a certain data in table have the user in use, then other user can not re-use these data, but adopt the mode of lock to carry out data storage, when concurrent data are a lot, the phenomenon of a large number of users queuing will appear, and cause system performance to decline to a great extent.
The inventor finds in the research process of the mode that has employing table in the ERP system now being stored data, thereby reduce system performance in order to prevent a large amount of concurrent users, usually adopt the mode of strengthening the hardware device performance, for example strengthen hard-disk capacity, promote internal memory, CPU (Central Processing Unit, central processing unit) performance etc., but continuous increase along with client's amount and data volume, this mode will make the user because constantly increase the input of hardware device, and cause increasing the weight of of cost burden; In addition, if adopt the regularly mode of deleting history data,, will cause the user to inquire about and to handle to historical data though alleviated current system pressure; And if restriction concurrent user's quantity will be restricted the range of application of system, be difficult to satisfy big customer's demand.
Summary of the invention
The object of the present invention is to provide a kind of date storage method and device, measure the system cost that logging data causes when big the concurrent user and increase to solve in the prior art, and the problem that descends of performance.
For solving the problems of the technologies described above, the invention provides following technical scheme:
A kind of date storage method comprises:
Determine to close the dimension that is used to create cache table in the key table, described dimension comprises at least one dimension member;
For each dimension member of described dimension creates corresponding cache table, the structure of described cache table is consistent with described pass key table;
The cache table that the most described dimension member of each dimension member's of correspondence of receiving data storage is created;
Data in the described cache table are write correspondence position in the key table of described pass.
Described dimension comprises at least a in document types, user type or the client type.
The dimension that is used for creating cache table in the key table of described definite pass is specially: determine to close main dimension and at least one sub-dimension that key table is used to create cache table;
Describedly, each dimension member of dimension is specially for creating corresponding cache table:
For each main dimension member of described main dimension creates corresponding cache table;
With described main dimension member's cache table as closing key table, for each sub-dimension member of described sub-dimension creates corresponding cache table.
The cache table that the most described dimension member of described data storage with corresponding each dimension member creates comprises:
The storage route of each dimension member's of described correspondence data is revised as and points to described data corresponding cache table from pointing to described pass key table;
According to described amended storage route with described data storage to the corresponding cache table.
The described correspondence position that data in the cache table are write in the key table of described pass comprises:
Data in the described cache table are write correspondence position in the key table of described pass according to the time interval that sets in advance; Or
According to the manual submission pattern that sets in advance the data in the described cache table are write correspondence position in the key table of described pass.
Describedly after being write correspondence position in the key table of described pass, data in the cache table also comprise: delete the data in the described cache table.
Also comprise:
When in redefining the pass key table, being used to create the dimension of cache table, the described cache table that deletion has been created.
A kind of data storage device comprises:
Determining unit is used for determining to close the dimension that key table is used to create cache table, and described dimension comprises at least one dimension member;
Creating unit is used to each dimension member of described dimension to create corresponding cache table, and the structure of described cache table is consistent with described pass key table;
Storage unit is used for the cache table that each the dimension member's of correspondence that will receive the most described dimension member of data storage creates;
Writing unit is used for data with described cache table and writes correspondence position in the key table of described pass.
Described storage unit comprises:
Revise routing unit, be used for the storage route of each dimension member's of described correspondence data is revised as and points to described data corresponding cache table from pointing to described pass key table;
Storage data units is used for according to described amended storage route described data storage to the corresponding cache table.
The said write unit comprises:
Writing unit regularly is used for according to the time interval that sets in advance the data of described cache table being write correspondence position in the key table of described pass; Or
Manual writing unit is used for according to the manual submission pattern that sets in advance the data of described cache table being write correspondence position in the key table of described pass.
Also comprise:
Delete cells after being used for data with cache table and writing correspondence position in the key table of described pass, is deleted the data in the described cache table, maybe closes when being used to create the dimension of cache table in the key table the described cache table that deletion has been created when redefining.
By above technical scheme provided by the invention as seen, determine to close the dimension that is used to create cache table in the key table among the present invention, for each dimension member of this dimension creates corresponding and the consistent cache table of pass list structure, with each dimension member's of correspondence of receiving the data storage cache table created of dimension member most, the data in the cache table are write correspondence position in the key table of described pass.Use the present invention when carrying out data storage, because the pass key table that comprises a plurality of dimensions is split, alleviated the concurrent user and measure when big influence system performance by setting up a plurality of cache table; And adopt cache table classification and storage data, less to the change of original system, improved the ease for use of system, reduced maintenance cost.
Description of drawings
Fig. 1 is the first embodiment process flow diagram of date storage method of the present invention;
Fig. 2 is the second embodiment process flow diagram of date storage method of the present invention;
Fig. 3 is the 3rd embodiment process flow diagram of date storage method of the present invention;
Fig. 4 is the first embodiment block diagram of data storage device of the present invention;
Fig. 5 is the second embodiment block diagram of data storage device of the present invention;
Fig. 6 is the 3rd embodiment block diagram of data storage device of the present invention.
Embodiment
Core of the present invention has provided a kind of date storage method and device, determine to close the dimension that is used to create cache table in the key table, described dimension comprises at least one dimension member, for each dimension member of described dimension creates corresponding cache table, the structure of described cache table is consistent with described pass key table, the cache table that the most described dimension member of each dimension member's of correspondence of receiving data storage is created writes correspondence position in the key table of described pass with the data in the described cache table.
In order to make those skilled in the art person understand the present invention program better, and above-mentioned purpose of the present invention, feature and advantage can be become apparent more, the present invention is further detailed explanation below in conjunction with the drawings and specific embodiments.
The first embodiment flow process of date storage method of the present invention is as shown in Figure 1:
Step 101: determine to close the dimension that is used to create cache table in the key table.
Wherein, close at least a that the dimension of key table can be in document types, user type or the client type.
Step 102: for each dimension member of this dimension creates corresponding and the consistent cache table of pass list structure.
Concrete, when in determine closing key table, being used to create the main dimension of cache table and at least one sub-dimension, for each main dimension member of described main dimension creates corresponding cache table, and described main dimension member's cache table closed key table as transition, for each sub-dimension member of described sub-dimension creates corresponding cache table.
Step 103: each dimension member's of the correspondence that will receive data storage is the cache table of this dimension member establishment most.
Concrete, the storage route of each dimension member's of described correspondence data is revised as and points to described data corresponding cache table from pointing to described pass key table, according to described amended storage route with described data storage to the corresponding cache table.
Step 104: the data in the cache table are write the correspondence position that closes in the key table.
Wherein, can the data in the described cache table be write correspondence position in the key table of described pass, perhaps the data in the described cache table be write correspondence position in the key table of described pass according to the manual submission pattern that sets in advance according to the time interval that sets in advance.
Second embodiment of date storage method of the present invention as shown in Figure 2, this embodiment shows the detailed process of data storage, the dimension that wherein is used to create cache table is promptly only once divided closing key table only for according to closing the main dimension that key table is determined:
Step 201: determine to close a main dimension that is used to create cache table in the key table.
When determining to close the main dimension of key table, can from all dimensions, choose one wantonly as main dimension, also can will influence the dimension of system performance maximum as required as main dimension.
Each dimension all comprises at least one dimension member, is that user type is an example with the dimension, and each dimension member of user type is user 1, user 2...... user N (N is an integer).
Step 202: be that each main dimension member of main dimension creates corresponding and the consistent cache table of pass list structure.
Still be that user type is an example with the dimension, suppose that user type comprises N user, then create a cache table that is used to store this user data respectively for each user, the structure of this cache table is consistent with the structure of closing key table, so that follow-up data in the cache table can being write easily closed in the key table.
Step 203: the storage route of corresponding each main dimension member's data is closed key table and is revised as and points to this data corresponding cache table from pointing to.
When with pass key table storage data, the storage route of each data that receives is all pointed to the pass key table, because for each user has created cache table, therefore the storage route with each user's data is revised as the cache table of pointing to this user from pointing to the pass key table.
Because the storage route of only revising data can be advanced data storage corresponding cache table, so the present invention changing on the less basis existing system, just can improve the performance of system.
Step 204: the data that receive are stored to the corresponding cache table according to amended storage route.
User 1 data have been supposed to receive, then according to the storage route of amended these data, with the cache table of this data storage to user 1.
Step 205: the data in all cache table are write the correspondence position that closes in the key table according to the time interval that sets in advance.
Owing to cache table is in order to alleviate the temporary storage table that system performance is created, therefore also to need the data sync in the cache table to closing in the key table, so that the user can closed operations such as enterprising line data inquiry of key table and business processing.
Data in the synchronization caching table can set in advance timer when closing key table, carry out timing according to certain time interval, automatically the data in the cache table are write when a time cycle finishes and close in the key table.For example, can be arranged on default lock in time carries out night, and this moment, system was in idle condition, was convenient to the data in the cache table are write the pass key table.Certainly, also can be according to actual needs, for the data in different dimensions member's the cache table are provided with different locks in time, the present invention does not limit.
Step 206: the data in the deletion cache table.
Because cache table only be temporary storage table, therefore after the data sync in the cache table is in the key table of pass, for the memory headroom of the system of saving, can be with the data deletion in the cache table.
Step 207: judge whether to redefine and close the dimension that is used to create cache table in the key table, if then execution in step 208; Otherwise, finish current flow process.
Step 208: the cache table that deletion has been set up, return step 201.
Because cache table only is a temporary storage table, when therefore in need redefining the pass key table, being used to create the dimension of cache table, in the time of promptly need creating new cache table according to the new dimension of determining, for the memory headroom of the system of saving, can be with the cache table deletion of having set up.
The 3rd embodiment of date storage method of the present invention as shown in Figure 3, this embodiment shows the detailed process of data storage, wherein be used to create dimension a main dimension and sub-dimension of cache table, promptly only carry out the secondary division closing key table for determining according to the pass key table:
Step 301: determine to close a main dimension and sub-dimension that is used to create cache table in the key table.
After having determined main dimension, create cache table according to the main dimension member of main dimension and carry out the performance issue that data storage can be alleviated system, still,, can on main dimension member's basis, determine a sub-dimension for the further performance issue of alleviation system.
Step 302: each the main dimension member who is main dimension creates corresponding cache table.
Step 303: main dimension member's cache table is closed key table as transition, for each sub-dimension member of sub-dimension creates corresponding cache table.
On main dimension member's basis, determine a sub-dimension, exactly each main dimension member's corresponding cache table is further split, on the basis of cache table that is each main dimension member's foundation, further set up sub-dimension member's cache table.
Step 304: the storage route of corresponding each sub-dimension member's data is closed key table and is revised as and points to this data corresponding cache table from pointing to.
Step 305: according to amended storage route with the sub-corresponding cache table of data storage.
Step 306: the data in all cache table are write the correspondence position that closes in the key table according to the manual submission pattern that sets in advance.
The needs of different user can make the user all can the data in the cache table be write according to this pattern at different time and close in the key table according to the manual submission pattern that sets in advance for convenience.
Step 307: the data in the deletion cache table, finish current flow process.
Need to prove, according to the needs of actual storage and the requirement of system performance, can further determine the sub-dimension of sub-dimension, be that the embodiment of the invention does not limit the division number of times of dimension, above-mentionedly determine that to closing key table a main dimension and a sub-dimension only are convenient for example, in fact can repeatedly divide the sub-dimension of determining.
Be that document types is an example with dimension below, data storage procedure in the embodiment of the invention be described:
Corresponding dimension is a document types, supposes that the dimension member of document types comprises: outsourcing is put document, sale outbound document, product warehousing document in storage, is alloted the type document; Then corresponding above-mentioned four dimensions member creates outsourcing warehouse-in document cache table respectively, sells outbound document cache table, product warehousing document cache table, allots type document cache table; After receiving the input data, judge that these data belong to which dimension member's data, suppose that these data are that database data is gone in outsourcing, initial this outsourcing is gone into the storage route of database data for closing certain position in the key table, revise outsourcing this moment and go into the storage route execution outsourcing warehouse-in document cache table of database data, outsourcing can be put in storage the correspondence position of data storage in the outsourcing warehouse-in document cache table according to this route, other dimension member's data also store in the corresponding cache table in the manner described above.
For the data in each cache table are write the pass key table, set in advance the time of cache table data sync, for example, the data that are provided with in all metadata cache tables were carried out synchronously at 12 of nights every day, because this moment, system was in idle condition, order that can be when creating cache table synchronously the time is put outsourcing the document cache table in storage, is sold outbound document cache table, product warehousing document cache table, allots the correspondence position that data sequential write in the type document cache table enters the GATT in the key table and get final product.Certainly, the user also can manually write the data in the above-mentioned cache table and close in the key table.
Dimension member's outsourcing warehouse-in document when above-mentioned main dimension is document types, sell the outbound document, the product warehousing document, allot on the basis of type document, corresponding dimension member arbitrarily, buying the storehouse document in addition is example, can further determine its sub-dimension, suppose that sub-dimension is user type (comprising N user), then buy outside on the document basis, storehouse, determine that further sub-dimension member is user 1, user 2 is to user N, and the document cache table is put in the outsourcing that the then final cache table of creating is user 1 in storage, user 2 outsourcing warehouse-in document cache table is to the outsourcing warehouse-in document cache table of user N.By sub-dimension member's cache table carry out the process of data storage and process that aforementioned cache table by main dimension member is carried out data storage similar, do not repeat them here.
Corresponding with the embodiment of date storage method of the present invention, the present invention also provides the embodiment of data storage device.
The first embodiment block diagram of data storage device of the present invention as shown in Figure 4, this device comprises: determining unit 410, creating unit 420, storage unit 430 and writing unit 440.
Wherein, determining unit 410 is used for determining to close the dimension that key table is used to create cache table, and described dimension comprises at least one dimension member; Creating unit 420 is used to each dimension member of described dimension to create corresponding cache table, and the structure of described cache table is consistent with described pass key table; Storage unit 430 is used for the cache table that each the dimension member's of correspondence that will receive the most described dimension member of data storage creates; Writing unit 440 is used for data with described cache table and writes correspondence position in the key table of described pass.
The second embodiment block diagram of data storage device of the present invention as shown in Figure 5, this device comprises: determining unit 510, creating unit 520, storage unit 530 and writing unit 540.
Wherein, determining unit 510 is used for determining to close the dimension that key table is used to create cache table, and described dimension comprises at least one dimension member;
Creating unit 520 is used to each dimension member of described dimension to create corresponding cache table, and the structure of described cache table is consistent with described pass key table;
The 3rd embodiment block diagram of data storage device of the present invention as shown in Figure 6, this device comprises: determining unit 610, creating unit 620, storage unit 630, writing unit 640 and delete cells 650.
Wherein, determining unit 610 is used for determining to close the dimension that key table is used to create cache table, and described dimension comprises at least one dimension member; Creating unit 620 is used to each dimension member of described dimension to create corresponding cache table, and the structure of described cache table is consistent with described pass key table; Storage unit 630 is used for the cache table that each the dimension member's of correspondence that will receive the most described dimension member of data storage creates; Writing unit 640 is used for data with described cache table and writes correspondence position in the key table of described pass; After delete cells 650 is used for data with cache table and writes correspondence position in the key table of described pass, delete the data in the described cache table, maybe close when being used to create the dimension of cache table in the key table the described cache table that deletion has been created when redefining.
As seen through the above description of the embodiments, use the present invention when carrying out data storage, because the pass key table that comprises a plurality of dimensions is split, alleviated the concurrent user and measure when big influence system performance by setting up a plurality of cache table; And adopt cache table classification and storage data, less to the change of original system, improved the ease for use of system, reduced maintenance cost.Those skilled in the art can be well understood to the present invention and can realize by the mode that software adds essential general hardware platform.Based on such understanding, the part that technical scheme of the present invention contributes to prior art in essence in other words can embody with the form of software product, this computer software product can be stored in the storage medium, as ROM/RAM, magnetic disc, CD etc., comprise that some instructions are with so that a computer equipment (can be a personal computer, server, the perhaps network equipment etc.) carry out the described method of some part of each embodiment of the present invention or embodiment.
Above-described embodiment of the present invention does not constitute the qualification to protection domain of the present invention.Any modification of being done within the spirit and principles in the present invention, be equal to and replace and improvement etc., all should be included within protection scope of the present invention.
Claims (11)
1, a kind of date storage method is characterized in that, comprising:
Determine to close the dimension that is used to create cache table in the key table, described dimension comprises at least one dimension member;
For each dimension member of described dimension creates corresponding cache table, the structure of described cache table is consistent with described pass key table;
The cache table that the most described dimension member of each dimension member's of correspondence of receiving data storage is created;
Data in the described cache table are write correspondence position in the key table of described pass.
2, method according to claim 1 is characterized in that, described dimension comprises at least a in document types, user type or the client type.
3, method according to claim 1 is characterized in that, the dimension that is used for creating cache table in the key table of described definite pass is specially: determine to close main dimension and at least one sub-dimension that key table is used to create cache table;
Describedly, each dimension member of dimension is specially for creating corresponding cache table:
For each main dimension member of described main dimension creates corresponding cache table;
Described main dimension member's cache table is closed key table as transition, for each sub-dimension member of described sub-dimension creates corresponding cache table.
4, method according to claim 1 is characterized in that, the cache table that the most described dimension member of described data storage with corresponding each dimension member creates comprises:
The storage route of each dimension member's of described correspondence data is revised as and points to described data corresponding cache table from pointing to described pass key table;
According to described amended storage route with described data storage to the corresponding cache table.
5, method according to claim 1 is characterized in that, the described correspondence position that data in the cache table are write in the key table of described pass comprises:
Data in the described cache table are write correspondence position in the key table of described pass according to the time interval that sets in advance; Or
According to the manual submission pattern that sets in advance the data in the described cache table are write correspondence position in the key table of described pass.
6, method according to claim 1 is characterized in that, describedly also comprises after data in the cache table are write correspondence position in the key table of described pass: delete the data in the described cache table.
7, method according to claim 1 is characterized in that, also comprises:
When in redefining the pass key table, being used to create the dimension of cache table, the described cache table that deletion has been created.
8, a kind of data storage device is characterized in that, comprising:
Determining unit is used for determining to close the dimension that key table is used to create cache table, and described dimension comprises at least one dimension member;
Creating unit is used to each dimension member of described dimension to create corresponding cache table, and the structure of described cache table is consistent with described pass key table;
Storage unit is used for the cache table that each the dimension member's of correspondence that will receive the most described dimension member of data storage creates;
Writing unit is used for data with described cache table and writes correspondence position in the key table of described pass.
9, device according to claim 8 is characterized in that, described storage unit comprises:
Revise routing unit, be used for the storage route of each dimension member's of described correspondence data is revised as and points to described data corresponding cache table from pointing to described pass key table;
Storage data units is used for according to described amended storage route described data storage to the corresponding cache table.
10, device according to claim 8 is characterized in that, the said write unit comprises:
Writing unit regularly is used for according to the time interval that sets in advance the data of described cache table being write correspondence position in the key table of described pass; And/or
Manual writing unit is used for according to the manual submission pattern that sets in advance the data of described cache table being write correspondence position in the key table of described pass.
11, device according to claim 8 is characterized in that, also comprises:
Delete cells after being used for data with cache table and writing correspondence position in the key table of described pass, is deleted the data in the described cache table, maybe closes when being used to create the dimension of cache table in the key table the described cache table that deletion has been created when redefining.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101354741A CN101334795B (en) | 2008-08-07 | 2008-08-07 | Data storage method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101354741A CN101334795B (en) | 2008-08-07 | 2008-08-07 | Data storage method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101334795A true CN101334795A (en) | 2008-12-31 |
| CN101334795B CN101334795B (en) | 2010-10-13 |
Family
ID=40197393
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101354741A Active CN101334795B (en) | 2008-08-07 | 2008-08-07 | Data storage method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101334795B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102542054A (en) * | 2011-12-29 | 2012-07-04 | 厦门雅迅网络股份有限公司 | Method utilizing cache tables to improve insertion performance of data in database |
| CN102902776A (en) * | 2012-09-28 | 2013-01-30 | 用友软件股份有限公司 | Time dimension member generation device and time dimension member generation method for online analytic processing system |
| CN106528787A (en) * | 2016-11-09 | 2017-03-22 | 合网络技术（北京）有限公司 | Mass data multi-dimensional analysis-based query method and device |
| CN107145301A (en) * | 2016-03-01 | 2017-09-08 | 深圳市深信服电子科技有限公司 | Data access method and device based on hybrid magnetic disc |
| CN109086279A (en) * | 2017-06-13 | 2018-12-25 | 北京京东尚科信息技术有限公司 | Caching report method and apparatus |
-
2008
- 2008-08-07 CN CN2008101354741A patent/CN101334795B/en active Active
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102542054A (en) * | 2011-12-29 | 2012-07-04 | 厦门雅迅网络股份有限公司 | Method utilizing cache tables to improve insertion performance of data in database |
| CN102542054B (en) * | 2011-12-29 | 2017-02-08 | 厦门雅迅网络股份有限公司 | Method utilizing cache tables to improve insertion performance of data in database |
| CN102902776A (en) * | 2012-09-28 | 2013-01-30 | 用友软件股份有限公司 | Time dimension member generation device and time dimension member generation method for online analytic processing system |
| CN102902776B (en) * | 2012-09-28 | 2016-03-30 | 用友网络科技股份有限公司 | For time dimension member generating apparatus and the method for on-line analysing processing system |
| CN107145301A (en) * | 2016-03-01 | 2017-09-08 | 深圳市深信服电子科技有限公司 | Data access method and device based on hybrid magnetic disc |
| CN107145301B (en) * | 2016-03-01 | 2020-09-01 | 深信服科技股份有限公司 | Data access method and device based on hybrid disk |
| CN106528787A (en) * | 2016-11-09 | 2017-03-22 | 合网络技术（北京）有限公司 | Mass data multi-dimensional analysis-based query method and device |
| CN106528787B (en) * | 2016-11-09 | 2019-12-17 | 优酷网络技术（北京）有限公司 | query method and device based on multidimensional analysis of mass data |
| CN109086279A (en) * | 2017-06-13 | 2018-12-25 | 北京京东尚科信息技术有限公司 | Caching report method and apparatus |
| CN109086279B (en) * | 2017-06-13 | 2021-10-15 | 北京京东尚科信息技术有限公司 | Report caching method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101334795B (en) | 2010-10-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103473239B (en) | A kind of data of non relational database update method and device | |
| Venkatraman et al. | SQL versus NoSQL movement with big data analytics | |
| CN101334795B (en) | Data storage method and device | |
| CN110597785B (en) | Automobile part remanufacturing sharing system based on block chain and private cloud | |
| Karsten et al. | Inventory pooling games for expensive, low‐demand spare parts | |
| CN106202346A (en) | A kind of data load and clean engine, dispatch and storage system | |
| CN101908165A (en) | Geographic information system (GIS)-based industrial cluster information integration service system and method | |
| KR101400214B1 (en) | Appratus for providing a hybrid c interface | |
| CN102354356A (en) | Data authority management device and method | |
| CN102591864B (en) | Data updating method and device in comparison system | |
| CN105989076A (en) | Data statistical method and device | |
| CN104156396B (en) | The method and system of database performance are improved under big data environment | |
| CN107577436A (en) | A kind of date storage method and device | |
| Mukherjee | Synthesis of non-replicated dynamic fragment allocation algorithm in distributed database systems | |
| CN101702219A (en) | Method for generating material information and device thereof | |
| CN108846755A (en) | A kind of right management method and device based on intelligent contract | |
| CN115098572A (en) | User portrait construction method, device and computer equipment | |
| CN105446824A (en) | Table increment obtaining method and remote data backup method | |
| CN106250501A (en) | Report processing method and reporting system | |
| CN103761248A (en) | Method and system for querying data through main memory database | |
| Tseng et al. | A successful application of big data storage techniques implemented to criminal investigation for telecom | |
| CN107506189A (en) | A kind of iOS data persistence methods realized based on factory mode | |
| CN115510072A (en) | A master data engine based on multi-tenant SaaS application platform | |
| CN103678414A (en) | Method and device for storing and inquiring data | |
| CN103309890A (en) | Technology for merging Linux file system and real-time database index |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |