JP2006107215A - Link management system, browser, database, program and management method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To solve the problems of existing techniques wherein it is impossible to find a link to a link destination file and trace the link back from the file, and it is difficult for a third person other than file authors to create a link when link information is embedded in files. <P>SOLUTION: Link information is managed in a database as a record including a link source file and a link destination file. This provides a function of allowing a third person other than file owners to freely set and database a link between displayed files, a function of searching the database for links to a displayed file, and a function of acquiring files that are link destinations or link sources by using file location information included in the database. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to a link management system, and more particularly to a technique in which a user freely sets a link indicating the relationship between information on the Internet.

  Non-Patent Document 1 describes an example of a system for setting a link between files that a user publishes on the Internet. The link function is defined in the WWW (World WideWeb) information description language HTML (HyperText Markup Language) described in this document, and the link function is implemented in a browser for displaying it, such as Microsoft Internet Explorer. Are known.

The link function in HTML, two files, namely the link is loaded when the user selects the link source files and links described, in the creation of link and to a destination file that appears, the description of the link is a link The location of the link destination file is described in a form embedded in the HTML of the original file, and only a one-way link from the link source to the link destination is realized.

  In addition, a tool known as a Blog tool, for example, MovableType software MovableType, implements a function called TrackBack as an application on the WWW. In this function, when the link destination file creator creates the link destination file, the specified URL (Universal Resource Locator) associated with the link source file is automatically specified in the link destination file. Thus, it is possible to create a link from the link source file to the newly created link destination file.

  The link from the link destination file to the link source file can be created by the creator of the link destination using the functions provided by normal HTML as described above. Can be created.

Furthermore, the extended link function in the standard XLink that realizes links between XML files described in Non-Patent Document 2 is described in an xlink file that is an XML file that describes links independent of the link source file and link destination file. By doing so, the browser that read the xlink file can follow the link source file and the link destination file in both directions.
XHTML "1.1 Module-based XHTML, W3C Recommendation 31 May 2001 XML Linking Language (XLink) Version 1.0, W3C Recommendation 27 June 2001

  The first problem with the conventional method described above is that a bi-directional link cannot be freely created by a third party, or the bi-directional link is not inseparable and is deleted in only one direction. Even if it can be created, it is impossible to know that the link was created from the file. The reason is that in the description in HTML, only the link source file creator can create a link as described above, and cannot create a bidirectional link.

  Also, according to TrackBack, the file author can create two-way links with other file authors as described above, but this link consists of two one-way links, each independently It can be deleted. That is, the creator of one link can delete the link freely, and the link in the opposite direction is not affected by the deletion, so that only pseudo bidirectionality is realized. Also, as with normal HTML, a third party who is not related to the file cannot create a link.

  Furthermore, in the case of XLink, a third party different from the file creator can create a link by allowing a third party to create a link by describing the location of both files in the Xlink file. . In addition, by describing bidirectional links in one file, the unity that cannot delete only one of the links is realized. However, in order to display a bidirectional link, the browser reads the Xlink file and reads the link source or link destination file described there, so simply reading the file links to it Can't know that exists. If limited to the link source file author, for example, a means such as creating an Xlink file at the same position as the link source file can be used. There is a problem that the reader cannot know its existence.

  In addition, the second problem for the same reason is that even if a numerical value is added as an attribute to the link by the conventional method, for example, Xlink, it can not be aggregated for a specific file There are challenges.

  As a third problem, for the same reason as the first and second problems, a score for the linked file is given as a numerical attribute added to the link, and an evaluation comment is given as the link source file. In this case, a score and an evaluation comment are added to the link source file, that is, a file in which an evaluation comment is written, and the user evaluates the score for the first linked file according to the score given to the first evaluation comment. There is a problem that it is difficult to obtain a score including the influence of.

  Accordingly, the object of the present invention was invented in view of the above problems, and a third party other than the creator of the link source file and the link destination file can freely create a bidirectional link between the files. Is to make it possible.

  Another object of the present invention is to collect all link information in which a file displayed by a user is a link destination or link source, and to allow aggregation when the link has a numerical attribute. It is.

  Still another object of the present invention is to provide a file in which a comment is described when an evaluation value is given as an attribute of the link to the link source, and a comment or score for the link destination file is described as the link source file. It is possible to perform meta-evaluation based on further comments and scores.

