CA2367863A1 - Associating information management system, program for associating information management, and recording medium - Google Patents

Abstract

The present invention provides an associating information management system for managing various types of information by associating. The system comprises at least a relationship management table 6 for storing association of parent-child relationship in identification information of various types of information, and retrieval processing means 4 for performing retrieval processing of various types of information from parent to child and from child to parent by association of the relationship management table in the designated information and scope. The identification information comprises ID, FAT information, address recorded in FAT, file type, directory pass, file name, scope of selection, object, attributes and information having attributes. Various types of information are managed by a member management table 7 for storing member data comprising the identification information and detailed information. As a result, it is possible to register and manage the association of various types of information by simple arrangement and to facilitate retrieval and extraction of the relationship.

Description

TIThE OF T8E INVENTION
ASSOCIATING INFORMATION MANAGEMENT SYSTEM, PROGRAM FOR ASSOCIATING INFORMATION MANAGEMENT, AND RECORDING MEDIUM
B,ACKGROUNV OF THE IHVENfION
The present invention relates to an assoaiat.ing information management system for the management of information by associating various types of information, and to a program for the associating information xnanagemeat, and also to a r~cording medium. The invention also relates to a pedigr~e type human relationship management system far recording information data.of individual persons and organizations by systematizing mutual relationship.
In the present-day information-oriented era and the age of IT revolution, extensive propagation is now see~rt 3.n various fields of personal Gomnputer, portable information terrmi.nal (PDA) , and other types of information teriainal devises. In association with such propagation, the ,informa.tion to be processed and managed at the information terminals is now extremely diversified including the infoxmat3.on': relating to individual person, information relating to organization, information relating to business operation, customer and other business, information relating to document and literature, and information relating to various typws of management. The information is not only diversafiiad in types but also in the amount of information. To cope wzth such situation, there arise l diversified relationships bettaeen these types of information. To effectively utilize the relationship of various types of information, it is essential and indispensable to arrang~ the ix~formation and place the re~.ata.onship of the information under perfect management .
In general, in making association or linking between various types of iafot-mation, it is generally practiced to bu~,ld up association in s tree structure from higher position to lower position according to a fixed rule, Zn case of a family tree, aonnecta,on is msde~ from parent to children, and further, to children of the children, and to other relatives. The association of the relationship from higher positioa to lower position 3.s basically important, and the relationship is normally not entangled in complicated manner.
However, ~rhen the types and amount of the information are increased, for instance, in a certain type or category, 3.t becomes necessary to perforsu association or liakiag of the relationship izlcluding the information of different types and different categories for the purpose of rearranging the total entity of the information. Fig. 1 shows an example of a relationship chart, and Fig. 2 represents an 'example of various types of information arranged by the association, For instance, if it is supposed that various types of infortuation A - J are associated arith each ether as shaven by arro~ts in Fig. l, the association of all types of Information iswot generally represented by a tree

2 structure as shown by solid~lines. The relationship between A and F may be given by an association between A
and B, C and D via dotted l3.ne . In this tray, there axe different routes of association in many oases. The relationship is then entangled and complicated if there are max~.y d~.fjEc~rent types of information _ Also, as shown 3.n Fig.
2, z.f there are different units of information such as hi,texature, ~ ~ university; ~ ~ construction firm, a person who prepares the document, draw~.ngs, ~ ~ document, section or department in charge of management, etc. If we take special notice of O D document, it is associated or related with a, parson who prepares the document, literature, dTawir~.gs, application document, storage place, or section or department in charge.
rn addition to the assaoiation of different types and categories of inform,atioa associated as described above, when it is wanted to systematize human relationship or human coanect3.on in the information relating to individual person., the number of persons connected or related to one person may include several to several hundreds of persons_ Further, there is a friend of a fxi.end who is further connected to another friend. The same person may be repeatedly associated in a pedigree of the sgme human relationship, and the situations are very complicated..
When the association of these different types of information is ~xprassed is a gersorstl rwlxti.onship chart, it is very compla.cated, entangled and troublesome. It is very difficult to record all of these relationships. In

3 this respect, it is necessary to manage the information by limiting the relationship depending on each intended purpose. For instance, in case of human relationship, only ' the important part of the relationship is placed under management by human memory. This is the situation we are confronted with at present.
In a general fam3:ly pedigree, it is possible to indicate family members in direct line, while it is difficult to inda,aate the relationship of maternal relatives connected by marriage. Maternal relatives of the eldest son can be indicated somehow as shown in Fig. 3.
However, when ~.t is taanted to indicate all of the materna3.
relatives of all brothers, to include all ~paaternal relatives based on"Ghe marriage of each of the brothers of 15~ all spouses and to include alI other maternal relatives of parents and brothers of the par~nt and maternal relatives of the parent' s' home, there is Sao other approach but to express the relationship~by a 3-dimens3.onal method.
Moreover, it is a family relaa:i.onship. The name of sn inclividual given in a family tree aprpears only at one point.
The, number of brothers is a little more than a dozen at the most.
However, when human relation is to be syste~aized, the number of the persons connected to a single person will be s~veral to several hundreds of persons as~shown in Fzg. 4.
A friend of a friend may be a friend of another friend.
The same person may appear repeatedly in the same pedigree.
Under such, situation, it is vexy difficult to record

4 the xelationship, and all of these relationships cannot be recorded. For this reason, only the important part of the whole human relationship is placed ;,:r.der :..a..-.ag~tent, relying on human memory.
In the past, a system for managing the information has been proposed (JP-A-2000-66970), in which name of transmitter, name of addressees ar~ extracted from e-mail address. A3so, an apparatus for obtaining human relationship information has been proposed (JP-A-11-66082), I:0 in v~hich the information on visiting cards is read by computer and the information that a visiting card tans given from Mr. So-and-so is registered.
I3owever, is the prior art as described above, only 2-dimensional connection of human relationship is defined, and it is not possible to define or retrieve the information regarding extensive and deep human relationship in 3-dimensional extent such as parent-child relationship (senior-junior relationship).
SUb~ARY OF TFiE IN'VENfiION
It is an object of the present invention to provide a system, by v~hich it is possible to register and manage the association of various types of information by a simple arrangement. Further, it is another object of the present i=ivention to provide a system, by which it is possible to retrieve and extract the relationship of information in convenient manner. Further, it is still another object of the prc-cent invention to provide a system, by which it is

5 possible to express a pedigree of human r~lationship on a 2-dimensional paper so that the route of relationship can be searched in relia~l a manr_e= e:~sn :~:hea the same psrsc repeatedly appears in the pedigree. Further, it is yet still another object of the present invention to provide a system, by which it is possible to express the connection by parent-child relationship, to clearly distinguish,the relationship snd to differentiate the deep connection.
Further, it a.s still another object of the present inv~ea.tion to provide a system, by which it is possible to perform pedigree type human relationship managem~nt and to indicate a family pedigree not by generation but by degree of relatives and to freely trace and to display a family tree ~rithout fixing direction of connection in parent direction and child direction.
To attain the above object, the present invention provides an associating ir~formation management system for associating various types of information and for managing the information, said system comprising a relationship management table for storing parent-child re3,ationship in identification in.fortriatian of each type of information; and retrieval processing means for performing retrieval processing of various types of i~aformation from parent to child and from child to parent by association of the relationship managem$nt table is the .information and the scope as designated.
Further, the present invention provides the associating iriforsnation management system as described

6 above, wherein said various types of information are managed by a member management table where member data comprising said ideatifioation infomnation and detailed information are storad_ Said detailed snformation S comprises type and rank, classification and job type and also comprises classification Information for ciassifyiag the members. Farther, the present invention provides the associating inform$.tion management system as described above, wh~rein said detailed information comprises var~.ous types of information including FAT information, address recorded in FAT, file type, directory pass, file name, scope of selection, object, attribute-and information having attribute. Also, the present invention provides th~
associating information management system as described above, wherein said identification information comprises ID, FAT information, address recorded is FAT, file type, directory pass, file name, scope of selection, ob~eot, attribute, or information having attrilautc3. Further, the present invention provides the associating information management system as described above, wherein said relationship management table comprises information of mutual associating direction and degree of relationship.
Also, the present invention provides an associating information management system for managing by associating 25~ various types of information, said systean.aamprising a relationship management table for stor3.ng pxront-child relationship ire identification information of each in~ormation, a member management table for storing said

7 identification information and sand variov~s type of information, input processing means for performing input, sat ~~ :~ $ :'~ 3~'~' ~s~; ~== Of i-ho ~i-a, ~ a a ar"~~; fir; _n_~,r 3,t2fS2rd~li3t ~Qlfl management means fox retrieving various types of information from parent to child and from child to parent by association of the relationship management table in the information and the scope as designated by. said input process~.ng means and for processing various types of information stored irr the member management table, and output processing mesas far performing output processing of the data processed by said associating information management means., fuxther, the present invention provides the associating information manag~ment~systeai as described above, wherein said input processing means associates one or a plurality of data stored in said member management table with one or a plurality of different types of data under a given condition, slid stores the result of the association in said relationsh3,p management table.
Also, the present invention provides an associating information management system provided with database, said database couiprising, a member management table for storing member information of individuals and organizations including name or organization name, address, telephone number, etc., and a relationship management table for defining relationship between a member registered in the xnamber management table and another member related to said u~aber by paxent~child relationship and for entering classification code to indicate type of relationship and

8 priority rank of the relationship.
In this database, it is preferable to provide, in addition to the relationship management table, an classification table for defining which relationship the classification code indicates and vPhich priority rat~3~ the classification node indicates for the purpose of increasing the processing speed.
In the registration items in the member management table, an area code for preparatiori of statistical data or i0 the registered member. sand for classification and assigruuent may be provided.
Further, present invention provides the system as described above, wherein when the member is designated as.a reference person, a member a.x~. parent-child relationship with said member is extracted and displays parent member, child member and grandchild memnber together oaith the reference person as s list, said system further comprising means for executing the following steps of:
(~.) making a code of a member selected in a member 2.0 list extracted by designating a specific condition as a xefer~nce person code ("reference person CIF") ;
(2) acquiriz~g iafarmation of the reference person from the member management table based on the reference persozi CIF and of storing the information in a reference person display area;
(3) extracting codes of all members in patent relationship of the reference parson from the relationship management table ("parent CIF") and classification thereof

9 based on the reference person CIF, acq~xiring each lAforln.atiOn from the member, management table and priorit~,t rank of alass~.fication fraut the: classification tablo, cad storing the infoxmation in a paxent member list display area from a member with higher priority rank;
(4) extraoting codes of all members in child relationship of the reference person from the relationship management table ("child CIF") and classification thereof based on the reference person CIF, acquiring each information from the mezaber management table and priority rank of classification from the classification table, and storing the 3.nformation in a child member list display area from a member with higher prioxity rank;
. (5) extracting codes of all members in child relationship of a child member at the uppermost part of the child member list display area ("grandchild CIF") from. the relationship management table based on a child CIF at the uppermost part of the child aeember list display area and Classification thereof, acguiring each information from the member management table and priority rank of classificata.on from the classification table, and storing the information in a grandchild member list display axea from a member with higher priority rank;
(6) displaying the display area;
(7) judging whether or not the user has selected a member other than the uppermost member i.n the child member list display area (If selected, advance to Step (8). If not se7.eated, advance to Step (9.) ) ;

(8) extracting codes of all members in child relationship of a child member selected in the child member list display area and classification thereof from the relationship management table based on the selected child CIF, acquiring each information from the member management table, and priority rat~k of classification from the classification table, and storing and displaying again the ~.nformatio~a in a grandchild member list display area from a member with higher prior~.ty rank;
.10 (9) fudging whether a reference person change button is pressed or not (If pressed, advance to Step (10). If not pressed, o~ait for the next iastructioz~. ) ; and

