JP2005259164A - Associating information management system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To allow association of various types of information to be registered and managed with a simple structure, and a relationship including position time series to be simply retrieved and extracted. <P>SOLUTION: This application provides an associating information management system for managing various types of information by associating them with one another. The system comprises: at least a relationship vector table KVT for storing a relationship among the various types of information, the direction of the relationship and position time series information; and a retrieval processing means 4 for performing retrieval processing of association based on the relationship, the direction of the relationship and the position time series information stored in the relationship vector table and for performing an output process of a relationship diagram. The system also comprises a relationship management table KKT for storing a parent-child association among various kinds of information. The retrieval processing means 4 carries out an output process of a relationship map for displaying, as a relationship diagram, transition of the relationship along the position time series among the various kinds of information and a relationship genealogical chart for displaying association among the various kinds of information by a chain. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to an association information management system, an association information management program, and a recording medium for associating and managing various types of information, and also records data and mutual relations of individual / organization information in a systematic manner. The present invention relates to a genealogical network management system.

  Through the information age, IT revolution, etc., personal computers, personal digital assistants (PDAs), and other various information terminal devices are rapidly spreading in various fields. Along with this, information to be processed and managed by the information terminal is very widespread, such as information on people, information on organizations, information on sales / customers and other businesses, information on documents / documents, and information on various management. In this way, not only the types of information increase but also the amount of information increases, naturally there are various relationships among the information. In order to make effective use of such information relationships, it is essential to organize the information and manage the information relationship.

  In general, information is related by, for example, associating a tree structure from a higher level to a lower level according to a certain rule in a certain genre or category. In addition, a family tree is connected from a parent to a child, then to the child, and to each of them, but the relationship from the top to the bottom is fundamental, and the relationship is complicated and complicated. There is no.

  However, as the type and amount of information increases, in order to organize the entire information according to the information to be handled, it is also necessary to manage relationships including information with different genres and categories. FIG. 44 is a diagram illustrating an example of a relationship diagram, and FIG. 45 is a diagram illustrating an example of various types of related information.

For example, as shown in FIG. 44, if the information of A to J is related as shown by the arrows, in general, the information is not a tree structure like a solid line. As for the relationship, there is often an example in which another relationship exists, such as a relationship indicated by a dotted line even through A and BCD, and these relationships are complicated among a large number of pieces of information. In addition, as shown in FIG. 45, when documents, XX universities, XX construction, creators, drawings, XX documents, management departments, etc. are used as units of information, for example, when focusing on XX documents, On the other hand, the creator, literature, drawings, application documents, storage location, and department in charge are related.
JP 2000-66970 A JP-A-11-66082

  As described above, not only the association of various information with different genres and categories, but also the information about people, when trying to systematize the network, the number of people connected to one person has changed from several to several hundred. Furthermore, like a friend's friend is another friend's friend, the same person is duplicated and related to the same family tree, which is very complicated.

  When information having such a relationship is represented as a general relationship diagram, it becomes very complicated and complicated, and it is very difficult to record it, and even to record all relationships. For this reason, management is limited to each purpose. For example, in a personal network, only important points are managed by relying on human memory. This is the current situation.

  In a general family tree, it is possible to represent a direct family, but it is difficult to describe together the outer gait bound by marriage. If it is only the eldest son's gait, it can be managed as shown in FIG. 46, but the gait of all the siblings is described, and the gait that each of the spouse's siblings married, their parents, their parents 'siblings, and their parents' homes When all the outer fences are described, it must be expressed three-dimensionally in three dimensions. Moreover, because they are family members, the names that appear in the genealogy are always in only one place. There are a dozen or so brothers.

  However, when trying to systematize the network, as shown in FIG. 47, there are several to hundreds of people connected to one person, and a friend of a friend is another friend of another. In the same genealogy, the same person appears several times. When this happens, it is very difficult to record a general relationship diagram, and not all relationships can be recorded. Therefore, the current situation is that human connections are managed only by relying on human memory.

  Conventionally, the network information is extracted and managed from the sender name, addressee name, and their e-mail addresses included in the e-mail (for example, see Patent Document 1), and the business card information is read by a computer. There has been proposed an apparatus (see, for example, Patent Document 2) that obtains personal network information by registering together information indicating who received the business card from whom.

  However, these prior arts only specify the two-dimensional connection of human connections, and information on human connections with a three-dimensional spread and connection depth such as parent-child relationships (up and down relationship) is also specified. I couldn't search.

  The present invention solves the above-described problems, and enables registration and management of various information relationships with a simple configuration, and facilitates search and extraction of relationships including position time series. It is.

  To this end, the present invention is an association information management system for associating and managing various pieces of information of members as management units, and at least information in a direction related to the mutual relationship between the identification information unique to the members And relation vector table storage means for storing relation category information including the degree of relation and position time-series information, and various information including classification information and detailed information for classifying the members corresponding to the identification information, When the member management table storage means to be managed and the range of the members and mutual relations, the degree of the relation and the related direction are input as the search conditions, the input is made to the input members from the relation management table storage means. Search for members having a mutual relationship and a degree of relationship, and further input from the searched members Relevant information processing for repeatedly searching members having a mutual relation and a degree of relation to the inputted range of related directions, and reading various information of the retrieved members from the member management table storage means And output processing means for performing output processing of a relationship diagram including members retrieved by the association information processing means and various information of the read members, a relation map, and a relation tree. Shows the transition of the relationship along the time series between the various information during the output processing of the relation map in the output processing, and chained the connection between the various information during the output processing of the relationship tree. It is characterized by displaying.

  According to the present invention, there is provided an association information management system for associating and managing various pieces of information of members as management units, and at least information on directions related to the mutual relationship between the identification information unique to the members And relation vector table storage means for storing relation category information including the degree of relation and position time-series information, and various information including classification information and detailed information for classifying the members corresponding to the identification information, When the member management table storage means to be managed and the range of the members and mutual relations, the degree of the relation and the related direction are input as the search conditions, the input is made to the input members from the relation management table storage means. Search for members having a mutual relationship and a degree of relationship, and further input from the searched members. Relevant information processing means for repeatedly searching for members having mutual relations and degree of relation to the inputted range of related directions and reading various information of each searched member from the member management table storage means; Output processing means for performing output processing of various information of the member searched by the association information processing means and the read member, and the output processing means is configured to perform relation map output processing in the output processing. When displaying the transition of the relationship between the various information along the position time series, and when displaying the relationship tree, the connection between the various information is displayed in a chain, so display the relationship map and the relationship tree Can be used together, can create a relational map and chronological table of data, and use the reference target center display of any data specified in it. Can. Therefore, it becomes possible to search and track the relations that follow the positional and temporal flow by the “backward route”.

  In addition, the relationship between data can be expressed by parent (main, upper) and child (secondary, lower), and managed by the parent, not the generation, so that the tracking and display of the relationship can be simplified. Moreover, by associating the registered data with each other, the data can be allocated as long as the relationship continues, and the relationship route between the two parties can be traced or the relationship can be expressed in a genealogy. Duplicate data can be referred to if they are linked by the same data relationship without performing name identification processing, and the maiden name and new name data can be made compatible by association.

  In addition, it is possible to manage not only people but also people and things, things and things, and manage data by mixing data of goods and people, for example, companies that deal with government offices, etc. If you have created an important document that could be used later, you can associate it with the person who created the document or the section of the document jurisdiction, and remember it for the next use. You don't have to follow

  By referring to which section or branch of which section the book or map material that was referenced when creating the document was related to that section or branch, the "section" or "book" If only one of “document” and “document” has a clue, even if it is not memorized in detail, it is possible to reach the necessary information by following the formula based on the relationship. Of course, it can be linked not only to documents but also to products such as cars purchased with customers, and land can be entered as data to track changes in ownership. Ambiguous or uncertain data cannot be lost by associating with news sources.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings. FIG. 1 is a diagram showing an embodiment of an association information management system according to the present invention, FIG. 2 is a diagram showing a configuration example of a member management table, FIG. 3 is a diagram showing a configuration example of a relationship management table, and FIG. It is a figure which shows the structural example of a table. In the figure, 1 is an input processing unit, 2 is an output processing unit, 3 is a data registration / update processing unit, 4 is a search processing unit, 5 is an editing processing unit, 6 is a relationship management table, 7 is a member management table, and 8 is Indicates the master table.

  In FIG. 1, an input processing unit 1 inputs, searches, edits, and outputs various data for setting, registering, updating, deleting, etc. for each data such as a relationship management table 6, a member management table 7, and a master table 8. The process of inputting various instructions is performed. The output processing unit 2 displays various data for setting, registering, updating, and deleting each data, an input screen for various instructions such as search, editing, and output, a screen regarding processing results based on input of various instructions, and information display It performs output, print output, data transfer to other devices via a network or communication line, and transmission processing.

  The data registration / update processing unit 3 that performs data management performs various processes such as setting, registration, update, and deletion for each data based on the input from the input processing unit 1, for example, member detailed information registration / update, Register / update history information, input relations, etc. The search processing unit 4 performs member information search processing by accessing each data according to a search condition set based on an instruction input from the input processing unit 1. For example, member search, member history search, member relationship Search and so on. The edit processing unit 5 performs an edit process for outputting a search result in accordance with an output condition set based on an instruction input from the input processing unit 1. For example, a member introduction system diagram, front and back n-parent display, connection search display Etc.

  In the member detailed information registration / update, the member information is registered and images related to the members are displayed by the image display function. Moreover, an address is allocated from a zip code by pressing a zip code search button after inputting the zip code. In the history information registration / update, detailed information such as correspondence history and sales history is registered for each registered member, and the input contents are assigned members from the history contents by using the member history search function. In the relationship input, it is registered which is connected from which to which and what kind of relationship they are. In the relationship category, the relationship with the child member is selected from the preset contents as seen from the parent, and registered members are searched from the relationship category selected using the member relationship search function. In the relationship detail registration, by inputting the detailed information for the connection at the time of input, the member relationship search function is used to search using the detailed information input at the time of registration.

  In the member search, the results obtained by giving the conditions are overlapped many times to narrow down to the target member group. In the (AND) search, the current condition is given to the previous results to further narrow down the data. In the (OR) search, if either of the previous result and the result of the current condition is satisfied, a match is obtained. By searching, the corresponding member is usually displayed in the list box, and when the non-applicable member is selected (clicked), the members other than the member selected by the condition are displayed in the list box. In member history search, members are searched based on the history input for each member. For example, when using a history as trading information, it is possible to search for a person who sold XX within one week last week. In the member relationship search, a search is performed based on the relationship between members. For example, when a relationship is used for a salesman's customer development, a sales strategy can be set for each area by registering the probability of each customer.

  In the member introduction pedigree, it is possible to refer to all related parties by displaying the second degree in the parent direction and the second degree in the child parent based on the reference target person and changing the reference target person. In the front-rear n-degree display, based on the reference target, for example, the 5th degree in the parent direction and the 5th degree in the child direction, and the related parties up to 10 degrees in total are displayed in different colors. Is displayed. In the connection search, any two people are designated and a search is made as to whether there is a connection between the members.

  The relationship management table 6 is a table that performs a one-to-one relationship between various types of information based on identification information. In the present invention, the identification information includes an identifier, an identification number, an identification code, an ID, an ID number, CIF, file allocation table (hereinafter referred to as FAT) information managed by the OS, attribute information capable of individual identification, and the like. . As for the relationship, the relationship is related to each other, for example, as shown in FIG. 3, in the direction of parent → child, master → secondary, up → down or vice versa. It adds information such as understandable relationship categories. As for the relationship classification, for example, in the case of people, it is generally boss, subordinate, friend, introduction, anti-eyes, OB for relationship with school list, OB for relationship with non-person, ownership for company relationship, Direct relationships to relationships used for subcontracting, tie-ups, business partners, personnel evaluations, colleagues, affiliations, and relationships used by financial institutions when managing the chain of guarantees, guarantors, joint guarantors, affiliation buildings, affiliation lands, documents -The relationship between the document and the drawing is set according to the relationship between the creator, author, introducer, recommender, and the like. A plurality of such relationship management tables are used as required, such as the purpose of use.

  The member management table 7 corresponds to each piece of identification information. Each member's information itself or related information from which the information can be acquired, such as FAT information, FAT recording address, file type, position information, object, attribute, attribute information, etc. Is stored. Members are people, things such as people, documents, documents, drawings, companies, head offices, branches, branch offices, departments, places, facilities, institutions, products, machines, equipment, facilities, institutions, organizations, data, Various tangible and intangible management units including files, including all genres and categories. Member data to be managed includes member-specific identification information, location information for each type of member, location information such as folders, relationship information represented by physical address numbers, and member-specific detailed information. And manage it directly with member information or indirectly with information to obtain member information. For example, as shown in FIG. 2, the classification information for each member is information such as the member type, rank, classification, and business type, and the member-specific detailed information is information such as a description and a history. The date is the date of registration / update.

  The member type, rank, classification, business type, etc. of the classification information are conditions for editing and output for searching, and it is determined whether to include or exclude from the target of searching and editing output depending on the presence or absence of the designation. For example, if you are a person, your name is your member name, gender, date of birth, address, telephone, fax, e-mail address, work / affiliation / position / employment date, affiliation group, hobby, career / history , Photos, etc. Also, if it is a document / literature / drawing, its name is the member name, including literature classification, creation date / issue date, creator / publisher / author, summary of contents, recommendation / introductory text, etc. Arbitrary information. The history information is information including member biographies and update history.

  For example, the master table 8 is used when setting a registration category or specifying it as a search or editing output condition so that the minimum necessary information is registered in the member management table 7 according to each member information. It has a definition table of various information necessary for this. For example, a type table, a rank table, a classification table, a business type table, a relationship classification table, and the like as shown in FIG.

  The type table defines type information for identifying what kind of member, person, company, document,..., Etc., as shown in FIG. The rank table defines, for example, ranks and priorities as shown in FIG. 4B. As general ranks, ranks such as the most important, important, customer A rank, customer B rank, customer C rank, etc. High priority, medium priority, low priority, etc., and special ranks for negotiations, negotiable again, no acquaintance, etc. As for things, the priority of high, medium, low, etc. is defined for the ranks of the person and the name.

  In the classification table, for example, as shown in FIG. 4C, a section, a product, a group, and the like used for an area, personnel evaluation, and in-house evaluation are defined as items belonging to a large classification, a medium classification, and a small classification. For example, as shown in FIG. 4D, the industry table defines each industry such as manufacturing industry, information service industry, local government, construction / construction industry, insurance / finance industry, agriculture / forestry / fishery industry, and self-employment.

  The relationship classification table defines, for example, the relationship classification shown in FIG. 4 (E) and the respective priorities. The general classification of the type is person, such as boss, subordinate, friend, introduction, anti-eyes, etc. The classification for school names, etc., is from origin (OB), the classification is for non-human children, and the classification is for subcontracting, tie-ups, and transactions for the relationship between companies. The categories used for personnel evaluation, such as the tip, include direct reports, colleagues, and affiliations.

  The relationship classification serves as a “hand” for connecting registered members and is defined by a code representing the relationship between two data (members). It is for specifying the relationship between people and people, people and things, and things and things. For example, in the case of people and people There is a difference in the degree of relationship to the degree of acquaintance. The relationship categories are prioritized in consideration of this, so that more important and closer relationships can be displayed at the top.

  Next, the association search process of the association information management system according to the present invention will be described. FIG. 5 is a diagram for explaining an example of the flow of association search processing of the association information management system according to the present invention, and FIG. 6 is a diagram for explaining examples of search conditions and output conditions.

  In the association search process of the association information management system according to the present invention, for example, as shown in FIG. 5, the search condition is set (step S11) and the output condition is set (step S12). Here, as a search condition, for the member who starts the search, for example, what kind of member is targeted, what classification, rank, and type of business are targeted as shown in FIG. Further, the search range, for example, how many levels, how many parents, etc., are set. In addition, as an output condition, the range and conditions for editing and output are output, including the relationship between the parent and child output to which color and the output color at that time, as shown in FIG. 6B, for example. Mode to output whether the parent / child direction is output with an arrow, the parent / child is divided into left and right output, the parent / child is output in a table format, or output in a tree structure And what the pattern will look like.

  Next, the child is searched from the parent according to the search condition (step S13), and the searched child and its relationship are held in the memory (step S14). Similarly, a parent is searched from the child (step S15), and the searched parent and its relationship are held in the memory (step S16). Further, it is determined whether or not the next stage search is also targeted based on the output condition (step S17). When the next stage search is necessary, the last stage member searched and held in steps S13 to S16. Is used as a search key (step S18), and if it is duplicated with those searched and held members, the search key is deleted (step S19), and the process returns to step S13 to repeat the same processing.

  If it is determined in step S17 that the search is completed, the search result is edited according to the set output condition (step S20), and the edited search result is output (step S21).

  Next, detailed information registered in the member data will be specifically illustrated and described. The description information is not limited to the item name and can be changed according to the usage.For example, in general description items, the record ledger number, the initial transaction date, the business details, the transaction details, etc. When used for diplomatic sales, such as securities number, insured date, family composition, medical history, etc., when used for personnel evaluation, employee number, date of employment, family composition, special mention matters, comprehensive evaluation, etc. When a financial institution manages the connection of a guarantee, account type / number, contract date, family structure, presence of guarantee obligations, assets, etc., when used for business, membership number, first visit date, characteristics, hobby・ Information such as preferences is registered.

  History information allows you to enter time-series correspondence records. For example, in general items, date, meeting details, numerical targets, achievement level, next deferral, etc. When using for insurance such as purchase date, purchased product name, quantity, purchase price, number of points, etc., when using for personnel, such as the date of insurance amount change, insurance name / content, number of deposits, basic amount, total amount, etc. , Information such as loan date, collateral, loan amount, monthly repayment amount, balance, etc. is registered when used by a financial institution such as date, business name, amount, self-evaluation, and internal evaluation.

  When inputting a relation summary item using the relation between members connected on the relation input screen as additional information, the item is set according to the application. For example, for general use, events, parent notes, child notes, introduction dates, common anniversaries, remark dates, parent → child confidence, child → parent confidence, familiarity, evaluation ( When used for business relationships such as parent → child) and evaluation (parent ← child), orders, orders, subcontracts, introduction dates, transaction dates (first time), transaction dates (final), holdings, order weights, order weights , Relationship changes, transaction details, etc., when used for insurance, common hobbies, special skills, health status, latest encounter date, first seen date, wedding anniversary, intimacy, age of knowledge, hostility, remarks, etc. When using for personnel, fiscal year, assigned department, assigned date, evaluation date, transfer date, ability, cooperation, hard work, evaluation (parent → child), evaluation (parent ← child), etc. When using at financial institutions, guarantee details, mortgage rank (thing), memo, warranty renewal date, initial payment date, final payment date Guaranteed amount of money, guarantee limits, route number (thing), such as the detailed relationship is registered.

  An extended embodiment of the association information management system according to the present invention will be further described. FIG. 7 is a diagram for explaining the case of using the synchronization method, FIG. 8 is a diagram for explaining an example of parallel relation using a parent selection group and a child selection group, and FIG. 9 is a parallel by category matching. FIG. 10 is a diagram for explaining an example of LL method inter-database import.

  A synchronization method for providing the related information management function of the present invention to another database already constructed and operated will be described. In order to add a relationship management function to an existing database, there are a method of re-creating the software itself for managing the database from the beginning and a method of connecting relationship management software having a data transfer interface. The synchro system refers to the latter. In this synchronization method, the ID number unique to the data of the database is recorded in the relationship management table as shown in FIG. 7 without modifying the software of the existing database structure at all. That is, a plurality of different software is attached to one database. However, since the database itself is often designed for existing software, the relationship management software has an interface part for receiving information from the existing software. As a result, the relationship management software can use the data reference portion of the existing software without developing a basic data display portion. On the relationship management software side, already registered data are related to each other, and the relationship management function portion such as a genealogy display is in charge. It is possible to incorporate all the functions of the existing software into the relationship management software (by the external software execution function), and seemingly add the relationship management part to the existing system.

  In order to use the synchro method, it is necessary to monitor the ID change due to addition / modification / deletion in the existing software on the relationship management software side. If the existing software allows ID change, It is necessary for the relationship management software to deal with ID number reassignment or to add an invariant ID to existing data. By applying the synchro method, it is possible to shift to a system having a relationship management function at a low cost without introducing a new system that changes for an operating database system.

  Next, automatic association will be described. A process for associating one or a plurality of data different from any one or a plurality of data registered in the member management table, such as data that matches a given condition, category, selected data, or the like, may be performed. . In this case, as a serial relationship, a relationship in which a plurality of pieces of data selected by arbitrary designation are sequentially connected in series is performed in the order rearranged in advance by the user designation or one by one.

  In addition, as a parallel relationship, the data selected by the condition designation from all the data, the data extracted by the category that the data individually has, the arbitrarily selected data, Alternatively, all data is displayed, and a relationship management table is created by making a relationship by specifying the parent and child.

  In this case, for example, as shown in FIG. 8A, when there is one member in each of the parent selection group and the child selection group, a one-to-one relationship is made with each as a direct parent and child. In addition, when there is one parent selection group and multiple child selection groups, one parent is associated with each child one-to-one by one-to-one repetition, and one-to-many relationship is established. When there is a plurality and one in the child selection group, one child is related to each parent in a one-to-one repetition, and many-to-one relationships are made for the number of parents.

  When there are a plurality of parent selection groups and child selection groups, a one-to-many association is performed for the number of parents, or a many-to-one relationship is performed for the number of children, as shown in FIG. Specify new or existing data α between the parent and child, all parent specified data is a parent of α, all child specified data is stored in the relationship table as a child of α. Do. The association is performed by starting batch processing such as an association button or by drag and drop.

  In addition, as shown in Fig. 9, multiple category registration frames are provided for each data in the member management table, and horses, trees, apples, flowers, mountains, etc., are registered as parallel relationships by category matching. Select data that matches the selected category and relate it to new or existing data. For example, it can be similarly applied to data including the same attribute such as the same group and the same word.

  Explain how to import between databases. When the association information management system of the present invention is divided into a plurality of grades such as a professional version, a standard version, and a personal version, for example, as shown in FIG. A pseudo network like the LL system can be formed with members. Here, the professional version has no data registration restrictions, history information input / search is possible, detailed relationship information entry / search is possible, multiple databases are possible, the standard version has no data registration restrictions, history information entry / search is possible, the personal version is The registration limit is limited to several hundreds, and a common database is used. And the professional version has multiple databases and can be used while switching. If the database is not in the same folder, it can be set as an operation target anywhere in another personal computer on the LAN.

  By using the professional version, the administrator can refer to and update the database of the members as well as the database of the members, and the members can operate only their own databases by using the standard version. In the unlikely event that another person's data is copied without permission, an ID and password of 4 ranks are provided for each database, thereby making it impossible to enter the inside. The professional version allows you to refer to and update related detailed information that cannot be seen in the standard version, so it is possible to write to the member database outside of the person's control.

  In addition, data related in a range from arbitrarily designated data to n-parents or the like is set as an import target, and a code that does not overlap with the data identification code on the import side is reassigned and imported. If the same data exists on the importing side and the transplanting side at the time of import, the relationship is further made by “person” (relationship category of the same data). If the determination of whether they are the same is ambiguous, the user is prompted to select whether to give a message or to determine that the data is different.

  Next, operation with file management software will be described. FIG. 11 is a diagram for explaining a medium for connecting relationships, FIG. 12 is a diagram for explaining a relationship in file management software such as Explorer, and FIG. 13 is a diagram for explaining a partial relationship in a file of various types of data. FIG. 14 is a diagram for explaining the association of other files and the like. FIG. 15 is a diagram for explaining a case where a plurality of management tables are provided and related.

  Looking at the current status of file management software (Explorer etc.), the file management software considers the whole as one large storage, and can not find the file relationship just by dividing the file into container boxes that can be classified as folders. . However, everyone wants to be able to organize files more easily if they know the connections between the files.

  For example, if there is a document A created in a word and there is a document A ′ corrected, the relationship between the two documents is related to the file name, whether it is stored in the same folder, or the property. There is no other way to record that. If it is identified by property, if A ″, A ′ ″, A ″ ″, etc. are created, the document created later is related to the previously created document. You must fill in the properties of all documents created so far.

  When A ″ ″ is created, if only the properties of A ′ ″ are changed, it is not known that A and A ″ ″ are related unless the properties are viewed one by one. Similarly, the relationship between different file formats (documents, spreadsheets, images, CAD, etc.) cannot be summarized by the creator if divided by category. When divided by file type, inconvenience such as inability to unify in business occurs.

  Therefore, if the related information management function of the present invention is added to the file management software, the stored locations are organized into easy-to-understand folders such as by category and by creator, and a relation diagram of various files related to it is displayed. By doing so, it becomes possible to tie up the history of changes and business projects.

  In the file management software, there are automatic correlation functions, genealogical display such as parents and descendants, tree genealogy display such as 5 parents before and after, route search function between certain parents such as connection search, relation input screen etc. Prepare. The association can be performed using a relationship input screen or the like, or by drag and drop. When files related in Explorer are copied, not all the relationships are copied, but the connection is made by the relationship of the original file and the duplicate. If the file is a hidden file, it is displayed so that it is not related when the hidden file is set to be hidden. For the association, a file is used as identification information instead of a file name, and position information such as a folder or a physical address number can be used.

  The medium that connects the relationships will be described. When a medium is also included in the thought of the relationship information management function of the present invention to connect relationships, it has attributes or attributes that can be specified as independent objects even if some of them are extracted, including voice information, time information, position information, etc. Put information in an array such as a database. For example, as shown in FIG. 11, any sheet or selected cell of spreadsheet software (A), the entire file of file management software (B), any object in the CAD drawing (C) drawing, image (D) With respect to the entire image or an arbitrary selected portion, the relationship management information is stored in the member management table (F) by using, as an identifier, a key that can identify each such as the back number or address of the array, and the relationship management table (E) By associating, not only Explorer but also new or existing applications can be used.

  The relationship in file management software such as Explorer will be described. In Explorer or the like, the displayed folder and file name are stored in a directory path such as a file allocation table (hereinafter referred to as FAT) managed by the OS. In order to give such an explorer the related information management function of the present invention, there is a method of having a member management table other than FAT, a method of using the FAT itself as a member management table, and a relationship management table. It is possible to use the method 3 for managing the relationship with the FAT information itself, not the idea of managing the ID.

  In the method of ○ 1 having a member management table other than the FAT, as shown in FIG. 12A, the ID and the file information recorded in the FAT are copied and used as they are in the member management table, or in the FAT. Use information such as physical recording location addresses. Further, in the method ◯ 2, as shown in FIG. 12B, in the OS design stage, the shape of the FAT itself is changed to have an ID, the physical recording position address in the FAT, etc. The information may be directly entered into the relationship management table for correlation, or the FAT information itself may be stored in the relationship management table for correlation. In the method of ○ 3, since the FAT information itself has a content that can identify each case, as shown in FIG. 12 (C), it is recorded as it is in the relationship management table as it is without specially attaching an ID. By doing so, relationship management can be performed. In this method, since the FAT information or the physical recording position address in the FAT is stored in the relationship management table, it is necessary to change the relationship management table at the same time when the file or folder is changed.

  The object to be connected can be implemented regardless of whether it is a file or a folder, as long as it can be processed on the file management software even on the network. An Explorer-like one attached to an individual application having the same function as Explorer has file information in its own area instead of FAT, but the function is the same.

  A specific execution example will be described as follows. First, an area for designating a file or the like to be related is provided somewhere on the screen, and an object to be related is entered by input or drag and drop. One or a plurality of designations can be made in each designated area like a list box, and a one-to-one, one-to-many, many-to-one, and many-to-many relationship can be made as described above with reference to FIG. Therefore, an arbitrary file or the like is selected and, for example, a genealogy display is selected in a menu from a genealogy display button or a right click, and a screen for displaying a relationship is displayed. Furthermore, it has a connection search screen for tracking the relationship between two or more files and a screen that can display all the relationships of the front and rear n penetrations, and can proceed from any screen. When a related file or folder is copied, it is possible to select whether the relationship is inherited in the same manner as the copy source or whether only the copy source and the copy destination are related.

  A description will be given of partial association in a file of various types of data. Unlike the case of file management software that only related file names and folder names, partial information related to multiple types of data is related information and related information processing functions to related applications and the data files created thereby. You must have it. This is the same when the management of the relationship is left to management software on the OS side such as Explorer, or when data is related only within each application.

  For example, image processing software and an image file created thereby will be described as an example. In general, files created by an application have file format (Photoshop's file) with attribute information such as shape, object, color, saturation, brightness, alpha channel, layer information, and change history in addition to image information. The format varies depending on the usage environment, such as a format having only image information (such as BMP). Depending on the file format and the application used, the attributes that can be stored in the file differ in the amount of information. When copying and pasting an image that has been cut out in the image via the clipboard, only the data at the moment of copying needs to be taken into account, so even if the attributes are inherited, file information etc. May not inherit. However, in order to establish a relationship and maintain a continuous relationship, it is necessary to respond to changes in content and changes / movements of the relationship range. Therefore, it is necessary to store what attribute information in which range the related part is in the file itself, and the image processing software can display the relationship information saved in the file and monitor changes Is required. By using the member management table here, instead of storing basic data, the location where the selection range to be related exists and the characteristics of the data are recorded, and the data body is stored in the original file. Exists. Of course, the data itself can be copied from the original file and recorded in the member management table.

  That is, as shown in FIG. 13, the file has relationship designation range information and uses the member management table and the relationship management table, and does not use the member management table but manages the relationship only with the relationship management table. First, there is a usage environment corresponding to each combination, such as when managing information using a member management table or a relationship management table.

  Next, an example in which a relation layer is provided will be described. A relation layer for displaying a transparent relation designation range on the image data is provided. The range to be related is specified in the image processing software, and the range is displayed on the related layer. The attributes of the specified range include the selected shape / object, and the amount of information that can be held by the application, such as color, saturation, brightness, alpha channel, layer information, change history, etc. This will be described as other attributes. When a related information setting button or the like is provided in the image processing software and the range is selected, an ID, a file type, a directory path, a file name, a selection range, and other attributes are written in the member management table. At the same time, the ID acquired when the selection range is written in the member management table is recorded together with the selection range information in the image file as the identification name of the specified range. Individual information written in the member management table is related to other information on the relationship input screen of the OS file management software using the relationship input button or right-click menu, and the relationship is written to the relationship management table. . If corrections have been made to the parts included in the relationship specification range of the image data, it will ask if the relationship specification range will be changed by the monitoring function of the image processing software. The image file in which is recorded and the member management table are also changed.

  When the member management table is not used, the file type, directory path, file name, selection range, and other attributes may be directly written in the relationship management table for association. However, if you consider a unique member for differently relating the same file with the same specified range, the same connection, you must save it in an identifiable format unique to the member, including the ID.

  When the related information is not recorded in the image file, all the information is recorded in the member management table or the relationship management table, and the image processing software does not display the information to be displayed on the relationship layer or the like from the image file. Receive from those external tables. When not managed by the OS or unified management software, not managed solely by the application, but managed independently within the image application, it has a relationship management table and member management table unique to the application, and functions such as relationship input and genealogy display Will be installed in the image processing software.

  The above is about images, but recording and monitoring functions are required in the same combination of word processing software and document files, spreadsheet software and book files, CAD software and drawing data, sound source software and sound source data. As shown in FIG. 14, when the member management table is used, CAD such as ID, file type, directory path, file name, selection range, other attributes, for example, spreadsheet, sheet, cell, format information, etc. If so, the layer, line type, color, shape, etc., if the document, page, format information, etc., if it is a sound source, record the time, wavelength, range information, etc. When writing directly to the relationship management table without bypassing the member management table, the file type, directory path, file name, selection range, other attributes, etc. are recorded in the relationship management table. Since they only need to be in a form in which data can be distinguished from each other, they can also be applied using expressions that can represent the relationship between members in bit units for connecting relationships, such as an absolute address inside a personal computer. Each input / display means may use an external communication means such as Web, ASP, PDA, etc. in addition to the screen and the print medium. Basically, the function that can display the data in which the parent-child relationship is linked in the relationship management table in a genealogical form and can follow the formula can be provided on both the data side of each software and the OS side of the computer. . In addition, it can have a connection search function that tracks and displays the relationship between arbitrary data.

  A case where a plurality of management tables are provided and related will be described. The target of association is between registered members, but one member, such as when you want to have a relationship between history information, or when you want to relate history and relationship information, images and summary items of other members, etc. It cannot be represented in the management table or the relationship management table. In order to cope with this, as shown in FIG. 15, there may be a plurality of member management tables and relationship management tables instead of one in one system. The Nth member management table is recorded in a form including the attribute of which part of which information of which identification information (CIF) of the basic member management table is related. The parent-child relationship related by the input screen is recorded and displayed on the genealogy for partial relationship display. By doing this, in addition to the relationship tree that can only see the relationship of the head, it is possible to see the connection of each part.

  Next, an embodiment when the present invention is applied as a genealogical human network management system will be described. In the present embodiment, the relationship diagram that can only be represented in three dimensions is managed in a computer, and a part thereof is extracted and represented so that it can be represented on two-dimensional paper. The concept is described below.

  The system according to the present embodiment enhances search functions such as condition search and reading search when inputting data so as to minimize registration of duplicate data. Therefore, the data to be related is managed in a centralized manner, making it difficult to create useless connections. Also, even if there is duplicate data, it is always displayed in the neighborhood when the genealogy is created by connecting them with the relationship of “data of the same person”.

  From the viewpoint of general customer management, as shown in FIG. 16, since the data is stored in a card format, a method of storing the customer number of the next data connected to a part of the individual data is stored. Take. In the system of this embodiment, individual data and related data are managed in a completely separated form. The related data is also saved at 1: 1. A basic file (database table) representing a relationship has a parent customer number, a child customer number, and a relationship code.

  FIG. 17 shows an example of the table. If you arrange them in parent order, you can see that one person has multiple children. In the example of FIG. 17, as shown in FIG. 18, Mr. A has persons related to children, Mr. B and Mr. D. Mr. C has a child named A, and Mr. D has children named B and E. Further, when this file is rearranged in the child order, as shown in FIG. 19, Mr. A has a parent named Mr. C. B has parents A and D, D has A and E has D.

  FIG. 20 shows the parent-child relationship with A as the center. The system of the present embodiment creates a genealogy while repeating this chain. However, if the same person appears in the genealogy, the one that appears closer to the central person in the genealogy is regarded as the normal route, and the subsequent connection display overlaps with the normal route. ing. As a result, no matter how many times the same person appears (circulates) in the genealogy, the relevant route can be reliably found.

  Furthermore, the system according to the present embodiment has a direction of not only connecting but also connecting from one to the other. It has a very important meaning when a genealogical tree is represented by a tree structure. As mentioned above, by rearranging based on the parent and rearranging based on the child, the direction of the connection is clear and it is possible to attract the person who is connected to it by determining the central person Because it becomes.

  From a general emphasis on direct lineage such as “parent → grandfather → great-grandfather”, a chain with a single combination of “parent → child → child → parent → parent” connects and connects more distantly. be able to. In addition, by giving the direction of parent and child, it became possible to express a clear relationship like subordinates, supervisors, teachers, and students in connection parts that could only be expressed in an equal relationship. Then, by giving priority to each relationship category, the strength of connection can be determined.

  As shown in FIG. 21, when the user of the system of the present embodiment wants to have a connection with Mr. X, it can be seen which route is more effective when the connection of that route is used. In this way, by representing the connection with the parent and child, the relationship can be distinguished, and the depth of the connection can be further distinguished. In addition, if the genealogy is represented by generations, it becomes a direct view of “parent → grandfather → great grandfather”, so that a complete flow of up and down is possible. However, in terms of relatives, since there are only “parent” and “child”, if the concepts of parents from top to bottom and children from bottom to top are discarded, the relationship is like a bellows fold as shown in FIG. Can be folded.

  Using this, when creating a genealogy in the system of this embodiment, as shown in FIG. 23, the person who becomes the center of the genealogy is placed on the leftmost side, and from that person, the first degree regardless of the parent or child, Display one line to the right. The second degree is also displayed with a one-stage shift to the right regardless of the parent or child. By repeating this, the genealogical tree can be expanded into a tree structure and written in a planar shape. In this way, by representing the genealogy not by generation but by parent or the like, it is possible to freely trace and display a tree without fixing the connection direction between the parent direction and the child direction.

  Furthermore, in the present embodiment, since only the parent-child connection is included in the file representing only the relationship, the relationship chain continues only by mechanically looking at “parent → child → parent → child”. However, because the range that can be seen at one time is only divided due to restrictions on screen display and print display, if there is a relationship from the point where it was delimited, the same will be done from there `` parent → child → parent → child '' It is possible to repeat tracking mechanically and create a genealogy. It is the “member introduction genealogy (parent / child / grandchild)” that actually represents it. Although it is a direct line only display, it can be displayed anywhere as long as the relationship continues.

  Furthermore, in the function of relationship search, as shown in FIG. 24, it is possible to specify whether any two people are specified and track whether or not a relationship route is completed for the two people. In addition to the shortest relationship, all routes are searched for within the specified degree of friendship, and the routes are displayed as a genealogy. Here, all members having a connection of 10 parents, for example, 5 parents in the parent direction and 5 parents in the child direction from the reference target member are displayed. As shown in FIG. 25, the fifth degree is related to the fifth person. When viewed from the reference target person, Mr. A is out of the range of the genealogy because it is the sixth degree, but if Mr. B is the reference object, it will be the fifth degree and will appear in the genealogy. From the end of Mr. C, Mr. D can find the 10th degree, 11 connections. In this manner, members who are outside the display range of the genealogy can be displayed by creating a genealogy by shifting the reference object.

  Examples will be described below. FIG. 26 is a system block diagram showing the software configuration of the genealogical network management system of this embodiment. The database includes a member management table that stores individual / organization member information such as name or organization name, address, and telephone number, a member registered in the member management table, and other members related to the member. And a relationship management table for entering a classification code indicating the type of the relationship and the priority of the relationship, and in the master table, the relationship between the classification code and It has a reference table such as a partition table that defines what priority order is expressed.

The basic operation procedure and data processing in the system of the example of this embodiment will be described below. FIG. 27 shows the main menu screen of this system.
1. Member management, member addition, member modification, member deletion The above three items enter, update, and delete information about individuals and organizations.
・ Relationship input and genealogy display The above two register and display the connections and genealogy between members.
2. Data material Specify the conditions, extract the corresponding members from the registered members, and output them to a form or text file.
3. Basic settings Register and manage the basic code settings of the system.
4). System management Maintains the database.

  FIG. 28 shows an input screen that appears when the “Add Member” button on the main menu screen of FIG. 27 is pressed. From this screen, select individual registration or group registration. In the case of personal registration, enter your name, reading, date of birth, sex, gender, address, telephone number, and fax number. In addition, the user selects whether to make this member's data public or private. The special input items on this input screen will be described.

1. BOX
BOX is a rank code. It represents what kind of person the user is trying to input is for the user. Examples thereof are shown in FIGS. This is called BOX in the sense that the member's data card is sorted and stored in rank boxes. BOX can be prioritized.

  In the system of this embodiment, unlike customer management software that manages only customers, it is important to input the person who is not acquainted and wants to have a connection in the future and the person concerned. . If the BOX has a rank meaning “no acquaintance”, it can be distinguished from the current customer. Increasing registration data and connecting relationships will expand the possibility of creating a personal network for those who wanted to connect. In that case, it is possible to search whether or not the personal route is connected by the “relationship search” function.

2. Classification code The classification code is provided for the purpose of creating statistical materials for registered members and assigning them to affiliation classifications. Specify whether the member to be input belongs to the items classified into major category, middle category, or minor category, and display the number and ratio of the items in graphs. An example of this classification code is shown in FIG. The classification items are classified into three levels according to the counting purpose such as the department to which the user belongs and the jurisdiction, in addition to those based on addresses such as “prefecture, municipality, town name”.

When the system of the present embodiment is used not for personal connections but for article management, it can also be applied as a management classification instead of a district.
Examples include inventory management: warehouses, shelves, boxes
Car supplies: manufacturers, parts, parts
Animals and plants: Eyes, families, genera, etc.

3. Relationship Category The relationship category is one of the menus that appears when the “Basic Settings” button in FIG. 27 is pressed. This relationship classification serves as a “hand” that connects registered members. It is provided to specify what kind of relationship is made when people are related. Relationships can be prioritized according to the degree of relationship, from deep connections to a little acquaintance. Examples thereof are shown in FIGS.

  Since the code represents the relationship between the two data, it is possible to specify that different data is the same. For example, common events such as a change of family name due to marriage and a change of company or group name. As in this case, it is often easier to keep track of the member's situation by leaving the contents of the old name and the new name.

  The system according to the present embodiment prepares a relationship “Principal” as a default initial code in the relationship classification. If it is general customer management software, it must be registered as a single piece of data, but if the system of this embodiment associates the data as "person", there is no need to unify the data. Uncertain data and data that are registered by mistake are not overlooked if all the data are related to each other as the “principal”.

  The data of the members connected as “principal” is connected as a primary data with one as the main data and the other as the secondary data. If it is difficult to determine which data is the main data, a code meaning “duplicate data” is provided in the BOX, and the data is specified in the BOX column of the subordinate data for easy identification. In addition, when it is desired to avoid duplication in the number of data items of statistical data, if a classification meaning “duplicate data” is provided in the classification code and designated as a subordinate data area, unnecessary counts are counted there.

  Since it is a personal connection, not only information that the friendship is good, but also the relationship of the dog-monkey friend may be registered. It can be very helpful to include cautionary relationships, such as when you should not invite attendance at the same meeting, or who you should not talk about before that person. Also, even if a member is disconnected due to relocation or retirement, it may be possible to establish a new relationship with the person concerned, so it is preferable not to delete the relationship but to leave it.

  Next, the relationship input will be described. When the “Relation input” button shown at the bottom of FIG. 28 is pressed, a relationship input screen shown in FIG. 34 appears. Here, the connection between members and their contents are set. However, it is not only that Mr. A and Mr. B are connected, but also from which is connected, and what relationship is specified. From either to the other, consider the relationship with the master member as the parent and the slave member as the child. Patterns that can be considered in advance as to the relationship with the child members as seen from the parent are registered in the aforementioned relationship category.

  In the upper part of the screen of FIG. 34, the members (reference members) selected in the member specific search which is the preprocessing of this screen are displayed. In the lower half of the screen, the candidate candidates related to the target member are listed. Between them, there is a “parent-child switching” button and a list box indicating the upper and lower relationships. In the “Change parent / child” button, set which of the top and bottom is the parent (main), and the relationship category is displayed in the list box, so the relationship from the parent is selected.

i). “Seki” button Displays the members related to the first degree of the target member.
Used when referencing / changing / deleting the current relationship.
Select the person whose relationship is to be changed or deleted from the list.

ii). In the case of changing the relationship update / delete button, change the relationship contents and click the “update relationship” button.
Click the "Delete" button to delete the relationship.
Deleting a relationship does not delete the data itself, but only loses the connection, and the data remains even if the relationship is deleted. However, those who have been deleted will not appear in the same genealogy unless they are connected by another route. The relationship was also described in the above-mentioned “Relationship Classification”, but the relationship between the dog monkey's relationship and the relationship is considered as a kind of human network and should not be deleted as much as possible.

  Next, a genealogical display that is a feature of the present embodiment will be described. There are two types of genealogy display methods in the system of this embodiment. One is a “member introduction genealogy (parent / child / grandchild)” shown in FIG. Display parents, children, and grandchildren with a reference target at the center. In this genealogy display, by clicking the “Change Reference Object” button and shifting the reference object to the displayed parent, child, or grandchild, changing the person at the center of the genealogy, all the parties connected to that member Is displayed in the formula.

  If all registered members are related without a break, they will be displayed without interruption, but if the group of association is different, the genealogy will not be connected even if the reference object is moved. In this case, if a member of another group is selected and entered into the genealogy display, the related parties are displayed in the same manner. In the database, many small groups are formed and gradually grow larger.

  Further, in this genealogy display method, only a limited number of members are displayed as shown in FIG. Only direct parents, children, and grandchildren are displayed. A connected separately from the parent, B connected separately from the child, and its direct line are displayed by changing the reference object.