A first invention for solving the above problem is a link management system,
A database in which information indicating the location of the link source file and information indicating the location of the link destination file are stored in association with each other;
A link search means for searching the database for information indicating the location of the designated file;
And a file search means for searching for a file based on information indicating the location of the link destination file or link source file associated with the information indicating the location of the specified file that has been searched.

  According to a second aspect of the present invention for solving the above-described problem, in the first aspect, the database is formed by associating information indicating a location of a link source file with information indicating a location of a link destination file of the link source file. It has the registration means to register to.

According to a third invention for solving the above-mentioned problem, in the first or second invention, the database includes a link type indicating a type of a relationship between the link source file and the link destination file, and a link. Link evaluation information indicating the evaluation of the destination file,
Link type determination means for filtering the link type associated with the information indicating the location of the designated file searched by the link search means according to the specified link type;
And tally means for tallying link evaluation information associated with the filtered link type.

  A fourth invention for solving the above-mentioned problems is characterized in that, in the above-mentioned third invention, the link search means has a hierarchy specifying means for specifying a hierarchy which is a depth for recursively searching for a link. To do.

In a fifth aspect of the present invention for solving the above-described problem, information indicating the location of a specified file is searched from a database in which information indicating the location of a link source file is associated with information indicating the location of a link destination file. A link search means to
File search means for searching for a file based on information indicating the location of the link source file or link destination file associated with the information indicating the location of the specified file that has been searched.

  According to a sixth invention for solving the above-mentioned problem, in the fifth invention, registration means for associating the information indicating the location of the link source file with the information indicating the location of the link destination file in the database. It is characterized by having.

According to a seventh invention for solving the above-mentioned problem, in the fifth or sixth invention, the database includes a link type indicating a type of a relationship between the link source file and the link destination file, and a link Link evaluation information indicating the evaluation of the destination file,
Link type determination means for filtering the link type associated with the information indicating the location of the designated file searched by the link search means according to the specified link type;
And tally means for tallying link evaluation information associated with the filtered link type.

  An eighth invention for solving the above-mentioned problems is characterized in that, in the seventh invention, the link search means has a hierarchy specifying means for specifying a hierarchy which is a depth for recursively searching for a link. To do.

A ninth invention for solving the above-mentioned problem is a database for managing information on files related by links,
Information indicating the location of the predetermined file and information indicating the location of the link destination file of this file are stored in association with each other.

A tenth aspect of the invention for solving the above-described problem is the ninth aspect of the invention, wherein a link type indicating a kind of relationship between the predetermined file and the link destination file;
Link evaluation information representing evaluation of the link destination file is stored.

An eleventh invention for solving the above-mentioned problem is a method for managing information related to a file associated with a link,
A link search step for searching for information indicating the location of the specified file from link information in which the information indicating the location of the link source file is associated with the information indicating the location of the link destination file;
And a file search step for searching for a file based on information indicating the location of the link source file or link destination file associated with the information indicating the location of the specified file that has been searched.

  In a twelfth aspect of the invention for solving the above-described problem, in the above-mentioned eleventh aspect, the link is obtained by associating information indicating the location of the link source file with information indicating the location of the link destination file of the link source file. It has the registration step which registers into information, It is characterized by the above-mentioned.

In a thirteenth invention for solving the above-described problem, in the eleventh or twelfth invention, the link information includes a link type indicating a type of relationship between the link source file and the link destination file; It has a link score representing the evaluation of the linked file,
A link type determination step of filtering the link type associated with the information indicating the location of the designated file searched in the link search step according to the specified link type;
And a counting step of counting link evaluation information associated with the filtered link type.

  A fourteenth invention for solving the above-mentioned problems is characterized in that, in the thirteenth invention, the link search step has a hierarchy specifying step of specifying a hierarchy that is a depth for recursively searching for a link. To do.

A fifteenth invention for solving the above-mentioned problem is a browser program of an information processing device,
The program executes the information processing apparatus,
A link search means for searching for information indicating the location of the designated file from a database in which information indicating the location of the link source file and information indicating the location of the link destination file are associated;
It is made to function as a file search means for searching for a file based on the information indicating the location of the link source file or the link destination file associated with the information indicating the location of the specified file searched.

In a sixteenth aspect of the present invention for solving the above-described problem, in the fifteenth aspect, the program stores the information processing apparatus.
It is further characterized by further functioning as registration means for registering information indicating the location of the link source file and information indicating the location of the link destination file in association with each other.

In a seventeenth aspect of the present invention for solving the above problem, in the fifteenth or sixteenth aspect, the database includes a link type indicating a type of a relationship between the link source file and the link destination file, and a link. Characterized by having link evaluation information indicating evaluation of the destination file,
The program executes the information processing apparatus,
Link type determination means for filtering the link type associated with the information indicating the location of the designated file searched by the link search means according to the specified link type;
It is further made to function as an aggregation means for aggregating link evaluation information associated with the filtered link type.

  An eighteenth invention for solving the above-mentioned problems is characterized in that, in the seventeenth invention, the link search means has a hierarchy specifying means for specifying a hierarchy which is a depth for recursively searching for a link. To do.

  In a nineteenth aspect of the invention for solving the above-mentioned problem, a record comprising a set of link source file ID, link destination file ID and link attribute is stored in a link information registration database which can be referred to from the Internet when link information is created. Register and search the link information registration database using the ID of the file to be displayed when displaying the file in the browser as a key, by searching all link information that the display file is the link source and link destination. It is characterized by realizing the link.

  A twentieth invention for solving the above-mentioned problems is characterized in that a search result is totalized on the browser side.

  In a twenty-first aspect of the invention for solving the above-described problem, in the nineteenth aspect of the invention, in the link information obtained by the search process, a search is similarly performed for an ID of a file other than a display file to obtain link information. Then, the process of performing the aggregation is recursively performed to obtain an evaluation value for the link destination evaluation, that is, a meta evaluation.

  The first effect is that the viewer of the file knows not only the link from the file, that is, the link from which the browse file is the link destination, but also the link from which the browse file is the link source. Is to be able to.

  In addition, the second effect is that when a viewer of a file who has viewed two files thinks that the file is related to both of them even if neither of the files is the file of the viewer, the association between the two Is possible. The reason for this is to provide a function of creating link information as a record in which both file IDs are associated, registering them in the database, and searching for links from the database using the file ID being browsed on the browser side as a key.

  A third effect is that the file viewer can obtain a score for the browsed file. This is because a score is provided as an attribute for the link, and the score of the link to which the browsed file as a result of the search is linked is calculated by the browser. Furthermore, in the evaluation comment file of the link source searched from the browse file, by providing a function for obtaining the evaluation comment itself by searching the link to which the file is a link destination in the same manner as the above search. Better results can be obtained.

  Next, the best mode for carrying out the invention will be described in detail with reference to the drawings.

  Referring to FIG. 1, the first embodiment of the present invention includes a link database 100 that can be referred to from the Internet for managing link information, and a browser 200 for displaying a file. The browser 200 also displays a link search unit 210 that searches for a related link from the file ID, a file acquisition unit 220 that searches for and acquires a file from the location of the link when a link exists, and displays the acquired file. File display means 230. These means generally operate as follows.

  In the link database 100, at least the ID or location of the file that is the link source and the ID or location information of the file that is the link destination are registered as information about the link. In addition, when an ID is registered instead of a file location, information on the relationship between the ID and the location is also registered.

  The browser 200 provides a function of displaying a file by a user and following a link associated with the file.

  The link search means 210 searches the link database 100 using the file ID or location information displayed on the file display means 230, and the displayed file is the link source or link destination as a search result. Get the file ID or location.

  The file acquisition unit 220 uses the file ID or location notified from the link search unit 210 to acquire the file entity from the location where the file is located via the network.

  The file display unit 230 displays the file acquired by the file acquisition unit 220 to the user.

  When the user determines that there is some relationship between the files displayed on the file display unit 230, the link registration unit 240 uses the link database 100 as link information with the two files as the link source file and the link destination file, respectively. Register with.

  Next, the overall operation of the present embodiment will be described in detail with reference to the flowcharts of FIGS.

  FIG. 2 shows the data structure in the link database 100. The link database 100 can be realized by using a normal relational database or a hash table that can be referred to from the Internet, or can be realized in a distributed manner on a network called DHT (Distributed Hash Table). May be.

  An operation when tracing a bidirectional link of a file will be described with reference to the flowchart of FIG.

  First, it is assumed that the file display unit 230 starts from a state where the first file is displayed. This first file can be displayed, for example, by giving the file ID or location directly to the file display means 230 (step 1).

  For the displayed file, the user designates the link from which the file is the link source and / or the link to which the file is linked, and instructs the link search unit 210 to execute the link search. (Step 2).

  The link search unit 210 acquires the ID list of the corresponding file from the link database 100 using the link type designated by the user and the file ID sent from the file display unit 230 (step 3).

  In the database of FIG. 2, the link source file ID is searched using the link source file ID as a key in the link table, or the link source file ID is searched using the link destination file ID as a key. Further, the location of the file corresponding to the retrieved file ID is acquired by searching the file location table. The acquired file ID list is sent again to the file display means 230, and the user selects a file to be traced from among them (step 4).

  The location of the file selected by the user is sent from the link search means 210 to the file acquisition means 220 (step 5).

  The file acquisition unit 220 acquires the file entity based on the file location information (step 6), and the file display unit 230 displays the file (step 7).

  With reference to the flowchart of FIG. 4, the operation when the user associates files is described.

  It is assumed that the file display means 230 starts from a state in which two files that the user thinks are related are displayed (step 41).

  The user designates one file as the link source file and designates the other file as the link destination file (step 42).

  The link registration means 240 registers the link information as a new link in the link database with the IDs of these two files as a set (step 43).

  Then, the effect of this Embodiment is demonstrated. In the present embodiment, in the table in the link database, the link information is managed as a set of the link source file and the link destination file, so of course the displayed file is the link source of the file link. Even in the case of the link destination, the user can follow the link information. In addition, link information can be created independently of the creation and registration of the file itself, and can be freely linked by a third party who is not the creator or owner of the link source or link destination file. It becomes.

  Next, the best mode for carrying out the second invention of the present invention will be described in detail with reference to the drawings.

  Referring to FIG. 5, the second embodiment of the present invention includes a link database 100 for managing link information and a browser 200 for displaying a file. The browser 200 also displays a link search unit 210 that searches for a related link from the file ID, a file acquisition unit 220 that searches for and acquires a file from the location of the link when a link exists, and a display of the acquired file. File display means 230, link registration means 240 for registering links, link type discrimination means 250 for discriminating the type or score of the obtained link information, and link aggregation for summarizing the links collected for each type. Means 260. These means generally operate as follows.

  As shown in FIG. 6, the link database 100 is substantially the same as the link database in the first invention of the present invention described above, except that it has a table for assigning types and scores to each link. . The browser 200 provides a function for a user to display a file and follow a link associated with the file. The operations of the link search unit 210, the file acquisition unit 220, the file display unit 230, and the link registration unit 240 are the same as those in the first embodiment of the present invention, and will not be described. Only the operation of the means 260 and the new operation of each means related thereto will be described. The link type determination unit 250 selects and filters only the links required by the user from the plurality of links obtained from the link search unit 210, and sends the link ID to the link aggregation unit 260. The link tabulating unit 260 tabulates the score based on the link ID and calculates a score such as a total value or an average value.

  Next, the overall operation of the present embodiment will be described in detail with reference to FIGS.

  FIG. 6 shows the data structure in the link database 100. The difference from the first invention of the present invention is that a link type table and a link score table are included for each link.

  The operation when the scores of the reputation information of the files are totaled using the file links in the flowchart of FIG. 7 will be described.

  First, the file display means 230 displays the contents of a file or a file list (step 71). In the following, the case where the file list is displayed will be described as an example. However, the case where the contents of the file are displayed is the same except that the target file is one.

  The user selects a file whose score is to be displayed from the displayed file list (step 72).

  The link search means 210 acquires a list of link IDs to which the specified file is a link destination using the ID of the file specified by the user (step 73). In the table of FIG. 6, a search is performed using the link table and the link destination file ID as a key.

  The link ID list is sent to the link type determination means 250. The link type determination means 250 determines whether each link is of a predetermined type, for example, “reputation / comment” type, and filters only “reputation / comment” type links (step 74). In the link database of FIG. 6, for each link ID, only the link type having “reputation / comment” is selected in the link type table. The link ID of the type filtering result is sent to the link counting means 260.

  The link totaling means 260 totals the scores possessed by the links of the respective link IDs, and determines the score for the original file (step 75). As an operation of the link database in FIG. 6, a score corresponding to each link ID is acquired in the link score table. As a score determination method, a total value of scores of each link may be simply used, or an average value of scores of each link may be used.

  The score obtained by the link aggregation means 260 is sent to the file display means 230, and the file display means 230 displays the score in association with the original file (step 76). For example, the score of each file can be shown to the user by displaying a score next to each file name in the file list display.

  Then, the effect of this Embodiment is demonstrated. In the present embodiment, it is possible to refer to an evaluation by a third party for a file by filtering and counting the link type and link score attached to the link in the table in the link database.

  Next, the best mode for carrying out the third invention of the present invention will be described.

  Referring to FIG. 8, the third embodiment of the present invention includes a link database 100 for managing link information and a browser 200 for displaying a file. The browser 200 also includes a link search unit 210 that searches for a related link from the file ID, a file acquisition unit 220 that searches for and acquires a file from the location of the link when a link exists, and a display for displaying the acquired file. File display means 230, link registration means 240 for registering links, link type discrimination means 250 for discriminating the type or score of the obtained link information, and link aggregation means for totalizing the links collected for each type 260 and a hierarchy designating unit 270 for designating the depth of the hierarchy following the link. These means generally operate as follows.

  Of the means constituting the link database 100 and the browser 200, the link search means 210, the file acquisition means 220, the file display means 230, the link registration means 240, the link type determination means 250, and the link counting means 260 are the above-described present invention. This is the same as the first embodiment and the second embodiment of the present invention, and a description thereof will be omitted. The operation of the hierarchy designation unit 270 and the operations of the link search unit 220, the link type determination unit 250, and the link aggregation unit 260 related thereto will be described.

  The hierarchy designation means 270 designates in advance the depth with which the user follows the link. Here, the link depth is defined as the first layer that traces from the link destination file to the link source file, and the second layer that traces the link that uses the link source file as the link destination. By tracing, you can recursively trace to a hierarchy of arbitrary depth.

  The link search unit 210 receives a list of files from the file display unit 230 as in the second embodiment of the present invention described above, and further receives a depth value of the hierarchy from the hierarchy designation unit 270. The link search unit 210 refers to the link database 100 and collects links recursively up to a designated hierarchy.

  The link type determination means 250 performs filtering according to the link type as in the second invention.

  The link totaling unit 260 performs totaling by weighting scores according to the tree structure of comments obtained by recursion. For example, if an evaluation comment file that is subject to evaluation at a certain level is given a low evaluation (meta-evaluation) for that evaluation, the process of reducing the weight of the evaluation of the original evaluation comment, etc. I do.

  Next, the effect of this embodiment will be described. In the present embodiment, it is possible to refer to the third party evaluation in consideration of the score of the evaluation comment with respect to the evaluation comment by recursively tracing the link data by the designated hierarchy.

  Next, operations for carrying out the present invention will be described using specific examples.

  The link database is configured using DHT (Distributed Hash Table) as a database that can be accessed from anywhere on the Internet. DHT is a technology that holds a hash table, usually implemented as memory or files on a single machine, virtually as a single hash table on a network configured on multiple PCs on the Internet. Compared with the case where the database is held on a single PC, there is a feature such as increased fault tolerance. The distributed hash table is, for example, a technique described in a non-patent document “Data Search in P2P System” (Communications of the ACM Japanese Version Vol.4 No.1, pp.17-24).

  FIG. 10 shows a case where a linked database is realized on a single database machine (a) and a case where a database is distributed and held on each machine on the Internet using a DHT (b). In this case, the link table in the database is realized as a set of a hash table that can draw the link destination file using the link source file ID as a key and a hash table that can draw the link source file using the link destination ID as a key. Is done. Further, the file location table is realized as a hash table that uses a URL as location information and can retrieve the URL of the file location using the file ID as a key.

  The browser is realized as software on the PC. For the file display means, for example, general file display software such as Microsoft Internet Explorer can be used. The link registration means uses a one-way hash function such as sha1 as the file ID, uniquely determines the ID from the file URL or file content, and uses the file URL as the key and the link source file ID. The link source file ID is registered in the respective distributed hash tables with the link destination file ID and the link destination file ID as keys. In the link search means, a module for searching the hash table is prepared, and the search for the link destination file ID from the link source file ID, the search of the link source file ID from the link destination file, and the file ID from the file ID are performed. Perform a URL search. With the configuration as described above, the problems of the present invention can be solved.

  A specific description for carrying out the second embodiment of the present invention will be given. The configuration of the link database and browser is the same as that of the first embodiment of the present invention. As the link database, a table in which the link type is used as a key and the score is a value using the link ID as a key is added. The module that searches the hash table searches for a link using the file ID determined from the file list as the link destination ID, and obtains a list of link IDs. In addition, the search module uses link IDs and sequentially searches the link type table to obtain the link type corresponding to each link ID. Only the link ID that matches a predetermined type, for example, “evaluation comment”, is obtained. Leave the score for each ID from the link score table. Here, it is assumed that the evaluation values are given in five stages, for example, -2, -1,0, 1, and 2. A smaller value indicates a lower rating for the file. One way to aggregate a number of evaluation comment links given to a file is to simply add the scores for each link. In this case, a large number of well-received files will get a large value. Another tabulation method is a method of obtaining an average score value of each link. In this case, the tendency of evaluation is shown regardless of the number of evaluation itself, and the value is normalized to a value from -2 to 2. The obtained score is displayed side by side in the file list in the file list in the browser, so that the user can judge the quality of each file. With the configuration as described above, the second problem of the present invention can be solved.

  Furthermore, a specific example of the third embodiment of the present invention will be shown. Except for the total part of the score, it is the same as the above example. In the third embodiment, a link is recursively followed to form a tree structure for the link score. An example of the tree structure of the link score is shown in FIG. As a method for determining the root portion of the tree structure, that is, the score of 1 in FIG. 9, for example, there is the following method. Scores placed side by side at the same level, for example, a score for 8 from 10, 11 averages the score by 10, 11. The rating for 4 is also the average of the scores of 8 and 9. The score of 9 is 0. A score of 8 should take into account a rating of 10,11 to 8 itself. Here, it is assumed that the evaluation of the nth layer is given as S (n) = S0 (n) * 2Sa (n + 1). Here, S0 (n) is an original score as an attribute in the nth layer, and Sa (n + 1) is an average value of evaluation from the n + 1th layer for the file. The original score of 8 itself is -1, but the evaluation from 10, 11 is translated and multiplied by 20.5 to -1.4. This means that a negative evaluation value of 8 is increased when a positive evaluation is given for the negative evaluation of 8. Similarly, the score given to 1 of 4 is originally -2, but becomes -1.22 when the influence of 8, 9, 10, and 11 is considered. In the above example, the score is set to -2 to 2, and the formula for calculating the influence from the lower hierarchy is defined as described above. However, the range of the score is arbitrary, and the calculation of the influence is based on other calculations like the score. You can also With the configuration as described above, the influence of the evaluation comment score of only the designated hierarchy can be obtained, and the third problem of the present invention can be solved.

  According to the present invention, in the use of information on the Internet, the relationship between files can be increased with the cooperation of network users, and it is possible to efficiently search for information using the relationship between files. Become.

It is a block diagram which shows the structure of the best form for implementing 1st invention. It is a figure which shows the database structure of the best form for implementing 1st invention. It is a flowchart which shows the operation | movement at the time of the search of the link of the best form for implementing 1st invention of this invention. It is a flowchart which shows the operation | movement at the time of registration of the link of the best form for implementing 1st invention of this invention. It is a block diagram which shows the structure of the best form for demonstrating 2nd invention. It is a figure which shows the database structure of the best form for implementing 2nd invention. It is a flowchart which shows the operation | movement at the time of aggregation of the link score of the best form for implementing 2nd invention of this invention. It is a block diagram which shows the structure of the best form for implementing 3rd invention. It is a figure for demonstrating the calculation of the score at the time of following a link recursively of 3rd invention of this invention. It is a figure which shows the concept of DHT (distributed hash table).

Explanation of symbols

100 link database 200 browser 210 link search means 220 file acquisition means 230 file display means 240 link registration means 250 link type determination means 260 link aggregation means 270 hierarchy designation means

Claims (21)

A link management system,
A database in which information indicating the location of the link source file and information indicating the location of the link destination file are stored in association with each other;
A link search means for searching the database for information indicating the location of the designated file;
Link management comprising: a file search unit for searching for a file based on information indicating a location of a link destination file or a link source file associated with information indicating the location of the specified file that has been searched. system.   The link management according to claim 1, further comprising registration means for registering information indicating a location of a link source file and information indicating a location of a link destination file of the link source file in the database in association with each other. system. The database has a link type indicating a type of relationship between the link source file and the link destination file, and link evaluation information indicating an evaluation of the link destination file,
Link type determination means for filtering the link type associated with the information indicating the location of the designated file searched by the link search means according to the specified link type;
The link management system according to claim 1, further comprising a totaling unit that tabulates link evaluation information associated with the filtered link type.   4. The link management system according to claim 3, wherein the link search means includes hierarchy designation means for designating a hierarchy that is a depth for recursively searching for links. A browser for an information processing device,
A link search means for searching for information indicating the location of the designated file from a database in which information indicating the location of the link source file and information indicating the location of the link destination file are associated;
A browser comprising: a file search means for searching for a file based on information indicating the location of a link source file or a link destination file associated with the information indicating the location of the specified file that has been searched.   6. The browser according to claim 5, further comprising registration means for registering information indicating the location of the link source file and information indicating the location of the link destination file in association with each other in the database. The database has a link type indicating a type of relationship between the link source file and the link destination file, and link evaluation information indicating an evaluation of the link destination file,
Link type determination means for filtering the link type associated with the information indicating the location of the designated file searched by the link search means according to the specified link type;
The browser according to claim 5, further comprising a totaling unit that totalizes link evaluation information associated with the filtered link type.   The browser according to claim 7, wherein the link search unit includes a hierarchy designation unit that designates a hierarchy that is a depth for recursively searching for a link. A database that manages information about files associated with links,
A database characterized in that information indicating the location of a predetermined file and information indicating the location of a link destination file of this file are stored in association with each other. A link type indicating the type of relationship between the predetermined file and the linked file;
The database according to claim 9, wherein link evaluation information representing evaluation of the link destination file is stored. A method for managing information about files related by links,
A link search step for searching for information indicating the location of the specified file from link information in which the information indicating the location of the link source file is associated with the information indicating the location of the link destination file;
A file search step for searching for a file based on information indicating the location of the link source file or link destination file associated with the information indicating the location of the specified file that has been searched. .   12. The management according to claim 11, further comprising a registration step of registering information indicating the location of the link source file and information indicating the location of the link destination file of the link source file in association with the link information. Method. The link information includes a link type indicating a type of a relationship between the link source file and the link destination file, and a link score indicating an evaluation of the link destination file.
A link type determination step of filtering the link type associated with the information indicating the location of the designated file searched in the link search step according to the specified link type;
The management method according to claim 11, further comprising: a counting step of counting link evaluation information associated with the filtered link type.   14. The management method according to claim 13, wherein the link search step includes a hierarchy specifying step of specifying a hierarchy that is a depth for recursively searching for a link. A browser program for an information processing device,
The program executes the information processing apparatus,
A link search means for searching for information indicating the location of the designated file from a database in which information indicating the location of the link source file and information indicating the location of the link destination file are associated;
A program which functions as a file search means for searching for a file based on information indicating the location of a link source file or a link destination file associated with the information indicating the location of the specified file thus searched. The program executes the information processing apparatus,
16. The program according to claim 15, wherein the program further functions as registration means for registering information indicating the location of the link source file and information indicating the location of the link destination file in association with each other in the database. The database includes a link type indicating a type of a relationship between the link source file and the link destination file, and link evaluation information indicating an evaluation of the link destination file.
The program executes the information processing apparatus,
Link type determination means for filtering the link type associated with the information indicating the location of the designated file searched by the link search means according to the specified link type;
The program according to claim 15 or 16, further functioning as a summing unit that tabulates link evaluation information associated with the filtered link type.   The program according to claim 17, wherein the link search unit includes a hierarchy designation unit that designates a hierarchy that is a depth for recursively searching for a link. A link database for managing at least information of a pair of a link source file and a link destination file as link information in order to allow a file user to refer to the relationship between files on the Internet as a bidirectional link; A browser for viewing files,
The browser
File display means for displaying the file;
Link search means for obtaining link information associated with the file from the link database;
A file acquisition means for acquiring a file associated with a link via the Internet;
A link management system comprising: a link registration unit for a user to register a relationship between files in a link database. The link database according to claim 19, wherein the link information includes a link type indicating a type of a relationship between files related by a link, and a link score representing a link destination evaluation by a numerical value.
20. A link management system comprising a browser according to claim 19, further comprising: a link type determination unit that filters link information according to a link type; and a unit that tabulates link scores.   The browser further includes a hierarchy designating unit for designating a depth for recursively following the link, and performing a meta-evaluation of the file itself that is being evaluated when calculating the score of the file by recursively following the link. 21. The link management system according to claim 20, wherein a score calculation with consideration is performed.

Images