CN103544239A - Complete genetic relationship information base traversal improvement method - Google Patents
Complete genetic relationship information base traversal improvement method Download PDFInfo
- Publication number
- CN103544239A CN103544239A CN201310459004.1A CN201310459004A CN103544239A CN 103544239 A CN103544239 A CN 103544239A CN 201310459004 A CN201310459004 A CN 201310459004A CN 103544239 A CN103544239 A CN 103544239A
- Authority
- CN
- China
- Prior art keywords
- record
- sibship
- carry out
- attribute
- derivation
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
Abstract
The invention discloses a complete genetic relationship information base traversal improvement method which includes three times of traversal processes. According to the first-time traversal process, mutuality derivation is performed on preferable genetic relationship information sub-base parts one by one, and the information sub-bases are improved. According to the second-time traversal process, correlation derivation is performed on the preferable genetic relationship information sub-base parts one by one, and the information sub-bases are improved. According to the third-time traversal process, by means of the general genetic relationship sub-bases, the type range and the checking rule of a specific genetic relationship to be derived are determined at first, then the traversal improvement process is executed, relationship derivation is performed in the process according to the determined type range of the specific genetic relationship to be derived, improvement is performed, and the determined checking rule is used for checking. If records can be directly described by the preferable genetic relationship information sub-base parts, the records are stored into the preferable genetic relationship information sub-base parts as much as possible according to a preferable strategy, and records affected in the preferable genetic relationship information sub-base parts are improved again by referring to relevant steps in the first-time traversal process and the second-time traversal process.
Description
Technical field
The invention belongs to computer information processing field, relate in particular to a kind of complete sibship information bank traversal improving method.
Background technology
A kind of general sibship information bank traversal improving method of application for a patent for invention and a kind of non-general sibship information bank traversal improving method, all can not individual adaptation in general sibship information bank with adopt the simultaneous complete sibship information bank of sibship information bank of multiplex technique, use wherein a kind of traversal improving method or the utilization that simply two kinds of traversal improving methods combined, be all difficult to realize comparatively fully traversal perfect.
Summary of the invention
The present invention will solve the traversal of complete sibship information bank and improve problem, for addressing the above problem, the object of the present invention is to provide a kind of complete sibship information bank traversal improving method, make the sibship information of storage can access enough analyzing and processing to can obtain good memory by using.
Two parts of preferred sibship information word bank that sibship information bank comprises general sibship information word bank and employing multiplex technique completely, when optimizing, traversal can consider respectively, but it should be noted that two word banks are not what isolate, but jointly form a whole information bank, therefore, the complete sibship information bank traversal improving method that the present invention proposes, mainly comprises the following steps:
First pass ergodic process: preferred sibship information word bank part is carried out to reciprocity derivation perfect one by one; First process preferred sibship information word bank part, and carry out reciprocity derivation and have little significance for general sibship information word bank at complete sibship information bank, because what preferably store in sibship information word bank is generally most important sibship, the importance of general sibship information word bank is taken second place, and much not directly describe, first pass ergodic process specifically comprises the following steps:
The 1st step: first all properties of all records in sibship information bank is all labeled as untreatedly, mark is to attribute here, is processed in the process of processing by treated attribute flags, avoids re-treatment;
The 4th step: start to process each record, first navigate to first record in sibship information bank, if arrived information bank end be in information bank without any; carry out the 16th EOS, otherwise carry out lower step;
The 7th step: each attribute of beginning reason current record, check that this records first is not empty and untreated attribute, for sky or processed all needn't processing, if, do not carry out the 14th step, if treatable processed completely maybe cannot process of current record is not described, at this moment should continues to process next record;
The 9th step: carry out reciprocity derivation, according to the reciprocity of sibship, if the corresponding attribute of corresponding relation people record for empty and untreated corresponding setup of attribute by corresponding relation people record be indicate this record party value and the corresponding attribute of two records is all labeled as processed, if the corresponding attribute of corresponding relation people record, for indicating the party's of this record value, is all labeled as processed by the corresponding attribute of two records, other value and this attribute description is the reciprocal relative relation of the same race that possible surpass 2 parties if, as siblings' relation is traced back to the last-of-chain record that corresponding attribute is sky or the party's who indicates this record value always, during for sky, the corresponding attribute of last-of-chain record is changed into the party's who indicates this record value otherwise corresponding property value need not be set, and the corresponding attribute of all records on this chain is all labeled as processed, other value and this attribute description is to be only 2 parties' reciprocal relative relation of the same race if, as sibships such as own father, breeder mother, spouses, at this moment just has conflict, by conflict rule, processes and the corresponding attribute of two records is all labeled as processed, conflict rule is generally selected best according to following principle, judgement optimum can adopt automatic decision or artificial judgment, its rule is, being better than of current sibship information is non-current, it is low that the sibship information that legal effect is high is better than effect, it is low that the reliable sibship information of information source is better than reliability, may correct sibship information be better than possible errors, when corresponding relation people records without corresponding attribute, should determine whether to adjust multiplexing scheme according to preference policy, if be adjusted into new multiplexing scheme, need to arrange all influenced existing attribute that comprises corresponding attribute, first derivation result to be stored into the respective attributes of this multiplexing scheme, the information reproduction of the former multiplexing scheme of the reservation of its less important multiplexing scheme is come, do not have with a grain of salt being abandoned, if do not cause the variation of data-reusing scheme, without corresponding attribute being set and carrying out relevant treatment, but it is processed that this attribute and corresponding attribute (corresponding attribute as without mark not) also need to be labeled as,
The 12nd step: continue processing this, to record the next one be not empty and untreated attribute, if there is the 9th step of execution, records allly not for empty and untreated attribute until handle this, if not, carries out lower step, continues to process next record;
The 14th step: navigate to next record in sibship information bank, process one by one in order, if arrived information bank end, carry out the 16th EOS, otherwise carry out the 7th step;
The 16th step: first pass ergodic process finishes.
Second time ergodic process: preferred sibship information word bank part is carried out to correlativity derivation perfect one by one; Continuation is partly processed preferred sibship information word bank, carries out correlativity derivation, different from first pass ergodic process, can use general sibship information word bank part canned data here, and second time ergodic process specifically comprises the following steps:
The 1st step: all records in sibship information bank are all labeled as untreated, mark is to record is here labeled as treated record processedly in the process of processing, and avoids re-treatment;
The 4th step: start to process each record, navigate to first untreated record in sibship information bank, if arrived information bank end, carry out the 16th EOS, otherwise carry out lower step;
The 7th step: retrieve this and record first for empty attribute, only process the sibship information of this unknown, known no matter, if not, carry out the 14th step, have and carry out lower step;
The 9th step: if two sibships can deriving the described sibship of this attribute according to the correlativity of sibship all exist, confirm whether to exist to search for two word banks, if wherein one or two all also exists at last in general sibship information word bank part, if should can carry out correlativity derivation for null attribute, carry out correlativity derivation and by derivation result, this attribute be set, may also to adjust if desired the respective attributes of correlationship people record, such as deriving first and second, be that siblings are when be related to, if one of them has had corresponding sibship, should add another this and have siblings' chain, if what derive this attribute description is to be only 2 parties' reciprocal relative relation of the same race, as own father, breeder mother, the sibships such as spouse, the respective attributes value of corresponding relation people record to be set according to the reciprocity of sibship, concrete disposal route is with reference to the 9th step of first pass ergodic process, but need not mark association attributes be processed, finally all affected party's record outside current record is labeled as untreated, at the reciprocal relative of the same race that is only 2 parties, be related in situation it is according to the reciprocity of sibship, corresponding party to be labeled as untreated, in the situation that siblings' relations etc. may surpass 2 parties' reciprocal relative relation of the same race, this will be closed to all other records in tethers is all labeled as untreated, then carry out lower step, if cannot derive to derive this attribute according to correlativity, directly carry out lower step,
The 12nd step: check that this record next one is empty attribute, be treated to one by one empty attribute, if not, carry out the 14th step, have and carry out the 9th step;
The 14th step: this record is labeled as processed, processed record, but its for null attribute whether can derive all do not affect this record to be labeled as processed, then carry out the 4th step, in process information storehouse, in remaining untreated record, first is untreated, and this record may be once processed but be marked as again untreated record due to influenced in the 9th step;
The 16th step: second time ergodic process finishes.
The 3rd time ergodic process: for general sibship information word bank part, first determine the concrete sibship kind scope that will derive and check rule, because the concrete sibship kind of storing in general sibship information bank is unrestricted, if do not limited for derivation result yet, its derivation result collection may be very large so, and there is no any effect for improving analysis recall precision yet, therefore should be defined as and be conducive to improve the concrete sibship kind of analyzing recall precision, generally should be the most direct sibship between two people, be that relation path length is those concrete sibship kinds of 1, because the analysis retrieval of general sibship information bank does not take to be similar to the technology of pointer sometimes, more quick in order to analyze retrieval, those concrete sibship kinds that can be also 2 by some relation path length sometimes etc. are also included the concrete sibship kind scope that will derive in, check that rule mainly comprises the rule of eliminating data collision and data redundancy, in order to be unlikely to expend aspect inspection too much, in general only have obvious data collision and unnecessary data redundancy just to eliminate, obvious data collision is not as met the data of the reciprocity of sibship, the son that the father that sibship information first is second and another sibship information second are third (male sex) is exactly the data that do not meet the reciprocity of sibship, unnecessary data redundancy comprises identical two information, mutually reverse two information of equal value and the information that can be formed by other two or above information direct splicing etc. each other, can certainly determine more strictly as required or more loose inspection rule, hypothesis is not done any inspection herein, any data collision and data redundancy is not checked and is processed,
Then carry out traversal and improve process, in process, by the determined concrete sibship kind scope that will derive of the first step, carry out relation derivation and improve and carry out check processing by the determined inspection rule of the first step.Main flow process is that each record in information bank and other record are carried out to relation derivation one by one, relation derivation comprises two kinds, by determining derive sibship and by determining the unknown relation kind sibship of deriving of unknown relation people, from existing information, derive information common but that not yet know perfectly well, thereby be conducive to better analyze retrieval.In order to realize traversal, here two steady arms have been used, the record of current accessed when first steady arm travels through information bank for being positioned at, second steady arm coordinates the record of deriving for locating, because the first step is determined and do not done any inspection, so do not comprise any step that any data collision and data redundancy are checked and processed, if add relevant inspection rule in the first step, can increase and/or revise relevant step with reference to a kind of general sibship information bank traversal improving method of application for a patent for invention, no longer narrate here; Because the deposit data of complete sibship information bank is in two word banks, above-mentioned steps has all only partly been done analyzing and processing to general sibship information word bank, therefore will increase a step and partly process in conjunction with preferred sibship information word bank, this step is only for being optimized general sibship information word bank information by preferred sibship information word bank information here; If derive in said process, belonging to the sibship information that preferred sibship information word bank part can Direct function description should store preferred sibship information word bank part into according to preference policy as far as possible, now for affected record in preferred sibship information word bank part, with reference to first pass ergodic process, again carries out perfect with second time relevant step of ergodic process to affected record; The 3rd time ergodic process specifically comprises the following steps:
The 1st step: first steady arm navigates to first record (initial value is put in outer circulation) in information bank, if arrived information bank end, carries out the 25th EOS, otherwise carry out lower step;
The 2nd step: according to the relation path of this record, from two ends preferred sibship information word bank partly search can unique coupling sibship information, if relation path can whole unique couplings, after deleting this record, carry out the 22nd step, if only a surplus sibship is not mated, derive this sibship, and according to preference policy, store this sibship into preferred sibship information word bank part as far as possible, and possibly by cement out can Direct function description sibship store general sibship information word bank part afterbody into, if stored successfully, delete rear the 22nd step of carrying out of this record, if store unsuccessfully, after deleting this record and storing the sibship of deriving into general sibship information word bank part afterbody, carry out the 22nd step, if remain two or more sibships, do not mate, compatible portion can not form a sibship of not directly describing of more simplifying than former record and replace the former record in former general sibship information word bank part, then carry out lower step, if can not carry out any unique coupling, directly carry out lower step,
The 3rd step: second steady arm navigates to a rear record (initial value is put in interior circulation) of first steady arm location current record, if arrived information bank end, carries out the 25th EOS, otherwise carries out the 8th step (starting to carry out loop body);
The 8th step: whether the record that judges two steady arms location can unique compatible portion relation path, with relation path length short go coupling long, if equal in length, carry out the 11st step, also can proceed to mate but be uniquely to mate certainly, if second steady arm location to record described sibship relation path short, see the part relations path of recording described sibship that this record whether can first steady arm location of unique coupling, if can uniquely mate, (result set is that the first step limits by the sibship method of deriving by definite unknown relation people, to carry out relation derivation, the derivation result at result set does not all belong to the scope that can not derive, in relevant derivation rule, can only have derivation result to belong to the rule of the concrete sibship kind scope of the definite derivation of the first step), said process can be referred to as by determining the derive process of sibship of unknown relation people, if can not derive, carry out so the 11st step, if derive another group can Direct function description or two people that not directly describe between sibship information, carry out the 14th step and process,
The 11st step: the part relations path of recording described sibship whether described sibship can first steady arm location of matching of recording that judges second steady arm location, if can partial fitting, by by determining that the unknown relation kind sibship method of deriving carries out relation derivation, said process can be referred to as by determining the derive process of sibship of unknown relation kind; If can not derive, carry out so the 20th step; If derive another group can Direct function description or two people that not directly describe between sibship information, carry out the 14th step and process;
The 14th step: derivation result is inserted to information bank end, complete the warehouse-in work of derivation result, then carry out the 20th step;
The 20th step: second steady arm navigated to the next record (interior circulation moves down a record) of former position the record, if arrived information bank end, carry out the 22nd step (interior circulation all finishes), otherwise carry out the 5th step;
The 22nd step: first steady arm is navigated to the next record (outer circulation moves down a record) of former position the record, if arrived information bank end, carry out the 25th EOS (outer circulation all finishes), otherwise carry out the 3rd step;
The 25th step: the process that whole traversal is perfect finishes.
If there is the sibship information of deriving by relation derivation will store preferred sibship information word bank part in above-mentioned the 3rd time ergodic process, now for affected record in preferred sibship information word bank part, with reference to first pass ergodic process and second time relevant step of ergodic process, again carry out perfectly, it is characterized in that:
The first step: the new insertion attribute from affected record, carry out reciprocity derivation, if corresponding relation people records corresponding attribute, and attribute is that the empty corresponding setup of attribute corresponding relation people being recorded is the value that indicates the party of this record; If the corresponding attribute of corresponding relation people record, for indicating the party's of this record value, need not be processed; Other value and this attribute description is the reciprocal relative relation of the same race that possible surpass 2 parties if, trace back to corresponding attribute is the last-of-chain record of sky or the party's who indicates this record value always, during for sky, the corresponding attribute of last-of-chain record is changed into the party's who indicates this record value otherwise corresponding property value need not be set; Other value and this attribute description is to be only 2 parties' reciprocal relative relation of the same race if, by conflict rule, processes; When corresponding relation people records without corresponding attribute, should determine whether to adjust multiplexing scheme according to preference policy, if be adjusted into new multiplexing scheme, need to arrange all influenced existing attribute that comprises corresponding attribute, if do not cause the variation of data-reusing scheme, without corresponding attribute being set and carrying out relevant treatment; Because reciprocity is derived, new record and this record of impact are regular collocations in pairs or in groups, can not affect other record, therefore process so far;
Second step: from affected start-of-record, retrieve this and record first for empty attribute, if should can carry out correlativity derivation for null attribute, carry out correlativity derivation and by derivation result, this attribute be set, may also to adjust if desired the respective attributes of correlationship people record, or the respective attributes value of corresponding relation people record is set with reference to the first step according to the reciprocity of sibship, and all affected party's record outside pre-treatment record is all added to second step processing queue; Continuing this record next one of retrieval is empty attribute, and processes until this recording processing is complete by step above; Continuation by the record of step process second step processing queue above until the record in queue be all disposed; Because correlativity is derived, the new record of impact is not expected, and this impact can bring new condition for the correlativity derivation of affected new record, therefore must process all affected records.
Accompanying drawing explanation
Fig. 1 Fig. 1 is complete sibship information bank traversal improving method schematic diagram;
Fig. 2 is that first pass traversal is improved process flow diagram flow chart;
Fig. 3 is that second time traversal improved process flow diagram flow chart;
Fig. 4 is that the 3rd time traversal improved process flow diagram flow chart;
Fig. 5 is that the 3rd time traversal improved affected record in process and again improved schematic diagram with reference to first pass ergodic process with second time relevant step of ergodic process;
Below in conjunction with accompanying drawing, the present invention is further described.
Embodiment
Embodiment 1
Suppose to have certain family in census register management system to have 8 people V0, V1, V2, V3, V4, V5, V6, V7, householder is V2, the currency of V0 " with householder's relation " is " wife ", the currency of V1 " with householder's relation " is " brother wife ", the currency of V3 " with householder's relation " is " son ", the currency of V4 " with householder's relation " is " father-in-law ", the currency of V5 " with householder's relation " is " mother-in-law ", the currency of V6 " with householder's relation " is " foster mother ", and the currency of V7 " with householder's relation " is " foster father ".First to from above-mentioned known sibship information, extract can two people of Direct function description between sibship information, in order to narrate conveniently, adopt tlv triple to describe the sibship information of extraction here, tlv triple (a, b, r) represent that b is the party with r sibship of a, as (first, second, son) represent that second is the people that first has son's relation, second is the son of first.For simplicity, only list V0, V1, all extractible sibship information of V2, V3, the sibship of V4, V5, V6, V7 is not all extracted simultaneously.From known above-mentioned sibship information, can extract following can two people of Direct function description between sibship information, by tlv triple, represent as follows:
(V2, V0, spouse), (V2, V3, children), (V2, V6, foster mother), (V2, V7, foster father);
(V0, V2, spouse), (V0, V3, children), (V0, V1, with father siblings), (V0, V1, with female siblings), (V0, V5, breeder mother), (V0, V4, own father);
(V1, V0, with father siblings), (V1, V0, with female siblings), (V1, V5, breeder mother), (V1, V4, own father);
(V3, V0, breeder mother), (V3, V2, own father);
And sibship information between following not describable two people, by tlv triple, represent as follows:
(V2, V1, brother wife), (V2, V4, father-in-law), (V2, V5, mother-in-law);
Next create the multiplexing sibship node of corresponding attribute store represent above-mentioned relation people can two people of Direct function description between sibship information, attribute multiplexing scheme 1 is the fixing corresponding blood ties node respective attributes of each attribute, its code value is 1, and attribute multiplexing scheme 2 is FATHER on the basis of the fixing corresponding blood ties node respective attributes of all the other attributes, MOTHER is multiplexed with foster father, foster mother, its code value is 2, so said extracted can Direct function description sibship information can create corresponding 8 the multiplexing sibship node of attribute E0, E1, E2, E3, E4, E5, E6, E7, adopts the way of realization of structuring memory variable here, is seven tuples (ID, a FATHER for reduced representation, MOTHER, NEXTBROTHER_F, NEXTBROTHER_M, ACHILD, MARRYED, TAG) the multiplexing sibship node of expression attribute, property value V0 wherein, V1, V2, V3, V4, V5, V6, V7 represents corresponding identification card number, NULL represents that corresponding sibship is unknown, and after arranging, the multiplexing sibship node of these 8 parties' attribute is:
E0：（V0,V4,V5,V1,V1,?V3,?V2,1）
E1：（V1,V4,V5,V0,V0,?NULL,?NULL,1）
E2：（V2,V7,V6,?NULL,?NULL,?V3,?V0,2）
E3：（V3,V2,V1,?NULL,?NULL,?NULL,?NULL,1）
E4：（V4,?NULL,?NULL,?NULL,?NULL,?NULL,?NULL,1）
E5：（V5,?NULL,?NULL,?NULL,?NULL,?NULL,?NULL,1）
E6：（V6,?NULL,?NULL,?NULL,?NULL,?NULL,?NULL,1）
E7：（V7,NULL,?NULL,?NULL,?NULL,?NULL,?NULL,1）
Store above-mentioned information into preferred sibship information word bank part.
Next create corresponding general sibship node and store sibship information between two people that represent above-mentioned not directly description, the simplest sibship node should have three attributes, wherein two attribute representation both sides parties also want clear and definite its tagmeme, a concrete sibship kind of attribute representation, here with P1, P2, tri-attributes of R, represent (referring to Fig. 4) respectively, and the tagmeme of clear and definite P1, P2, the sibship information that this node will represent is that P2 is the party with R sibship of P1.Between two people of so above-mentioned 3 standards, sibship information can create corresponding three general sibship node E`1, E`2, E`3, wherein:
E`1. P1=V2, E`1. P2=V1, E`1. R=brother wife
E`2. P1=V2, E`2. P2=V4, E`2. R=father-in-law
E`3. P1=V2, E`3. P2=V5, E`3. R=mother-in-law
Store above-mentioned information into general sibship information word bank part.
Then information bank carries out perfect through three times ergodic processes to information bank according to this method after building:
First pass ergodic process: preferred sibship information word bank part is carried out to reciprocity derivation perfect one by one, in this process, when processing E0 records, its sibship information (V0, V2, spouse), (V0, V3, children), (V0, V1, with father siblings), (V0, V1, with female siblings) according to mutual reverse sibship information, all exist, so be all labeled as processed, but process sibship (V0, V5, breeder mother), (V0, V4, own father) time, according to the reciprocity of sibship, can derive (V5, V0, children), (V4, V0, children), and corresponding E4, the corresponding attribute of E5 is sky, therefore according to the result of deriving, arrange, then be all set to processed, first pass ergodic process other processing procedure slightly,
Second time ergodic process: preferred sibship information word bank part is carried out to correlativity derivation perfect one by one; When processing E0 because E0 is not null attribute, so next process E1 until E7, because sibship information in this example is less, does not arrange action so second time ergodic process derived any new sibship;
The 3rd time ergodic process: for general sibship information word bank part, first determine the concrete sibship kind scope that will derive and check rule, then carry out traversal and improve process, in process, by the determined concrete sibship kind scope that will derive, carry out relation derivation and improve and carry out check processing by determined inspection rule, what if wherein belong to, preferred sibship information word bank part can Direct function description should store preferred sibship information word bank part into according to preference policy as far as possible, now for affected record in preferred sibship information word bank part, with reference to first pass ergodic process, again carry out perfect with second time relevant step of ergodic process, first process E`1, can find two sibships relation path and carry out unique coupling from preferred sibship information word bank, so can delete E`1, E`2 and E`3 be like this too, all deleted in processing.
Claims (5)
1. complete sibship information bank travels through an improving method, it is characterized in that comprising the following steps:
First pass ergodic process: preferred sibship information word bank part is carried out to reciprocity derivation perfect one by one;
Second time ergodic process: preferred sibship information word bank part is carried out to correlativity derivation perfect one by one;
The 3rd time ergodic process: for general sibship information word bank part, first determine the concrete sibship kind scope that will derive and check rule, then carry out traversal and improve process, in process, by the determined concrete sibship kind scope that will derive, carry out relation derivation and improve and carry out check processing by determined inspection rule, what if wherein belong to, preferred sibship information word bank part can Direct function description should store preferred sibship information word bank part into according to preference policy as far as possible, now for affected record in preferred sibship information word bank part, with reference to first pass ergodic process, again carry out perfect with second time relevant step of ergodic process.
2. in a kind of complete sibship information bank traversal improving method claimed in claim 1, according to the reciprocity of sibship, carry out the first pass ergodic process that relation derivation is realized, it is characterized in that comprising the following steps:
The 1st step: all properties of all records in preferred sibship information word bank part is all labeled as untreated;
The 4th step: navigate to first record in preferred sibship information word bank part, if arrived information bank end, carry out the 16th EOS, otherwise carry out lower step;
The 7th step: check that this records first not for empty and untreated attribute, if not, carry out the 14th step, otherwise carry out lower step;
The 9th step: carry out reciprocity derivation, if corresponding relation people records corresponding attribute, and attribute for empty and untreated corresponding setup of attribute by corresponding relation people record be indicate this record party value and the corresponding attribute of two records is all labeled as processed; If the corresponding attribute of corresponding relation people record, for indicating the party's of this record value, is all labeled as processed by the corresponding attribute of two records; Other value and this attribute description is the reciprocal relative relation of the same race that possible surpass 2 parties if, trace back to corresponding attribute is the last-of-chain record of sky or the party's who indicates this record value always, during for sky, the corresponding attribute of last-of-chain record is changed into the party's who indicates this record value otherwise corresponding property value need not be set, and the corresponding attribute of all records on this chain is all labeled as processed; Other value and this attribute description is to be only 2 parties' reciprocal relative relation of the same race if, by conflict rule, processes and the corresponding attribute of two records is all labeled as processed; When corresponding relation people records without corresponding attribute, should determine whether to adjust multiplexing scheme according to preference policy, if be adjusted into new multiplexing scheme, need to arrange all influenced existing attribute that comprises corresponding attribute, if do not cause the variation of data-reusing scheme, without corresponding attribute being set and carrying out relevant treatment, but that this attribute and corresponding attribute (corresponding attribute as without mark not) also need to be labeled as is processed;
The 12nd step: processing this, to record the next one be not sibship attribute between empty and untreated expression two people, if there is the 9th step of execution, if not, carries out lower step;
The 14th step: navigate to the next record in preferred sibship information word bank part, if arrived information bank end, carry out the 16th EOS, otherwise carry out the 7th step;
The 16th step: first pass ergodic process finishes.
3. carrying out relation derivation according to the correlativity of sibship and realize ergodic process second time in a kind of complete sibship information bank traversal improving method claimed in claim 1, is characterized in that comprising the following steps:
The 1st step: all records in preferred sibship information word bank part are all labeled as untreated;
The 4th step: navigate to first the untreated record in preferred sibship information word bank part, if arrived information bank end, carry out the 16th EOS, otherwise carry out lower step;
The 7th step: retrieve this and record first for empty attribute, if not, carry out the 14th step, have and carry out lower step;
The 9th step: if should can carry out correlativity derivation for null attribute, carry out correlativity derivation and by derivation result, this attribute be set, may also to adjust if desired the respective attributes of correlationship people record, or the respective attributes value of corresponding relation people record is set according to the reciprocity of sibship, finally all affected party's record outside current record is all labeled as untreated, then carry out lower step, if cannot derive to derive this attribute according to correlativity, directly carry out lower step;
The 12nd step: check that this record next one is empty attribute, if not, carry out the 14th step, have and carry out the 9th step;
The 14th step: this record is labeled as processed, then carries out the 4th step;
The 16th step: second time ergodic process finishes.
4. carrying out relation derivation according to the correlativity of sibship and realize ergodic process the 3rd time in a kind of complete sibship information bank traversal improving method claimed in claim 1, is characterized in that comprising the following steps:
The first step: determine the concrete sibship kind scope that will derive and check rule;
Second step: partly carry out traversal for general sibship information word bank and improve process, in process, by the determined concrete sibship kind scope that will derive of the first step, carry out relation derivation and improve and carry out check processing by the determined inspection rule of the first step, checking regular in the situation that and specifically comprise the following steps not arranging:
The 1st step: first steady arm navigates to first record in general sibship information word bank part, if arrived information bank end, carries out the 25th EOS, otherwise carry out lower step;
The 2nd step: according to the relation path of this record, from two ends preferred sibship information word bank partly search can unique coupling sibship information, if relation path can whole unique couplings, after deleting this record, carry out the 22nd step, if only a surplus sibship is not mated, derive this sibship, and according to preference policy, store this sibship into preferred sibship information word bank part as far as possible, and possibly by cement out can Direct function description sibship store general sibship information word bank part afterbody into, if stored successfully, delete rear the 22nd step of carrying out of this record, if store unsuccessfully, after deleting this record and storing the sibship of deriving into general sibship information word bank part afterbody, carry out the 22nd step, if remain two or more sibships, do not mate, compatible portion can not form a sibship of not directly describing of more simplifying than former record and replace the former record in former general sibship information word bank part, then carry out lower step, if can not carry out any unique coupling, directly carry out lower step,
The 3rd step: second steady arm navigates to a rear record of first steady arm location current record, if arrived information bank end, carries out the 25th EOS, otherwise carries out the 8th step;
The 8th step: carry out by determining the unknown relation people process of sibship of deriving, if can not derive, carry out so the 11st step; If derive another group can Direct function description or two people that not directly describe between sibship information, carry out the 14th step and process;
The 11st step: carry out by determining the unknown relation kind process of sibship of deriving, if can not derive, carry out so the 20th step; If derive another group can Direct function description or two people that not directly describe between sibship information, carry out the 14th step and process;
The 14th step: if derivation result be can Direct function description sibship, according to preference policy, store this sibship into preferred sibship information word bank part as far as possible, and possibly by cement out can Direct function description sibship store general sibship information word bank part afterbody into; Otherwise derivation result is inserted to information bank end, complete the warehouse-in work of derivation result, then carry out the 20th step;
The 20th step: second steady arm navigated to the next record of former position the record, if arrived information bank end, carry out the 22nd step, otherwise carry out the 5th step;
The 22nd step: first steady arm is navigated to the next record of former position the record, if arrived information bank end, carry out the 25th EOS, otherwise carry out the 3rd step;
The 25th step: the process that whole traversal is perfect finishes.
5. if there is the sibship by relation derivation to store preferred sibship information word bank part in the 3rd time ergodic process claimed in claim 4, now for affected record in preferred sibship information word bank part, with reference to first pass ergodic process and second time relevant step of ergodic process, again carry out perfectly, it is characterized in that:
The first step: the new insertion attribute from affected record, carry out reciprocity derivation, if corresponding relation people records corresponding attribute, and attribute is that the empty corresponding setup of attribute corresponding relation people being recorded is the value that indicates the party of this record; If the corresponding attribute of corresponding relation people record, for indicating the party's of this record value, need not be processed; Other value and this attribute description is the reciprocal relative relation of the same race that possible surpass 2 parties if, trace back to corresponding attribute is the last-of-chain record of sky or the party's who indicates this record value always, during for sky, the corresponding attribute of last-of-chain record is changed into the party's who indicates this record value otherwise corresponding property value need not be set; Other value and this attribute description is to be only 2 parties' reciprocal relative relation of the same race if, by conflict rule, processes; When corresponding relation people records without corresponding attribute, should determine whether to adjust multiplexing scheme according to preference policy, if be adjusted into new multiplexing scheme, need to arrange all influenced existing attribute that comprises corresponding attribute, if do not cause the variation of data-reusing scheme, without corresponding attribute being set and carrying out relevant treatment;
Second step: from affected start-of-record, retrieve this and record first for empty attribute, if should can carry out correlativity derivation for null attribute, carry out correlativity derivation and by derivation result, this attribute be set, may also to adjust if desired the respective attributes of correlationship people record, or the respective attributes value of corresponding relation people record is set with reference to the first step according to the reciprocity of sibship, and all affected party's record outside pre-treatment record is all added to second step processing queue; Continuing this record next one of retrieval is empty attribute, and processes until this recording processing is complete by step above; Continuation by the record of step process second step processing queue above until the record in queue be all disposed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310459004.1A CN103544239A (en) | 2013-10-07 | 2013-10-07 | Complete genetic relationship information base traversal improvement method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310459004.1A CN103544239A (en) | 2013-10-07 | 2013-10-07 | Complete genetic relationship information base traversal improvement method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103544239A true CN103544239A (en) | 2014-01-29 |
Family
ID=49967691
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310459004.1A Pending CN103544239A (en) | 2013-10-07 | 2013-10-07 | Complete genetic relationship information base traversal improvement method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103544239A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5933818A (en) * | 1997-06-02 | 1999-08-03 | Electronic Data Systems Corporation | Autonomous knowledge discovery system and method |
| CN102096714A (en) * | 2011-01-30 | 2011-06-15 | 广州红动体育有限公司 | Method and system for merging network genealogies |
| CN102142015A (en) * | 2011-01-30 | 2011-08-03 | 唐凌遥 | Processing system and processing method for nodes in family tree |
-
2013
- 2013-10-07 CN CN201310459004.1A patent/CN103544239A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5933818A (en) * | 1997-06-02 | 1999-08-03 | Electronic Data Systems Corporation | Autonomous knowledge discovery system and method |
| CN102096714A (en) * | 2011-01-30 | 2011-06-15 | 广州红动体育有限公司 | Method and system for merging network genealogies |
| CN102142015A (en) * | 2011-01-30 | 2011-08-03 | 唐凌遥 | Processing system and processing method for nodes in family tree |
Non-Patent Citations (3)
| Title |
|---|
| 葛强: ""亲属关系逻辑推理专家系统的研究"", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
| 陈振宇，袁毓林，张秀松，周强: ""一种基于大知识库的亲属关系自动推理模型"", 《中文信息学报》 * |
| 靳小龙: ""基于常识的亲属关系推理模型"", 《计算机工程与应用》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8073874B2 (en) | Bit string searching apparatus, searching method, and program | |
| US20160314161A1 (en) | Multi-Version Concurrency Control Method in Database and Database System | |
| CN102110171B (en) | Method for inquiring and updating Bloom filter based on tree structure | |
| US7603346B1 (en) | Integrated search engine devices having pipelined search and b-tree maintenance sub-engines therein | |
| US8190591B2 (en) | Bit string searching apparatus, searching method, and program | |
| US7831626B1 (en) | Integrated search engine devices having a plurality of multi-way trees of search keys therein that share a common root node | |
| US8386526B2 (en) | Coupled node tree backup/restore apparatus, backup/restore method, and program | |
| CN103597450B (en) | Memory with the metadata being stored in a part for storage page | |
| CN103473375A (en) | Data cleaning method and data cleaning system | |
| CN105975587A (en) | Method for organizing and accessing memory database index with high performance | |
| CN111552692B (en) | Plus-minus cuckoo filter | |
| CN104866610B (en) | A kind of SQLite based on similar type matching estimation deletes data reconstruction method | |
| US20170024439A1 (en) | Accelerated detection of matching patterns | |
| US8250076B2 (en) | Bit string search apparatus, search method, and program | |
| US7653619B1 (en) | Integrated search engine devices having pipelined search and tree maintenance sub-engines therein that support variable tree height | |
| CN105183915A (en) | Multi-version management method for reducing index maintenance overhead | |
| CN111552693A (en) | Tag cuckoo filter | |
| CN110197214A (en) | A kind of patient identity matching process based on multi-field similarity calculation | |
| CN108491402B (en) | Method for implementing lightweight file system | |
| CN106970937B (en) | Method and system for quickly establishing index based on local cache | |
| CN104077078B (en) | Read memory block, update the method and device of memory block | |
| US9275091B2 (en) | Database management device and database management method | |
| CN111008625A (en) | Address correction method, device, equipment and storage medium | |
| US8166043B2 (en) | Bit strings search apparatus, search method, and program | |
| CN103544239A (en) | Complete genetic relationship information base traversal improvement method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140129 |
|
| RJ01 | Rejection of invention patent application after publication |