CN102495853A - Aspect-oriented cloud storage engine construction method - Google Patents
Aspect-oriented cloud storage engine construction method Download PDFInfo
- Publication number
- CN102495853A CN102495853A CN2011103671911A CN201110367191A CN102495853A CN 102495853 A CN102495853 A CN 102495853A CN 2011103671911 A CN2011103671911 A CN 2011103671911A CN 201110367191 A CN201110367191 A CN 201110367191A CN 102495853 A CN102495853 A CN 102495853A
- Authority
- CN
- China
- Prior art keywords
- data
- tangent plane
- database
- cloud storage
- request
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to an aspect-oriented cloud storage engine construction method. The aspect-oriented cloud storage engine construction method includes steps of 1, constructing a data access layer by design personnel according to the adopted type of database; 2, realizing aspect processing for data in the database by the design personnel; 3, analyzing service request by the design personnel, and operating aspect of the data to obtain aspect data; and 4, constructing a cloud storage engine on the basis of the aspect data constructed in the step 3 by the design personnel. Compared with the prior art, the aspect-oriented cloud storage engine construction method has the advantages that the concept of the data access layer is newly added into an existing cloud storage framework, the data access layer realizes the aspect processing for the data by the aid of the idea of aspect-oriented programming, data retrieval and data management efficiency is greatly improved, and complexity of data heterogeneity during processing of relational data and non-relational data is reduced.
Description
Technical field
The invention belongs to the Network storage technology field, relate in particular to a kind of building method of cloud storage engines.
Background technology
In modern times under computing technique, software and hardware technology, the development of internet technology; Computer system is through technology such as cluster application, grid computing technology or distributed file systems; A large amount of various dissimilar memory devices in the network are gathered collaborative work through application software, data storage and Operational Visit function externally are provided jointly.We are referred to as cloud computing machine system to this system.In such cloud computing system; The core of system is the storage and the management of mass data; And to this situation; Need a large amount of memory device of configuration in the cloud computing system, a cloud storage system (being called for short the cloud storage) is just derived, is transformed into to the management method of the data of these memory device, stores and data itself; Compare with traditional memory device; Cloud storage system is not only a hardware; But the complication system that a plurality of parts such as the network equipment, memory device, server, application software, public access interface, Access Network and a client-side program are formed; In this system, each several part is core with the memory device, comes externally to provide data storage and Operational Visit service through application software.
Storage engines is in the Database Systems; A kind of mode with the data centralization storage administration; Existing storage engines; Be primarily aimed at relevant database, this storage engines according to storage means, index type and locking horizontal classification, and is loaded into the tables of data in the relevant database in the internal memory with sorted tables of data.
But existing storage engines is not removed the relation that highly is coupled between the data; Do not change the storage means of data; Make the user in retrieve data when carrying out data management; The cost great amount of time is searched, is compared, and existing storage engines is not supported the non-relational database.Therefore, existing storage engines is difficult to adapt to new features such as data variation is big, data concurrency height when storing distribution mode in the face of the cloud of isomery.
Summary of the invention
The objective of the invention is to solve existing storage engines when storing distribution mode in the face of the cloud of isomery; Be difficult to adapt to the deficiency that data variation is big, the data concurrency is high; Propose a kind of cloud storage engines building method towards tangent plane, this method is utilized the thought towards tangent plane, takes out the operation to data; Shielding is to the difference of bottom relevant database and non-relational data, and unification is to the management and the access control of data.
Technical scheme of the present invention is: a kind of cloud storage engines building method towards tangent plane comprises the steps: step 1: the designer makes up data access layer according to the type of database that is adopted; Step 2: the designer carries out tangent plane to the data in the database; Step 3: the designer analyzes service request, and data operation tangent plane is obtained the tangent plane data; Step 4: on the basis of the tangent plane data that the designer builds, make up the cloud storage engines in step 3.
The detailed process that makes up data access layer in the above-mentioned steps 1 is following: confirm to use data storage method to be relevant database or non-relational database, respectively relevant database and non-relational database are set up data access layer.
Process to the relevant database tangent plane in the above-mentioned steps 2 comprises the steps:
The raw data table that the ergodic data storehouse is all is numbered every table, guarantees that numbering does not repeat;
Table numbering in the last step is stored in separately in another table;
To the data of raw data table, extract by row (row one attribute), the data of extracting are left in separately in the new tables of data; Again with the data number in the new tables of data; The data that all extract by row from raw data table, numbering corresponding in all new tables of data is consistent, and this numbering can be the major key in the raw data table; Also can use other modes to generate, but will guarantee that all data numbers in the new tables of data do not repeat.
Process to non-relational database tangent plane in the above-mentioned steps 2 comprises the steps:
In the non-relational database; Data are with the stored in form of key-value pair; Each bar data all can have data key and corresponding data value, so in to non-relational database tangent plane, only need the data key of data be stored in the table; The data value storage of data key correspondence obtains two new tables of data in another table.
The invention has the beneficial effects as follows: the present invention compares with conventional art; In existing cloud storage architecture; The new notion that adds data access layer; This data access layer uses towards the thought of tangent plane programming the data tangent plane is handled, and has significantly improved the efficient of data retrieval and data management, has simplified the complexity problem of data isomery in relational data and the non-relational data handling procedure.
Description of drawings
Fig. 1 is a cloud storage system overall architecture synoptic diagram involved in the present invention.
Fig. 2 is of the present invention towards tangent plane administrative model figure.
Embodiment
Below in conjunction with accompanying drawing and concrete embodiment the present invention is done further elaboration.For specific embodiment of the present invention is done explanation, be necessary to confirm earlier the notion and the theory of some special uses of the present invention.
1. cloud storage architecture
The cloud storage architecture provides the visit to data through adding standard hardware and share standard network (public internet or privately owned intranet), and cloud capacity and performance have good scalability.Hundreds of cloud storage servers externally provide service, are single, a large-scale storage pool equipment in logic.
Cloud storage system involved in the present invention; Its structural model is formed by following five layers from bottom to top; As shown in Figure 1, wherein ground floor (accumulation layer), the 3rd layer (basic management layer), the 4th layer (access layer), layer 5 (application-interface layer) are the cloud storage organization model of standard, and the second layer is that the present invention is in order to make up new cloud storage engines; And the new data access layer of introducing, the structure of this data access layer has used the thought towards tangent plane programming.Do further introduction in the face of each layer down:
11. accumulation layer
Accumulation layer is that cloud is stored most basic part.Memory device can be the FC fibre channel storage, can be IP memory devices such as NAS and iSCSI, also can be DAS memory devices such as SCSI or SAS.Memory device in the cloud storage is the huge and how different regions that distribute of quantity often, link together through wide area network, internet or FC fiber channel network each other.Accumulation layer can comprise storage engines, and storage engines is a kind of data to be stored in the method in the file (perhaps internal memory) with various technology.After the difference classification of adopting in the various different technologies, function widely is provided finally to data storage mode, index skill, locking level.
12. data access layer
Data access layer is to use towards what tangent plane programming thought realized relationship type and non-relational data of database is operated.Data access layer upwards is encapsulated into concrete routine call, shows as identical program name, has realized the visit to distinct type data-base downwards, and identical program name is mapped as the concrete operations to disparate databases.
13. basic management layer
The basic management layer is the most crucial part of cloud storage.The basic management layer is through technology such as cluster, distributed file system and grid computings; Realize the collaborative work between a plurality of memory devices in the cloud storage; A plurality of memory devices can externally be provided with a kind of service, and more greatly stronger better data access performance is provided.
Data in identity identifying technology, the storage of data encryption technology assurance cloud can not visited by undelegated user; Simultaneously; Can guarantee that through various data backups and disaster tolerance technology and measure the data in the cloud storage can not lose, the safety that guarantees cloud storage self is with stable.
14. access layer
Any one authorized user can be logined cloud storage system through the public application interface of standard, enjoys the cloud stores service.Cloud storage unit of operation is different, and the access type that the cloud storage provides is also different with addressing means.
15. application-interface layer
The cloud storage is part the most flexibly.Different cloud storage units of operation can develop different application service interfaces according to the practical business type, and different application services is provided.
2. Simple Object Access Protocol (SOAP, Simple Object Access Protocol)
Simple Object Access Protocol is a kind of standardized communication standard; Simplified the process of web page server from database extraction data; Make web page server need not to spend again the plenty of time formatted data; And can let between the different application and to see through the HTTP communications protocol, intercourse data each other with the XML form, make the transmission of data and concrete programming language, platform and hardware independent.
3. towards tangent plane programming (Aspect Oriented Programming, introduction AOP).
The purpose that mainly realizes towards tangent plane programming is to extract to the tangent plane in the business processing process, and what it was faced is certain step or the stage in the processing procedure, to obtain to hang down between the each several part in the logical process isolation effect of coupling.
Introduce the basic concepts that need use among the present invention below towards tangent plane programming:
Access point (join point): be that executory one of program is accurately carried out point, for example program method.Access point is an abstract concept, when realizing towards tangent plane programming, does not need painstakingly to go to define a tie point.
Point of contact (point cut): be a structure of catching access point in essence.Usually calling of correlation technique in the prize procedure come at point of contact of definition.
Tangent plane (aspect): it is exactly tangent plane that point of contact and tie point combine, and is to a program module in the specific procedure, and this program module has comprised the concrete grammar of carrying out tangent plane.
Notice (advide): the run time version at point of contact is the code of the execution specific procedure that comprises in the tangent plane.
Destination object (target): the concrete object of tangent plane effect.
Agent object (proxy): tangent plane is through operation agent object, the concrete object of off-line operation.
Inweave (weaving): be meant that tangent plane uses the process of agent object.
After the notion and theory that make much of the relevant special use of the invention described above, further introduce practical implementation process of the present invention below: a kind of cloud storage engines building method towards tangent plane, as shown in Figure 1, comprise step:
Step 1: the designer makes up data access layer according to the type of database that is adopted.
The detailed process that makes up data access layer is following:
Step 11: confirm to use data storage method to be relevant database or non-relational database, respectively relevant database and non-relational database are set up data access layer; The concrete design as follows:
A. the spendable access mode of relevant database comprises:
ODBC (Open Database Connectivity): Open Database Connection,
JDBC (Java Database Connectivity): the java database connects,
ADO (ActiveX Data Objects): ActiveX Data Objects,
OLEDB (Object Linking and Embedding Database): object linking embeds database;
B. the spendable access mode of non-relational database comprises:
Key-Value: based on the storage mode of key-value pair;
Because the above-mentioned access mode of mentioning is the state of the art, therefore it is not launched to describe in detail.
Step 2: the designer carries out tangent plane to the data in the database.
Step 21: in relevant database; Data are the stored in form with table; Each row of table is exactly data, and each row of table are exactly the attribute that data have, because relevant database is only to data itself; And to the attribute of data, so can carry out tangent plane to the attribute of data.
The process of relevant database tangent plane is following:
The raw data table that the ergodic data storehouse is all is numbered every table, guarantees that numbering does not repeat;
Table numbering in the last step is stored in separately in another table;
To the data of raw data table, extract by row (row one attribute), the data of extracting are left in separately in the new tables of data; Again with the data number in the new tables of data; The data that all extract by row from raw data table, numbering corresponding in all new tables of data is consistent, and this numbering can be the major key in the raw data table; Also can use other modes to generate, but will guarantee that all data numbers in the new tables of data do not repeat.
Step 22: in non-relational database; Data are with the stored in form of key-value pair; Each bar data all can have data key and corresponding data value, so in to non-relational database tangent plane, only need the data key of data be stored in the table; The data value storage of data key correspondence obtains two new tables of data in another table.
More than the data with new data table stores are exactly the tangent plane data.
Step 3: the designer analyzes service request, and data operation tangent plane is obtained the tangent plane data.As shown in Figure 2, tangent plane operation can be a kind of abstract behavior, can be abstract be inquiry, newly-increased, modification, deletion, daily record etc. like the operation of data, and each operation promptly can be used as a tangent plane operation;
In Database Systems; The designer at first extracts the tangent plane of data manipulation, and the database manipulation step that this data manipulation is corresponding concrete, concrete database manipulation step need concrete database access mode again; The designer is packaged into a program with concrete database access mode; This program can be visited relevant database, also addressable non-relational database, and this program is as notice.
Application-interface layer can send request to server, and the program of sending request is an access point, after request is sent from access point; Services request is intercepted and captured in tangent plane operation, and the program of catching access point is as the point of contact, the request that captures through the point of contact; To judge the validity of request by the point of contact; If be invalidation request then tackle, if effectively request is just given notice with request and handled, notice is directed against concrete request can turn to concrete database object.
Concrete database object becomes the tangent plane data through the first step, and at this moment, the tangent plane data are exactly destination object; If destination object itself is the encapsulation to data, these encapsulation have just comprised the operation to True Data, then call agent object to the data object that has comprised the True Data operation; When the tangent plane operation will be handled the tangent plane data; Will handle agent object earlier,, realize operation the tangent plane data then through agent object.
The process of off-line operation tangent plane data is called and inweaves the operation of above-mentioned tangent plane through the operation agent object.
Step 4: on the basis of the tangent plane data that the designer builds, make up the cloud storage engines in step 3.
Because the storage of data itself still needs dependence type database and non-relational database; But because both textural differences are big; Cause visit to make mistakes during exchanges data easily; Therefore in the process of building the cloud storage engines, the data access mode of using step 1 to make up is come accessing database respectively.Reduce because the influence that the difference of database is brought with this.
Step 41: the construction process of relevant database storage engines comprises the steps:
A. deletion, renewal and the insertion operation with data mixes, and makes data manipulation that the size of data is produced storage fragmentation still less like this; Through merging adjacent storage block of being deleted, and if a storage block is deleted, the mode that just expands to next storage block can improve the efficient of storage.
B. set the largest index number of each table.Setting the maximum columns of each index is 64.Maximum key length is 1024 bytes.Surpass the situation of 250 bytes for key length, uses one above 1024 bytes the key piece.
If c. the table in the middle of the tables of data does not have the piece of suitable size, then newly-increased table comes auxiliary storage.
D. set a sign in the index file, it shows whether table is correctly closed.
E. set up lock mechanism.When visit data, lock, the process that detects deadlock just detects the existence of deadlock in the very short time after the produce of deadlock in system.In case detect and produced deadlock in the system, just select two operations of produce of deadlock through the time of judging request for data, let the operation of first to file carry out earlier.If the time of application is identical, then use timeout mechanism to discharge lock, two operations are not carried out.
Step 42: non-relational database construction storage engines construction process comprises the steps:
A. select available key assignments data structure:
Lists (tabulation),
Sets (set),
Sorted Sets (ordered set),
Hashes (Hash table),
The data type of key assignments has determined the operation that this key assignments is supported, like common factor, the union of tabulation, set or ordered set, look into senior atomic operation such as collection.
B. data key is stored high byte earlier, to allow a more index compression of high address, insert when writing down with sorted order, index tree is by reconstruct, so that high byte only comprises a key.To improve the storage efficiency of key assignments data structure.
C. data value is stored low byte earlier; Store high byte again; To reduce the dependence of the database environment that data value and data value were moved, the server of runtime database uses complement code and floating-point format to come presentation data value, and the byte in the data line is not generally united; From the byte that a direction is read not unite, like this can be so that server has higher efficient when obtaining train value.
D. the principal and subordinate is synchronous: the storage medium of non-relational database can be deployed in the system of isomery, so the data that are stored in the heterogeneous system database need be synchronous, to guarantee the consistance of data.
The system of isomery couples together through network; In network; Each heterogeneous system is exactly a memory node, and data in the memory node need synchronously, and needing will an overall timing mode; Make the memory node in the network in the regular hour, carry out data sync, the method for synchronization can have the primary storage node regularly with from regularly two kinds of memory nodes.Main timing working mode is as working method regularly with this node clock source.From the timing working mode be with a certain reference data time be standard, regularly working method again after this node clock source is locked.
Accomplish above-mentioned steps 1 after step 4, the tangent plane operation is accomplished, and uses soap protocol will handle tangent plane data conversion later and is the XML form, and return to the corresponding data of application-interface layer according to the needs of request.
Below in conjunction with an embodiment technical scheme of the present invention is done further description: suppose that certain university need set up a basketball team, need select the classmate who is fit to participate in screening from height, body weight, age, interest, three aspects of health condition.Use now towards the cloud storage engines of tangent plane programming and handle the screening request.
Step 1: make up data access layer.Because all classmates are not in same institute; Each collegian's data all is stored on the different servers; And only stored the data of height, body weight, age, interest on institute's server, and health condition is stored on the server of Hospital, and the database that uses on the server is the database software of different vendor; So will need set up the mechanism of a cover visit data to all disparate databases to this isomeric data storage.
Step 2: data are carried out tangent plane.After the mechanism of setting up the database data of visiting each institute and Hospital's database; All students' information is carried out tangent plane to be handled: the master data in the disparate databases is read from table; The attribute that students such as height, body weight, age, interest, health condition is all extracts separately and builds table, and related with student number.Data in height, body weight, age, interest, the health condition table are the tangent plane data, and the tangent plane data are exactly destination object.
Step 3: tangent plane is carried out in operation to data.Tangent plane is carried out in possible operation, though have only a kind of function of screening now, after the screening; Possibly write down in addition, notify, data manipulation such as ordering etc., so tangent plane is carried out in the operation that relates to, screening itself is exactly a tangent plane; And the program of sending operation requests such as screening is exactly an access point, receives screening and judges whether effective program is exactly the point of contact in screening, and the point of contact is after getting access to effective screening request; Request is distributed in the different handling procedures; These handling procedures are notified exactly, and notice has different institutes and hospital database access modes, and notice can be to screening requesting query tangent plane data; Every qualified tangent plane data will be returned.If itself does not comprise request msg the tangent plane data, during the age, have only date of birth information like request, change the date of birth so, the age will change accordingly, and then the date of birth is an agent object.The process of notifier processes agent object inweaves exactly.
Step 4: after all data that need have been obtained according to screening conditions, the tangent plane data of disperseing are reformulated related independent information, be presented on the screening requestor in face of, be to make up complete student data.
Those of ordinary skill in the art will appreciate that embodiment described here is in order to help reader understanding's principle of the present invention, should to be understood that protection scope of the present invention is not limited to such special statement and embodiment.Those of ordinary skill in the art can make various other various concrete distortion and combinations that do not break away from essence of the present invention according to these teachings disclosed by the invention, and these distortion and combination are still in protection scope of the present invention.
Claims (6)
1. the cloud storage engines building method towards tangent plane comprises the steps:
Step 1: the designer makes up data access layer according to the type of database that is adopted;
Step 2: the designer carries out tangent plane to the data in the database;
Step 3: the designer analyzes service request, and data operation tangent plane is obtained the tangent plane data;
Step 4: on the basis of the tangent plane data that the designer builds, make up the cloud storage engines in step 3.
2. a kind of cloud storage engines building method according to claim 1 towards tangent plane; It is characterized in that; The detailed process that makes up data access layer in the said step 1 is following: confirm to use data storage method to be relevant database or non-relational database, respectively relevant database and non-relational database are set up data access layer.
3. a kind of cloud storage engines building method towards tangent plane according to claim 1 is characterized in that the process to the relevant database tangent plane in the said step 2 comprises the steps:
The raw data table that the ergodic data storehouse is all is numbered every table, guarantees that numbering does not repeat;
Table numbering in the last step is stored in separately in another table;
To the data of raw data table, extract by row (row one attribute), the data of extracting are left in separately in the new tables of data; Again with the data number in the new tables of data; The data that all extract by row from raw data table, numbering corresponding in all new tables of data is consistent, and this numbering can be the major key in the raw data table; Also can use other modes to generate, but will guarantee that all data numbers in the new tables of data do not repeat.
4. a kind of cloud storage engines building method towards tangent plane according to claim 1 is characterized in that the process to non-relational database tangent plane in the said step 2 comprises the steps:
In the non-relational database; Data are with the stored in form of key-value pair; Each bar data all can have data key and corresponding data value, so in to non-relational database tangent plane, only need the data key of data be stored in the table; The data value storage of data key correspondence obtains two new tables of data in another table.
5. a kind of cloud storage engines building method towards tangent plane according to claim 1 is characterized in that, the detailed process to data operation tangent plane in the said step 3 comprises the steps:
In Database Systems; The designer at first extracts the tangent plane of data manipulation, and the database manipulation step that this data manipulation is corresponding concrete, concrete database manipulation step need concrete database access mode again; The designer is packaged into a program with concrete database access mode; This program can be visited relevant database, also addressable non-relational database, and this program is as notice;
Application-interface layer can send request to server, and the program of sending request is an access point, after request is sent from access point; Services request is intercepted and captured in tangent plane operation, and the program of catching access point is as the point of contact, the request that captures through the point of contact; To judge the validity of request by the point of contact; If be invalidation request then tackle, if effectively request is just given notice with request and handled, notice is directed against concrete request can turn to concrete database object;
Concrete database object becomes the tangent plane data through the first step, and at this moment, the tangent plane data are exactly destination object; If destination object itself is the encapsulation to data, these encapsulation have just comprised the operation to True Data, then call agent object to the data object that has comprised the True Data operation; When the tangent plane operation will be handled the tangent plane data; Will handle agent object earlier,, realize operation the tangent plane data then through agent object.
6. a kind of cloud storage engines building method towards tangent plane according to claim 1 is characterized in that the construction process of relevant database storage engines comprises the steps: in the step 4
A. deletion, renewal and the insertion operation with data mixes, and makes data manipulation that the size of data is produced storage fragmentation still less like this; Through merging adjacent storage block of being deleted, and if a storage block is deleted, the mode that just expands to next storage block can improve the efficient of storage;
B. set the largest index number of each table;
If c. the table in the middle of the tables of data does not have the piece of suitable size, then newly-increased table comes auxiliary storage;
D. set a sign in the index file, it shows whether table is correctly closed;
E. set up lock mechanism.
6. a kind of cloud storage engines building method towards tangent plane according to claim 1 is characterized in that the construction process of step 4 China-African tie type database construction storage engines comprises the steps:
A. select available key assignments data structure:
Lists (tabulation),
Sets (set),
Sorted Sets (ordered set),
Hashes (Hash table),
The data type of key assignments has determined the operation that this key assignments is supported, like common factor, the union of tabulation, set or ordered set, look into senior atomic operation such as collection;
B. data key is stored high byte earlier, to allow a more index compression of high address, insert when writing down with sorted order, index tree is by reconstruct, so that high byte only comprises a key, to improve the storage efficiency of key assignments data structure;
C. data value is stored low byte earlier; Store high byte again; To reduce the dependence of the database environment that data value and data value were moved, the server of runtime database uses complement code and floating-point format to come presentation data value, and the byte in the data line is not generally united; From the byte that a direction is read not unite, like this can be so that server has higher efficient when obtaining train value;
D. the principal and subordinate is synchronous: the storage medium of non-relational database can be deployed in the system of isomery, so the data that are stored in the heterogeneous system database need be synchronous, to guarantee the consistance of data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110367191.1A CN102495853B (en) | 2011-11-17 | 2011-11-17 | Aspect-oriented cloud storage engine construction method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110367191.1A CN102495853B (en) | 2011-11-17 | 2011-11-17 | Aspect-oriented cloud storage engine construction method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102495853A true CN102495853A (en) | 2012-06-13 |
| CN102495853B CN102495853B (en) | 2014-07-09 |
Family
ID=46187678
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110367191.1A Active CN102495853B (en) | 2011-11-17 | 2011-11-17 | Aspect-oriented cloud storage engine construction method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102495853B (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103390015A (en) * | 2013-01-16 | 2013-11-13 | 华北电力大学 | Mass data united storage method based on unified indexing and search method |
| CN103440130A (en) * | 2013-08-26 | 2013-12-11 | 成都金山数字娱乐科技有限公司 | Data processing method and device |
| CN103473328A (en) * | 2013-09-17 | 2013-12-25 | 中电长城网际***应用有限公司 | MYSQL (my structured query language)-based database cloud and construction method for same |
| CN103647815A (en) * | 2013-12-03 | 2014-03-19 | 清华大学 | An optimal storage cloud construction method based on erasure codes and selection factors |
| CN103744952A (en) * | 2014-01-02 | 2014-04-23 | 北京集奥聚合网络技术有限公司 | Method and system for implementing multi-table property of NoSQL database |
| CN105812436A (en) * | 2014-12-31 | 2016-07-27 | ***通信集团公司 | Heterogeneous storage operation method and device |
| CN108052551A (en) * | 2017-11-28 | 2018-05-18 | 北京航天云路有限公司 | A kind of method for a large amount of time series datas of storage realized on REDIS |
| CN108595490A (en) * | 2018-03-15 | 2018-09-28 | 北京雷石天地电子技术有限公司 | A kind of construction method and system of database retrieval mechanism |
| CN108650254A (en) * | 2018-05-08 | 2018-10-12 | 上海你我贷互联网金融信息服务有限公司 | A kind of encrypting and deciphering system for multi-tenant data |
| CN108880908A (en) * | 2018-07-09 | 2018-11-23 | 上海盛付通电子支付服务有限公司 | A kind of monitoring method and its server |
| CN109213760A (en) * | 2018-08-02 | 2019-01-15 | 南瑞集团有限公司 | The storage of high load business and search method of non-relation data storage |
| CN110688662A (en) * | 2019-09-16 | 2020-01-14 | 威富通科技有限公司 | Sensitive data desensitization and inverse desensitization method and electronic equipment |
| CN114528337A (en) * | 2022-01-12 | 2022-05-24 | 南湖实验室 | Interface system and universal interface for multi-source heterogeneous data source and implementation method thereof |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100235606A1 (en) * | 2009-03-11 | 2010-09-16 | Oracle America, Inc. | Composite hash and list partitioning of database tables |
-
2011
- 2011-11-17 CN CN201110367191.1A patent/CN102495853B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100235606A1 (en) * | 2009-03-11 | 2010-09-16 | Oracle America, Inc. | Composite hash and list partitioning of database tables |
Non-Patent Citations (5)
| Title |
|---|
| 《中国优秀硕士学位论文全文数据库》 20100515 杨继刚 《基于J2EE-SSH框架的小鼠信息数据库***的设计与实现-PBMICE-SR语义检索框架》 第六章 1-2 , 第05期 * |
| CHRISTIAN KASTNER等: "《A Case Study Implementing Features Using AspectJ》", 《SOFTWARE PRODUCT LINE CONFERENCE, 2007. SPLC 2007. 11TH INTERNATIONAL》 * |
| 杨继刚: "《基于J2EE-SSH框架的小鼠信息数据库***的设计与实现—PBMICE-SR语义检索框架》", 《中国优秀硕士学位论文全文数据库》 * |
| 赵培等: "《云计算技术及其应用》", 《中兴通讯技术》 * |
| 陈虎等: "《面向批量***优化的并行存储引擎MTPower》", 《计算机学报》 * |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103390015A (en) * | 2013-01-16 | 2013-11-13 | 华北电力大学 | Mass data united storage method based on unified indexing and search method |
| CN103390015B (en) * | 2013-01-16 | 2016-03-30 | 华北电力大学 | Based on mass data stored in association method and the search method of unified index |
| CN103440130A (en) * | 2013-08-26 | 2013-12-11 | 成都金山数字娱乐科技有限公司 | Data processing method and device |
| CN103473328A (en) * | 2013-09-17 | 2013-12-25 | 中电长城网际***应用有限公司 | MYSQL (my structured query language)-based database cloud and construction method for same |
| CN103647815A (en) * | 2013-12-03 | 2014-03-19 | 清华大学 | An optimal storage cloud construction method based on erasure codes and selection factors |
| CN103647815B (en) * | 2013-12-03 | 2017-04-12 | 清华大学 | An optimal storage cloud construction method based on erasure codes and selection factors |
| CN103744952A (en) * | 2014-01-02 | 2014-04-23 | 北京集奥聚合网络技术有限公司 | Method and system for implementing multi-table property of NoSQL database |
| CN105812436A (en) * | 2014-12-31 | 2016-07-27 | ***通信集团公司 | Heterogeneous storage operation method and device |
| CN108052551A (en) * | 2017-11-28 | 2018-05-18 | 北京航天云路有限公司 | A kind of method for a large amount of time series datas of storage realized on REDIS |
| CN108595490A (en) * | 2018-03-15 | 2018-09-28 | 北京雷石天地电子技术有限公司 | A kind of construction method and system of database retrieval mechanism |
| CN108650254A (en) * | 2018-05-08 | 2018-10-12 | 上海你我贷互联网金融信息服务有限公司 | A kind of encrypting and deciphering system for multi-tenant data |
| CN108880908A (en) * | 2018-07-09 | 2018-11-23 | 上海盛付通电子支付服务有限公司 | A kind of monitoring method and its server |
| CN109213760A (en) * | 2018-08-02 | 2019-01-15 | 南瑞集团有限公司 | The storage of high load business and search method of non-relation data storage |
| CN110688662A (en) * | 2019-09-16 | 2020-01-14 | 威富通科技有限公司 | Sensitive data desensitization and inverse desensitization method and electronic equipment |
| CN114528337A (en) * | 2022-01-12 | 2022-05-24 | 南湖实验室 | Interface system and universal interface for multi-source heterogeneous data source and implementation method thereof |
| CN114528337B (en) * | 2022-01-12 | 2024-03-15 | 南湖实验室 | Multi-source heterogeneous data source oriented interface system, universal interface and implementation method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102495853B (en) | 2014-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102495853B (en) | Aspect-oriented cloud storage engine construction method | |
| CN109492040B (en) | System suitable for processing mass short message data in data center | |
| US9009116B2 (en) | Systems and methods for synchronizing data in a cache and database | |
| US8117153B2 (en) | Systems and methods for a distributed cache | |
| US8892509B2 (en) | Systems and methods for a distributed in-memory database | |
| Padhy et al. | RDBMS to NoSQL: reviewing some next-generation non-relational database’s | |
| EP1840766B1 (en) | Systems and methods for a distributed in-memory database and distributed cache | |
| CN101183377B (en) | High availability data-base cluster based on message middleware | |
| US20090012932A1 (en) | Method and System For Data Storage And Management | |
| CN104484472B (en) | A kind of data-base cluster and implementation method of a variety of heterogeneous data sources of mixing | |
| CN102033912A (en) | Distributed-type database access method and system | |
| CN106815338A (en) | A kind of real-time storage of big data, treatment and inquiry system | |
| CN107209704A (en) | Detect the write-in lost | |
| CN101187888A (en) | Method for coping database data in heterogeneous environment | |
| CN105574667A (en) | Nuclear power design data integration method and system | |
| CN104050276A (en) | Cache processing method and system of distributed database | |
| WO2012108015A1 (en) | Data synchronization method, data synchronization program, and data synchronization control device | |
| CN102902777A (en) | Cross data source inquiry device and cross data source inquiry method | |
| CN109241054A (en) | A kind of multimodal data library system, implementation method and server | |
| CN104281980B (en) | Thermal power generation unit remote diagnosis method and system based on Distributed Calculation | |
| CN113407600B (en) | Enhanced real-time calculation method for dynamically synchronizing multi-source large table data in real time | |
| CN107423390A (en) | A kind of real time data synchronization algorithm based on inside OLTP OLAP mixed relationship type Database Systems | |
| CN107330017A (en) | A kind of electric power mass data storage and query and statistical analysis method and its system based on subject example | |
| CN107330098A (en) | A kind of querying method of self-defined report, calculate node and inquiry system | |
| US20180121532A1 (en) | Data table partitioning management method and apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent of invention or patent application | ||
| CB02 | Change of applicant information |
Address after: 610054 information industry building, 159 East Ring Road, Chengdu, Chenghua District, Sichuan Applicant after: Chengdu Comsys Information Technology Co., Ltd. Address before: 610054 information industry building, 159 East Ring Road, Chengdu, Chenghua District, Sichuan Applicant before: Uestc Comsys Information Co., Ltd. |
|
| CB03 | Change of inventor or designer information |
Inventor after: Tang Xuefei Inventor after: Wang Hailiang Inventor after: Shi Li Inventor after: Han Chunmei Inventor before: Tang Xuefei Inventor before: Wang Hailiang Inventor before: Shi Li |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: APPLICANT; FROM: CHENGDU KANGSAI INFORMATION TECHNOLOGY CO., LTD. OF UESTC TO: CHENGDU COMSYS INFORMATION TECHNOLOGY CO., LTD. Free format text: CORRECT: INVENTOR; FROM: TANG XUEFEI WANG HAILIANG SHI LI TO: TANG XUEFEI WANG HAILIANG SHI LI HAN CHUNMEI |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |