JPH117449A - Hypertext information collecting method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To improve the operability and convenience of a user who utilizes hypertext information by transferring information of a node stored in a storage medium when the user inputs the address of a certain node. SOLUTION: This device contains a collection system (a communication means 4, an interpreting means 5 and an index generating means 6), a storage system (a receiving means 7, a managing means 8 and a storing means 9), an index table 10 and a temporary file 11 storage place 11. The storage system stores collected hypertext information in a storage medium 12 in accordance with a user's request. The medium 12 is delivered to a user and the user connects the medium 12 to his own proxy 13 and utilizes it. A browser 14 shows hypertext information. The proxy 13 reads information in the medium 12 and sends it to the user when the user inputs an address and a corresponding node exists in the medium 12, and reads the information of a specified address from a server 1 and transfers it to the user when the node does not exist.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] The present invention relates to a hypertext system.

[0002]

2. Description of the Related Art In the case of a hypertext system, since information is linked by links, the next information cannot be obtained unless the links are followed in order.

[0003] In a distributed hypertext system on a global scale such as the WWW (World Wide Web), for a user who browses WWW contents with a browser, a WWW mechanism that follows a link through a communication line is provided by:
Trying to follow many nodes was very time consuming. Most of it was airtime. If the user is motivated to refer to the content by collecting information, the user has to wait until the content is displayed in front of a computer equipped with a browser. "USP 5572643: Wed browser wi
th dynamic display of information objects during l
Inking] uses the waiting time to provide a function of displaying an advertisement or the like, but it is not essential information for the user, and has not been an essential solution for the user.

[0004] On the other hand, "Fah-Chun Cheong:" Internet Agen
As described in ts ", New Riders, 1996", the Internet robot recursively follows a link from a node address (uniform resource locator) given as an initial value, and associates a node via a network. There is a system that collects information of each URL and automatically generates an index for each URL. That is, a function of interpreting information of each node and generating a table of URLs and keywords has been provided. Based on this table, an information search function can be provided. That is, when a keyword is input, a function of searching for a URL of related content can be realized.
However, in the case of Internet robots, the content itself that has been collected is usually discarded after the table is generated. There is a limit on the capacity of the disk unit,
This is because there was no point in retaining the content.

[0005] The problem is that when an Internet robot is operated, a large-scale index is usually created. Therefore, a large amount of resources such as disks and memories constituting the system are required, and the communication line is slow. , It took days or weeks to generate the table.

[0006]

An Internet robot that only discards a large amount of content cannot satisfy the needs of the browser system of a frustrated user because the content is not easily transmitted. It is an object of the present invention to provide a hypertext system that is free from space-time constraints without binding the user in front of a computer with a browser.

Although the technology used is different, for example, a VTR device for home video recording produces a similar effect. When trying to watch a program on a TV, the user is bound before the TV. However, in the case of a VTR, it can be said that the user is released from the constraints of time in that the tape can be temporarily stopped and the user can continue the program at another time or watch the same broadcast scene many times.
In the case of a portable VTR, the restraint of the user has been released spatially. However, naturally, the existing VTR device cannot refer to the hypertext information.

[0008]

In a preferred embodiment of the present invention, a hypertext information collecting apparatus includes a receiving means for inputting a user's request, an information collecting means, and a function of selectively storing the collected contents in a storage medium. The computer system includes a storage unit for storing, and a management unit for managing a storage medium and user information. The above object is achieved by delivering a storage medium in which originally discarded content is selectively stored to a user in accordance with the input user's request.

[0009]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Preferred embodiments of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a system configuration diagram of the entire hypertext information collecting method.

The hypertext information is distributed to a plurality of servers 1 connected to a network. A node in one server 1 is linked by links to several other nodes. One node can be specified by a unique address (URL). The proxy 2 capable of centrally accessing hypertext information including a plurality of nodes can be realized by a conventional technique.