(10) making a code of a member as a reference person CIF'who was selected by the user fxcai each of the parent member list display area, the child member list display area, and the grandchild member list display area (Return to Step (2 ) . ) .
Also, the present invention providds the system as described above, wherein a member in parent-child relationship is extracted by a member code set is the xeference person, and degrees of relatives are displayed in a tree view in the order of relatives cf closer degree, said system further comprisixlg means for executing the steps of (1) acquiring information of the reference person saembar of the member xna.nagement table based on the ref~xeace person CIF, and displaying the information is a tree view area;
I,1 (2) selection of the first degree relatives (2-1) extracting a parent member from the relationship management table based on the reference person CIF, and additionally displaying the information uWder the reference person with one member in one step in the second column of the tree view area in. the order of priority rank;
(2-2) extractixig a child member from'the relationship m-anagem3ent table based on the reference person CIF, and additionally displaying the information under the parent 1:0 member with one member a.n one. step in the second column of the tree view area in the order of priority rank, whereby an abbreviation symbol is added after the name if a member with the same CIF is already displayed in the tree view;
(3) selection of the second degree relatives;
(3-1) performing the following processing in the order from higher position on members of the first degree displayed in the second column:
(3-2) extracting a parent member from the relat3.onsh3_p manageme3zt table based on the first degr~ae relative CIF, 20. and inserting and displaying the information between the corresponding first degree member and the next first degre~
membex with one member in one step in the third column of the tree view area in the. order of priority rank, whereby "selection of the second degree relatives" is not carried out zf the member of two degrees before (the refereirCe person) in direct line a.s the same member;
(3-3) "selection of the second degree relatives" is not carried out if an abbreviation symbol is attached to a me:.v:~ber in the corresponding step of the first degree;
~.'3-4) adding an abbreviation symbol after the name if a memh~.~.~ with the same CIF is already displayed in the tree view;
(3-5) ~::~tracting a child member from the relationsh~..p management tac::~':A based on the first degree relative CIF, and inserting an'. displaya.ag the information between the.
coxrespondiag firs~i: degree member and the next firs degree member ~rith ane membe.: in one' step in the third column of l0 the tree view area in t~-.:~ order of priority rank, whereby "selection of tY~~u second ~~ free relatives" is n.ot carried out if the meruber off' tovo deg-~:°:~es before (the ref~renae person) in direct lice a.s the s.?..me member;
(3-6) "selection of the seco.:~, degree relatives" is not carried out if an abbreviation r~y;.~bol is attached to a member of the correspoadiag step of t~w::° first degree;
(3-7) adding an abbreviation symbol ,.j.fter the name if a member ovith the same CIF is already disp~':y~ed is the tree view area;
(4) selection of a-th degree relatives (n ~4 (4-1) performing the follotaing proce~-sine respectively in the order from higher position on n-Z-th dagr~je ~aaeer displayed is n-th column;
(~4-2) extracting a parent. member from 'the relationship management table based on n-1-th degree relative CIF, and iaserta.ag and displaying the a,r~,forms.tion betw~aors the memb~r of the Corresponding ri-1-th degree and the next n-1-th degree member ari.th one member in one step in n+1-th column of the tree view area in the order of priority rank, whereby "selection of n-th degree relatives" is not carried out if a member of two degrees before (n-2-th degree relative) in direct lame a.s the same member;
(4-3) "selection of n-th degree relative" is not carried out if an abbreviation symbol is attached to a uiember of the corresponding step of n-1-th degree;
. (4-4) adding.an abbreviation sy~abol after the name if a member with the same CIF i.s already displayed in the tree 1O view area;
(4-5) extracting a child member from the relationship management table based on n-1-th degree relative CIF, and inserting and displaying the information between the corresponding n-2-th degree member and the Text ri-1-th degree member with one member in one step in n+1-th column of the tree view area in the order of priority rank, whereby "selection of n-th degree relative" a.s not carried out if a member of ts~o degrees before (n-2-th degree relative) in ds.rect line is the same member;
(4-6) (selection of n-th degree relative) is not .
carried out if an abbreviation symbol is attached to a member in the corresponding step of n-1-th degree;
(4-7) adding an abbreviation symbol ofter the name if a member with the same CIF is already displayed in the tree view area;
repeating Step (4) until "n" reaches a predeterrni.ned number by progressively increasing "t~." by one in Step (4) after the procedure of (5) above, and completing the 1~

processing if "a" reaches the predetermined number.
Further, the present invention provides a system as described above, wherein said system extracts up to ar~.y degree of relative as desired and displays whether a relationship route is made up using member codes of two members as set to the reference person, said system further comprising means for executing the steps of:
(1) setting one of the two mewbers for tracing they relationship as a regular member, and the other as a sub-member, storing a setting condition to trace ~ahe.ther the sub-~aember is connected with the regular member, and initializing array area in the memory for temporarily storing retrieval result;
(2) storing the setting condition as to up to which degree should be searched at the furthest or whether the shortest route should be searched or all routes should be searched as designated by the user when processing is performed;
(3) extractsng the first degree member in parent-child relationship of the regular member;
(3-1) judging whether ia-th (i = 1 to n) member is a sub-member or not among the number of records "na" of the extracted first degree member;
(3-1-1) if it is a sub-member, executing the processing of Step (3-1) to the record of the next first degree member by storing the route from the regular iuember in arxay area of the memory;
(4) if it is not a sub=member, extracting the second degree member in parent-child relationshsp of ia-th memb~r of the first degree;
(4-1) judging whether ib-th (i = 1 to n) member is a sub-member or not among the number of.~reeords "nb" of the second degree extracted;
(9-1-1) if it is a sub-member, executing the processing of Step (4-1) to the record of the next second degree by storing the route from the regular member in array area of the memory;
(~-2) if it is not a sub-member, judging whether the same member as ib-th member of the second degree is.present at higher position in the route or not;
(4-2-1) a.f it is present at higher position, executing.
the processing of Step (~-l) to the record of the next s~cond degree member by interrupting the processing;
(5)~ if it is not present at ha.gher position, extracting the third degree member in parent-child relationship of ib-th member of the second degree;
(5-1) judging whether ic-th (i = 1 to n) member is a sub-member or not among the number of records "nc'' of the third degree extracted;
(5-1-1) if it is a~sub-member, executing the processing of Step (5-1) to the record of the next third degree member by storing the route from the regular member in array area of the memory:
(5-2) if it is not a sub-member, judging athether the same member as ic-th member of the third degree is not present at higher position in the route or cot;

(5-2-1) if it is present at higher position, interrupting the processing and executing the processing of Step (5-1) to the record of the next third degree member by interrupting the processing;
(6) if it not present at higher position, extracting the fourth degree member in parent-child relatioxisha.p of ic-th member of the third degree;
(7) repeating the procedure by progressively irrCreasing the value up to the degree of the number as set in advance, and performing the following processing i:n the final degree member:
(7-1-) judging whether ix-th (i = 1 to n) member is a sub-member or not among the number of records "nx" of the final degree extracted;
(7-1-1) if it is a sub-member, storing the rout~ from the regular me~uber in array area of the memory, and advancing to the next record of the final degree;
(7-2) if it is not a sub-riember, a.dvanoing to the next record of the final degr~e . If the record of the f final ~0 degree. is co~ctp3.eted up to "n", performing processing, by progressively increasing by one the number of records of the degree oae step before;
(7-3) if the number of recording of the degree one step before is completed up to "n", performing processing by progressively increasing by one the number of reoords of the degree oue step begore;
(8) performing this procedure until the number of records of all degrees is completed;
i~

(9) rearranging retrieval results stored in array area of the memory from the member of lower degree in the route;
(10) displaying the first of the retrieval results in the tree view area; and '

(11) da.splayzng the route selected by the user among the retrieval results ~..n the tree view area if they user designates the change of the retrieval result display in the pulldown list box.
Still other objects and advantage of the invention will in part be obvious and will ire part be appaxent frocm the specification.
The invention accordingly comprises the features of construction, combinations of elements, and arrangement of parts which will be exemglifa.ed in the aonstruation hereinafter set forth, and the scope of the invention s~a.ll be indicated in the claims.
BRIEF DESCRIPTION OF TEE DRAWINGS
Fig. 1 is a drawing to show an example of a relationship chart;
F3.g. 2 is a drawing to show an example of various types of information associated or linked with each other:
Fig. 3 is a drawing to explain an example of a family tree as g~nerally known;
Fig . 4 is a drafting to explain an example of huuk-m relationship or connection;
Fig. 5 is a block diagraiu showing an embodiment of an associating infoxmata.on management system according to the present invention;
Fig_ 6 is a table showing an example of a member management table;
Fig. 7 is a table shoooing.an arrangement example of a relationship uianagement table;
Fig. 8 represents tables, each shova3:ng an arrangement example of a master table;
Fig. 9 is a flow chart to explain an example of flog of associating retrieval processing of the associating info~tion management system according to the present invention;
Fig. 10 represents tables, each shor~i.ag an example of retrieval condition and output condition;
Fig. 11 is a draping to explaim a case where synchronous system is used;
Fig. 12 is a drawing to explain an exataple of association in parallel using parent selection group and children selection group;
Fig. l3~is to explain an example of association in series based on concordance or agreement of categories;
Fig. 14 is an illustration to explain: an example of an import between database of hh system;
Fig. 15 is a drawing to explain taedia for connecting related items;
~ Fig. 3.6 is to explain association iu a file management software such as E~lorer;
Fig. 17 is a cart to explain partial association in a file of various types of data:

Fig. 18 is a chart to explain association of other files;
Fig. l9 is a chart to explain. a case where items, are associated by providing a plurality of management tables:
Fig. 20 is a drawing to explain a customer management method of card type as couunonly in use;
Fig. 21 i.s . a drawing to explaxr~, ari example of the relationship management table in the present invention;
Fig. 22 is a drawing to explain child relationship;
Fig. 23 is a drawing to explain parent relationship;
Fig. 24 is a drawing to explain parent-children:
relationship;
Fig. 25 is a drawing to explain a route betoPaen a user and a person whose relationship is to be searched;
~.5 Fig. 26 is.a drawing to explain connection based on par~ant-children relationship in the present invention;
Fig. 27 is an illustration to explain an example of a.
screen of a mevmber introduction pedigree of the present invention;
Fig. 28 is an illustration showing an example of a screen to search member re2ationship retrieval in the present invezition;
Fig. 29 is a drawing to explain how to search a pedigree in the present invention;
Fig. 30 is a block diagram showing software configuration of a system according to the present invention; .
Fig. 31 is an. illustration of a main menu screen of a system for carrying out the present invention;
Fig. 32 is an illustration sho~inq.a meacber infor~aata.oa input screen of an embodiment of the present invention;
Fig. 33 is an ~.liustration of a box item, input screen of as embodiment of the present invention;
Fig. 34 is an illustration of a box item input screen of the e~mbodimeat of the present invention:
Fig. 35 is an illustration of an area node input ZO screen in. an embodi:aent of the present invention;
Fig. 36 is an illustration of a relationship classification registration screen of an ennbodiment of the present invention;
Fig. 37 is an illustration of a relationship classification registration scr,~~ of an embodiment of the present invention;
Fig. 38 is an illustration of a relationship input screen of the embodiment of the present invention;
Fig. 39 is an illustration of a screen of a member introduct3.on pedigxee (parent, children and grandchildren) in an embodiment of the present invention;
Fig. 40 is a drawing to explain a scope of p.edigreel indicated in the embodi.merit of the present invention;
Fig. 41 shows details of the display screen of Fig.
39;
Fig. 42 is a drawing to explain a route to be searched in the relationship retrieval;
Fig. 43 is a drawing of an example of s.imuLtaneous use of the relationship management table and the relationship vector table;
Fig. 44 is a drawing to explain an example of a method to connect the relationship;
Fig. 45 is a drawing to indz:ca.te an example of linking of related persons classified in groups;
Fig. 46 is a drawing to indicate an example of a relationship pedigree prepared by reference object center display; and Fig. 47 is a drawing of an example of a relationship map prepared by position time s~ries display.
DESCRIPTION OF THE PREFERRED E~ODZMENT3 Description will be given below on embodiments of the present invention referring to the drawings.
In Fig. S, an input processing unit 1 performs input of various types of data such as registration, updating, deletion, etc. to the data, and inputs various types of instructions such as retrieval, editing, outputting, etc.
in a relationship management table &, a member management table 7, a master table 8, etc. An output processing unit 2 performs data transfer and delivery processing to other equipment and devices via network or communication lines, outputs display of information and prints out picture relating the result of processing based on input screen of various type of instructions such as retrieval, editing, output, etc., and carries out setting, registration, updating and deletion, etc. of the data.

A data registration and updating processing un~.t 3 for data management perforats various types of processing such as setting, registration, updating, deletion, etc. to the data based on the input of the input processing unit 1.
For instance, registration/updating of membex detailed information, registration/updating of history information, and related input are carried out. A retrieval processing unit 4 gains access to each data based on retrieval condition, which is set according to an instruction from the input processing unit 1, and carra.es out retrieval processing of. member information. For instance, member pertinent retrieval, member history retrieval, member relationship r~trieval, etc. are performed. An edit processing unit 5 carries out edit processing fox outputting results of retrieval according to a preset output condition, which is set according to an instruction from the input processing unit 3.. For instance, display of meanb~r introducta.on pedigree, display of information of a--th degree relatives before and after and connection 2d retrieval display, etc. are performed.
In the member detailed information registration/
updating, information of the member is registered, and images relating to the member are displayed by image display function. Alsa, by pressing a postal number retrieval button after inputting the postal number, correct address a.s detected fr~a. the postal number. In the history information registration/updating, detailed iuforraation such as corresponding history, history of sales proceeds, c etc. is registered for each registered member. Further, from the inputted history contents, a member is detected by history retrieval function. In the relationship ix~,put, it a.s registered from oihich point or to which point the connection is made said oPhat kind of xelationship it is . In the relationship classification, it a.s selected which relationship it has from parer~t or from child based on the preset contents, and the registered member is retrieved .
from the relationship classification using the member relationship retrieval function. In tha relationship details registration, detailed information to the connection is inputted at the time of inputting, and retrieval is made using the detailed information inputted at the time of xegis,tration by mesas of the member relationship retrieval function.
In the member pertis~ent retrieval, an aimed memb~r group is selected by repeatedly applying the results obtained by giving the conditions. In (AND) retrieval, the data is further selected by applying the current cond~.tion to the previous result. In (OR) retrieval, it reaches concurrence if either the result of the previous condition or the result of the current condition is satisfied. By the retrieval, the applicable member is ziormally displayed in a list box. When a non-applicable member is selected (cl.icked), members other than the salected members based on ' the condition are displayed in the list box. In the member history retrieval, a member is retrieved according to the histoxy inputted for ~ach member. For instance, when the history is used as buy-and-selling inftarmatioa, a person who has sold "~~" ~oithia the preceding week can be retrieved. In the member relationship retrieval, retrieval is ma.ds aoeordiwg to the relationship between members. For instance, when the relationship is used for exploiting customers by sal~s staffs, sales strategy can be set up for each area by registering expectation rate for each customer.
In the member introduction pedigree, persons to be referred are displayed, who are within two degrees 3.r~
20 senior direatioa and in junior direction respectively. By changing the persons to be referred, all relevant persons can be referred. In the display of n-th degree relatives in senior and juni.ox directions, based on the persons to be referred, the relevant persons are displayed is different colors to five degrees in senior direction and in junior direction respectively (in 10 degrees is total), and lists of senior members and junior members are displayed on one side of the screen. In the connection retrieval, any two persons as desired are specified, and it is retrieved whether there is connection between the members.
A relationship management table 6 a.s a tak~le for finding association (linking) oa one-to-one basis on various types of individual information according to the identified information. In the present invention, the ~ identification inforraatibxl includes identifier, identification number, identification code, ID, ID number, CIF. Further, it includes information of file location table (hereinafter referred as "FAT") under management of OS, individually identifiable attribute information, etc.
For the association, inforsnat3.on such as xelationship . classification to identify degree of relationship is added as necessary in the mutual. relating direction, e.g. in the direction of : parent --~ child, master -> slave, senior --~
junior as shovm in Eig. 7, or in reverse direction. In the relationship classification, for instance, in case a.t is related to a person, classification includes senior staff, junior staff, colleague, introduction, or hostility. Ia the relationship of school or colleg~ graduate last, c3assification includes year of graduation. In the relationship of non-person object, ownership is included.
In the relationship in a company, classification includes subcontractor, affiliation, or business'partner. In the relationship used for personnel effioienay rating, classification includes direct subordinate, colleague, or belonging department. In the relationship used by financial institution in the management of relationship for guarantee, classa.ficati.ou includes guarantor, joint suxety, related building,'or xelatad land. In the relationship of document, literature or drawing, classification includes a person taho prepared documant, author, i~ntroducer, recommender, etc. These are set for each type of relationship. A plurality of these relationship management tables are used depending on the int~nded purpose when neaassazy.
~. member manage~tent table 7 stores information such as information of each member to match ~.he i.dentification information ox related information to acquire the infortnatioa, e.g. information such as FAT .infortaatioa, address recorded in FAT, type of file, position information, object, attribute, attribute~inforutation, etc. A member includes a person or an object such as person, document,' literature, drawing, enterprise, head office or branch office, department or section, place, facility, organization, commodity, machine, equipaaent, etc., taagibla ox intangible management unit i.acluding facility, agency, organization, data, file and any type or category is included. For the member data to be managed, identification information specific to member, .
classification information of member for each type depending upon each member, or position information such as folder, relevant infor~tation given by physical address number, detailed information specific to member, etc. are registered. These~are directly managed by member information or indirectly raanagad by the information to acquire member information.. For instance, classification information for classifying each member as shown in Fig. 6 includes the a.nformata.on such as information for type of each member, rank, classification, job type, etc. Detailed information specific to the member is the information such as r$sum~, personal history, etc. Date is the date of registration and updating.
Iu the classification information, type, rank, classification, or job type of the member is the classification information. are the conditions for editing and' outputting the infozzn~atioil for retrieval . Depending . upon whether it is specified or not, it is judged whether 5.t should be included as an pb3ect of editing a.i2d outputting or it should be excluded. In the infoxznation of 5. summary (epitome), name is registered as the name of the member in case of a person, and the data such as sex, date of birth, present address, telephone, facsimile, E-mail address, working place, belonging department or section, job title, date of entry to the company, belonging group, hobby, personal history, r6sum6, photograph, etc. axe ' included. In case of document, literature, or dra~3.ng, its name is regarded as member name, and the data such as literature classification, date of preparation, date of publication, person who prepared, publisher, author, smmxuary of the content; ~rords of recomcmendation, or words introduction are included. The information of personal history'includss brief history of the member or updated personal history.
A master table 8 contains a de~znition table of various typES of information, which is necessary to set.
xagistration classification so that minimally needed information is registered depending on each member information to the member management table 7 or to specify the cond.ita.on for retrieval pr edit output. For instance, these inc2ude tables classified by type, rank table, class3fiaata.oa table, jab typ~ table, rwlationship classz.f3.aation table, etc.
Type classification table is to define the information of each type to identify the member as shorn in Fig. 8 (A), i.e. to define person, company, document, etc. The rank table is to define rank and priority as shown i3n Table 8 (B). In general, the rank includes the following ranks:
the most important, important,. or customer A rank, customer B rank, customer C rank, and also priority such as high, intermediate, or low. As specific rank, there are ranks such as "in negotiation", "re-negotiation possible",'or "no acquaintance". In the norl-person member type, thezre are movable property, real property, etc. For the purpose of using the rank for the members in listing, ranks include the person himself or herself, or a person already listed, and priority such as high, intermediate, or low'is defined.
In the classificata.on table, area, or department or section to be used in personnel efficiency rating or intra-company rating as shown in Fig. 8 (C), or commodity, group, etc. are defined as the items belonging to large classification, medium classification, or small classificata.on. In the job type table; each of the job types such as manufacture, inforasatioa service provider, self-governing body, architectural and building firm, insurance or financial organisation, agricultural, forestry or fishery firm, or self-supporting business, ctn. are . defined.
The relationship classification table defines the relationship classification as shown iii fig. 8 (E) anal the priority. In general classification, job types include senior staff, junior staff, colleague, introduction, hostility, eta. When parent is classified by school or college'name, graduation is used. When a child ss alassifa.ed as anon-person object, it is classified by ownership. When the relationship between cazapanies is classified, it is classified as subcontractor, affiliated.
partner, or business partner. When relationship is clsssifs.ed for persox~.nel efficiency ratizig, there are classification such as direct subordinate, colleague, or beloxiging department or section.
The relationship classification plays a role of a "hand" to connect the registered members ~oith each other, and it is defined by a code, which represents coxinection of tovo data (members) . It is used to specify in which relationship these are connected ~o3.th, each other . When linking or associating a person with another person, ox a person pith an object; or an object with another object, there are differences in the degree of reLatiotsship, i.e.
deep relationship, slight connection, insubstanta.al acq~aintanae; for instar~Ce. Priority is added to the relata,onship classification by taking these situations into account so that more important and more intimate relati.oz~ hip is displayed at higher position.
Next, description will be given on associating retrieval processing of the associating information managemaat system according to the present invention.
In the associating retrieval processing of the associating information management system according to the present invention, retrieval conclition is set (Step S11) and output condition is set (Step S12) as shown in Fig. 9, for instance. As the retrieval condition, it is set as shoo~a in Fig. 10 (A) . For a.rrstance: which member type should be retrieved, o~hich classification, rank or job type should be retrieved, and further, the range of retrieval i.e. up to which stage or up to which degree of rela.ta.ves the retrieval should be ~ctade_ As the output condition, it is set as shown in Fig. I0 (B). For instance; how far parents and children should ba outputted, which color should be assigned as output color, whether relationship should also be outputted or not, whether parent direction or children direction should be outputted by arxows or not, in vPhich direction (left or right) parents or children should be outputted, whether parent or children should be L5 outputted in form of table or not, or whether it should be outputted in tree structure or not, etc., i.e. the mode snd the pattern to be outputted should be designated.
Next, children. are retrieved from parents according to the retrieval condition (Step S13), and the retrieved child and its relationship is stored in memoxy (Step 514).
Similarly, parent is r~trieved from children (Step SI5), and the retrieved parent and its relationship are stored in memory (Step S16). further, based on the output condition, it is judged whether the retrieval of the next stage should be perfozzued or not (Step Sl7). If the retrieval of the next stage is needed, retrieval is performed in Steps SI3 -S16, and the meutber of the final stage retrieved and stored i.s used as a retrieval key (Step Sl8)_ If this is overlapped ovith the retrieved and stored members, the retrieval key is deleted {Step S19), and it is returned to Step 513, and the same procedure should be repeated.
In case it is judged in Step S17 that the retrieval has been completed, the ~cetrieval result should be edited according to the preset output condit3.on {Step S20), and the xetra.eval result thus edited is outputted (Step S21).
Next, detailed description mill, be given on the detailed information to be registered in member data. The ynformat~.on of the summaxy is not limited. to the item name and it can be chaaged according to the intended purpose.
Eor instance, in general summary items, the items such as registry t'iumber, date of the first business transaction, business de~taa.ls, memorandum of business details, etc.
should be registered. When the information is used for insurance canvassing, the stems such as insurance policy number, date insured, fazaily details, medical history, atC.
should be regist~red. Then the information is us~d far ' personnel efficiency rating, the items such as employee number, date of entry to the company, fami3.y details, specific items, general evaluation, etc. should be registered. When financial institution manages the connection of guarantee, the items such as account type and accout~,t number, contract date, family details, whether there are liabilities on guarantee or not, assets, etc.
should be rega.stered. When the information is used for sales activities, the items such as membership cumber, data of the first visit, special features, hobby, and taste $2 should be registered.
The history information is used for such purpose that the corresponding records is tires series can be inputted.
Fox instance, in general items, items such as date, details of arrangement, sales goal in numerical figure, achievability, carry-oust to the following term, etc.
should be registered. 'When the information is used for sales activities, the items such as data or purohase, name of the purchased product, quantity, amount of purchase, number of premium pouts, etc. should ba registered. when. the information is used for insurance, the items such as date of change of the amourst insured, name and type of insurance and other details, number of .payment of insurance p~reiuiura, basic amount of insuranea, total amount, etc. should be registexed. When the information is used for personnel management, the 3.tems such as data, name of fob, amount, self-evaluation, intra-company evaluation, etc. should be registered. When the infozzaation is used by financial 2U a.nsti.tution,.the items such as date of loaning, mortgage,' amount of loan, amount of expected monthly reimbursam~ant, balance., etc. should be registered.
Whey mutual relationship of members connected on the relationship a.nput sateen is inputted as additional.
information of relationship summary a.tetns, the items are set as appropriate depending on thw iil.teadQd purpose. For instance, ~ben the information is used for general purpose, the items such as event, notable features of parent, notable features of child, date of introduction, memorial day is common, date of remarks, reliaba.li.ty of parent on child, reliability of child on parazit, intimacy, evaluation (parent to child), evaluation (child to parent), etc. are registered. When the information is used for business transaction; the items such as receiving of order, order placement, subcontract, date of introduction, date of (the first) transaction, date of (the final) transaction, shareholdings, weight (ratio) of order placement, weight (ratio) of receiving of order, transition of relationship, details of business transaction, etc. are registered. When the information is used for insurance, the items such as hobby in common, special ability, health condition, the latest date of encounter, date of the first acquaintarsce, wedding anniversary, intimacy, number of years of acquaintance, hostility, remarks, ete. are registered.
When the 3.aformation is used for personnel management, the 3.tems such as year, department ox seeti.on asszgn.ed, date of assignment, date of ~valuation, date of ttansfer, ability, 2Q cooperativeness, tenaciousness, evaluation (parent to child), evaluation (child to parent), etc..are registered.
When the information is used by financial ~.nstitution, the items such as details of guarantee, mortgage rank (object), memorandum, date of guarantee updating, date of the first payment, date of the last payxuent, amount on guarantee, limit amount of guarantee, current nominal price (object), detailed relationship-, etc. are registered.
Further, description will be given on embodiments, to which the associating information m,anagemeat system of the present invention is extended.
First, description will be'given on synchronous system, iati which the associating information management function of they present invention is provided to other database already built up and placed under management.. ',~'o add the related management function to the existing database, there are two methods. a method to prepare the software uz~der operation again from its beginning, and a method to connect a related 14 managemexlt software having data delivery interface. The synchronous system refers to the latter. In the synchronous system, ID number specific to the data of the database i.s recorded in the relationship management table as. showr~ iti Fig. 11 ~ta.thout totally modifying the software of the existing database structure. That is, a plurality of different types of soft~oare ase provided to ore database.
Howevex, the database itself is often designed for the existing software. In this respect, the interface to receive the iaformati:on from tb.e existing software is contained iin the related utanagement software. In so doing, on the related management software, s data reference portion of the existing software can be utilized without developing basic data d~.splay portion. On the related management software, the data already registered are associated or linked with each othex, and the relationship xnan.agement such as pedigree display is Contained in the software. It is possible to incorporate all functions of the existing software (by tire function to execute external software) in the related management software so that it looks apparentlli that the related management portion is added to the existing system.
To utilize the synchronous system, it is necessary to monitor the change of Z'D due to adding, correction, and deletion in the existing software on the related management software. Wheis the existing software allows the change of =D, the related management software must cope rPith the reassignment of TD number or an unchangeable ID must b~
added to the existing data. By applying the synchronous system, it is possible to shrift to a system having eost-saving related m.anagemerst function without introducing a new systean ovhich is to replace the database system currently in operation.
Next, description w3.11 be given on automatic association or linking. It clay be designed in such manner one or a plurality of any data registered in the member management table (such as the data consistent with a given condition, or data of selected category) are assoc3.ated with one or a plurality of different data. In this case, the association in seris.s, i.e. the association of a pluxality of data selected by an arbitrary designation connected one after another and in. series, is performed ixx, the order rearranged by the user, or one by one.
Also, as the association in parallel, the data extracted by condit3.on designation from all data, the data extracted in a category specific to each data, the data arbitrarily selected, or all data are displayed to a selected parent group or a se~.ected children group, and association is earr~.ed out by the designation of parent and children, and the relationship management table is prepared.
In this case, if thezre is one mambar each in the parent selected group and the children selected'group as shown in Fig. 12 (A) , one-to-one associata.on is performed by directly regarding each of these as parent and ch3.ld.
Also, where there are one parent selected group,and a plurality of children selected groups, association of the parent is performed with each of the children on one-to-one basis, and on one--to-multiple basis as many tiuies as the number of children. If there are a plurality of parent selected groups and one child selected group, one child ~i.s associated with each of the parents repeatedly on ore-to-one basis, and further, on multiple-to'-one basis as~many times as the number of parents.
If thexe area plurality of parent selected groups clad a plurality of children selected groups, association on one-to-multiple basis i.s performed as many times as the 2Q number of parents or associ2ttion.on multiple-to-one basis .is performed, as many times as the number of children. As shoovt~ in Fig. 12 (B) , the association on multiple-to-multiple basis is performed, l.c. a rtew or existing data is designed between parent and child'. All of the pareat-designated data are r~garded as parent of CY, and all of the children-designated data are regarded as children of 4', and these are stored in the relationship table_ Each association is performed by general processing starting procedure using an association button or by drag-and-drop method.
As the association in parallel based on the, consistency of category, a plurality of category ' registration fxaiaes are grovided for each of the data in, th~ member management table as shown in F.ig. 13. ~.'h.e data.
consistent with the selected category such as horse, tree, apple, flower, mountain, etc. are selected, and these are associated with a new or existing data. For instance, this 1,0 can be applied similarly to the data, which contains the same attribute or the same Words~such as the same group.
Now, description will be given on ia~,port b~tween databases. When the associating information management system df the present invention is divided into a plurality of grades such as professional version, standard varsion, or personal version, it is possa.ble~ to bu3.ld up a pseudo network such as hh system including a manager and one or a plurality of staffs as shoran in fig. 14. here, the professional version is defi3ned as a version ~rhere there ~.s no limit to data regi.stxatiox~, ha.story information can be inputted and retrieved, relationship detailed information can ba inputted and retrieved, and a plura3ity of databases are allowable. The standard version is defined as a version where there is no limit to data regi tration, and h3.story information can be zaputted and retrieved. The personal versiori is defined as a versioFt where registration is limited to sevp~ral hundreds of items and a common databases is-used. fhe,professional versian contains a plurality of databases and these can be used by switching over to each other. The database can be an object of operation regardless of wherever i,t is on the other personal computers on T.AN so far as it is not within the same folder.
Using the professional version, the manager can refer to and update database of staffs in addition to the manager's own database. Using the standard version, the staff cannot operate any more except the staff's oraa database. If data of other person is copied without permission, ~-rank ID and password aria provided for each database, and it is prohibited to enter inside. 8y the professional version, it is possible. to refer to and update a portion of the relationship detailed information, s~hich cannot be found it1 the. stand, rd t~ession, and it is possible to wr3.te on the database of a staff beyond the staff' s own management _ The data associated within the range of up to n-th degree of relatives from an'arbitzarily designated data is turned to an object of import.. A code not overlapping faith the data identification code on incorporation side is re-assigned and is imported. At the time of itnportiag, if there are the same data on the incorpotation side and on the iBIpl2Cntat3.Git a.3.Gi2, association is perf:.~ad further on "the person in question" (relationship classification that it relates to the same data). If it is not definitely certain whethat the data are the same or not, the user is asked to select whether a message should be provided to~the user or a.t should be judged as the other data.
Next, description ss~.ll be given on operation on the file management software.
t~ihen we look at the curxent status of the file management software (such as Explorer), the file management software is regardsd as a large storage place for accomanodation as a whole, and files are merely divided and placed in classifiable container boxes called folders, and it is not possible to search file relatioaship. However, for the management of files, it would be much easier for everybody to arrange and put in order a.f the cozu~~ation between the files is known.
For instance, if it is supposed that there is a document A prepared using WORD and here is a document A' which is prepared by correcting the daeuaZent A. In this case, if there is relationship between these two documents, it mear~.s that it cannot be indicated except by the f3.le name or by the fast that the documents are stored in the same folder or there is relationship in property. If these documents are identified by the property, and in case the documents A" , A" ' , A" " , etc . are prepared; the fact that the document prepared subsequeatly is related with the document previously prepared must be entered in the property of all documents prepared so far.
When the document A" " is prepared, and if only the property of the document A''' is changed, it is not possible to find that there is relati.ouship bet~caen the documents A and A" " unless the properties are checked by going back one by one. Similarly, ~obat is related to different file format (such as document, table calculation, image, CAD, etc.) cannot be summarized by the p~rson who prepared the documents if these are classified by categories. If the documents are classified according to the type of file, inconvenient situation may arise that unif3.cation in business operation cannot be achieved.
In this respect, if the assoaiat3..ng iaformati.on management function of the pres~nt invention is added to the file management software, the stored places may~ba arranged in easily iaatelliggible folder . such as classification~by category or by the person who prepares.
8y displaying the relationship chart of the files related, it is possible to summarize by the history of change o= by business.project.
In the file management software, there are provided functions such as an automatic associating function, a function to display pedigree such as parents, oh~i.ldren a~ad grandchi~ldrea, a function to display tree type pedigree such as the relatives within 5th degree before and after; a funetiou to search route betvPSen relatives of a certain relationship such as connection search, or a function such as relationship input screen. Association can be carried out either by the use of relationship input screen or by drag-and-drop method.' When the associated files are copied on Explorer, all associations axe not copied, but association with the original file is made up by duplication. If the file is a concealed file, 3.t is displayed in such manner that association is not carra.ed out ovhen the concealed file is set as not to be sees.
Association is performed not by file name, but the file is turned to identification information, and position information or, physical address nutuber of folder can be used. .
Description will be gives now on a medium to connect the relationship. If the medium is included in the concept of the associating info~mation.management function of the 20 present invention to connect the relationship, information such as audio iaformation, time information, position information, etc. i.a. attribute specifiable as an independent ob ject even when a part of it a.s extracted or an information having such attribute, sre.hsndled as the la object for management a.nd'these are placed i.n an array such as database. For iastance, as shown.in Fig. 25, o~z an arbitrary sheet or a selected cell is the table calculation software (A) , the entire file of the file management software (B) . an arbitrary object 3.n a CAD drawing (C) , an 20 exttireW wage of the a.mage (D) or as arba.txary selected part of it, related information is stored ixt. the member management table (F) using a key to specify back number of the array or address as identifier. Then, association is performed in the relationship management table (E). As a 25 result, the information can be used not only in Explorer, but also in a new or existing application.
Noror, description twill be given on the association in a file management software such as Explorer. In Explorer or the like, the folder to 1~e displayed and file name are stored in directory pass such as file allocation table ("FAT") under management by OS. In order to provide.
Explorer ~ovith the associating information management, function of the present ~.nvention, there axe the following methods: ~ a method to have the member management tabl~
at a place other than FAT; ~ a mrethod to use FAT itself as the member management table; and ~ a method to manage the relationship in such manner that the relationship management table.has FAT information izseif, and not the concept to manage ID.
Ia the method 1U to have the member management table at a place other than FAT, ID and file iafox~aation recorded in FAT are copied i.n the meaaber management table shoprn in Fig.
16 (A) and is used, or iriformation such as physical recording position address in FAT 3s used. In the method ~, th.ere are a case where 7D is given by changing the shape of FAT itself zn the stage of OS designing as shown in F~.g. 1f (8) , or a case where information such as .physioal xecording position address a.n FAT is directly put.
in the relationship management table and association is performed, or a case v~rhere FAT information itself is stored in the relationship management table and is associated. In the method ~, FAT information itself can be identified one by one . Therefore, relationship wanagemdent carr be accomplished by recording a.n the relationship management table without specifically putting TD as shown a.n Fa.g. 16 (C). According to this method, FAT information or physical xecording position address in FAT ~.s stoted in the relationship management table, and the relationship management table-must be changed simultaneously v~ith the change of file or folder.
As for the object to connect the ralationsha.p, regardless of 9,rhether ~.t is a file or a folder, it can be achieved if it ,can be processed on the file manageanent software even on a network. An Explorex-like object, which has the same function as Explorer belongs to individual application, which has the same function as Explorer, has ' file information in a specific area instead of FAT, but the functions are the same.
In the following, description v~ill be given on a concrete execution exam~sle . Fa.rst, an area to specify file I5 and the like to be associat~d is provided somewhere on the screen, and an object to be associated is put into it by inputting or drag-and-drop. In each specified area, one or a plurality of plaoes aan be designated such as list bo~ces.
As already e~splained in connection with Fi.g. 22, assaaiatiou can be performed on one-to-one bases, one-to-multiple basis, multiple-to-one basis or multiple-to--multa.ple basis. Then, axr arbitrary file is selected. For instance, pedigree display is selected on menu by pedigree display button or by right-hand click, and it is txansfer~ed to a screen to display the relationship.
Further, a cozu~ection searching screen to trace the relation of taco or more files or a screen to display all relationship of the xelati.ves of a-th degree before and after may ba provided, and this may be performed from any screen as c~esi.red. When the associated file or folder is copied, it is possilale to select whether the relationship should be taken over as the origin~or copying or it is simply the association of the origin of copying with tha destination of copyizig.
Next, description will be given on partial associat~.on in a file, which contains a diverse types of data . Vrth.7se the case of the file manage~aent software, in which the association of file name snd folder name is involved, in the partial association of diverse types of data, the related application and the data file prepared by the applications must be provided with related information and related information processing functions. The same applies to the case where the relationship management is entrusted to the management software on OS side such as Explorer or in the case wher~ the data are assoea:ated within each of the applications.
For instance, description is given here on an image processing software and an image file prepared by the softarare . In general, the information, iii a file prepared by .an application has vazioyxs types of format depending upon utilization environment in addition. to image information, e.g. file format having attribute information such as shape, object, color, color saturation, brightness, alpha ahan~ael layer information, change history, etc. (such as PSD of Photoshop) , of a format having image infos~matioa only. The attributes held 3n the files has different ~5 a.nformation amount depending upon file format and the application used. In the ease, where a part Cut off from an image is to be copied and pasted via clip board, only the data at the moment of aopyiag should be the object of concern. Even when the attributes axe taken over, there is no need to take over file it~formztion. However, in order to have a relationship and to maintain continuous relationship, it is necessary to cope 9,tith the change of the contents and the transfer of the related scope.
Z4 Therefore, it is necessary to keep in memory in the file itself as to which attribute information the associated portion is and in wha.ch scope. In the image processing software, functions are needed to display the relationship information stox~d in the file and to monitor the change.
i5 In this case, basic data is not stored by the use of the member management table, but thc: selection scope to be associated or characterista.cs of the data axe recorded, and the data 3.tself is present in the original file. Naturally, it i.s possible to copy the data itself from the original 20 file and to record it in the meazber management table.
Specifically, as shoo~n in Fig. 17, the fvle may have the relationship designation scope information, and the member management table and the ze3.ationship management table may be used. Further, in case the member management 25 table is not used and the relationship is managed only in the relationship management table, or in case the information management i,s performed in the member management table or in the relationship management table, there axe various types of utilization environment to match each combinat_iort of the cond3.tions .
Next, description. will be given an an example where a relationship layer is provided: A relationship layer to display transparent relationship designation scope is provided and is overlapped on the image data. The scop~ to be associated is designated within the .image processing software, and this scope is displayed in the relat3.or~,ship layer_ As for the attributes in the designated scope, the 20~ amount of information is diff~riant depending on each ' applicat3.on (in addition the se3.ected shape and object) , such as color saturation, brightness, alpha channel layer information, change history, etc. Here, description is given an the s.electi.on scope and other attributes _ A
relationship iaformation setting button and the like aace provided in the image processing software. When the scope is selected by turning this button on, ID, type of fil~, c~.rectory pass, file came, selection scope, and other attributes ar~ written is the member management table. At QO tha same tiias, ID acquired at the tame when the selection scope was written in the member management table is recorded together with the selection serape information in the iom.ga file as identif3.cation name o~ the designated scope. Individual information written in th~ member management table is associated with the other information on the screen of relatiox~.ship input of the file manage~ttent software of OS by the relationship input button or the mean by right-hand click. . This relationship is Sarittan i.n the ~7 relationship management table. When a portion included in the xelationship designation of the image data is corrected, it 3.s asked whether the relationship designation scope should be changed or not by monitor function of the image processing software. If there is a change, the image f~.le recording the information and the member management table are also changed.
In case the member management table is not used, file type, directory pass, file name, selection scope and other 20 attributes may be &irectly writtea in the relationship management table and association may be carried out.
However, if ~,~e consider an independent member to perform different association with the same designation scope and the same attra.bute on the same file, all data must be stored after turning them to identifiable formatioa specific to the member inelud3.ng ID.
In case the relationship infortr~tion is not recorded in the image file, all informatioa is recorded in the member managemlent table or the relationship management table. The image processing software receives the information to be displayed on the relationship layer and the like, not front the image file, but from the external table. When the information is not managed by OS or unified managamerit software or it is not managed by the Z5 application alone, bixt it is managed in an image appla.cation alone, there must be a relationship management table and a member management table specific to the application, and the function such as relationship input or pedigree display must be provided an the image processing s of tware .
Description has baexi given above on the image .
Recording snd monitoring functions are needed for the combinations such as: word processor softvrare and document file, table calculation software and'book file, CAD
software and drawing data, sound source software and sound source data, etc. As shown a.n Tsbla I,8, when the member management table is used, ID, file type, directory pass, file name, selection scope, and other attributes are recorded. For instance, in case of table calculation, sheet, cell, format information, etc. are recorded. In case of CAD, layer, line type, color, shape, etc. era recorded. In case of a document, page, format s.aformation, etc. are recorded. In case of sound source, tame, ovavelength, sound range information, etc. axe recorded.
When the information is written directly is the relationship management table, not detouring the member management table, file type, directory pass, file name, selection range, and other attributes are recorded in the relationship management table. These may be recorded in such manner that the data can be identified from each other.
This can also be applied by the use of expression. which can indicate relationship of the data in the unit of bit to connect the relationship such as absolute address in personal computer: Tn addition to screen and printing meds.um, input and display means using external communication means such as Web, ASP, PDA, etc. may be used.

Basically, the fuzactions to display the data connected in parent-child relation in the relationship management table in pedigree and to follow up one after another can be provided on data side of each software or on OS s3.de of the computer. Further, connection retrieval function to trace and display the relationship between any data as desired may be provided.
Now, description dill be given on, the case oPhere association is carried out by providing a plurality of management tables: ~he~ objects to be associated are the registered members. In case it is granted to have relationship between a history,informatioa and another history information or in case it is odanted to associate history ooith the relationship infoxmation, or an image with sumamary items of other member, it is act possible to express by a single mezaber management table or a single relationship manageutent table. To cope with such situation, not a single but a plurality of the member management tables or the relationship management.tables may be provided in a single system as shoovn in Fig. 1.9. An N-th member Management table is recorded in such manner as to which part of ovhich infortaatiozi it relates to and of Which identification inforueation (CIF) in the member management table~as basis. In N-th relationsha.p management table, parent-child relationship associated in the screen for partial relationship input saxeen is recorded, and it is displayed on the pedigree for paxtial relationship display.
In so doing, in addition to the relationship pedigree ~thich can show only the relationship in head portion, the coz~neotion of each position can be identified.
The present invention is not limited to the above embodiments , and various ~eodificataons and var5:a~tioas Can 6 be made. For,instance, in the above embodiments, description has been given on information of summary and information of history as detailed information of me~aber data, while various types of information such as photographs or attach~aaent files may be added, or the 1G classified information according to identifa.cation code and detailed specific information may be registered for the same member.
As it is evident from the above explanation, the present invention provides the associating information 15 management system by associating various types of information fox management, cad the system comprises at least a relationship m~anage~aent table for storing association of parents with children 3.n identification information of the various types of,iaformatioa, and 20 retrieval processing mans for r8trieving various types of information from parents to children and from children to parents. As a result, the relationship between the data can be expressed by parents (master; senior) and children (slave; jun,iar), and tracing and display of the 25 relationship can be easily performed through management by the relative relationship in degree rather than by generation. Moreover, by associata.ng the.registered d,~ata wyth each other, it is possible to connect the data so far ~x as the relationship exists. It is also possible to trace the relationship route of the two members and to express the relationship in pedigree: Overlapped data can be distinguished by the relation of the same data without checking them one by one. Former family name and new family name can be made compatible through the associat3.on.
Also, the association Can be performed not only between man and man, but between man and object or between object and object. The data of object can be managed then the data are mixed with the data of man. For instance, when an important document is prepared, which may be used extensively later in a company axed which has business transaction with Government or public offices, it a.s possible to perform assoc3:ation to the parson v~ho prerpared the document or to the secta.oa or department in charge of document control, and theirs is no need to seek the da,ts in memory when it should be used.
Further, it is also ~asy to find books or map materials which were referred in the preparation of the doauznent and to. which section or to which branch offa.ce these books or ~aaterials belong. This can be accomplished by making association with the section or the branch office.
If there is only a.single clue such. as "section", "book", "material", or "document", even when the details may not be a.n memory, it is possible to find necessary information by searching the relationship one after another. Naturally, not only the document but also. the custoztrer and a commodity such as the purchased vehicle can be associated with each other. If land is inputted as data, the~transitioa of the ownership can be traced. Ambiguous data and uncartai.n data axe not turned to the data of unidentified nature a.f these are associated in the new sources.
Next, description will be given ou embodiments wh~.n, the present invention is applied to a pedigree type human relationship managem~nt system. In tha.s eiabodi,ment, the relationship chart which is expressible otaly 3-dimeusionally can be managed on computer. When a part of the i.rtformation, is selected. and indicated, it is possi.blQ
to express the informat3.oa on 2-diaie~asional paper.
In the following, basic concept twill be described.
In the system of the present ixiventioa, when data is i~aputted, full retrieval functions arm provided such as condition retrieval or furigana ('Tapariese vernacular) retrieval, avoa.di,ng the registration of overlapped data as much as possible for this reason, the data to be associated are placed und~er.management of one-point concentration type, and , useless connection a.s excluded. Lven when there may be overlapped data, these are connected by the relationship of "the data of the same person", sohen a pedigree is prepared, and it is clisplayed at nearby point_ Frar~a the concept of general customer mauagemeat, the data are stored in form of cards as shown in Fig. 20.
Customer number and the like connected to the subseguerit data are kept in memory in a part of individual data and axe used.

In. the system of the present embodiment, indiv~.,dual data and relationship data axe placed under management ~.n completely.separated form. The data of relationship ar~
also stored on one-to-one basis.
The basic file to express the relationship (table of database) has a customer number of parent, a customer number of child, and a relationship code.
Fig: 21 shows a11 example of this table.
If this is arranged in the order of parents, it is found that one person has a plurality of children.
In the exa~rtple shown in F.:;.g . i 2 , Mr . A has two persons is child relationship, i.e. Mx: B and Mr. D as shown in Fig.
22_ Mr. C has a child named Mr. A, and Mr. D has children named. Mr. B and Mr. E.
Further, when this file is rearranged in the order of ahildrexi., Mr . A has a parent named Mr . C as shorn in. Fig .
23. Mr. 8 has parents named Mr. A and Mr. D. Mr. I) has a parent Mr. A, and Mr. E leas a parent Mr. D.
' When we observe parent-child relationship with Mr. A
20. at the center, it is as shown in Fig. 24. By repeatedly following the chain connection in the system of the present embodimer~.t, s pedigree is prepared_ Fioovever, if the same person appears ire the pedigree, the one tahich appears at a point closer to the person at the center of the pedigree is r~garded as a regular route. Because the subsequent conneatioa is overlapped on. the xegtxlar route, it is represented by "....._".
As a result, even when the same person stay appear repeatedly in 'the pedigree (i.a. in case of circulationj, it is possible to search the related route in reliable mannex.
Further, in the system of the pxesent embodimeat, connection does not mean a siDnple corlaection, but it has directivity, i.e. a connection from which to which.
This has a very important meaning when the pedigree is expressed in a tree structure.
As already described, by rearrangiag with the pareat as the basis or by rearranging with the child as the basis, the directivity of the connection is clearly defined. By determining the person at the center, it is pos ible to find out the parson connected to it.
Compared with the pedigree generally in use with special emphasis on the direct line such as "parent -->
grandfather --' great-grandfather" , the relationship can he connected and seen to a further point in single-oriented combinatioa of "parent -> child -' child --~ parent --~ parent" .
By providing the directivity of parent-child da.reation, the connection which could not expressed only by the relationship on equal basis can nova be expressed in more clearly defined relationship such as subordinate, superior staff, former teacher, or former pupil.
By putting the priority to the relationship classification, it is possible to identify the intensiveness of the connection.
As shown in Fig. 25, oPhen a user of the system of the preseat embodiment wants to have connection with Mr. X, i,t ~..s found which route can be used more effectively.
As described above, by expressing the connection in parent-child relationship, the relationship can be clearly distiizguished, acrd further; is is possible to di,stingu.ish the depth of the connection.
When a pedigree is expressed by generation, it is seen by means of direst line of "parent --~ grandfather --> great-grandfather". As a result, a definite flow is formed, which defizies that senior is senior and jua.ior is junior.
~0 However, if it is expressed by the degree of relatives, there arc only parents and children. If rde give up the concept that parent looks down from above, and child looks up from below, the relationship can be folded in zigzag manner as shown in Fig. 26.
when a pedigree is prepared in the. system of the pr~sent embodiment by uta.lizing the above logic, it is as shown in Fig. 27. A person to be at the center of the pedigree is assigned at the furthest left. From. this person, a relative of the first degree ~.,s displayed by one step rightward regardless of whether the person of the first degree is par~nt of child. The parsons of the second degree are also displayed by one more step rightward regardless of whether the person is parent or child. Hy xep~aatixig this procedure,.the pedigree is developed in a tree structure and can be expressed on a plane.
As described above, by express.i.ng the pedigree not by geaeration but by the degree of relatives, it is possible to freely trace the relationship and to display in form of a tree without fixing the direction of connection, i.e.
parent direction, or child direction.
Further, in the present embodimata.t, only the connection of parent-child is catered in a file, which expresses only the relationship. By mechanically observing the relationship as ''parent --~ child --> parent --> child", the chases coauects.on of the relationship can be continuously seen. However, froma the limitation of screen display and pritat3.ng display, the scope detectable at one glance is 10. limited. If there is relationship further beyond the limit, tracing may be repeated maohaaically is the same mazuier as:
"parent --~ child -; parent ~ child", and the pedigree can be prepared. This is actually shown by a "member ir~troduction pedigree iparent, child, gxandchildxe~a.)". This is a display of the direct line only, and the relationship can be displayed endl~ssly so far as the .relationship exists.
Further, in the function of relatiozsship retrieval,, as shown is Fig_ 28, any tmo persons as desired can be specified, and it is possible to trace. tchether a .
relationship route is,made up to these two'persons. , In addition to the shortest relationship, all: possibly routes are searched within the specified degrees of the relatives, and the routes are displayed in a pedigree.
In this case, from th~ member used as reference, relationship is shown for 5 degrees in parent direction and 5 degrees in child direction, i.e. all members~in the connection of x-0 d~grees axe displayed.
As shown in Fig. 29, a relative in the fifth degrees means a person at the fifth position in the line. TnThen it is seen from a person who is used as reference, Mr. A i..s in the sixth degree and it is beyond the scope of the pedigree.
If Mr. $ zs used as refei.~ence, it is is the, fifth degree, and Mr. A is shown on, the pedigree.
When sees fiom Mr. C who a.s at osie end, Mr. D is iu the tenth degree, and the connection of eleven persons Can be seen. ' As described above, even the members who are beyond the display scope of the pedigree can be displayed by preparing a pedigree when the person used as reference is shif ted . .
Tn the following, description wall be gives on axzother embodiment.
Fig. 30 is a system blook diagram showing software configuration of a pedigree type human. relationship management system of as embodiment of the present invelxtion.
As the database, it aomprisas a member management tables for storiszg meaaber saformation of sndiv~.dual and organization such as name or organization name, address, telephone number, etc. and a relationship management table fox entering classification. code to define relationship between a meanbar registered in the member management table and another member relating to that member and to incliGate type . of relationship and priority rank of the relationship. The :caster table comprises a reference table such as classification table to define oahich relationship the classification code indicates and which priority rank st inda.cates .
Description will be given below on basic opexating p=aCedure and data processing in the system o~ the presei~.t embodiment.
F~.g. 3l is an illustration showing a main menu screen of the present system. ..
1. ~de~obQr management - Addition of tiers - Correction of tnam~b~rs Delatiop of .~mbex8 Ia tha above thxeg provass~s, i~patbf.ag, updating arid delst~.on o~ tha i,~ngcrm~t~,oa of i~sdivsduals sad oxga~3~aticxas axe pe=~'o~ed.
' Aelata,onship input , .. Pedi.groa display Ia thse a~sove two processes, aoaaaetyon of ~be~xa and 8edigsee ase r~g5.ste~ad and c~.isplayad:
2. Data avater3~.a3,a 2o ~t,e .opn~"tion is epec~.~sed, and tha correspoad.~.ng ~ber group in the registered members is extracted, and th~ roguit is outputtesd to'document os text tile.
3. . $a~9.a s~ttiag Cods setting and the ifka, which serve as the basis of the ~ywtema,, ase reg~.a~red and ire p~.aaed undar masvagem~eat .
4. ' ~ystesa, ~tsageu~er~t 7~afa~naaea and maaageaaoat ni da~C.3base axe osvrried, out .

button 'Addition of members" on the main menu screen of Fig_ 31 is pressed. From this picture, it is selected whether ~it is registration of as individual or registration of an organization. To register, the data such as name, furigana, date of birth, sex, address, telephone number, and facsimile cumber are i,uputtad: A7.so, it is selected whether the data of this ~sember may be made public to the other reader or riot.
Now, description will be given on specific input items in this input screen.
Z. Box A box is a rank code. It indicates which type of partner to the user the member currently to be inputted is.
Fig_ 3 shows an example.
Iu the meaning that data cards of the member are assorted and stored in the box of rank, it is called a "box" . The box can. define priority rank .
In the system of the present embodiment, unlike the custo3uer manageonent software to place only the custamsrs under management, it is :important to input a person, with whom the member has no acquaintance but dishes to have connection is future, or a person related to such a person.
If a tank is set its the box, which means "no acquazntance~' , i,t can be distinguished from the present customers.
By increasing the registered data and by connecting the relationship there arcs~s the poss~.bility to make a human relationship route to a person, with whom the member wishes to have connection: In such case, it can be retrieved whether human selatzonship route is connected or not by the "relationship =etzieval~~ function.
2. Area code An area code is set for preparation of statistical data of the xegistered member and for assortment to the applicable classification. It a.s designated which of the items as classified by large classification, medium classification, cad small classification the member cow being ir3putted belongs,.and numb~r of items and ratio are displayed in graphs and the like. Fig. 34 shows an example of the area Code.
The heat of clasaificatiaa is classified into 3 stages, depending upon the purpose of data arrangement such as seeti~.on oz department and district under control, in addition to the address data such as "pxefecture, name of city, town or village".
When the system of the present embodiment is used, not for human reiatioaship, but for object management, it can be applied not for area but for manage~itent classification.
Adequa a examples are:
Stock control: vParehouse, shelf, box Car accessories: manufacturer, parts, components Animals and vegetables: order, family, genus 3. Relationship classification , Relationship classification is one of the menus, tvhieh appear o~hen the "basic setting" button of Fig. 3I a.s pressed. This relationship classifioatioa plays a role of a "hand" to connect the registered members. This is provided for the purpose of designating in ovhich relationship the members are connected with each other o~hen associatixig a person with another person. It a.s possible to put priority rank to the relationship, ranging from deep conxiection to a mere acquaintance by sight. An example is shops in Fig. 35.
Because this is a coda tn indicate connection betwe~n the tovo data, it is also possible to designate a plurality of individual data as the same data.
0 Eor instance, it is a routine event such as change of family name due to marriage or change of name of a company or a group. As in these cases, it is often much easier to id~,antify the situation of the member if the details.st the time of the former name and the details at the tune of the 1b new name are both maintained.
In the system of the present e~mbodimeat, the relationship of "the person himself or herself" is used as an established initial code in the relationship classification.
20 Ia case of a general customer management software, the data must be gathered together as a single data and registered. In the system of the present embodiment, i,f the data are associated kith each other as "the person himself or herself", there is no need to unify the data.
25 Uncertain data or the data erroneously registered by overlapping ~a.ll not be ov~rlooked s.f the data are associated with each other as "the person himself or herself".

Mien the data of the members themselves to be connected as "the person himself or herself" are connected, one of them is aonneeted to the main data, and the other is coz~neated to a slave data as the .relative of the first degr~e. Tn ease it is difficult to judge which data is the master data, a code meaning "overlapping data" is provided in the box, and it is des3.gnated in the box column of the slave data to facilaaate; the identification.
Also, when it is wanted to avoid overlapping the 20 number of items of statistical data, if a classification of "overlapping data" a.s provided in the area code and it is designated to the ar~a of the slave data, then the number of non-related or unnecessary items is counted in the area of the slave data.
Because it concerns ire human relationship, not only an information of intimacy but also a relationship of a cat-and-dog life may be registered. It would be very useful if a relationship requiring special attention such as the . relationship that a member does not wish to attend the same maeti~ng with a certain person or the relationship that a member does not wish to sgeak about him before other people is included. Even when the relationship is interrupted because the related memober has been transferred or retired from the company, a nevJ relationship may be established, and it is preferable that the relationship is maintai~2ed without deleting.
Next, description Will be given on the relationship input. When the button "relationship input" shoovn in the lower part of Fig. 32 is pressed, a relationship input screen as shoo~n in Fig. 36 appears.
F3ere, the COnrieCtlOIl betwes~ the members themselves and the details of the connection axe set. Not only the fact that Mr. A is con~clected vPith M~r. B, but also, connection is made from mhieh person to another person, i.e.
the detailed relationship is designated.
To inda:cate the connections which are iaads fzom. wha.eh member to which member, a principal member is regarded as a parent, and a slave member is regarded as a child. A
pattern to indicate witb re~lation-ship exists with the child when seen from parent should be registexed in advance in the relationship classification as descra.bed above.
On the upper part of the screen of Fig. 36, a member 25 selected by member specifying retrieval, i.e. the preceding processing of the screen, ( the stat~dard member) a..s displayed. On the lower half of the screen, a list of candidates to be assoca,ated with the aaember is given.
Betwe~n these parts, there ar~ provided a par~rt-child sv~-tc,.t~over aa~d a list box to indicate the master-slave,relatioaship.Orx the paxent-child switchover, it is set wh~.ch of the master and the slave should be designated as paient (master). The relationship classification is displayed in the h.st box, and the relationship from the parent is selected.
3) "Relationship" display button To display a m~mber, wha is associated with the first degree relativ6 of the member in question.
To use at the time.of referzal/change/deleta.on of the present association.
To select a person,,wha should be Ghangad in relationship or deleted from the list.
ii) Relat~.onshap updating/delet.ion button Tn case of the change, the relationship details are . Changed and the "relationship~uQdating" button is clicked.
Whea the relationship is to be deleted, "deletion"
button ~,s clicked.
The deletion of the relationship does not mean the deletion of the data itself, but it means the deletion of the connection. Even when the relationship is deleted, the data is maintained. Howev~r, if the relationship is.
deleted, the same members do not appear in the same pedigree unless there is coanection between them in a different route .
2t is important not to delete to the utmost extent because the relationship of a cat-an:d-dog relation or breaking-off the r~lationship should also be regarded as a type of human relationship.
Next, description a~3.11 be given on the pedigree display, which .is the feature of the present embodiment:
Tn the system of the present embodiment, there are two types of pedigree display systems.
One. is "member introduction pedigree (parent-child-grandchild)" shown iri F3.g. 37. With the person used as reference positioned at the center, parents, children and grandchildren are d3.splayed.

I12 this pedigree display, the button "change of reference person" is clicked and the reference person is shifted to parents, children and grandchildren on display.
Hy changing the person at the center in the pedigree, all related persons ovho are connected to the member are displayed one after another.
If all registered members are associated without interruption, these are displayed without interrupt3.on.
However, if the groups of association are different, the connection will not be continuous in the pedigree even when the reference person is shifted.
In such case, if a member of a different group is selected and this is entered in the pedigree disglay, the related persons are displayed one after another as described above.
In the database, small groups are formed one after anoth~r and continuously grow little by little.
2n the display mode of this pedigree, only a limited number of members are displayed as sho~m in Fig. 38.
Only parents, children and grandchildren of direct lzne.are displayed. A parson A connected from the parent i.n a different lice and a person 8 connected from the child in a different line and those connected with these in direct line can be displayed when the reference person is changed.
The outline of the procedure for retrieval process3.ng of the ~Smember introduction pedigree (parent-child-grandcha.ld) " is as follows ss (1) The code of the member selected from the member list extracted by designating a specific condition is used as a ~ceference person code ("right person CZF") .
(2) Based on the right person CIF, the information of the reference person is acquired f=om the member management table, and this is stored in a reference person display area.
(3) Based on the right person CIF, the codes of all members in the parent relationship .with the reference person ("parent CIF") and its classification are extracted from the relationship managemnent table, and each information is acquired from the sneanber management table, and priority rank of the classification is acquired from the classification table. From the member with higher priority rank, the i.nfarmatzon is stored in the parent memnber list display area.
(~) Based on the right person CIF, the codes of all members in child relationship of the reference 2p person ("child CIF") and its classification are extracted from the relationship management table.
Each information is acquired from the ,member management table and priority rank of classification is acquired from the classification table. From the memaber having higher priority rank, the information is stored in a child member list display area_ (5) Based on the child CIF at the uppermost paxt of the child member list display area, codes of all members in child relationship of the child member at the uppermost part of the child member list display area ("grandchi3d CIF's) and the classification are -extracted and each infoxmation is acquired from the m~ber management table, and priority rank of classifscatsoxi is acquired from the classifa.cata.on table. Fram the member with higher priora.ty rank, the information is stored in a grandchild memberv list display area.
(6) The display area is displayed.
(7) It is judged whether the user has selected a me~uber other than the member at the uppermost part in the child member list ds.splay area. ~=f selected, sdvaace to Step (8). If not selected, advance to Step (9).
(8) Based on the selected Child CIF, codes of all members in chi7.d relationship of the selected child member in the child member last display area ("grandchild CIF") and class3,ficats.an are extracted from the relationship manage3nent table. Each information is aequ.ired from th~ member management table, and priority rank of classification a,s acguired from the c~.assificata.oa table. From the member with higher priority rank, the infoxmatioa is stored in a grandchild member list display area and it is displayed again.
(9) It is judged whether the reference person change button has been pressed or not. If it has been pressed, advance to Step (10). If not pressed,vChe processing is terminated.
(I0) The code of the member, zahich the user selected among the parent member list display area, the child member list display area, and grandchild member list display area, is regarded as the right person CIF.
Return to Step (2).
In this parent-child-grandchild display screen, only one generation is displayed above the direct line, and only two generations axe displayed under the direct line.
Another pedigree, i.e. "member introduction pedigree (fifth degree relatives before anal after) ", is used to compensate the portion not displayed. An example is shown in Fig. 39.
In this "member introduction pedigree (fifth degree relata.ves before and after) ", all related persons are included in the pedigree within the scope of the five degrees before and after of the refer~nce person determined a,.n the "member introduction p~digree (parent-child-grandchild)" of Fig. 37.
The pedigree showing human relationship as in the system of the present invention cannat be expressed by a one-directional flow, i.e. the parent is at upper position and the child is at lower position as in a family pedigree.
Instead of this, in the system of the present embodiment, a person at the center of the pedigree is displayed at the uppermost left end as shown in Fig. 40. A
person of the first degree is displayed at a position lower by vne step at left. Similarly, the persons up to the fifth degree are da.splayed at positions lower by one step each leftward.
Arrows in lateral direction indicate relationship from parent to child. The mark "..." aneans that~there is the shortest route elsewhere. ' Far instance, the mark "..." is attached to "Ryoma.
Sakamoto" in the column (a). "Ryoma Sakamoto". of (a) is in the second degree as seen from "Kaishu Ratsu". zf me look at the other route, "Ryoaia Sakamoto°' is displayed in (b) of the first degxae. Because (b) is closer than tai to "Kaishu Katsur', i.a, a reference persozi, the portion with the mark "..." is given for reference.
The mark + means that human. relationship continues st~.ll downward.
In case of human relationship to be concealed or Comnplicated human relationship, the pedigree can be feely rearranged by usa.ng this funatioa of +.
The outline of the procedure to generate the member introduction pedigree is as follows:
(1) Based on the reference person CIF, the information of the. refer~nce person member in the member nzanageanent table is acquired, and this is displayed in a tree vicar area .
(2) Selection of the first degree (2-1) Based on the code of the reference person (CIF), the paxeat ~uember is extracted from the relationshiQ management table, and it is additionally dssplayed under the reference perso~o.
?0 with one member in one step in second column of the tree viev~ area in the order of priority rank.
(2-2) Based on the reference person CIF, a child member is extracted ~rom the relationship management tile, and it is additionally displayed under the parent member with one member in one step in the second column of the tree ~tiew area in the order of priority rank.
However, if a member with the same GIF is lp already displayed in the tree view area, the mark '~ , _ . " should be added of ter the came (3) Selection of the second degree (3-1) For member of the first degree displayed in the second column, the follo~oing processing is 15 performed is 'the order frown above.
(3-2) Based on the first degree relata.ve CIF, a parent mP~~'1er is extracted from the relationship management table, and it is ins~rted and displayed between the corresponding first degree member axed the aext first degree member vPith one member iro.
one step in the third column of the tree W ew area in the order of priority ras~k _ However, if the member two degrees before (the reference person) in direct line, "selection of 25 the second degre~" is not carried out.
(3.- '3) If the mexabex in the corresponding step of the first degxee is with the mark "...", "selection of tha second degree relative" is not carried out.

(3-4) If members with the same CIF are already displayed in the tree vie~o area, the mark "..." is aatached after the name.
(3-5) Based on the first degree relative CIF, a child member is axtxacted from the relationship management table, and this is inserted.and displayed 3aetsoeera the corresponding first degree member and the next first degree member in the third column of the tree va.eov area in the order of priority rank_ Hov~ever, if the members t~ao degrees before (the reference person) in direct line are the same member, "selectiaa of the second degree relative"
is not carried ou.t.
Z5 (3-6) Tf the member in the corresponding step of the .
first degree has the mark "...", "selection of the second degree relative" i:s not carried out.
(3-7) If a member with the same CIF i.s already displayed in the tree view area, the mark "..." is added after the name _ (4) Selection of a-th degree relative (n = 3) (4-I) For the members' of th~ second degree d~.splayE:d zn the third column, the following processing is performed from above.
(4-2) Based oa the second degxee relat3.ve CIF, a parer~.t member is extracted from the relationship' management table, and this is inserted and displayed between the correspoadiag second degree member and the next s~aand degree member with one member in one step in the fourth column of the tree view area i~. the order of priority rank.
However, if the mem'ber.s two degrees before g (the first degree xelative) in direct line are the same members, "selection of the third degree relative" is not carried out.
(,~-3) 2f the member in the corresponding step of the second degree has the mark "...", "selectioz~. of the third degree relative" is not carried out.
(Q-4) If a iaember with 'tee' $~e CIF is already displayed in the tree view area, the mark "..." is added of ter the name .
(4-5) Based ou the second degree relative CIF, a child member is extracted from the relationship management table, and this is inserted and displayed between the corresponding second degree member and the next second degree ~arember oPith one member as one step is the fourth column of the tree view area in the order of priority rank.
Fiowevar, if the saembers two degrees before (the first degree relative) in direct line is the same member, "selection of the third degree relative" is not Carried out..
(4-6) If the member in th~ corresponding step of the second degree has the mark "..-", "selection of the third degree reLativa" is not carried vut.
(4-'7) If the member with the same CIF is already displayed is the tree vieoP area,, the mark ". . . " is added. after the name.
(5) Subsequently, the same processing is performed for thr~ fourth degxee and the f3:fth degree relatives by progressively increasing the number in Step (4)_ Next, d~escripta.oz~ will be given on relationship retrieval function, which is another feature of the present embodiment.
When the "relationship retrieval" button is cliGlced, a screen of member relationship retrieval shawa in Fig. 38 is displayed.
Flere,, two persons or two organi~atzons are designated, and it is searched whether there is connection between the members. In the upper step, tlna reference person member is placed. However, it is shifted to the retrieval screen by pressing the "condition retrieval" button, and the u~embers can be changed as desired is both upper step and the lower step.
The relationship is traced raithin the scope from th~
first degree to the tenth degree. Using the radio button, it is designated ~rhather the shortest route is to ba found or all routes are to be found. v~Th~x~ the message "display all r~lationships" is checked and the execution button is clicked, the degree and aerial number in the same degree relatives are d3.splayed in~the list box at upper left of the pedigree in Fig. 38. Fig. 41 is used to explain this acrd sho9ts ate example of pedigree betv~een .trio members each on the left side and the right side.

When a route to be referred is sel,eeted in the list box, the pedigree of this route is displayed. If "detail"
button is clicked, the registration details of the person selected in the pedigree is displayed.
The."printing" button is used to have a preview of the results of tracing on display and to be ready for printing by a printer.
The processing procedure of this relationship retrieval function is as follows:
(Z) Among the two members to trace the relationship, one is regarded as a regular member, and the other is regarded as a sub-member. With the purpose of tracing whether the sub-~tember is connected to the regular memaber or not, the present aonditioa is stored, and an array area in the memory temporarily storing the retrieval results .is iaitializad. When a canceling button is pressed by the user, the processing should be stopped, and th~ result up to the middle gay stored in the memory is discarded.
(2) Before performing the processing, the setting condition is stored, i.e. to ro~hich degree the searching is taade at the most sad whether the shortest route or all routes should be searched as designated by the user. Here, explanation is given on a case where all members up to the fourth degree are searahed_ (3) fhe first degree x~iember in parent-child relation of the regular member is extracted.

(3-1) Among the number of records "na'~ in the first degree as extracted, it ~.s judged ~ohether ia-th (i - 1 to n) is a sub-atember or not.
(3-1-1) If it is a sub-member, the route from the regular member is stored in the array area of the memory and the processing of the step (3-1) is carried out to the record of the next first degree relative_ (4) If it is not a sub-member, the second degree member is parent-child relation of ia-th member of the first degree is extracted.
(4-1) Among the number of records "nb" in the second degree thus extracted, it is judged whether ib-th (i = 1 to n) member is a sub-utember or act.
(4-1-1) If it is a sub-memaber, the route from the regular member is stored in array area of'the memory, and 'the processing of Step (4-I) is carried out to the.
record of the next second degree.
(4-2) If it is not a sub-member, it is judged whether the same member as ib-th member of the second degree is present at higher position in the route or not.
(4-2-Z) If it is pr~sent at such position, the processing is interrupted, and the processing of Step (4-1) is carried out to the record of the next second degree.
(5) If it is act present at such position, the third ' degree member in parent-child relation of ib-th member of the second degree is extracted_ (5-1) Among th~ number of'records "nc" of the third degree thus extracted, it is judged that ic-th member (i = I, to n) is a sub-member or not.
(5-l-1) If it is a sub-me~aber, the route from the regular member is stored in array area of the memory, and the processing of Step (5-1) is parried out to the record of the next third degree.
(5-2) If it is not a sub-member, it is judged whether the same member as ic-th member of the third degree is present at higher position in the route Or not.
(5-2-1) If it is present at such position" the processing is interrupted, aad the processing of Step (5-1) is carried out to the record of the next third degree:
(6) If it is not preseat at such position, the fourth degree member in parent-child relation of ic-th member of the third degree is. extracted.
(7) Among the number of record "nd" of the fourth degree thus extracted, it is judged tvhether id-th (i = 1 to n) member is a sub-member or not.
(7-1-1) Lf it is a sub-member, the route frota the xegular member is stored is array area in the memory,, aad it is advanced to the next record of the fourth degree.
(7-2). If it is net a sub-~ber, it is advanced to the next record of the fourth degree. If the record of the fourth degree is completed to n-th member, the number of records of the third degree is progressively advanced by one, and the.proeessing is performed.
(7'3) If the number of records of the third d~gree is completed up to "n", the number.of records of the second degree is progressively increased by one, and the processing is performed.
(7-4) When th~ number of tha records of the second degree a.s completed to "a", the number of records of th~ first degree is progressively increased by one, and the processing is carried out.
(8) The results of the retrieval stored in the array area is the memory is rearranged f=om th~ member having number of the degree in the route.
(9) The first of the re~tra.eval results is disp3ayed in the tree view.
(Z0) When the user designates the change of the retrieval result~displayed zn the pulldown list box, a route selected by the user in the retrieval result~is displayed in the tree view.
As described above, the following effects can be obtained by the present embodunent:
f5 1. A pedigree of hwaan relationship can be expressed on 2-dimensional paper.
2. Even whey the same person may app~ar many times in the pedigree (even when the circulation occurs), it is possible to search the related route in reliable manner.
3. The connection can be expressed. in parent-child relation. The relationship can be differentiated, and the depth of the connection can be differentiated.
4. Because the pedigree is expressed, not by generation but by degree of relatives, it is possible to trace the relationship freely and to display in a tree structure taxthout fixing the direction of connection fxom parent direction cad child direction.
5. The pedigree can be continuously prepared so far as the relationship exists.
fi. It is possible to trace the connection of any tv~o members as desired is all of the routes.
ha. the embodiments described above, it is designed in such manner that relationship inforiaation entangled ita complicated manner is partially highlighted and is checked arid evaluated by displacing slightly, and relatinx~ship pedigree can be indicated in simple manner. 8y th~.s arrangement, it is possible to Match and assess the conneatiaa of the central data ~rith the data setting out from it_ In this arrangement, however, it is not possible to trace the changes of combination and separation over time and to evaluate the change.of the relationship. In the relationship management table; parents and children are associated ~rith each other while parents and children are not necessarily positioned in the order of generating or originating. parents and children are set and positioned for the convenience of the user. Therefore, when parent and child are associated ~oith each other, it is not possible to set the relationship in reverse direction or to set a plurality of relationships at the same time. This is because a relationship perpetually circulating is made up swhen the relationship is retrieved and traced unless parent-child relatiox~ship is set in one direction to trace the association, Nest, a relationship vector table is further added to the above embodiment, In this new embodiment, it is I0 possible to retrieve and trace the relationship is terms of position and time by means of a "retroactive route" through simultaneous use of the relationship management table.
This is seeded, for instance, is the following cases:
Ia the above embodiment, when related human connection, is iaputted,~and if the name is changed, it is not possible to trace back to the.raot eves when connection is made through the r~lation of the person in question because thsre is no order of generating, The order of generating may be found in each of the data, but it is difficult to reflect the da.splay made in the order to the pedigree.
For this purpose, the relationship ihforaiation must have a direction, which i,s suitable for each Case and which is a direction of parent-child relationship di~ferent from the time of generation.
Now, taking an exautple in the creation or the generat~.on of the universe, the phenomena repeatedly occur due to "big bang' as separation of a certain substance A at a certain time and at a certain position. Further, it is separated to substances 8 and C at a certain time at a certain position, and the substance A is changed to a substance A'. Ti~hen such combination and separation repeatedly occur; there may be the case where the original substance is turned to a different substa~a:ee specifi.e to itself or the ease aPhere the substance is changed while retaining the original attribute as before. When the relationship information is used in the field of science, there is a risk that a substance s~parated and combined by the same phenomenon may be regarded as the same substance as before unless information is available for the time and the position to makes up the relationship. It would be all right if i.t is limited to such simpl~ relationship as human relationship, in which the importance is not given as to twhere wo persons became acquainted pith each other.
However; the information of the change of substance or segmentation or division of microorganism is an information, for which time and position are indispensable. By tracing back time and posit:i.on of the relationship information in terms of time and position, it is possible to trace the transition of the data.
Further, the information relating to the persons who participated in propagation of information is to ba recorded to traces back the source of ir~formation, from v~hich rumor might have spread. The rumor may sometimes spread and may be propagated to the'same person by more than once , a . g . A -~ 8 -~ C -~ . . . . . . ~. . -~ A --> 8 --~ G --~ .' .
. . .
-' B '-' A -> , . . . In this cane, what was informed at the 81' ' ~ second time may often be different from what vas heard at the first time. If the consider the connection of the relationship, the first relationship between A and B is exactly the same as the second relationship between A and B.
The third relationship (i.e. from B to A~ is different is that only the da.rectioa of information propagation is reversed. However, the ti~ae of information propagation is different, cad this may exert iafluenca on the change of information, for instance, dependir~,g on the position of propagation. The data such as tim~ and position as described above should be included in the information of each individual person cad the data should be processed as these are included in the relationship information.
As described above, when handling the relationship information, it is very advantageous to identify "the retroactive route'. In this respect, for the purpose of manipulating th3.s "retroactiv~ route", a~relationship vector table KvT is added to the relationship management table KKT as a data table shown in Fig. 43.
In Fig. 43, th~ relationship manageaaent table RKT ~.s the same as before, but relationship classification is not 3,ncluded in it and this may be included in the relationship vector table RVT. Also, detailed portion of each data may be preserved in a member ~nanagemeat table (not shov~my . As already explained, in the relationship aranageme~.t table KKT, a clirection of tracing the relationship between the two is determined through parent-child. relationship. In reality, it plays a role as orientation mesas to exclude perpetual ' ~ circulation is the course of proeessi.ng such as retrieval, tracing, etc. For this reason, parent--child relationship between the two is not registered repeatedly arid it zs a specific relationship, and parent and child axe never recorded in reverse direction.
In the relationship vector table RVT, unlike the parent-child relationship is the relationship management table KKT, the relationship between the two is registered by more than one time together with the direction and the position in time series, connecting position, and order of connecting. In the prodessiag based on the assumption that the data are written is the relationship vector table KVT, the data are recorded one by one for all relations associated with each other, and the direction of relationship i8 indicated, not by parent and child, but by origin and destination. The origin and the destination can be specified regardless of the setting of parent and child. In each record in th~ relationship vector table xvT, additional information is given, i.e. as information that an aggregate specified individually and s~queatially is registered as a group or that tank is set for, linking, and the data is recognized as a unigue record. The relationship vector table RVT is needed in case a plurality of relations apparently appear or is case there is ranking in the relation. However, when it would suffice if only the relationship can be found, it is desirable to design in such manger that it can be selected whether or not the information is to be written in the relationship vector table KfT depending oa the need of the user because memory region may be packed otherwise.
In the relationship vector table KVT, rhea the relations are connected on one-to-one basis, on multiple-s to--one basis, or oa multiple-to-~aultiple basis, arbitrary additional information may be gives as sho~m in Fig. 44, and it may be designed in such manner that the user can.
freely set connecting position and connecting sequence with differentiation classification such as "the same", xo ~ "replacement", "variant", "continuous", "combination", or "separation". In the classification "the same", two data are regarded as the sane but these are not integrated, and linking is made Without changing the original shape of group, i.e. this is the same concept as the r~lationship 15 classification of "the pe=son~in question". In the classification "replacepaent" , tovo data are regarded as the same data, and one of them is indicated as . a data vrith priority. The other data, i.e. non-priority data is regarded as concealed data or collected data, and these are 20 integrated as a unity. In the classification "variant", it.is coasidsxed that the data has been changed from original data to destination data, and these are licked by clearly defining the distinction of the ne9t and the old.
In the classification "continuous", it is considered that 25 the original data is continuous to the destination data, and linking is made by clearly defining the di.stincta.on of the nest and the old. In the classification "combi.n.ation", linking is made on multiple-to-one basis. In the classification "separation", linking is made on one-to-multiple basis. Also, in case it is aecessaxy to perform definite associat~.oa in time sexier at the intention of the user, it should be specified by which member of v~hich group the r~iations already classified in groups are licked as shown in Fig. 45_ By the use of i-.he relationship vector table KvT, it~is possible to simultaneously use the reference object center display (hereinafter, also referred as "xelationship pedigree") and the position t~.rae series display (hereinafter also xeferred as "r~latioxzsbip map" or "relationship chronological table'~j. Fo= instance, when association is made ca one-to-one basis as shoovn. is Fig. 44, apart from the reference object center cu.splay made up an relationship n~twork when linking mhile ev~n the user .is not aware, the association based on the intention of the user is directly da.splayed as shown in Fig. 45 in the position time serf~s display. By simulfi~eously using these, it is possible to prepare relationship wap or relationship chronological table of the data, and reference object center display of an arbittary data specified therein can be used.
In the relationship management table KKT, the relationship linked in parallel or linked in series as described above, and the relationship classified as groups are disassembled as a connection specific to one-to-one association and are registered, and the same relationship or reverse relationship is not recorded. Specifically, when relationship'is expressed only in the relationship management table RRT, parent-child relationship is used in coaanon to indicate the relata.onship and .flow of relationship tracing. When there are more than one relationship patterns between the two or when there is a relationship such as A --~ B and, at the same time, B -' A, there has been no other way but to register only one of them.
Far iastaace, it is supposed here that A is a sen~.or staff of 8 and that A and 8 both belong to the same circle.
Also, it is supposed that 8 was a senior student 3.a school to A and was a former teaah~r to A. Ia this case, the initial relationship is 8 -; A (juaior to senior). 'Then, it was turned~ta A = B,(i.e. companions in the ciral~).
Later, the relationship A --~ s~(senior) was established.
Finally, the relation 8 --~ A (former teacher) was made up .
In this case, the relationship cannot be expressed only by parent-child relat3.onship of the r~lationship mana,gemeat table KFCT. Therefore, the relationship in each case, and direction and tame series information are recorded zn the relationship vector table KVT. Ia the concept of the relationship vector table KVT in this case, the table is prepared under the assumption that the relationship informatson registered in it is specific by itself, and there is no relationship of the same attribute betrween arbitrary two partners. Therefore, in case th~ user wishes to give a meaning of more than, one relations in the same, relationship, the user wants intentionally to specify the order of the relations or the reverse relationship should be retained. Such information is given to the relationship vector table KVT so that each of the records such as tae information, position information, etc. has different relationship.
In so doing, when the connection is expressed by chains, even when the same relationship may appear at more thaw one time~poiats, "retroactive route" can be displayed as a different one . Fioatever, in this display, the 7.0 position to display reference object .is not specific, and it is not possible to see all related persons at one time.
For instance, Fig. 46 is a figur~, which is prepared by replacing the relationship map is Fig. 47 by a relationsh3.p pedigree. If it is disassembled and thoroughly investigated, these are the figures relating to the same relationship. In Fig. 46, the relationship as seen from each individual oar: be understood at a glance. In Fig. 47, the transition of the relationship is inc~a.cated in mole intelligible manner. Sowever, while G in the lower portion of Fig. 47 is being referred, it is not possible to find the connect 'loll with E .
In this respect, a relationship pedigree ~rith G as a reference object can be displayed while referring to G.
And it is possible to refer at which point on the relationship map a different member indicated to have connection is displayed. Further, if it is possible to see the other GOnnectl0n lVhen ,lt is moved to the other position, even the difference of tiiae and position can be identified at thp same time.
For iastanCe, ovhen the data to be investigated are dispersed at more than one poit~ts on the relationship map (or on the relationship chronological table) and there are more than one destinations to move to, it may be arranged in such manner that positions and attributes of these data are indicated by means such as list box and the use= may select the object displayed or the related data may be displayed with high luminance on the relationship map to facilitate the position identification. When it is moved to the selected position, it is desirable to. arrange that the data is autamdaticahy displayed by scrolling on the designated position of the relat~,onship map using means such as jump button. rn thi.s way, if it is possible to refer to the relationship pedigree at the desired spot on the relationship map and to move to it, a~system can be built up, in which the relationship can be identified in easier azanner .
In arbitrary additional information, the time is not limited_to the uai.ts such as year, month, day, hour, minute or second, but an attribute to express process of the change of information may be used. ,8y the use of expression such as position and time, the position can be enspressed in 3-dimensional space, and time may have an effect as 4-dimensional meaning to express the pxocess of change. Even v~hea th~ time may be the same, the relationship bet~oeen A and B is an ordinary relationship when it is seen from C. But, if it is seen from D, it may 8$

look as a relationship at odds. When it is sees from E, it may look as tt~e relationship of a happy married cauple.
In this. respect, subjective view of those who register the data gives strong influence on the association. Whey there are indefinite number of users in a system, the information that the person who inputted the data is a differeat.person may be regarded as a position information.
ftarther, there may be additional information to recognize that more than one relations existing between the same too persons such as speed, force, etc. are speoific by themselves. If there is as area with arbitrary additional information in the relationship vector table KVT, sucb information can be arranged v~ithout regard to the developer and the user of the system.
Also, the prepared aggregates are registered with names as group members such as "aggregate - single unit", "single aanit - aggregate", or "aggregate - aggregate" and a relationship map may be prepared. In so doing, it is possible to identify the connection for each of the aggregates and connection of the single unit member ~rhieh make up the aggregate. Further, it is possible to retrieve the aggregate, which includes a specific type of chain relationship. For instance, in the field of scientif3.c study, such as a study on multiuaoleaulas coiapouad having any desired molecular structure, a study to trace generation and transition of a subject such as language, or a research field to study celestial bodies, i.a. constellation and nebu3.ae, fixed stars sad planets.

Claims (29)

WHAT IS CLAIMED IS:

1. An associating information management system for associating various types of information and for managing the information, said system comprising:
a relationship management table for storing parent-child relationship in identification information of each type of information: and retrieval processing means for performing retrieval processing of various types of information from parent to child and from child to parent by association of the relationship management table in the information and the scope as designated.

2. An associating information management system according to claim 1, wherein said various types of information are managed by a member management table where member data comprising said identification information and detailed information are stored.

3. An associating information management system according to claim 2, wherein said detailed information comprises a classification information for classifying the members.

4. An associating information management system according to claim 3, wherein said classification information comprises type, rank, classification, and job type.

5. An associating information management system according to claim 2, wherein said detailed information comprises various types of information including FAT

information, address recorded in FAT, file type, directory pass, file name, scope of selection, object, attribute and information having attribute.

6. Aa associating information management system according to claim 1, wherein said identification information comprises ID, FAT information, address recorded in FAT, file type, directory pass, file name, scope of selection, object, attribute, or information having attribute.

7. An associating information management system according to claim 1, wherein said relationship management table comprises information of mutual associating direction and degree of relationship.

8. An associating information management system for managing by associating various types of information, said system comprising:
a relationship management table for storing parent-child relationship in identification information of each information;
a member management table for storing said identification information and said various type of information;
input processing means for performing input, setting and indication of the data;
associating information management means for retrieving various types of information from parent to child and from child to parent by association of the relationship management table in the information and the scope as designated by said input processing means and for processing various types of information stored in the member management table; and output processing means for performing output processing of the data processed by said associating information management means.

9. An associating information management system according to claim 8, wherein said input processing means associates one or a plurality of data stored in said member management table with one or a plurality of different types of data under a given condition, and stores the result of the association in said relationship management table.

10. A program for associating information management for associating and managing various types of information by using a relationship management table for storing the result of said association of parent-child relationship in identification information of various types of information, whereby there are provided a function to carry out retrieval of various types of information from parent to child by the association of the relationship management table and a function to perform retrieval of various types of information from child to parent.

11. A program for associating information management for associating and managing various types of information by using a relationship management table for storing the result of said association of parent-child relationship in identification information of various types of information, whereby the program carries out a function to select one or a plurality of parents or one or a plurality of children under a selection condition as designated by said various types of information, a function to associate said selected one or a plurality of parents and said one or a plurality of children by said identification information and to store is the relationship management table, a function to retrieve various types of information from parent to child by association of the relationship management table, and a function to retrieve various types of information from child to parent.

22. A recording medium for associating information.
management to associate and manage various types of information, said recording medium being able to read the data by computer and used to record at least:
a relationship management table for storing association of parent-child relationship in identification information of various types of information; and a retrieval processing program for performing retrieval processing of various types of information from parent to child and from child to parent by association of the relationship management table in the designated information and scope.

13. A recording medium for associating information management to manage various types of information by associating, said recording medium being able to read by computer and at least comprising:
a relationship management table for storing association of parent-child relationship by identification information of various types of information;
a member management table for storing said identification information and said various types of information;
an input processing program for inputting, setting, and indicating the data;
an associating information management program for retrieving various types of information from parent to child and from child to parent by association of said relationship management table in said designated information and scope and for processing various types of information stored in said member management table; and an output processing program for performing output processing of the data processed by said associating information management program.

14. An associating information management system provided with database, said database comprising:
a member management table for storing member information of individuals and organizations including name or organization name, address, telephone number, etc.: and a relationship management table for defining relationship between a member registered in the member management table and another member related to said member by parent-child relationship and for entering classification code to indicate type of relationship and priority rank of the relationship.

15. An associating information management system according to claim 14, wherein there is provided a classification table for defining which relationship the classification code indicates and which priority rank the classification code indicates in addition to the relationship management table.

16. An associating information management system according to claim 14 or claim 15, wherein there is provided an area code for statistical data preparation and for classification and assignment of the registered member in the registration items is the member management table.

17. An associating information management system, comprising:
a member management table for storing member information of individuals and organizations including name or organization name, address, telephone number, etc.;
said system records relationship record defining relationship between a member registered in the member management table and another member relating to said member by parent-child relationship, said system being provided with a database, which comprises a relationship management table for recording classification code indicating type of the relationship and priority rank of the relationship, and when the member is designated as a reference person, a member in parent-child relationship with said member is extracted and displays parent member, child member and grandchild member together with the reference person as a list, said system further comprising means for executing the following steps of:

(1) making a code of a member selected in a member list extracted by designating a specific condition as a reference person code ("reference person CIF");

(2) acquiring information of the reference person from the member management table based on the reference person CIF and of storing the information in a reference person display area;

(3) extracting codes of all members in parent relationship of the reference person from the relationship management table ("parent CIF") and classification thereof based on the reference person CIF, acquiring each information from the member management table and priority rank of classification from the classification table, and storing the information in a parent member list display area from a member with higher priority rank;

(4) extracting codes of all members in child relationship of the reference person from the relationship management table ("child CIF") and classification thereof based on the reference person CIF, acquiring each information from the member management table and priority rank of classification from the classification table, and storing the information is a child member list display area from a member with higher priority rank;

(5) extracting codes of all members in child relationship of a child member at the uppermost part of the child member list display area ("grandchild CIF") from the relationship management table based on a child CIF at the uppermost part of the child member list display area and classification thereof, acquiring each information from the member management table and priority tank of classification from the classification table, and storing the information in a grandchild member list display area from a member with higher priority rank:
(6) displaying the display area;
(7) judging whether or not the user has selected a member other than the uppermost member in the child member list display area (If selected, advance to Step (8). If not selected, advance to Step (9));
(8) extracting codes of all members in child relationship of a child member selected in the child member list display area sad classification thereof from the relationship management table based on the selected child CIF, acquiring each information from the member management table, and priority rank of classification from the classification table, and storing and displaying again the information in a grandchild member list display area from a member with higher priority rank;
(9) judging whether a reference person change button is pressed or not (If pressed, advance to Step (10). If not pressed, wait for the next instruction.); and (10) making a code of a member as a reference person CIF who was selected by the user from each of the parent member list display area, the child member list display area, and the grandchild member list display area (Return to Step (2).).

18. An associating information management system, comprising:

a member management table for storing member information of individuals and organizations including name or organization name, address, telephone number, etc.;
said system records relationship record defining relationship between a member registered in the member management table and another member relating to sand member by parent-child relationship, said system being provided with a database, which comprises a relationship management table for recording classification code indicating type of the relationship and priority rank of the relationship, and a member in parent-child relationship is extracted by a member code set in the reference person, and degrees of relatives are displayed in a tree view in the order of relatives of closer degree, said system further comprising means for executing the steps of:
(1) acquiring information of the reference person member of the member management table based on the reference person CIF, and displaying the information in a tree view area;
(2) selection of the first degree relatives (2-1) extracting a parent member from the relationship management table based on the reference person CIF, and additionally displaying the information under the reference person with one member is one step in the second column of the tree view area in the order of priority rank;
(2-2) extracting a child member from the relationship management table based on the reference person CIF, and additionally displaying the information under the parent member with one member in one step in the second column of the tree view area in the order of priority rank, whereby an abbreviation symbol is added after the name if a member with the same CIF is already displayed in the tree view;
(3) selection of the second degree relatives:
(3-1) performing the following processing in the order from. higher position on members of the first degree displayed in the second column:
(3-2) extracting a parent member from the relationship management table based on the first degree relative CIF, and inserting and displaying the information between the corresponding first degree member and the next first degree member with one member is one step in the third column of the tree view area in the order of priority rank, whereby "selection of the second degree relatives" is not carried out if the member of two degrees before (the reference person) in direct line is the same member;
(3-3) "selection of the second degree relatives" is not carried out if an abbreviation symbol is attached to a member in the corresponding step of the first degree;
(3-4) adding an abbreviation symbol after the name if a member with the same CIF is already displayed in the tree view;
(3-5) extracting a child member from the relationship management table based on the first degree relative CIF, and inserting and displaying the information between the corresponding first degree member and the next first degree member with one member in one step in the third column of the tree view area in the order of priority rank, whereby "selection of the second degree relatives" is not carried out if the member of two degrees before (the reference person) in direct line is the same member;
(3-6) "selection of the second degree relatives" is not carried out if an abbreviation symbol is attached to a member of the corresponding step of the first degree;
(3-7) adding an abbreviation symbol after the name if a member with the same CIF is already displayed in the tree view area;
(4) selection of n-th degree relatives (n = 3) (4-1) performing the following processing respectively in the order from higher position on n-1-th degree member displayed in n-th column:
(4-2) extracting a parent member from the relationship management table based an n-1-th degree relative CIF, and inserting and displaying the information between the member of the corresponding n-1-th degree and the next n-1-th degree member with one member in one step in n+1-th column of the tree view area in the order of priority rank, whereby "selection of n-th degree relatives" is not carried out if a member of two degrees before (n-2-th degree relative) in direct line is the same member;
(4-3) "selection of n-th degree relative" is not carried out if an abbreviation symbol is attached to a member of the corresponding step of a-1-th degree;
(4-4) adding an abbreviation symbol after the name if a member with the same CIF is already displayed in the tree view area;
(4-5) extracting a child member front the relationship management table based on n-1-th degree relative CIF, and inserting and displaying the information between the corresponding n-1-th degree member and the next n-1-th degree member with one member in one step in a+1-th column of the tree view area is the order of priority rank, whereby "selection of n-th degree relative" is not carried out if a member of two degrees before (n-2-th degree relative) is direct line is the same member;
(4-6) (selection of n-th degree relative) is not carried out if an abbreviation symbol is attached to a member in the corresponding step of n-1-th degree;
(4-7) adding an abbreviation symbol after the name if a member with the same CIF is already displayed in the tree view area;
repeating Step (4) until "n" reaches a predetermined number by progressively increasing "n" by one in Step (4) after the procedure of (5) above, and completing the processing if "n" reaches the predetermined number.

19. An associating information management system, comprising:
a member management table for storing member information of individuals and organizations including name or organization name, address, telephone number, etc.;
said system records relationship record defining relationship between a member registered in the member management table and another member relating to said member by parent-child relationship, said system being.provided with a database, which comprises a relationship management table for recording classification code indicating type of the relationship and priority rank of the relationship, and said system extracts up to any degree of relative as desired and displays whether a relationship route is made up using member codes of two members as set to the reference person, said system further comprising means for executing the steps of:
(1) setting one of the two members for tracing the relationship as a regular member, and the other as a sub-member, storing a setting condition to trace whether the sub-member is connected with the regular member, and initializing array area in the memory for temporarily storing retrieval result;
(2) storing the setting condition as to up to which degree should be searched at the furthest or whether the shortest route should be searched or all routes should be searched as designated by the user when processing is performed;
(3) extracting the first degree member in parent-child relationship of the regular member;
(3-1) judging whether ia-th (i = 1 to n) member is a sub-member or not among the number of records "na" of the extracted first degree member;
(3-1-1) if it is a sub-member, executing the processing of Step (3-1) to the record of the next first degree member by storing the route from the regular member in array area of the memory:
(4) if it is not a sub-member, extracting the second degree member in parent-child relationship of ia-th member of the first degree:
(4-1) judging whether ib-th (i = 1 to n) member is a sub-member or not among the number of records "nb" of the second degree extracted:
(4-1-1) if it is a sub-member, executing the processing of Step (4-1) to the record of the next second degree by storing the route from the regular member in array area of the memory;
(4-2) if it is not a sub-member, judging whether the same member as ib-th member of the second degree is present at higher position is the route or not;
(4-2-1) if it is present at higher position, executing the processing of Step (4-1) to the record of the next second degree member by interrupting the processing;
(5) if it is not present at higher position, extracting the third degree member in parent-child relationship of ib=th member of the second degree;
(5-1) judging whether ic-th (i = 1 to n) member is a sub-member or not among the number of records "no" of the third degree extracted;
(5-1-1) if it is a sub-member, executing the processing of Step (5-1) to the record of the next third degree member by storing the route from the regular member in array area of the memory;
(5-2) if it is not a sub-member, judging whether the same member as ic-th member of the third degree is not present at higher position is the route or not;
(5-2-1) if it is present at higher position, interrupting the processing and executing the processing of Step (5-1) to the record of the next third degree member by interrupting the processing;
(6) if it not present at higher position, extracting the fourth degree member in parent-child relationship of ic-th member of the third degree;
(7) repeating the procedure by progressively increasing the value up to the degree of the number as sat in advance, and performing the following processing in the final degree member:
(7-1) judging whether ix-th (i = 1 to n) member is a sub-member or not among the number of records "nx" of the final degree extracted;
(7-1-1) if it is a sub-member, staring the route from the regular member in array area of the memory, and advancing to the next record of the final degree:
(7-2) if it is not a sub-member, advancing to the next record of the final degree. If the record of the final degree is completed up to "n", performing processing by progressively increasing by one the number of records of the degree one step before;
(7-3) if the number of recording of the degree one step before is completed up to "n", performing processing by progressively increasing by one the number of records of the degree one step before;

(8) performing this procedure until the number of records of all degrees is completed;
(9) rearranging retrieval results stored in array area of the memory from the member of lower degree in the route;
(10) displaying the first of the retrieval results is the tree view area; and (11) displaying the route selected by the user among the retrieval results in the tree view area if the user designates the change of the retrieval result display in the pulldown list box.

20. An associating information management system for associating various types of information and for managing the information, said system at least comprising:
a relationship vector table for storing relationship of said various types of information, direction of said relationship, and position time series information; and retrieval processing means for performing retrieval processing for association based on the relationship stored in said relationship vector table, direction of said relationship and position time series information, and for performing output processing of the relationship map.

21. An associating information management system according to claim 20, wherein there is further provided a relationship management table for storing parent-child relationship between said various types of information, and said retrieval processing means outputs a relationship map to display transition of relationship along said position time series of said various types of information as said relationship map and also outputs a relationship pedigree displaying connection of said various type of information in form of chains.

22. An associating information management system according to claim 21, wherein said various types of information are under management by a member management table for storing member data consisting of identification information cad detailed information.

23. An associating information management system according to claim 22, wherein said detailed information contains assortment information for assorting members.

24. An associating information management system according to claim 23, wherein said assortment information includes type, rank, classification, and job type.

25. An associating information management system according to claim 22, wherein said detailed information comprises FAT information, address recorded in FAT, file type, directory pass, file name, scope of selection, object, attribute, or information having attribute.

26. An associating information management system according to claim 22, wherein said identification information comprises ID, FAT information, address recorded in FAT, file type, directory pass, file name, scope of selection, object, attribute, or information having attribute.

27. An associating information management system according to claim 21, wherein said relationship management table comprises information of mutual associating direction and degree of relationship.

28. A program for associating information management for associating and managing various types of information by using a relationship vector table for storing relationship between said various types of information, direction of said relationship and position time series information, retrieval processing for association is performed according to the relationship, direction of the relationship said the position time series information stored in said relationship vector table, and output processing of the relationship map is carried out.

29. A recording medium for associating information management and readable by computer and for managing various types of information by association, said recording medium records a relationship vector table for storing relationship between said various types of information, said direction of relationship and said position time series information, and a retrieval processing program for performing retrieval processing of association based on the relationship, direction of the relationship and the position time series information stored is said relationship vector table and for carrying out output processing of the relationship map.