The outline of the procedure for searching for this “member introduction genealogy (parent / child / grandchild)” is as follows.
(1) A code of a member selected in a member list extracted by designating a specific condition is set as a reference target code (hereinafter referred to as a principal CIF).
(2) The reference target information is acquired from the member management table based on the principal CIF and stored in the reference target display area.
(3) Based on the principal CIF, the codes (hereinafter referred to as the parent CIF) and the classification of all the members who are in the parent relationship of the reference target are extracted from the relation management table, the information is the member management table, and the classification priority is the classification table. It is acquired and stored in the parent member list display area from the members having a high priority relationship.
(4) Based on the principal CIF, the codes (hereinafter referred to as child CIFs) and the classifications of all members who are in the child relationship of the reference target are extracted from the relation management table, and the respective information is the member management table, and the classification priority is the classification table. It is acquired and stored in the child member list display area from the member with the higher priority relationship.
(5) Based on the child CIF at the top of the child member list display area, the codes (hereinafter referred to as grandchild CIFs) and the classifications of all members corresponding to the child relationship of the child member at the top of the child member list display area are extracted from the relationship management table. Then, the respective information is acquired from the member management table, and the priority of the classification is obtained from the classification table, and stored in the grandchild member list display area from the members having the higher priority.
(6) Display the display area.
(7) It is determined whether the user has selected a member other than the top member in the child member list display area. Once selected, go to step (8). If not selected, the process proceeds to step (9).
(8) Based on the selected child CIF, extract the codes (hereinafter referred to as grandchild CIFs) and classifications of all members corresponding to the child relationship of the selected child member in the child member list display area from the relationship management table, and store the respective information. The member management table and the priority of the division are acquired from the division table, stored in the grandchild member list display area from the members having a higher priority relationship, and displayed again.
(9) It is determined whether or not the reference target change button has been pressed. If pressed, the process proceeds to step (10). If not pressed, the process ends.
(10) The code of the member selected by the user in the parent member list display area, child member list display area, and grandchild member list display area is the principal CIF. Return to step (2).

  On this parent-child display screen, only one generation is displayed above the direct line and only two generations below. Complementing this non-displayed portion is another genealogy, “Member introduction genealogy (front and back 5 parents etc.)”. An example is shown in FIG. This “member introduction genealogy (front and back 5 parents)” is a genealogy of all the related parties in the range of 5 parents before and after the reference object determined in “member introduction genealogy (parent / child / grandchild)” in FIG. To do.

  A genealogy representing a human network like the system of this embodiment cannot be represented by a one-way flow in which a parent is above and a child is below like a family tree. As an alternative, in the system of the present embodiment, as shown in FIG. 37, the person who is the center of the genealogy is displayed at the top left end. The first degree is displayed at a position one step down to the left. Similarly, the fifth degree is displayed while being lowered one step at a time to the left. The horizontal arrow indicates the relationship from parent to child, and “...” indicates that there is another shortest route.

  For example, (i) “Sakamoto Ryoma” has “...”. (I) “Sakamoto Ryoma” is the second-degree relative as seen from “Katsukaifune”, but when looking at other routes, “Sakamoto Ryoma” is also displayed in the first-degree (b). Since (ro) is closer to the reference object “Katsukaifune” than (ii), the part with “…” is for reference. The + sign means that there is a human connection under this. If you have a hidden or complex network, you can use this + function to reconstruct your genealogy freely.

The outline of the procedure for generating this member introduction genealogy is as follows.
(1) Based on the reference target CIF, information on the reference target member in the member management table is acquired and displayed in the tree view area.
(2) First parent identification (2-1) Parent members are extracted from the relationship management table based on the reference target code (CIF), and in the priority order in the second column of the tree view area, one member is one level below the reference target. Add to the display.
(2-2) Child members are extracted from the relationship management table based on the reference target CIF, and are additionally displayed under the parent member in the first row of the first member in the second column of the tree view area in the priority order.

However, if the same CIF member is already displayed in the tree view, "..." is added after the name.
(3) Second-degree identification (3-1) The following processes are performed in order from the top on the first-degree members displayed in the second column.
(3-2) The parent member is extracted from the relationship management table based on the first-degree CIF, and the corresponding first-degree member and the next first-degree member in the first row of the first member in the third column of the tree view area in the priority order. Insert and display between.

However, if the direct second-degree relative (reference object) is the same member, “second-level close-out” is not performed.
(3-3) If “...” is attached to the member of the corresponding first-level parent, “2nd-level identification” is not performed.
(3-4) If a member of the same CIF is already displayed in the tree view, “...” is added after the name.
(3-5) Child members are extracted from the relationship management table based on the first-degree CIF, and the corresponding first-degree member and the next first-degree member in the first row of the first member in the third column of the tree view area in the priority order. Insert and display between.

However, if the direct second-degree relative (reference object) is the same member, “second-level close-out” is not performed.
(3-6) If “...” is attached to the member of the corresponding first-level parent, “2nd-level identification” is not performed.
(3-7) If the same CIF member is already displayed in the tree view, "..." is added after the name.
(4) Washing out n parents. (4-1) The following processing is performed in order from the top for the members such as the second parent displayed in the third column.
(4-2) The parent member is extracted from the relationship management table based on the second-degree CIF, and the corresponding second-degree member and the next second-degree member in the first row of the first member in the fourth column of the tree view area in the priority order. Insert and display between.

However, if the direct second-degree predecessor (first-degree relative) is the same member, “three-degree relative identification” is not performed.
(4-3) If “...” is attached to the member of the corresponding second-level parent as the original, “3rd-level identification” is not performed.
(4-4) If the same CIF member is already displayed in the tree view, "..." is added after the name.
(4-5) Child members are extracted from the relationship management table based on the second-degree CIF, and the corresponding second-degree member and the next second-degree member in the first row of the first member in the fourth column of the tree view area in order of priority Insert and display between.

However, if the direct second-degree predecessor (first-degree relative) is the same member, “three-degree relative identification” is not performed.
(4-6) If “...” is attached to the member of the corresponding second tier, the “3rd tier identification” is not performed.
(4-7) If the same CIF member is already displayed in the tree view, "..." is added after the name.
(5) Thereafter, the number of steps (4) is advanced, and the same processing is performed for the fourth and fifth parents.

  Next, the relationship search function, which is another feature of the present embodiment, will be described. When the “relationship search” button is clicked, a member relationship search screen shown in FIG. 24 is displayed. Here, two people (both individuals and groups are acceptable) are searched for a connection between members. Although the reference target member is entered in the upper row, the “Condition search” button is used to move to the search screen, so that the member can be arbitrarily changed in both the upper and lower rows. The relationship is tracked in the range from the first degree to the tenth degree, but a radio button is used to specify whether the shortest route or all routes are found. When “Display all relationships” is checked and the execution button is clicked, the degree of closeness and the serial number within the same degree are displayed in the list box at the upper left of the genealogy in FIG. FIG. 38 is an explanatory diagram showing an example of a genealogy between two members on the left and right sides.

  When you select the route you want to reference in the list box, the genealogy of that route is displayed. As with other screens, the “Details” button displays the registered contents of the person selected in the genealogy when clicked. The “print” button previews the displayed tracking result and makes the printer printable.