The hypertext information collecting apparatus 3 in this embodiment includes a collecting system (communication means 4, interpreting means 5, index generating means 6), a storing system (accepting means 7, managing means 8, storing means 9), an index table. 10, a computer system having a temporary file storage location 11.

The index table 10 is used for managing nodes and links. The details of the index table will be described later in detail with reference to FIG.

According to the processing of the collection system, the collected hypertext information is stored in the storage medium 12 by the storage system according to the user's request. The storage medium 12 is delivered to the user, and the user uses the storage medium 12 by connecting it to his own proxy 13. The browser 14 can display hypertext information. The proxy 13 reads out the information in the storage medium 12 and sends it to the user when there is a corresponding node in the storage medium 12 when the address is input from the user. Then, the information of the designated address is read from the server 1 and transferred to the user.

FIG. 2 shows an example of the structure of a record in the index table.

The index table 21 has NO22,
URL23, KEY24, LINK25, FLAG2
6, VAL 27, which are used to store information on numbers, addresses, keywords, links, visited flags, and priorities.

Referring to FIG. 2, the user requests include "mon
"VAL" column 27 when there is a keyword "ey"
The calculation method of is shown below. The "NO" column 22 retrieves the records of 2 and 4 and adds 2 to each "VAL" column 27.
Further, the link destination in the “LINK” column 25 is checked, and “VA” of the records 1 and 4 corresponding to “NO” of the link destination is checked.
Add 1 to the "L" column. As a result, the “VAL” column 27
Priorities can be assigned according to user requests.
The relationship between the process for assigning priorities and other processes will be described later in detail with reference to the drawings.

The information processing method in the hypertext information collection device has two main systems (collection and storage).
First, a method of processing the collection system will be described with reference to FIG.

In step 31, a record whose FALG column is not visited is read from the index table.

In step 32, the communication means acquires information on one node indicated by the address based on the contents of the URL column of the index table.

In step 33, the obtained information is
Temporarily save to a temporary file storage location.

In step 34, the interpreting means opens the stored temporary file and interprets the information in the node, so that the node specified by the address
The node (link) associated with the node and the keyword characterizing the node are read.

In step 35, the index generating means includes:
The index table is checked, and if the address is new, a unique number is generated for the NO column using the URL, link, and keyword as one record, and newly stored in the index table. The VAL column is set to “0” as an initial value, and the FALG column is not visited. Also, the FALG column of the acquired node, that is, the visited flag is updated to visited.

In step 36, the next record in the index table is examined. If the record is not yet acquired (not visited), the processing from step 1 onward is repeated according to the address. If it has already been acquired, the next record is checked.

Next, a processing method of the storage system will be described below with reference to FIG.

In step 41, the user inputs a request in the form of a keyword. In step 42, the receiving means receives the keyword, searches the index table, and adds "2" as a primary mark to the VAL column for the record having the keyword.
Also, referring to the LINK column, if there is another record linked from the address, "1" is added to the record as a secondary mark. By this processing, a certain 1
In the VAL column of one record, the closer to the user's request, the larger the number. In step 43, the management means first sorts the index tables in descending order of the VAL column and determines the priority order. Next, the management means confirms whether or not the currently acquired nodes are within a predetermined priority order (here, 100 in descending order of numbers), and sends an instruction to the storage means. In step 44, the storage unit acquires information on the designated node from the temporary file storage location and stores the information on the storage medium. In step 45, it is confirmed whether or not all nodes of a predetermined priority have been stored,
If there is still a remainder, the process returns to step 44 and the process is repeated. In addition, the function of storing and sorting information according to the user's demand for each storage medium in accordance with the demands of a plurality of users in the storage means can be easily extended.

After storing the information of the node having the predetermined priority, the storage medium is removed from the hypertext information collecting device and connected to the user's proxy. The subsequent processing in the proxy on the user side will be described with reference to FIG.

In step 51, an address desired by the user is received. In step 52, it is confirmed whether or not a file storing information of the node corresponding to the address exists in the storage medium. If it is in the storage medium, the file is read in step 53.
If not, in step 54, it is obtained from the server of the address via the communication line. In step 55, the read file information is transferred to the user and returned.

