CN101833511B - Data management method, device and system - Google Patents
Data management method, device and system Download PDFInfo
- Publication number
- CN101833511B CN101833511B CN2010101365620A CN201010136562A CN101833511B CN 101833511 B CN101833511 B CN 101833511B CN 2010101365620 A CN2010101365620 A CN 2010101365620A CN 201010136562 A CN201010136562 A CN 201010136562A CN 101833511 B CN101833511 B CN 101833511B
- Authority
- CN
- China
- Prior art keywords
- data
- record
- tabulation
- retrieval
- search condition
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a data management method, a data management device and a data management system, relates to an embedded system and solves the problems of low efficiency and complex implementation of the conventional management ways of configuration data. The method comprises the following steps: establishing corresponding random access memory (RAM) data tables for each functional module in the embedded system; and storing the configuration data of the functional modules into the data groups of the corresponding RAM data tables of each of the functional modules. The technical scheme provided by the invention is suitable for the embedded system.
Description
Technical field
The present invention relates to embedded system, relate in particular to data managing method, device and system under a kind of embedded system.
Background technology
In the embedded communication equipment system, have more data manipulation (preserve, revise, inquire about), these data generally need the user to dispose, and are referred to as configuration data.In system's operational process, configuration data generally is kept in the internal memory (below be abbreviated as RAM), and the equipment that has also need be stored in the non-volatile media (below be abbreviated as NVRAM).
Existing data base management system (DBMS) all bigger (generally all more than million grades) commonly used.Receive hardware resource (cpu performance, RAM/NVRAM size) restriction, embedded communication system can't adopt these Database Systems to come the administration configuration data.Traditional configuration data management mode is at present: in internal memory, configuration data then distributed and saved is inner in each functional module, and form is also defined by each functional module voluntarily; When needs store NVRAM into, convert its configuration data of being responsible for into text formatting by each functional module again, store among the NVRAM.
The enhancing of As real-time communication system functionality, the quantity of system configuration data is also increasing rapidly.At this moment; Each functional module all is faced with same time efficiency problem when the configuration data that management is responsible for separately; All will preserve form and go to optimize respectively improvement, and the storage mode of text formatting storage space efficiency when configuration data quantity is big has also exposed according to configuration data separately.This makes conventional arrangement data management mode unavailable basically behind the big leap ahead of configuration data scale.
Summary of the invention
The invention provides a kind of data managing method, device and system, solved the low complicated problems that realizes of above-mentioned conventional arrangement data management mode efficient.
A kind of data managing method comprises:
Be respectively the corresponding RAM tables of data of each functional module foundation in the embedded system;
Configuration data in corresponding this functional module of RAM tables of data data set storage of each functional module.
Further, the step of said configuration data in corresponding this functional module of RAM tables of data data set storage of each functional module comprises:
Establishment comprises the record tabulation to be stored of said configuration data, and each record tabulation all comprises a major key;
When do not exist in the said RAM tables of data with said record to be stored tabulation in the identical record tabulation of major key field that comprised, then the afterbody in this RAM tables of data adds said record to be stored tabulation.
Further, the step of said configuration data in corresponding this functional module of RAM tables of data data set storage of each functional module also comprises:
When exist in the said RAM tables of data with said record tabulation to be stored in the identical record tabulation of major key field that comprised, then do not add said record to be stored and tabulate.
Further; Said RAM tables of data comprises at least one index; The corresponding forward concordance list of each index; Said forward concordance list is according to the record number of each record tabulation in this RAM tables of data of sequential storage of this group index, and said afterbody in this RAM tables of data adds after the step of said record tabulation to be stored, also comprises:
Use quick sorting algorithm that the forward concordance list of each group index is resequenced.
Further; The also corresponding reverse indexing table of each index; Each record tabulation by the record ranking after the rank order of this group index in this RAM tables of data of said reverse indexing table storage; After the step that said use quick sorting algorithm is resequenced to the forward concordance list of each group index, also comprise:
The reverse indexing table of each group index is according to the forward concordance list of correspondence, and change is the record ranking of storage wherein.
Further, above-mentioned data managing method also comprises:
The instruction of reception search records comprises at least one search condition in this instruction;
Retrieve respectively according to each search condition, obtain the result for retrieval set of each search condition, said search condition is specially the span or the designated value of a field;
Get the result for retrieval of the common factor of each result for retrieval set as search records.
Further, the said common factor of getting the set of each result for retrieval comprises as the step of the result for retrieval of search records:
Be respectively each result for retrieval set and make up a bitmap, record number is the record tabulation of k in the corresponding RAM tables of data of the k bit of this bitmap;
Back one result for retrieval set is added to during result for retrieval set before it occurs simultaneously, and the bitmap that obtains occuring simultaneously is changed to 1 with the corresponding bit value of record tabulation in occuring simultaneously in this bitmap;
Behind the common factor of having got the set of whole result for retrieval, be that the set of tabulating of 1 the corresponding record of bit is as result for retrieval with bit value in the bitmap that finally obtains.
Further, above-mentioned data managing method also comprises:
Receive modify instruction, comprise at least one search condition in the said modify instruction;
According to said search condition, retrieve corresponding record tabulation;
Said record tabulation is made amendment.
Further, above-mentioned data managing method also comprises:
Receive delete instruction, comprise at least one search condition in the said delete instruction;
According to said search condition, retrieve corresponding record tabulation;
Delete said record tabulation.
Further, above-mentioned data managing method also comprises:
Receive the instruction of retrieval next record, comprise at least one search condition in this instruction;
Retrieve successively according to each search condition, obtain the result for retrieval set of each effective search condition respectively;
Get the common factor of each result for retrieval set;
Inquire about the reverse indexing table in the corresponding index of last effective search condition, obtain the record ranking of each the record tabulation in the said common factor;
The record tabulation that the record ranking is minimum is as the result for retrieval of retrieval next record.
Further, above-mentioned data managing method also comprises:
Set up the nvram data storehouse, in said nvram data storehouse, be respectively the corresponding nvram data table of each functional module foundation in the embedded system, the current record of said NVRAM data table memory and capacity;
Through writing down tabulation synchronously between the corresponding RAM tables of data of the naked medium of direct read each functional module in said nvram data storehouse and embedded system.
Further, saidly comprise through writing down the synchronous step of tabulation between the corresponding RAM tables of data of the naked medium of direct read each functional module in said nvram data storehouse and embedded system:
Adopt the mode that directly reads naked medium that the tabulation of the record in the said nvram data table is read in the internal memory, join in the corresponding RAM tables of data, and delete the record tabulation of storing among the said NVRAM; Or,
The synchronous mark of each record tabulation in the inspection RAM tables of data writes this synchronous mark in the corresponding nvram data table for the record tabulation of synchronous regime not, and changes the synchronous mark of said record tabulation into synchronous regime.
The present invention also provides a kind of data administrator, comprising:
The RAM tables of data is set up module, is used for being respectively each functional module of embedded system and sets up corresponding RAM tables of data;
Data memory module is used for the configuration data in corresponding this functional module of RAM tables of data data set storage of each functional module.
Further, above-mentioned data administrator also comprises:
The search records module; Be used to receive the search records instruction; Comprise at least one search condition in this instruction, respectively the RAM tables of data data set of said data memory module storage is retrieved, obtain the result for retrieval set of each search condition according to each search condition; Said search condition is specially the span or the designated value of a field, gets the result for retrieval of the common factor of each result for retrieval set as search records.
Further, above-mentioned data administrator also comprises:
Retrieval next record module; Be used for receiving the instruction of retrieval next record; Comprise at least one search condition in this instruction; Successively the RAM tables of data data set of said data memory module storage is retrieved according to said search condition, obtained the result for retrieval set of each effective search condition respectively, inquire about the reverse indexing table in the corresponding index of last effective search condition; Obtain the record ranking of each the record tabulation in the said result for retrieval set, and will write down the result for retrieval of the minimum record tabulation of ranking as the retrieval next record.
Further, above-mentioned data administrator also comprises:
Modified module; Be used to receive modify instruction, comprise at least one search condition in the said modify instruction, according to said search condition; The RAM tables of data data set of retrieving said data memory module storage obtains corresponding record tabulation, and said record tabulation is made amendment.
Further, above-mentioned data administrator also comprises:
Removing module; Be used to receive delete instruction, comprise at least one search condition in the said delete instruction, according to said search condition; The RAM tables of data data set of retrieving said data memory module storage obtains corresponding record tabulation, and said record tabulation is made amendment.
The present invention also provides a kind of data management system, comprises data administrator;
Said data administrator is used for being respectively each functional module of embedded system and sets up corresponding RAM tables of data, and stores the configuration data of this functional module at the corresponding RAM tables of data data set of each functional module.
Further, above-mentioned data management system also comprises the nvram data storehouse;
Said nvram data storehouse; Be used for being respectively each functional module of embedded system and set up corresponding nvram data table, and through read write down between the corresponding RAM tables of data of naked medium each functional module in said nvram data storehouse and embedded system tabulate synchronous.
Further; Said data administrator also is used to receive the search records instruction, comprises at least one search condition in this instruction; Retrieve respectively according to each search condition; Obtain the result for retrieval set of each search condition, said search condition is specially the span or the designated value of a field, gets the result for retrieval of the common factor of each result for retrieval set as search records; And/or
Receive the instruction of retrieval next record; Comprise at least one search condition in this instruction; Retrieve successively according to said search condition, obtain the result for retrieval set of each effective search condition respectively, inquire about the reverse indexing table in the corresponding index of last effective search condition; Obtain the record ranking of each the record tabulation in the said result for retrieval set, and will write down the result for retrieval of the minimum record tabulation of ranking as the retrieval next record; And/or
Receive modify instruction, comprise at least one search condition in the said modify instruction,, retrieve corresponding record tabulation, said record tabulation is made amendment according to said search condition; And/or
Receive delete instruction, comprise at least one search condition in the said delete instruction,, retrieve corresponding record tabulation, said record tabulation is made amendment based on said search condition.
Embodiments of the invention provide a kind of data managing method, device and system; In the RAM database, be respectively the corresponding RAM tables of data of each functional module foundation in the embedded system; At the configuration data of corresponding this functional module of RAM tables of data data set storage of each functional module, realized making database structure simpler to the unified management of each functional block configuration data form in the embedded system; Simplify implementation, improved data storage efficiency.Use bitmap a plurality of retrieval set conjunction to be occured simultaneously the linear efficiency that has realized getting common factor.Nvram data storehouse through the relation database table format; Also improved the efficient of configuration data storage space; Also use the mode of the naked medium of direct read NVRAM in this course, shortened the access time, reduced system's shared system resource during writing NVRAM.In addition,, also realized the function that makes RAM database " retrieval is next " of embedded system data base, for all functions module has solved among the SNMP time efficiency problem to " retrieval is next " function of configuration data through using the reverse indexing table.
Description of drawings
Fig. 1 is the logical organization synoptic diagram of the employed RAM database of embodiments of the invention;
Fig. 2 is the structural representation of the employed record tabulation of embodiments of the invention;
The process flow diagram of a kind of data managing method that Fig. 3 provides for embodiments of the invention one;
Fig. 4 is the particular flow sheet of step 302 among Fig. 3;
The process flow diagram of a kind of data managing method that Fig. 5 provides for embodiments of the invention two;
Fig. 6 is the particular flow sheet of step 502 among Fig. 5;
Fig. 7 is the particular flow sheet of step 503 among Fig. 5;
Fig. 8 is the particular flow sheet of step 504 among Fig. 5;
Fig. 9 is the particular flow sheet of step 505 among Fig. 5;
The process flow diagram of a kind of data managing method that Figure 10 provides for embodiments of the invention three;
Figure 11 is for obtaining the particular flow sheet of each effective search condition retrieval set in the embodiments of the invention three;
Figure 12 is for obtaining the particular flow sheet that each effective search condition retrieval set is occured simultaneously in the embodiments of the invention three;
Figure 13 is the particular flow sheet of step 1003 among Figure 10;
The process flow diagram of a kind of data managing method that Figure 14 provides for embodiments of the invention four;
The nvram data library structure synoptic diagram that Figure 15 uses for embodiments of the invention;
The structural representation of a kind of data administrator that Figure 16 provides for embodiments of the invention;
The structural representation of a kind of data administrator that Figure 17 provides for another embodiment of the present invention.
Embodiment
The enhancing of As real-time communication system functionality, the quantity of system configuration data is also increasing rapidly.At this moment; Each functional module all is faced with same time efficiency problem when the configuration data that management is responsible for separately; All will preserve form and go to optimize respectively improvement, and the storage mode of text formatting storage space efficiency when configuration data quantity is big has also exposed according to configuration data separately.This makes conventional arrangement data management mode unavailable basically behind the big leap ahead of configuration data scale.
In addition, in the real-time communication system of supporting Simple Network Management Protocol (hereinafter to be referred as SNMP), except needs are retrieved, add, revise, the deletion configuration data clauses and subclauses, also needed each functional module that the function of " the retrieval next one " configuration data clauses and subclauses is provided.When the big leap ahead of configuration data scale, this makes each functional module all run into the time efficiency problem equally.
In order to address the above problem; Embodiments of the invention provide a kind of data managing method; The logical organization of the RAM database that uses in the embodiment of the invention is as shown in Figure 1; At least one index 102 by a plurality of RAM tables of data 101 and each RAM tables of data is formed, the functional module in the corresponding embedded system of each tables of data.In each tables of data with record tabulation be the unit store configuration data, the record tabulation is an array, structure is as shown in Figure 2, array index is the record number that record is tabulated.Each index among Fig. 1 is an index field in the corresponding diagram 2 all, the corresponding again forward concordance list 1021 of each index and a reverse indexing table 1022, as can be seen from Figure 1; The forward concordance list is according to the record number of each record tabulation in this RAM tables of data of sequential storage of this group index; For example, storing record tabulation 1,2,3,4 in the tables of data, wherein; After sorting according to index field T1 order from small to large; Just obtain the forward concordance list of index T1, this table has reflected each record tabulation ordering on field T1, is followed successively by record tabulation 2,4,1,3; Each record tabulation by the record ranking after the rank order of this group index in this RAM tables of data of reverse indexing table storage; After the forward concordance list is accomplished ordering; The record ranking (i.e. position after the ordering) that can know record tabulation 2 is 1; Just on second position of reverse indexing table, store 1, the rest may be inferred.The reverse indexing table is the record ranking of stored record tabulation only, and when the maximum table record number of system was no more than 64K, every 16 of use of reverse indexing table got final product, and can save 50% RAM expense.The reverse indexing table is modify when interpolation, modification, deletion record tabulation, to safeguard the correctness of reverse indexing table.
Below in conjunction with above-mentioned accompanying drawing, describe using embodiments of the invention one.Embodiments of the invention one provide a kind of data managing method, in conjunction with Fig. 1 and RAM database shown in Figure 2, have realized data storage, and idiographic flow is as shown in Figure 3, comprising:
In this step, when the RAM data base initialize, confirm capacity, table record length, major key and at least one index of each RAM tables of data respectively, be said RAM tables of data and at least one index assignment memory source.
Each RAM tables of data must define a major key, is used for each bar record tabulation of unique differentiation table, and major key can comprise one or more fields of record tabulation; Each tables of data can also define one or more groups index, is used for fast from the table retrieval.Every group index takies a field of table.Generally, the formation field of major key all is defined as index.
Each index of each tables of data, corresponding two concordance lists: one is this index value record number table that sorts (hereinafter to be referred as the forward concordance list) from small to large by each record; One is each reverse ordering ranking list (hereinafter to be referred as the reverse indexing table) that writes down.These two concordance lists upgrade when interpolation, modification and deletion record tabulation, when retrieval, use.
Wherein, when the RAM database is not supported to retrieve Next function, can not create the reverse indexing table.
Specifically as shown in Figure 4 in this step; When a functional module of embedded system needs store configuration data; At first generate one or more record tabulations that comprise above-mentioned configuration data; After each field that defines this record tabulation, the record tabulation that this is to be stored is input in the RAM database, uses quick sorting algorithm that the record tabulation to be stored of input is sorted by the RAM database.Then; Whether there are two major key fields in the adjacent records tabulation identical in the record tabulation a plurality of to be stored after the judgement ordering; If exist; Then return failed message, have the phenomenon of repetition to exist during indication record to be stored is tabulated in this failed message, can also carry the major key or the record number of the record tabulation of repetition; Otherwise; Further judge in the RAM database, whether to exist and the identical record tabulation of record to be stored tabulation major key field; And when existing, return failed message with the identical record of this record to be stored tabulation major key field, do not store this record tabulation; When not having the identical record of major key field, record to be added is copied to the tables of data afterbody, its record number increases progressively after original dominant record numbering successively.Afterwards, all forward concordance lists of initialization are specially the rank order according to record number; Use the quick sorting algorithm forward concordance list rearrangement corresponding at last, and upgrade the reverse indexing table according to the forward concordance list after the rearrangement to all index fields of this RAM tables of data.
When record table data to be stored when less (as being less than 100), also can use and insert ranking method and combine two methods, record tabulation to be stored is joined in the forward concordance list one by one, upgrade the reverse indexing table again.
Below in conjunction with accompanying drawing, embodiments of the invention two are described.
Embodiments of the invention two provide a kind of data managing method, can retrieve the tabulation of the record in the RAM database, and idiographic flow is as shown in Figure 5, comprising:
In this step, a plurality of search condition logics with, search condition specifically can specified within the span for certain field, perhaps certain field equals designated value.The literary name section that relates in the search condition all belongs to same RAM tables of data, and on this field, has defined index, and result for retrieval is fixed as all table records that satisfy search condition.
Need to prove, can specify one or more index (being the relation of logical and between the index condition) during actual retrieval as required, even can not specify any index (this moment, result for retrieval was all records).
In this step, obtain the result for retrieval of each search condition through dichotomy respectively and gather, wherein; Need to prove; When tables of data is empty or has an invalid search condition (promptly tabulating less than record according to this search condition retrieval), think and retrieve failure, return empty set; At N=0, when promptly not importing search condition, return the complete or collected works of record tabulation in the RAM tables of data.
Specifically as shown in Figure 6, the N on the input data table T index { TI
i| i=1,2 ..., N} and the span { (Tmin on this N index
i, Tmax
i) | Tmin
iBe lower bound (containing), Tmax
iBe the upper bound (containing), i=1,2 ..., N}; Whether the judgment data table is empty then, if be empty, then returns empty set, if be not empty, judges then whether N equals 0; If N is 0, return complete or collected works, otherwise r is the minimum index number of retrieval set in the assigned indexes tabulation, is used to use dichotomy to accomplish and detects; The initial value of r and i all is set to 1, then at forward concordance list TI
iLast with binary search first more than or equal to Tmin
iRecord ranking O
IsWith last smaller or equal to Tmax
iRecord ranking O
Ie, O
RsAnd O
ReBe illustrated respectively in initial ordering ranking of outcome record and end ordering ranking on the r index; If do not find qualified record ranking, then return empty set, otherwise, further judge O
Ie, O
Is, O
ReAnd O
RsConcrete, if O
Ie-O
Is＜O
Rs-O
Re, r:=i then, and with i:=i+1; Afterwards, i and N are compared, concrete, if i＜=N then continues to use binary search, otherwise counts result set { [O on each index
Is, O
Ie] | i=1,2 ..., not complete or collected works' number M, wherein [O among the N}
Is, O
Ie] represent that ranking is at O
IsAnd O
IeBetween all records; Further judge the value of M, if index I is then returned in M＜=1
rOn result set [O
Rs, O
Re], otherwise get into step 503.
In this step; All corresponding bitmap of result for retrieval set that each search condition retrieval is obtained, record number is the record tabulation of k in the corresponding RAM tables of data of the k bit of bitmap, if search condition is satisfied in this record tabulation; Then this bit is changed to 1, otherwise is changed to 0.
According to the method described above, each result for retrieval is gathered handled successively, back one result for retrieval set is added in its result for retrieval set common factor before, the processing until accomplishing whole result for retrieval set obtains final result for retrieval.
Specifically as shown in Figure 7, for example, input data table T is at N index { TI
i| i=1,2 ..., the interval { [O of result set that N} is last
Is, O
Ie] | i=1,2 ..., N} counts the minimum index TI of outcome record number
r, judge TI then
rOn the outcome record number be 0, if then return empty set, otherwise define a bitmap bitmap [0..1], wherein 0,1 is the bitmap numbering; The k bit of bitmap representes that record number is that the record of k is whether in result set, with TI
rLast result set all is identified on the bitmap 0; Variable b is set, is used to obtain final result for retrieval, when initial b:=0 is set, i:=0 handles i according to i:=i+1 then; I and N are compared, if i＞N then returns TI
rThose records of mark on bitmap [b] in the result set, otherwise judge i=r or TI
iOn result set be complete or collected works; When judged result is complete or collected works, i is carried out the processing of i:=i+1, when judged result is not complete or collected works that bitmap bitmap [1-b] is clear 0, to [O
Is, O
Ie] each record, if its mark in bitmap bitmap [b], this record of marked in bitmap [1-b] then, and the value of b is handled according to b:=1-b carries out the processing of i:=i+1 again, and i and N is compared again, to determine whether to return TI to i
rThose records of mark on bitmap [b] in the result set.
Use bitmap can improve the overall efficiency of retrieval.When calculating two intersection of sets collection that N and M element arranged respectively, efficient generally is N*M, and when using bitmap, efficient is N+M.
Need to prove, in same RAM tables of data, possibly have all identical a plurality of record tabulations of one or more index values, so final result for retrieval can be a record tabulation, also can be a plurality of record tabulations of all satisfying whole search conditions.
Accomplish on the basis of retrieval to 503 in step 501, can also realize being stored in the modification and the deletion of the record tabulation in the RAM tables of data, after retrieving the list records that needs operation, to its make amendment or the step of deleting following.
Configuration data stored in step 504, the modification RAM tables of data;
In this step, receive modify instruction after, retrieve the tabulation of corresponding record, the replacement of making amendment based on the search condition of carrying in the modify instruction.If have the identical record tabulation of many adjacent major key fields in the RAM tables of data, think that then the RAM tables of data makes a mistake, and returns failed message; Or in the RAM tables of data, when not having the record tabulation that meets search condition, return failed message.
After having revised the record tabulation,, upgrade the whole forward concordance lists and the reverse indexing table of this RAM tables of data according to amended result.
Specifically as shown in Figure 8; For example; Import the record tabulation of one group of tables of data T that will revise, use quick sorting algorithm that the record tabulation of input is sorted, and judge in the record tabulation after the ordering whether have the identical adjacent record of major key field; If exist then return failure, if do not exist then call process shown in Figure 6 and confirm that to be revised all are recorded in the tables of data and whether exist; After calling process shown in Figure 6; If judged result is not for existing; Then return failure; Otherwise be substituted into the record in the tables of data with record to be revised, use quick sorting algorithm then the forward concordance list rearrangement of this table on all non-major key member fields (according to the manipulative indexing value of the table record of representative) with identical major key; According to all the forward concordance lists after changing directly upgrade the reverse indexing table (in the known forward concordance list ranking be k record be numbered D
k, then be numbered D in the reverse indexing table
kThe ranking of record be k), return success.
Configuration data stored in step 505, the deletion RAM tables of data;
In this step, receive delete instruction, according to the corresponding record tabulation of the retrieval of the search condition in the delete instruction; And after retrieving the record tabulation that needs deletion; Carry out deletion, after deletion is accomplished, also need the whole forward concordance lists and the reverse indexing table of this RAM tables of data be upgraded.
Detailed process is as shown in Figure 9, for example, and N index { TI on the input data table T at first
i| i=1,2 ..., N} and the span { (Tmin on this N index
i, Tmax
i) | Tmin
iBe lower bound (containing), Tmax
iBe the upper bound (containing), i=1,2 ..., N} calls the record set R that process shown in Figure 6 is met condition then; The last item record in the table is moved to the memory location that j to be deleted writes down, and the ranking O that j writes down in two concordance lists of modify
j=O
Last, D
Olast=j wherein, is numbered the ranking of the record of j, O in the expression reverse indexing table
LastThe ranking of the record of numbering maximum in the expression reverse indexing table, D
OlastRanking is O in the expression forward concordance list
LastThe numbering of record; At last with ranking in the reverse indexing table greater than O
jThe ranking of all records subtract 1, return success.
Below in conjunction with accompanying drawing, embodiments of the invention three are introduced.
Embodiments of the invention three provide a kind of data managing method, use this method, can realize " retrieval next record " function of embedded system data base, and idiographic flow is shown in figure 10, comprising:
In this step, obtain corresponding result for retrieval set according to each search condition successively, result for retrieval is not effective search condition for empty search condition, when the result for retrieval of finding a search condition is empty set (promptly this search condition is invalid), stops retrieval.
Specifically shown in figure 11, for example, the index { TI of N＞0 on the step 1101 input data table T
i| i=1,2 ..., N} and the value { Tv on this N index
i| i=1,2 ..., N}, step 1102 i is set to i=1, and step 1103 is at forward concordance list TI
iLast with binary search first more than or equal to Tv
iRecord ranking O
Is(being table record number+1 when can not find) and last is smaller or equal to Tv
iRecord ranking O
Ie(being 0 when can not find); In step 1104, compare O then
IsAnd O
IeIf, O
Is＜=O
IeThen get into step 1105, otherwise get into step 1108; In the step 1105 with TI
rLast result set all is identified on the bitmap 0; Step 1106 is the relation of i and N relatively, if i＜=N then return step 1103, otherwise entering step 1107; Step 1107 is handled i according to i:=i-1; Step 1108 is O relatively
IsAnd O
IeIf, O
Is＜=O
IeThen get into step 1110, otherwise get into step 1109.
In the step 1109, compare O
IsWith the table record number, if O
Is＞table record number then gets into step 1115, otherwise gets into step 1110; In the step 1110, O
Ie:=table record number gets into step 1113 then.
In the step 1111, compare O
IeWith the table record number, if O
Ie=table record number then gets into step 1115, otherwise gets into step 1112; O in the step 1112
Is:=O
Ie+ 1, O
Ie:=table record number gets into step 1113 then.
I:=i-1 in the step 1115 gets into step 1116; In the step 1116,, otherwise return empty set if step 1118 is then returned in i＞=1.
After stopping retrieval, get the common factor of each result for retrieval set of having obtained, idiographic flow is shown in figure 12, and for example, input data table T is at N index { TI in the step 1201
i| i=1,2 ..., the interval { [O of result set that N} is last
Is, O
Ie] | i=1,2 ..., N}; Step 1202 counts the minimum index TI of outcome record number
rJudge TI in the step 1203
rOn the outcome record number whether be 0, if be 0 then return empty set, otherwise get into step 1204; A definition bitmap bitmap [0..1] in the step 1204 wherein 0,1 numbers for bitmap, and the k bit of bitmap representes that record number is that the record of k is whether in result set; Step 1205 is with TI
rLast result set all is identified on the bitmap 0; Make b:=0 in the step 1206, i:=0; Make i:=i+1 in the step 1207; The words of i＞N get into step 1213 in the step 1208, otherwise get into step 1209; Step 1209 is judged i=r or TI
iOn result set whether be complete or collected works, if then get into step 1211, otherwise get into step 1210; Step 1210 is with bitmap bitmap [1-b] clear 0; Step 1211 is to [O
Is, O
Ie] each record, if its mark in bitmap bitmap [b], then mark should write down (common factor on the preceding i index) among bitmap [1-b]; Step 1212 is carried out the processing of b:=1-b, gets back to step 1207 then.
Judge in the step 1213 whether total common factor R is empty set, if return empty set, if not then getting into step 1214; From total common factor R, find the minimum record of ranking on the N index in the step 1214, the N index value of this record is made as Tv
NStep 1215 is at forward concordance list TI
NLast with binary search first more than or equal to given record Tv
NRecord ranking O
BNWith last smaller or equal to given record Tv
NRecord ranking O
1N(all must find) returned R and interval [O
BN, O
1N] common factor.
In this step, at first obtain the corresponding reverse indexing table of last effective search condition, the record tabulation that the record ranking of storing in this reverse indexing table is minimum is as the result for retrieval of retrieval next record.
Specifically shown in figure 13, for example, the record of step 1301 input data table T tabulation R={i|i is a record number, i=1 ..., M} and N index { TI
i| i=1,2 ..., N}, step 1302 is carried out the processing of i:=1 then; Step 1303 is utilized TI
iThe reverse indexing table obtain among the R ranking tabulation L={O of each record
j| j=1 ..., M}; Step 1304 counts the minimum ranking O among the L
k, the i index value of establishing this record is made as Tv
iStep 1305 is at forward concordance list TI
iLast with binary search first more than or equal to Tv
iRecord ranking O
IsWith last smaller or equal to Tv
iRecord ranking O
Ie(all must find); Step 1306 is carried out R:=R and interval [O
Is, O
Ie] the processing of common factor; Step 1307 is carried out the processing of i:=i+1; Step 1308 is i and N relatively, if i＞N then returns R, otherwise gets into step 1303.
Special; When the minimum record tabulation of record ranking is two or more, can be in these a plurality of records tabulations, according to the reverse indexing table of last effective search condition; Obtain the minimum record tabulation of last effective search condition record ranking as result for retrieval; And the like, be merely a record tabulation up to result for retrieval, or till having used whole effective search conditions to screen.
Below in conjunction with accompanying drawing, embodiments of the invention four are described.
Embodiments of the invention four provide a kind of data managing method; Set up a RAM database and a nvram data storehouse,, improved reliability of data storage through these data are carried out backed up in synchronization in these two databases; Idiographic flow is shown in figure 14, comprising:
The nvram data library structure that embodiments of the invention use is shown in figure 15, and the only current record of data table memory and capacity in the nvram data storehouse are not stored major key, index definition and concordance list
The nvram data table be created in system initialization the time carry out, data list structure system run duration remains unchanged.After the initialization of RAM Database Systems, during system initialization,,, be that this table distributes the NVRAM space then according to this NVRAM table of this table information creating of RAM database if there is not certain nvram data table in the nvram data storehouse.
In this step, at first RAM tables of data record is synchronized to corresponding nvram data table, for avoiding not having to the NVRAM programming tables of data of variation, the RAM database provides a synchronous mark for each RAM tables of data.Record in a certain RAM tables of data tabulation is being added, revised, when deleting, the synchronous mark of this RAM tables of data be changed to not synchronous regime.When carrying out the RAM tables of data to nvram data table synchronous, only synchronous mark is not carried out synchronous operation for the RAM tables of data of synchronous regime, direct return is successfully for synchronously the time for synchronous mark.
After RAM tables of data record is synchronized to corresponding nvram data table; Again the nvram data table record is synchronized in the corresponding RAM tables of data; At first adopt the mode that directly reads naked medium that all nvram data table records are read in the internal memory; And all records of the corresponding RAM tables of data of deletion, call again " adding RAM tables of data record " process will above the nvram data table that reads join corresponding RAM tables of data.
When system initialization, because the RAM tables of data is blank, so generally when system initialization, can carry out by nvram data table synchronous to the RAM tables of data.
Can adopt the mode of directly writing naked medium to write the nvram data table in the time of synchronously, shorten the programming time.
Embodiments of the invention provide a kind of data managing method; Through simplifying the function of relational database system; Use forward and reverse indexing table; Solved configuration data efficiency retrieval time for all functions module is concentrated, made RAM database retrieval efficient reach the order of magnitude of log (n), wherein n is the physical record number of tables of data; Concerning the less middle-size and small-size real-time communication system of common several ten thousand of single table capacity, index number, this makes the database retrieval time almost become constant.
In the embodiments of the invention two and three, use bitmap a plurality of retrieval set conjunction to be occured simultaneously the linear efficiency that has realized getting common factor.And in the embodiments of the invention four; Nvram data storehouse through the relation database table format; Also improved the efficient of configuration data storage space; Also use the mode of the naked medium of direct read NVRAM in this course, shortened the access time, reduced system's shared system resource during writing NVRAM.
In addition; Through using forward and reverse indexing table; Also realized the function that makes RAM database " retrieval next " of embedded system data base, for all functions module has solved among the SNMP time efficiency problem to " retrieval is next " function of configuration data.
The data managing method that embodiments of the invention provide; Also with relation database table format nvram data storehouse; Improved configuration data storage space efficient greatly; And adopt the mode of the naked medium of direct read NVRAM, and shortened the access time, reduced system's influence to other function of system during writing NVRAM.The data managing method that the use embodiments of the invention provide is to storage and administration configuration data, and the Database Systems object code is no more than 30Kbyte, has significantly reduced taking of hardware resource, can effectively reduce equipment cost.
Embodiments of the invention also provide a kind of data administrator, and its structure is shown in figure 16, comprising:
The RAM tables of data is set up module 1601, is used for being respectively each functional module of embedded system and sets up corresponding RAM tables of data;
Further, above-mentioned data administrator is shown in figure 17, also comprises:
Retrieval next record module 1604; Be used for receiving the instruction of retrieval next record, comprise at least one search condition in this instruction, retrieve successively based on said search condition; Obtain the result for retrieval set of each effective search condition respectively; Inquire about the reverse indexing table in the corresponding index of last effective search condition, obtain the record ranking of each the record tabulation in the said result for retrieval set, and will write down the result for retrieval of the minimum record tabulation of ranking as the retrieval next record;
Removing module 1606 is used to receive delete instruction, comprises at least one search condition in the said delete instruction, according to said search condition, retrieves corresponding record tabulation, and said record tabulation is made amendment.
Embodiments of the invention also provide a kind of data management system, comprise data administrator;
Said data administrator is used for being respectively each functional module of embedded system and sets up corresponding RAM tables of data, and stores the configuration data of this functional module at the corresponding RAM tables of data data set of each functional module.
Further, above-mentioned data management system also comprises the nvram data storehouse;
Said nvram data storehouse is used for being respectively each functional module of embedded system and sets up corresponding nvram data table, and in said nvram data storehouse and embedded system, write down between the corresponding RAM tables of data of each functional module tabulate synchronous.
Further; Said data administrator also is used to receive the search records instruction, comprises at least one search condition in this instruction; Retrieve respectively according to each search condition; Obtain the result for retrieval set of each search condition, said search condition is specially the span or the designated value of a field, gets the result for retrieval of the common factor of each result for retrieval set as search records; And/or
Receive the instruction of retrieval next record; Comprise at least one search condition in this instruction; Retrieve successively according to said search condition, obtain the result for retrieval set of each effective search condition respectively, inquire about the reverse indexing table in the corresponding index of last effective search condition; Obtain the record ranking of each the record tabulation in the said result for retrieval set, and will write down the result for retrieval of the minimum record tabulation of ranking as the retrieval next record; And/or
Receive modify instruction, comprise at least one search condition in the said modify instruction,, retrieve corresponding record tabulation, said record tabulation is made amendment according to said search condition; And/or
Receive delete instruction, comprise at least one search condition in the said delete instruction,, retrieve corresponding record tabulation, said record tabulation is made amendment based on said search condition.
Above-mentioned data administrator and data management system; Can combine with a kind of data managing method that embodiments of the invention provide; In the RAM database, be respectively the corresponding RAM tables of data of each functional module foundation in the embedded system; At the configuration data of corresponding this functional module of RAM tables of data data set storage of each functional module, realized making database structure simpler to the unified management of each functional block configuration data form in the embedded system; Simplify implementation, improved data storage efficiency.In addition, also realize " retrieval next record " function in the embedded system, further improved the efficient of configuration data management in the embedded system.
One of ordinary skill in the art will appreciate that and realize that all or part of step that the foregoing description method is carried is to instruct relevant hardware to accomplish through program; Described program can be stored in a kind of computer-readable recording medium; This program comprises one of step or its combination of method embodiment when carrying out.
In addition, each functional unit in each embodiment of the present invention can adopt the form of hardware to realize, also can adopt the form of software function module to realize.If said integrated module realizes with the form of software function module and during as independently production marketing or use, also can be stored in the computer read/write memory medium.
The above-mentioned storage medium of mentioning can be a ROM (read-only memory), disk or CD etc.
The above; Be merely embodiment of the present invention, but protection scope of the present invention is not limited thereto, any technician who is familiar with the present technique field is in the technical scope that the present invention discloses; Can expect easily changing or replacement, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the described protection domain of claim.
Claims (14)
1. a data managing method is characterized in that, the configuration data uniform format management to each functional module in the embedded system comprises:
Be respectively the corresponding RAM tables of data of each functional module foundation in the embedded system; Tabulating with record in each RAM tables of data is the unit store configuration data; The record tabulation is an array; Said RAM tables of data comprises at least one index; The corresponding forward concordance list of each index and a reverse indexing table, said forward concordance list is by each writes down the record number of each record tabulation of this index value sequential storage from small to large of tabulation in the said RAM tables of data, and said reverse indexing table is stored the record ranking of each record tabulation in this RAM tables of data;
Configuration data in corresponding this functional module of RAM tables of data data set storage of each functional module comprises: create the record tabulation to be stored that comprises said configuration data, each record tabulation all comprises a major key; When do not exist in the said RAM tables of data with said record to be stored tabulation in the identical record tabulation of major key field that comprised; Then the afterbody in this RAM tables of data adds said record to be stored tabulation; Use the quick sorting algorithm forward concordance list rearrangement corresponding then, and upgrade the reverse indexing table according to the forward concordance list after the rearrangement to all index fields of said RAM tables of data.
2. data managing method according to claim 1 is characterized in that, the step that said RAM tables of data data set in each functional module correspondence is stored the configuration data of this functional module also comprises:
When exist in the said RAM tables of data with said record tabulation to be stored in the identical record tabulation of major key field that comprised, then do not add said record to be stored and tabulate.
3. data managing method according to claim 1 is characterized in that, also comprises:
The instruction of reception search records comprises at least one search condition in this instruction;
Retrieve respectively according to each search condition, obtain the result for retrieval set of each search condition, said search condition is specially the span or the designated value of a field;
Get the result for retrieval of the common factor of each result for retrieval set as search records.
4. data managing method according to claim 3 is characterized in that, the said common factor of getting the set of each result for retrieval comprises as the step of the result for retrieval of search records:
Be respectively each result for retrieval set and make up a bitmap, record number is the record tabulation of k in the corresponding RAM tables of data of the k bit of this bitmap;
Back one result for retrieval set is added to during result for retrieval set before it occurs simultaneously, and the bitmap that obtains occuring simultaneously is changed to 1 with the corresponding bit value of record tabulation in occuring simultaneously in this bitmap;
Behind the common factor of having got the set of whole result for retrieval, be that the set of tabulating of 1 the corresponding record of bit is as result for retrieval with bit value in the bitmap that finally obtains.
5. data managing method according to claim 1 is characterized in that, this method also comprises:
Receive modify instruction, comprise at least one search condition in the said modify instruction;
According to said search condition, retrieve corresponding record tabulation;
Said record tabulation is made amendment.
6. data managing method according to claim 1 is characterized in that, this method also comprises:
Receive delete instruction, comprise at least one search condition in the said delete instruction;
According to said search condition, retrieve corresponding record tabulation;
Delete said record tabulation.
7. data managing method according to claim 1 is characterized in that, this method also comprises:
Receive the instruction of retrieval next record, comprise at least one search condition in this instruction;
Retrieve successively according to each search condition, obtain the result for retrieval set of each effective search condition respectively;
Get the common factor of each result for retrieval set;
Inquire about the reverse indexing table in the corresponding index of last effective search condition, obtain the record ranking of each the record tabulation in the said common factor;
The record tabulation that the record ranking is minimum is as the result for retrieval of retrieval next record.
8. data managing method according to claim 1 is characterized in that, also comprises:
Set up the nvram data storehouse, in said nvram data storehouse, be respectively the corresponding nvram data table of each functional module foundation in the embedded system, the current record of said NVRAM data table memory and capacity;
Through writing down tabulation synchronously between the corresponding RAM tables of data of the naked medium of direct read each functional module in said nvram data storehouse and embedded system.
9. data managing method according to claim 8 is characterized in that, saidly comprises through writing down the synchronous step of tabulation between the corresponding RAM tables of data of the naked medium of direct read each functional module in said nvram data storehouse and embedded system:
Adopt the mode that directly reads naked medium that the tabulation of the record in the said nvram data table is read in the internal memory, join in the corresponding RAM tables of data, and delete the record tabulation of storing among the said NVRAM; And,
The synchronous mark of each record tabulation in the inspection RAM tables of data writes this synchronous mark in the corresponding nvram data table for the record tabulation of synchronous regime not, and changes the synchronous mark of said record tabulation into synchronous regime.
10. a data administrator is characterized in that, said data administrator is used for the configuration data uniform format management to each functional module of embedded system, comprising:
The RAM tables of data is set up module; Be used for being respectively each functional module of embedded system and set up corresponding RAM tables of data; Tabulating with record in each RAM tables of data is the unit store configuration data; The record tabulation is an array, and said RAM tables of data comprises at least one index, the corresponding forward concordance list of each index and a reverse indexing table; Said forward concordance list is by each writes down the record number of each record tabulation of this index value sequential storage from small to large of tabulation in the said RAM tables of data, and said reverse indexing table is stored the record ranking of each record tabulation in this RAM tables of data;
Data memory module is used for the configuration data in corresponding this functional module of RAM tables of data data group storage of each functional module, comprising: create the record tabulation to be stored that comprises said configuration data, each record tabulation all comprises a major key; When do not exist in the said RAM tables of data with said record to be stored tabulation in the identical record tabulation of major key field that comprised; Then the afterbody in this RAM tables of data adds said record to be stored tabulation; Use the quick sorting algorithm forward concordance list rearrangement corresponding then, and upgrade the reverse indexing table based on the forward concordance list after the rearrangement to all index fields of said RAM tables of data;
Retrieval next record module; Be used for receiving the instruction of retrieval next record; Comprise at least one search condition in this instruction; Successively the RAM tables of data data set of said data memory module storage is retrieved according to said search condition, obtained the result for retrieval set of each effective search condition respectively, inquire about the reverse indexing table in the corresponding index of last effective search condition; Obtain the record ranking of each the record tabulation in the said result for retrieval set, and will write down the result for retrieval of the minimum record tabulation of ranking as the retrieval next record.
11. data administrator according to claim 10 is characterized in that, also comprises:
The search records module; Be used to receive the search records instruction; Comprise at least one search condition in this instruction, respectively the RAM tables of data data set of said data memory module storage is retrieved, obtain the result for retrieval set of each search condition according to each search condition; Said search condition is specially the span or the designated value of a field, gets the result for retrieval of the common factor of each result for retrieval set as search records.
12. data administrator according to claim 10 is characterized in that, also comprises:
Modified module; Be used to receive modify instruction, comprise at least one search condition in the said modify instruction, according to said search condition; The RAM tables of data data set of retrieving said data memory module storage obtains corresponding record tabulation, and said record tabulation is made amendment.
13. data administrator according to claim 10 is characterized in that, also comprises:
Removing module; Be used to receive delete instruction, comprise at least one search condition in the said delete instruction, according to said search condition; The RAM tables of data data set of retrieving said data memory module storage obtains corresponding record tabulation, and said record tabulation is made amendment.
14. a data management system is characterized in that, comprises data administrator and nvram data storehouse, wherein:
Said data administrator adopts like claim 10,11,12 or 13 described data administrators;
Said nvram data storehouse; Be used for being respectively each functional module of embedded system and set up corresponding nvram data table, and through read write down between the corresponding RAM tables of data of naked medium each functional module in said nvram data storehouse and embedded system tabulate synchronous.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101365620A CN101833511B (en) | 2010-03-29 | 2010-03-29 | Data management method, device and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101365620A CN101833511B (en) | 2010-03-29 | 2010-03-29 | Data management method, device and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101833511A CN101833511A (en) | 2010-09-15 |
| CN101833511B true CN101833511B (en) | 2012-06-06 |
Family
ID=42717587
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101365620A Expired - Fee Related CN101833511B (en) | 2010-03-29 | 2010-03-29 | Data management method, device and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101833511B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103699849A (en) * | 2013-12-23 | 2014-04-02 | 国云科技股份有限公司 | Data access authorization protection method |
| CN104951550B (en) * | 2015-06-25 | 2018-07-17 | 走遍世界（北京）信息技术有限公司 | Date storage method and device |
| WO2017072890A1 (en) * | 2015-10-28 | 2017-05-04 | 株式会社東芝 | Data management system, data management method, and program |
| CN107562753B (en) * | 2016-06-30 | 2020-04-17 | 索意互动（北京）信息技术有限公司 | Index word-based analysis method and device |
| CN107103192A (en) * | 2017-04-21 | 2017-08-29 | 上海联影医疗科技有限公司 | Magic magiscan and its data managing method |
| CN109522239A (en) * | 2018-09-30 | 2019-03-26 | 上海恺英网络科技有限公司 | A kind of method and apparatus that common trait data determine |
| CN109753506B (en) * | 2018-12-28 | 2020-09-29 | 深圳市网心科技有限公司 | Data distributed storage method, device, terminal and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1858737A (en) * | 2006-01-25 | 2006-11-08 | 华为技术有限公司 | Method and system for data searching |
| CN101552028A (en) * | 2008-03-31 | 2009-10-07 | 深圳市朗科科技股份有限公司 | Storage device for combining and using storage equipment and method for realizing storage |
| CN101645310A (en) * | 2008-08-05 | 2010-02-10 | 深圳市朗科科技股份有限公司 | Flash memory equipment, method and system for managing flash memory |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8306967B2 (en) * | 2007-10-02 | 2012-11-06 | Loglogic, Inc. | Searching for associated events in log data |
-
2010
- 2010-03-29 CN CN2010101365620A patent/CN101833511B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1858737A (en) * | 2006-01-25 | 2006-11-08 | 华为技术有限公司 | Method and system for data searching |
| CN101552028A (en) * | 2008-03-31 | 2009-10-07 | 深圳市朗科科技股份有限公司 | Storage device for combining and using storage equipment and method for realizing storage |
| CN101645310A (en) * | 2008-08-05 | 2010-02-10 | 深圳市朗科科技股份有限公司 | Flash memory equipment, method and system for managing flash memory |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101833511A (en) | 2010-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101833511B (en) | Data management method, device and system | |
| CN101751406B (en) | Method and device for realizing column storage based relational database | |
| CN102122285B (en) | Data cache system and data inquiry method | |
| CN102129458B (en) | Method and device for storing relational database | |
| CN101840400B (en) | Multilevel classification retrieval method and system | |
| CN102467521B (en) | Easily-extensible multi-level classification search method and system | |
| EP2069979B1 (en) | Dynamic fragment mapping | |
| US5237681A (en) | Relational data base memory utilization analyzer | |
| CN102541529B (en) | A kind of query page generating device and method | |
| US20100161565A1 (en) | Cluster data management system and method for data restoration using shared redo log in cluster data management system | |
| CN105912687B (en) | Magnanimity distributed data base storage unit | |
| CN102930060B (en) | A kind of method of database quick indexing and device | |
| CN102375853A (en) | Distributed database system, method for building index therein and query method | |
| WO1992021090A9 (en) | Relational data base memory utilization analyzer | |
| CN104239377A (en) | Platform-crossing data retrieval method and device | |
| CN103902544A (en) | Data processing method and system | |
| CN103544261A (en) | Method and device for managing global indexes of mass structured log data | |
| CN100565508C (en) | Structured-document management apparatus, search equipment, storage and searching method | |
| CN104424219A (en) | Method and equipment of managing data documents | |
| CN102779138A (en) | Hard disk access method of real time data | |
| CN103473324A (en) | Multi-dimensional service attribute retrieving device and method based on unstructured data storage | |
| US11880368B2 (en) | Compressing data sets for storage in a database system | |
| CN101963993B (en) | Method for fast searching database sheet table record | |
| CN100452043C (en) | A storage and search method of multiple index hash table | |
| CN112527824A (en) | Paging query method, paging query 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120606 |