The processing procedure of this relationship search function is as follows.
(1) Of the two members who track the relationship, one is positive and the other is secondary, and in order to track whether the secondary member is connected to the primary member, the setting condition is saved and the search result is temporarily saved. Initialize the array area in memory. Note that when the cancel button is pressed by the user, the processing is stopped, and the result up to the middle stored in the memory is discarded.
(2) At the time of processing, the setting conditions for whether to search to the maximum number of parents specified by the user, whether the shortest route or all routes, are saved. Here, description will be made assuming that all of up to the fourth degree.
(3) The first-degree relative that is the parent-child relationship of the primary member is extracted.
(3-1) It is determined whether the ia-th (i = 1 to n) is the secondary member among the extracted number of first-degree na records.
(3-1-1) If it is a secondary member, the route from the primary member is stored in the array area in the memory, and the process of step (3-1) is executed for the next first-degree record. .
(4) If it is not a sub-member, the second-degree parent that is the parent-child relationship of the first-degree ia-th member is extracted.
(4-1) It is determined whether the ib-th (i = 1 to n) is the secondary member among the extracted number of records of the second-degree nb.
(4-1-1) If it is a secondary member, the route from the primary member is stored in the array area in the memory, and the process of step (4-1) is executed for the next second-degree record. .
(4-2) If it is not a sub-member, it is determined whether or not the same member as the second-degree ib-th member exists in the route.
(4-2-1) If it exists, the process is interrupted and the process of the step (4-1) is executed for the next second-degree record.
(5) If it does not exist, the third degree, which is the parent-child relationship of the ib member of the second degree, is extracted.
(5-1) It is determined whether the ic-th (i = 1 to n) is the secondary member among the extracted number of nc records of the third degree.
(5-1-1) If it is a secondary member, the route from the primary member is stored in the array area in the memory, and the process of step (5-1) is executed for the next third-degree record. .
(5-2) If it is not a sub-member, it is determined whether the same member as the third-degree ic-th member does not exist in the upper rank in the route.
(5-2-1) If it exists, the process is interrupted, and the process of step (5-1) is executed for the next third-degree record.
(6) If it does not exist, the fourth-degree parent that is the parent-child relationship of the ic-th member of the third-degree parent is extracted.
(7) It is determined whether the id-th (i = 1 to n) is the secondary member among the extracted number of nd records of the fourth degree.
(7-1-1) If it is a secondary member, the route from the primary member is stored in the array area in the memory, and the process proceeds to the next record such as the fourth parent.
(7-2) If it is not a secondary member, the process proceeds to the next record such as the fourth parent. When the fourth-degree record ends up to n, the number of third-degree records is advanced by one and the process is performed.
(7-3) When the number of records of the third degree is up to n, the number of records of the second degree is advanced by one and the process is performed.
(7-4) When the number of records of the second degree ends up to n, the number of records of the first degree is advanced by one and the process is performed.
(8) The search results stored in the array area in the memory are rearranged from the one with the least number of roots.
(9) The first search result is displayed in the tree view.
(10) When the user instructs to change the search result display using the pull-down list box, the route selected by the user in the search result is displayed in the tree view.

  In the above embodiment, it has been devised so that a relational system diagram can be simply displayed with a configuration in which complicatedly intertwined relation information is viewed while being partially spotted. According to this configuration, it is possible to see the connection between the central data and the data that moves away from it. However, with this configuration, it is impossible to follow the transition of coupling and separation over time and see the change in relationship. In the relationship management table, parent-child relationships are associated, but this parent-child relationship is not always set as a parent and a child in the order of occurrence. The parent and child are set for the convenience of the user. Therefore, once the parent and child are related, the reverse relationship or a plurality of relationships cannot be set at the same time. This is because if the relationship between the two parties is not set in one direction in order to trace the relationship, a relationship that circulates forever can be created during relationship search and tracking.

  Next, in addition to the above embodiment, a relation vector table is further added and used together with the relation management table, so that the relationship search / tracking can be performed following the positional and temporal flow by the “backward route”. The embodiment will be described. This is necessary, for example, in the following cases.

  In the above embodiment, when a related personality is input, even if the name changes, even if the name is changed, the roots cannot be found because the order of occurrence does not exist. Although it is possible to have the occurrence order in each data, it is difficult to reflect the display in the order in the genealogy. For that purpose, the direction corresponding to the case, not the direction of the occurrence time and the parent-child relationship, is required in the relationship information.

  Taking the generation of the universe as an example, the substance A which is a big bang is separated at a certain position for a certain time, and further separated into substances B and C at a certain time and position, and the substance A changes to a substance A ′. Repeat the phenomenon. When manipulating related information in a scientific field, such as when such binding and separation are repeated and the material becomes unique as a material different from the original material, or when the original attribute remains unchanged, etc. If there is no time and position information that can be related, there is a risk that the separated and combined things in the same phenomenon are regarded as the same. This may be left as long as it is a simple relationship that does not place importance on where any two people met, such as a personal connection. However, time and position are indispensable information for substance changes and microorganism division information, etc., and it is possible to track the transition of data by squeezing such related information by time flow and position. Become.

  Furthermore, when recording information about people involved in information transmission in order to trace the information source that rumors spread, rumors are A → B → C → …… → A → B → G → …… → B → A → I sometimes go back to the same person several times. In that case, the content heard first is often different from the content heard second. When only the connection is seen, the relationship between the first A and B and the second relationship between A and B are exactly the same, and the third relationship between B and A is only the information transmission direction is reversed. is there. However, the time at which information is transmitted is different, and there is a possibility that the information changes due to the transmission position. These times and positions should not be included in the personal information, but should be processed in the related information.

  As described above, in operating the relationship information, the merit of specifying the “scoring route” is very large. Therefore, in order to operate this “swing route”, as a data table, as shown in FIG. 39, a relation vector table KVT is provided in addition to the relation management table KKT.

  In FIG. 39, the relationship management table KKT is the same as before, but the relationship classification etc. may not be included in this but may be included in the relationship vector table KVT. Detailed portions of each data may be stored in a member management table (not shown). As already explained, the relationship management table KKT determines the direction in which relationship tracking flows between two parties by having a parent-child relationship. Actually, the relationship management table KKT is used to prevent permanent circulation in search and tracking during processing. It has a role as an orientation means. Therefore, the parent-child relationship between the two parties is not registered in a double manner, but is a unique relationship, and the parent and child are not registered in reverse.

  The relationship vector table KVT is for registering a plurality of relationships between the parent and child of the relationship management table KKT together with the direction, position time series, connection position, connection order, etc., and writing to the relationship vector table KVT. One record is recorded for each relationship related in the premise process, and the direction of the relationship is expressed by the original and the destination, not the parent and the child. This source and destination can be specified regardless of the parent / child settings. Each record in the relation vector table KVT has unique information such as the contents that the individually designated aggregates are registered as one group and the contents that the concatenation is ranked. Recognize as a record. The relation vector table KVT is clearly necessary when a plurality of relations are generated or when ranks are generated in the relations. However, if it is sufficient to know only the relationship, it is desirable to select whether or not to write information to the relationship vector table KVT according to the user's needs in order to compress the storage area.

  In the relation vector table KVT, when the relation is connected in a 1: 1, 1: many, many: 1, many: many, arbitrary additional information is provided as shown in FIG. The user can freely set the connection position and the connection order with classification categories such as “replacement”, “variant”, “continuous”, “join”, and “separate”. “Same” is considered to be the same as the relationship classification “Principal”, although the two data are regarded as the same, but are not integrated but connected while leaving the shape of the group. “Replacement” regards two data as the same, displays one as priority data, and combines non-priority data into one as hidden data or name identification data. “Transformation” connects the old and new data with the distinction between old and new as being changed from the original data to the destination data. “Continuous” connects the old and new data as if they are continuous from the original data. “Coupling” makes a many: 1 connection, and “separation” makes a 1: many connection. In addition, when a clear time-series relationship is required by the user's intention, as shown in FIG. 41, it is specified which member of which group is used to link the already grouped relationships.

  By using this relation vector table KVT, reference object center display (hereinafter also referred to as a relational tree) and position time series display (hereinafter also referred to as a relational map or relational chronology) can be used in combination. For example, as shown in FIG. 41, the position time-series display is different from the reference center display that is created in the relational network that the user is not aware of while connecting 1: 1 as shown in FIG. The relationship according to the intention is displayed as it is. By using these together, it is possible to create a relational map and a chronological table of data, and it is possible to use a reference object center display of arbitrary data specified therein.

  In the relationship management table KKT, the parallel, serial, and group relationships described above are all decomposed and registered as 1: 1 unique connections, and the same relationship and reverse relationship are not recorded. That is, when the relationship is represented only by the relationship management table KKT, since the parent-child relationship for displaying the relationship expression and the flow of relationship tracking is shared, when there are a plurality of relationship patterns of two parties, or A → B If there is a relationship such as B → A, only one of them has to be registered.

  For example, A is B's boss, and A and B belong to the same circle. Also, B is a senior of A and a teacher. In this case, if the first relationship is B → A (senior), then A = B (circle friend), then a relationship A → B (boss) can be made after a while, and finally B → A (master) If the relationship is completed, it cannot be expressed only by the parent-child relationship in the relationship management table KKT. Therefore, each relationship, its direction, time series information, etc. are recorded in the relationship vector table KVT. The concept of the relation vector table KVT in this case is created on the premise that the relation information registered therein is unique, and there is no relation of the same attribute between any two parties. Therefore, when the user wants to intentionally specify the order of the relations, to give the meanings of a plurality of relations within the same relation, or to keep the reverse relation, the time information and the relation vector table KVT Provide information such as position information that can identify each record as having a different relationship.

  As a result, when the connection is represented by a chain, even if the same relationship appears at a plurality of points in time, it is possible to display a “scoring route” as a separate item. However, in this display, since the display position of the reference object is not unique, it is not possible to see all the parties at once. For example, FIG. 42 is obtained by replacing the relationship map of FIG. 43 with a relationship tree, and is the same relationship diagram if it is disassembled and squeezed. FIG. 42 shows the relationship seen from each individual at a glance, and FIG. 43 shows a display that makes it easy to understand the transition of the relationship. However, while referring to G at the bottom of FIG. 43, the connection with E is not known.

  Therefore, while referring to G, it is possible to display a relational diagram with G as a reference object, where it is possible to refer to where another member displayed when there is a connection is displayed on the relationship map, and further If you can move to and see other connections, you will be able to grasp the difference in time and position at the same time.

  For example, when the target data is distributed to multiple locations on the related map (related chronology) and there are multiple destinations, the location and attributes are indicated by a list box, etc. You may make it easy to grasp | ascertain a position by making it select and displaying the applicable data part on a related map by high-intensity display. Further, when moving to the selected position, it is desirable to automatically scroll and display at a designated position on the related map with a jump button or the like. In this way, a system that makes it very easy to grasp the relationship can be constructed if the related genealogy can be referred to as appropriate at an arbitrary location on the relationship map and moved.

  In arbitrary additional information, for example, time is not limited to year / month / day / hour / minute / second, but may be an attribute indicating a process of change of information. By using the expressions “position” and “time”, the position is a three-dimensional space, and the time can have a four-dimensional function representing the process of change. Even if the time is the same, the relationship between A and B is normal when viewed from C, but when viewed from D, the relationship is considered to be bad, and when viewed from E, it is said that it is seen by a wisdom couple. In some cases, the registrant's subjectivity greatly affects the association. Thus, when there are a large number of unspecified users in one system, information indicating that the user is another input can also be regarded as one piece of position information.

  In addition, additional information for recognizing that a plurality of relationships existing between the same two parties such as speed and force are unique has an area having the arbitrary additional information in the relation vector table KVT. As long as it is set, it can be set regardless of the system developer or user.

  Also, create a relationship map by naming and registering the created aggregate as a group member, such as “aggregate: simple substance”, “single substance: aggregate”, “aggregate: aggregate”, etc. By this, it is possible to know simultaneously the connection of each aggregate and the connection of the single members constituting it. Furthermore, it is possible to search for an aggregate including a specific linkage relationship. For example, in the academic field, research fields such as multimolecular conjugates with arbitrary molecular structures, research fields that should track occurrences and transitions such as languages, research fields such as celestial constellations / nebulae and stars / planets Can be widely applied.

  In addition, this invention is not limited to the said embodiment, A various deformation | transformation is possible. For example, in the above-described embodiment, description information and history information have been described as detailed information of member data, but various other information such as photos and attached files may be added. The registration information and the specific detailed information may be registered.