[0029]

According to this series of processing, from the user's point of view, it seems that the user accesses the hypertext information as usual, but most of the information of interest to the user is transmitted from the storage medium without passing through the communication line. High-speed reading is possible. For the user using the hypertext information, operability and convenience are greatly improved.

[Brief description of the drawings]

FIG. 1 is an overall system configuration diagram of the present embodiment.

FIG. 2 is an example of an index table related to a strategy for collecting and storing information.

FIG. 3 is a processing flow of each functional block when collecting information.

FIG. 4 is a processing flow of each functional block when information is stored.

FIG. 5 is a processing flow in a proxy when a user uses the proxy.

[Explanation of symbols]

1 ... server, 2 ... proxy, 14 ... browser, 10 ... index table.

Claims (10)

[Claims] The present invention relates to a hypertext system in which nodes are related to each other by a link and a related node can be referred to following a certain node based on the link. A hypertext information collecting method for collecting node information, comprising a hypertext information collecting means, a hypertext information storing means, and an index table, wherein the hypertext information collecting means includes a communication means, an interpreting means, an index, The hypertext information storage means comprises a receiving means, a management means, and a storage means, and stores the hypertext information according to a user's request. It has a function of storing in a storage medium, and when a user inputs an address of a certain node, Hypertext information collection method characterized by transferring information stored node 憶媒 body. 2. The hypertext information collecting method according to claim 1, wherein the index table includes fields of a number, an address, a keyword, a link, a visited flag, and a request degree. . 3. The hypertext information collecting method according to claim 1, wherein the interpreting means generates an address, a keyword, and a link from the hypertext information, and the index generating means generates field data of the number, the visited flag, and the degree of request. A hypertext information collection method, wherein a record including an initial value is generated, and the communication unit acquires information on an address of a node whose visited flag is not visited, and creates a temporary file. 4. The hypertext information collecting method according to claim 1, wherein the receiving means receives a keyword from a user, searches a keyword field of an index table, and in a record where the keyword exists, a data of a field of a desired degree in a record where the keyword exists. Is updated, and in the record of the link destination address described in the link field of the record in which the keyword exists, the data of the field of the degree of request is updated. The reordering, the degree desired by the user is calculated for each address, and the storage means stores a temporary file created by the hypertext information collecting method of claim 1 in the storage medium for the information of the address having the high degree. Hypertext that features Information collection method. 5. The hypertext information collecting method according to claim 1, wherein the storage medium is connected to a proxy, and when a user inputs an address of a certain node, the information of the node stored in the storage medium is read. A method for collecting hypertext information, comprising the proxy to be transferred. 6. A hypertext information collecting method according to claim 5, wherein the storage medium is connected to a proxy, and when a user inputs an address of a certain node, the information of the node stored in the storage medium is added. A method for collecting hypertext information, comprising: acquiring the information of the address via a communication line when there is no information corresponding to the address, and including the proxy for transferring the information to a user. 7. The hypertext information collecting method according to claim 1, wherein the receiving means receives an address from a user, searches an address field of an index table, and searches a record in which the address exists for data of a field of a desired degree. Is updated, and in the record of the link destination address described in the link field of the record where the address exists, the data of the field of the degree of request is updated, and the management means uses the index table as a key with the field of the degree of request as a key. Sorting, calculating the degree desired by the user for each address,
2. The method according to claim 1, wherein:
And storing the temporary file created by the hypertext information collecting method in a storage medium. 8. The hypertext information collecting method according to claim 1, wherein the index table and the temporary file are selectively stored in a storage medium based on a degree of demand. 9. The hypertext information collecting method according to claim 1, wherein a storage medium selectively storing an index table and a temporary file based on a degree of demand is characterized. 10. The method for collecting hypertext information according to claim 1, wherein the storage medium storing the hypertext information is moved to a proxy specified by a user.