JP2002222114A - Re-access method to home page - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a re-access method to a home page allowing efficient re-access to the home page. SOLUTION: An address of an accessed home page, title character information, and an address of a home page serving as a link source are put together into a single record, and in every access, one record is produced to be stored as an access route history. On the basis of the address of the home page accessed by a plurality of the stored records and the address of the home page serving as the link source, a hierarchical structure between the accessed home pages is produced. According to the produced hierarchical structure, plural pieces of title character information T1-T10 are displayed, and from the displayed character information, access is allowed to its home page. In this way, the access route history of the home page, to which access is made once, can be visually and intuitively grasped, and efficiency of a re-search of a target home page can be improved.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for re-accessing a home page, and in particular, to a browser (Browser; HTML document display, WWW (World Wide Web; World Wide Web)) for efficient browsing on an information processing apparatus.・ Re-access method of the homepage in the program for browsing the web).

[0002]

2. Description of the Related Art In order to increase the efficiency of re-accessing a homepage that has been accessed once in Web browsing, the URL (Uniform Resource) of the accessed homepage has been increased.
A method of storing a Locator (a standard used for identifying various information resources such as files on the Internet or the World Wide Web) by using a registration function of a browser is known as a conventional technique.

[0003]

In the above-described conventional method of re-accessing a home page, the access path history between titles of a target home page cannot be visually and intuitively grasped. However, there is a problem that the efficiency at the time of this is low.

An object of the present invention is to solve the above-mentioned problems of the prior art and to provide a method of re-accessing a home page which enables efficient re-access to the home page.

[0005]

According to the present invention, an object of the present invention is to provide a method for re-accessing a home page, wherein the address of the accessed home page, the character information of the title, and the address of the home page as the link source are stored in one. A record is generated, one record is generated for each access, and stored as an access route history. The accessed home page is accessed based on the stored home page address of the plurality of records and the link home page address. This is achieved by generating a mutual hierarchical structure, displaying the character information of the title according to the generated hierarchical structure, and making the homepage accessible from the displayed character information.

[0006]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of a method for re-accessing a homepage according to the present invention will be described below in detail with reference to the drawings. The system to which the present invention is applied includes, for example,
Since the system is a known system using an information processing device such as a personal computer and a communication network such as the Internet, the description of the hardware configuration is omitted. The processing according to the embodiment of the present invention described below is executed inside an information processing apparatus such as a personal computer.

FIG. 1 is a flowchart for explaining a processing operation of creating an access path history table according to a homepage re-access method according to an embodiment of the present invention, and FIG.
FIG. 3 is a diagram illustrating a configuration of an access route history table created by the flow of FIG. 3, FIG. 3 is a flowchart illustrating a processing operation for hierarchically displaying an access route history, FIG. 4 is a diagram illustrating a configuration of a link destination list table group TBL, FIG.
FIG. 4 is a diagram showing an example in which access route histories created and displayed by the flow shown in FIG. 3 are displayed in a hierarchy.

First, referring to the flow shown in FIG. 1, FIG.
The procedure for creating the access route history table shown in FIG. As shown in FIG. 2, the access route history table 15 created in this process registers, as one record 20 to 29, histories of accesses made by specifying the address URL of the home page. Each record includes three entries 10 to 12 of a link source URL, an accessed homepage URL, and a title of the homepage.

(1) URL of access destination by operator
Is specified, it is determined whether the URL is already registered in the entry 11 of the access history table (step 1,
2).

(2) If the result of the determination in step 2 is that the URL of the access destination has not been registered in the entry 11 of the access history table, that is, if the previously accessed history does not remain on the table, A new record is added to the history table, and entries 10-1
In step 2, the link source URL, the URL of the homepage, and the title extracted from the homepage are stored, and the processing from step 1 is repeated. In the case of the first access, since the link source URL does not exist, the entry 10 is blank, for example, as in the record 20 (step 3).

(3) If the result of determination in step 2 is that the URL of the access destination has already been registered in the entry 11 of the access history table, that is, if the history of the previous access remains in the table, The process returns to step 1 without performing additional registration of a new record, and waits until the next access destination is specified.

In the processing described above, when there are two or more link sources, only the link source registered first is registered as the route history. Therefore, the same URL does not exist in the entry 11.

Next, with reference to the flow of FIG. 3, a process of drawing a hierarchical display example as shown in FIG. 5 while generating the link destination list tables shown in FIG. 4 will be described. The link destination list table is generated for each hierarchy as shown as TBL1 to TBL6 in FIG. 4, and the records included in these are the access route history table described in FIG. 15 is a record extracted from FIG. Therefore, the entries that make up each record are
It is the same as the access history table 15.