It is a figure which shows embodiment of the correlation information management system which concerns on this invention. It is a figure which shows the structural example of a member management table. It is a figure which shows the structural example of a relationship management table. It is a figure which shows the structural example of a master table. It is a figure for demonstrating the example of the flow of the correlation search process of the correlation information management system which concerns on this invention. It is a figure for demonstrating the example of search conditions and output conditions. It is a figure for demonstrating the case where a synchronous system is utilized. It is a figure for demonstrating the example of the parallel relationship using a parent selection group and a child selection group. It is a figure for demonstrating the example of the parallel relationship by the matching of a category. It is a figure for demonstrating the example of the import between databases of a LL system. It is a figure for demonstrating the medium which connects relationship. It is a figure for demonstrating the correlation in file management software, such as an explorer. It is a figure for demonstrating the partial correlation in the file of many types of data. It is a figure for demonstrating correlation of other files. It is a figure for demonstrating the case where a some management table is provided and related. It is explanatory drawing which shows the method of customer management of a general card form. It is explanatory drawing which shows the example of the relationship management table in this invention. It is explanatory drawing of a child relationship. It is explanatory drawing of a parent relationship. It is explanatory drawing of parent-child relationship. It is explanatory drawing of the route | root with the person who wants to search a user and a relationship. It is explanatory drawing of the connection by the parent-child relationship in this invention. It is a figure which shows the example of the screen of the member introduction genealogy of this invention. It is a figure which shows the example of the screen of the member relationship search of this invention. It is a figure explaining how to search for a genealogy according to the present invention. It is a block diagram which shows the software configuration of the system of this invention. It is a figure of the main menu screen of the implementation system of this invention. It is a figure of the member information input screen of the Example of this invention. It is a figure of the BOX item input screen of an Example of this invention. It is a figure of the BOX item input screen of an Example of this invention. It is a figure of the classification code input screen of this invention Example. It is a figure of the relationship classification registration screen of this invention Example. It is a figure of the relationship classification registration screen of this invention Example. It is a figure of the relationship input screen of this invention Example. It is a figure of the screen of the member introduction genealogy (parent, child, grandchild) of the present invention embodiment. It is explanatory drawing of the range of the genealogy currently displayed in the Example of this invention. FIG. 24 is a detailed diagram of the display screen of FIG. 23. It is explanatory drawing of the route searched in a relationship search. It is a figure which shows the example of combined use of a relationship management table and a relationship vector table. It is a figure for demonstrating the example of the method of connecting relations. It is a figure which shows the example of a connection of the grouped relationship. It is a figure which shows the example of the related system created with the reference object center display. It is a figure which shows the example of the related map created by the position time series display. It is a figure which shows the example of a relationship diagram. It is a figure which shows the example of the various information linked | related. It is explanatory drawing which shows the example of a display of a general family tree. It is explanatory drawing which shows the example of the connection of a personal connection.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 1 ... Input processing part, 2 ... Output processing part, 3 ... Data registration / update processing part, 4 ... Search processing part, 5 ... Editing processing part, 6 ... Relation management table, 7 ... Member management table, 8 ... Master table

Claims (1)

An association information management system that associates and manages various information of members as management units, at least,
Relationship vector table storage means for storing information on the direction of the relationship between the individual identification information unique to the members and information on the relationship classification including the degree of relationship and position time-series information;
Member management table storage means for storing and managing various types of information including classification information and detailed information for classifying the member corresponding to the identification information;
When the member and the relationship between the members and the degree of the relationship and the range of the related direction are input as the search conditions, the relationship between the members input from the relationship management table storage means and the degree of the relationship are input. The member management table storage means is further searched from the searched member to the range of the input relation direction repeatedly from the searched member to the range of the input relation direction. Association information processing means for reading various information of each searched member,
Output processing means for performing output processing of a relationship diagram including the member searched by the association information processing means and various information of the read member, a relationship map, and a related genealogy, the output processing means, In the output process, when the relation map is output, the transition of the relation along the position time series between the various information is displayed. When the relation tree is output, the connection between the various information is displayed in a chain. An association information management system characterized by

Images