(1) First, a layer number counter N is initialized to 1 and drawing of layer 1 is started. Then, a link destination list table TBL 1 of the first hierarchy is generated, and information of the first record 20 of the access history table 15 shown in FIG. 2 is stored in the generated link destination list table TBL 1 (steps 30 and 31).

(2) Draw all the titles of the records in the link destination list table TBL1. In this case, in the link destination list table TBL1, U1 is stored as the URL of the accessed homepage, and T1 is stored as its title. Therefore, only the title T1 is drawn and displayed as the hierarchy 1 as shown in FIG. . With the processing up to this point, the drawing processing of the layer 1 ends (step 32).

(3) Next, the layer number counter N is incremented by 1 to 2 to start drawing the layer 2. In order to search from the second record to the last row in the access history table 15 and list information stored in the link destination list table TBL2, the link source search pointer P is set to the second row in the access history table 15. Is set to 2 (steps 33 and 34).

(4) The second in the access history table 15
It is checked whether or not the link source URL of the second record 21 of the row matches the URL of the first record of the link destination list table TBL1. If they match, the link destination list table TBL2 of the second hierarchy is checked. Then, the information of the second record 21 of the second row in the access history table 15 is stored in the generated link destination list table TBL2 (step 3).
5, 36).

(5) If the URLs do not match in the check in step 35, or after the processing in step 36,
The link source search pointer P is incremented by 1 to 3 to check whether P has exceeded the value of the last row of the access history table 15 or not. If P does not exceed the value of the last row of the access history table 15 in this check, step 35
The processing is continued by returning to the processing from step (1), and information stored in the link destination list table TBL2 is listed up (steps 37 and 38).

(6) If P exceeds the value in the last row of the access history table 15 in the check in step 38, it means that the listing of the information stored in the link destination list table TBL2 has been completed. At this time, in the link destination list table TBL2, as shown in FIG.
URL U2 to U of linked home page with URL as U1
4 and their titles T2 to T4 are listed from the access route history table 15 and stored.
Therefore, next, the first record in the link destination list table TBL1 is deleted, and the records below the second record are moved to the row of the record immediately above. As a result, the link destination list table TBL1 has no data (step 39).

(7) Next, the link destination list table TBL
Check whether there is data in 2. In this case, as described above, since there are three data in the link destination list table TBL2, all the titles T2 in the TBL2 are displayed.
As shown in FIG. 5, .about.T3 is drawn one layer below the title T1 of the already drawn layer 1, that is, in the layer 2. With the processing up to this point, the drawing processing of the hierarchy 2 is temporarily ended (steps 40 and 41).

(8) Thereafter, the flow returns to the processing in step 33, where 1 is added to the layer number counter N to obtain 3 and the layer 3
Start drawing. Then, as described above, the link destination with the URL U2 as the link source is listed up to generate the link destination list table TBL3 by the processing loop of steps 35 to 38. But in this case, the URL
Since there is no link destination with U2 as a link source, TBL 3 is a table without data. In step 39, the first record of TBL2, that is, the record having the access destination homepage URL U2, is deleted, and the record having URL U3 is replaced by the first record of TBL2.

(9) Then, in the check of step 40, it is determined that there is no data in TBL3,
Next, it is checked whether data exists in the link destination list table TBL2. In this case, since the record still remains in the TBL 2, the process returns to the process from step 34 (steps 40 and 42).

(10) The link destination of the record of the URL U3 which is the first record of the TBL 2 is listed up from the access route history table 15 and stored in the TBL 3 by the processing loop of steps 35 to 38. At this time, in the link destination list table TBL3, as shown in FIG. 4, the URL U5 of the link destination home page with the link source URL being U3,
U6 and their titles T5 and T6 are listed from the access path history table 15 and stored. Then, in step 39, the record having the access destination home page URL U3, which is the first record of the TBL 2, is deleted, and the record having the access destination URL U4 is replaced with the record having the access destination URL U4.
This is the first record of TBL2.

(11) In step 40, it is checked whether or not there is data in the link destination list table TBL3. As described above, since there are two data in the link destination list table TBL3, in step 41, , TBL 3 in FIG. 5, all titles T5 and T6 are drawn one layer below the title T3 of layer 2 already drawn, that is, in layer 3. With the processing up to this point, the drawing processing of the layer 3 is temporarily ended.

(12) Thereafter, the flow returns to the processing in step 33, where 1 is added to the layer number counter N to obtain 4 and the layer 4
Start drawing. Then, as described above, the link destination with the URL U5 as the link source is listed up and the link destination list table TBL4 is generated by the processing loop of steps 35 to 38. At this time, in the link destination list table TBL4, as shown in FIG.
The URL U7 and the title T7 of the link destination home page set as No. 5 are listed from the access route history table 15 and stored. And in step 39,
Access destination homepage UR which is the first record of TBL 3
The record with LU5 is deleted and the access destination UR is replaced.
The record having LU 6 is the first record of TBL 3.

(13) In the step 40, it is checked whether or not there is data in the link destination list table TBL4. As described above, one data exists in the link destination list table TBL4. , TBL 4 is drawn one layer below the title T 5 of layer 3 which has already been drawn, that is, at layer 4 as shown in FIG. With the processing up to this point, the drawing processing of the hierarchy 4 is temporarily ended.

(14) Thereafter, the flow returns to the processing in the step 33, where 1 is added to the layer number counter N to make 5 and the layer 5
Start drawing. Then, as described above, the link destination with the URL U7 as the link source is listed up and the link destination list table TBL5 is generated by the processing loop of steps 35 to 38. At this time, in the link destination list table TBL5, as shown in FIG.
The URL U10 and the title T10 of the link destination home page set to 7 are listed from the access route history table 15 and stored. And step 39
Thus, the record having the access destination home page URL U7, which is the first record of the TBL 4, is deleted. As a result, there is no data in the link destination list table TBL4.

(15) In the step 40, it is checked whether or not there is data in the link destination list table TBL5. As described above, one data exists in the link destination list table TBL5. , TBL 5 is drawn one layer below the title T 7 of layer 4 already drawn, that is, layer 5, as shown in FIG. With the processing up to this point, the drawing processing of the hierarchy 5 is temporarily ended.

(16) Thereafter, the flow returns to the process of step 33, where 1 is added to the hierarchy number counter N to be 6, and the hierarchy 6
Start drawing. Then, as described above, in the processing loop of steps 35 to 38, the link destinations having the URL U10 as the link source are listed up to generate the link destination list table TBL6. But in this case, UR
Since there is no link destination with the LU 10 as a link source, the TBL 6 is a table without data. In step 39, TBL 5
First record, that is, access destination homepage URL U
The record with 10 is deleted. As a result, there is no data in the link destination list table TBL5.

(17) In the step 40, it is checked whether or not there is data in the link destination list table TBL 6. Since there is no data in the link destination list table TBL 6 as described above, the link destination is determined in step 42. It is checked whether there is data in the list table TBL5. In the described example, since there is no data in the link destination list table TBL 5, 1 is subtracted from the layer number counter N to be 5, and it is confirmed that this value is not "0". Repeat the process (steps 43 and 4
4, 42).

(18) By the processing loop of steps 42 to 44, when N = 4, it is determined in step 42 that data exists in the link destination list table TBL3, and the processing from step 34 Return, steps 35-3
8, the link destination list table TBL 3
The link destinations having the access destination URL U6 of the first record as the link source are listed up and stored in the vacant link destination list table TBL4. At this time, in the link destination list table TBL4, although not shown in the figure,
URL of the linked home page with the link source URL set to U6
U8 and U9 and their titles T8 and T9 are listed from the access route history table 15 and stored. Then, in step 39, the record having the access destination home page URL U6, which is the first record of the TBL 3, is deleted. As a result, the linked list table TB
L3 has no data.

(19) In step 40, it is checked whether or not there is data in the link destination list table TBL4. Since there are two data in the link destination list table TBL4 as described above, , TBL4, the titles T8 and T9 in FIG.
To draw. With the processing up to this point, the drawing processing of the layer 4 is completed.

(20) Thereafter, returning to the processing from step 33, N = 5 as in the case described above, and step 3
By the processing of steps 4 to 38, the link destinations having the URL U8 as the link source are listed up to generate the link destination list table TBL5. However, in this case, since there is no link destination with the URL U8 as the link source, the TBL 5 is a table without data. In step 39, the head record of TBL 4, that is, the record having the access destination homepage URL U8 is deleted. As a result, the linked list table TB
The record having the access destination homepage URL U9 remains in L4.

(21) Since there is no data in the TBL 5 in the judgment in the step 40, it is found in the step 42 that there is a record having the access destination homepage URL U9 in the TBL 4, and the URL U9 is An attempt is made to generate a link destination list table TBL5 by listing up link destinations as link sources. However, in this case as well, there is no link destination with the URL U9 as the link source, so TBL
5 is a table without data. In step 39, TB
The first record of L4, that is, the access destination homepage UR
The record having LU9 is deleted. As a result, the link destination list table TBL4 becomes a table without data.

(22) Since there is no data in TBL 5 in the determination in step 40, it is determined in step 42 whether or not there is data in TBL 4. However, since there is no data in TBL 4,
By setting N = 4 in step 43, step 42
Refers to the link destination list table TBL 3 one level higher. However, since there is no data here, N is set to N = 3. In step 42, the link destination list table TBL 2 one level higher is referred to. . As a result, the link destination list table TBL 2 contains the URL of the website to be accessed.
It can be seen that a record having U4 exists.

(23) Thereafter, the link destination having the URL U4 as the link source is listed up by the processing of steps 34 to 38 to generate the link destination list table TBL3. However, in this case, since there is no link destination with the URL U4 as the link source, the TBL 3 is a table without data.
In step 39, the head record of TBL 2, that is, the record having the access destination homepage URL U4 is deleted. As a result, the link destination list table TBL2 becomes a table without data.

(24) Since there is no data in TBL 3 in the determination in step 40, it is determined in step 42 whether or not there is data in TBL 2. However, since there is no data in TBL 2,
By setting N = 2 in step 43, step 42
Refers to the link destination list table TBL 1 on the upper hierarchy, but since there is no data here, N = 0 in step 43.
It is said. This N = 0 is confirmed in step 44,
All the processing ends.

By the processing described above, the character information of the title of the accessed home page as shown in FIG. 5 can be hierarchically displayed.
By operating the displayed title portion with a mouse or the like, the homepage can be immediately accessed.

According to the embodiment of the present invention, by performing the above-described processing, each of the histories of the access specified by the URL is replaced with the link source URL, the accessed homepage URL, and the title of the homepage. Based on the access route history table as shown in FIG. 2 registered as one record having one entry, character information of the title of the access destination as shown in FIG. 5 can be hierarchically displayed. As a result, the user can visually and intuitively grasp the access route history for any homepage accessed once, and can efficiently re-access the target homepage. In addition, the user can easily re-access the home page near the target home page as well, thereby improving the efficiency of the re-access.

The embodiment of the present invention described above is similar to that of FIG.
3 can be configured and executed as a program, and these processing programs can be provided by being stored in a recording medium such as an FD, a CD, an MO, and a DVD.

[0041]

As described above, according to the present invention, the user can visually and intuitively grasp the access route history for any homepage accessed once.
The desired homepage re-access can be performed efficiently. Further, according to the present invention, the user can efficiently re-access a home page near the target home page.

[Brief description of the drawings]

FIG. 1 is a flowchart illustrating a processing operation of creating an access route history table according to a homepage re-access method according to an embodiment of the present invention.

FIG. 2 is a diagram illustrating a configuration of an access route history table created by the flow of FIG.

FIG. 3 is a flowchart illustrating a processing operation for hierarchically displaying an access route history.

FIG. 4 is a diagram illustrating a configuration of a link destination list table TBL.

FIG. 5 is a diagram showing an example in which access route histories created and displayed by the flow shown in FIG. 3 are displayed in a hierarchy.

[Explanation of symbols]

 15 Access route history table TBL 1 to TBL 6 Link destination list table

 ──────────────────────────────────────────────────続 き Continued on the front page F term (reference) 5B075 KK07 KK13 KK33 KK39 ND20 ND23 ND36 NK10 NK13 NK24 NK31 NK43 NK44 PP13 PP30 PQ02 PQ26 PR03 UU40 5B082 EA07 GC03

Claims (3)

[Claims] In a method of re-accessing a home page, an address of the accessed home page, character information of a title, and an address of a home page as a link source are set as one record, and one record is generated for each access. And generating a hierarchical structure between the accessed homepages based on the accessed homepage address of the plurality of records and the address of the link source homepage. A method for re-accessing a home page, wherein information is displayed according to the generated hierarchical structure, and the home page can be accessed from the displayed character information. 2. The hierarchical structure between the accessed homepages is such that a record in which the same homepage is a link source is searched from the access route history, and a hierarchy one level lower than the homepage as a link source is searched in the searched record. 2. The method for re-accessing a home page according to claim 1, wherein the home page is generated by a process of setting the home page accessed by the user. 3. The address of the accessed homepage, the character information of the title, and the address of the homepage as the link source are defined as one record, and one record is generated for each access and stored as an access route history. A processing program, a processing program for generating a hierarchical structure between accessed homepages based on addresses of accessed homepages of the plurality of stored records, and an address of a linking homepage, and character information of the title And a processing program for accessing the home page from the displayed character information, thereby realizing the homepage re-access method according to claim 1. recoding media.