JP2005071164A - Bookmark management method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To enable even a person inexperienced in operation to easily and quickly browse desired content by improving the convenience of a bookmark function. <P>SOLUTION: A bookmark management device has a first function of measuring browsing frequencies of a webpage corresponding to a bookmark-registered shortcut and the other webpages forming the same website, and if finding a webpage having a higher browsing frequency than the bookmark-registered webpage, rewriting a URL associated with the bookmark-registered shortcut, a second function of displaying bookmark-registered shortcuts under classification according to category classification conditions set by the user by URLs and the like, and a third function of filtering shortcuts to webpages having a browsing frequency below a given value out of webpages homologized with bookmark-registered shortcuts. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

The present invention relates to a technique for improving user convenience regarding a bookmark function of a Web browser.

As a tool for browsing web pages on a computer, a web browser (hereinafter, referred to as a web page)
There is an application called “Browser”. In general, browsers are H
TML (HyperText Markup Language) files, image files, etc.
Web) Download from a server, analyze the logical structure and layout described in the HTML file, and display various contents.
Various functions are added to this browser in order to make browsing of Web pages smooth. Typical functions include a function called “bookmark” or “favorite”. This function is based on the URL of the web page (Uniform Resour
ce Locator) and its shortcuts are stored in association with each other, and when a specific shortcut is selected from among the shortcuts displayed in the list by a user click or other action,
The web page corresponding to the selected shortcut is quickly accessed. In this specification, this function is simply called “bookmark function”, registered by the bookmark function is called “bookmark registration”, and a list of shortcuts displayed by the bookmark function is called “bookmark list”.
In order to make such a bookmark function easier to use, various techniques have been proposed. For example, Patent Document 1 discloses a method of counting the number of display times of shortcuts registered by the bookmark function and changing the display order of shortcuts displayed in a list according to the count result. As a result, shortcuts to frequently accessed Web pages are arranged at positions that are more conspicuous on the list, so that the user can quickly find a desired shortcut from many shortcuts.

JP 2000-99436 A

The user's needs regarding the bookmark function are not limited to those described in Patent Document 1, and examples include the following.
First, although the top page of a certain website has been bookmarked, it is often the case that pages that are actually viewed often are pages that are several layers below the top page. For example, a user may bookmark a top page of a website operated by a certain manufacturer, and then often browses only information on a certain product in the website. In this case, the user cannot browse a desired page unless the user follows the hyperlink from the top page. In this case, it cannot be said that the original function of bookmarks, that is, quick access to a desired page, is fully exhibited.
Next, when the number of shortcuts registered as bookmarks increases, shortcuts of different types and categories may be mixed in the bookmark list for the user, such as a shortcut for a page related to hobbies or a shortcut for a page related to work. There is. In such a state, the user becomes very difficult to see the contents of the list, and therefore it may take a considerable time to find a desired shortcut. In addition, although a user is interested in a certain Web page and registered as a bookmark, the user gradually becomes less interested and can hardly browse the page. However, even in such a case, since the shortcut of the page that is no longer viewed remains registered as a bookmark, it becomes an obstacle for the user when browsing the contents of the list.
Of course, these problems are problems in which the user only needs to classify or delete the shortcuts as appropriate. However, for users who are not familiar with operations such as beginners, it is difficult to organize them.
The present invention has been made under such a background. The purpose of the present invention is to improve the convenience of the bookmark function so that even a beginner unfamiliar with computer operation can easily and quickly browse desired contents. It is to provide the technology to make it.

In order to solve the above-described problem, a bookmark management apparatus according to the present invention stores address information assigned to content, identification information unique to the content in association with each other, and storage means that stores the information. Display means for displaying identification information, content display means for acquiring and displaying content based on address information associated with the identification information designated by the user and stored in the storage means, and the content Measuring means for measuring the frequency at which the display means displays content for each content, and the measuring means among a plurality of contents to which address information at least partially in common with the address information stored in the storage means is assigned Identify content that exceeds a certain threshold measured by Comprising a constant section, the address information stored by said storing means, and a rewriting means for rewriting the address information assigned to the identified content.
As a result, it is possible to rewrite the address information of the identification information registered in the bookmark to the address information of the content having the highest browsing frequency among the content at least partially in common with the address information.

Also, in a preferred aspect of the bookmark management apparatus according to the present invention, the certain threshold value is a value indicating a display frequency of content to which the address information stored by the storage unit is assigned.
According to this aspect, the rewriting of the address information is performed based on the display frequency of the content associated with the identification information registered in the bookmark.

In a preferred aspect of the bookmark management apparatus according to the present invention, the address information is a URL (Uniform Resource Locator), and the common part is a domain name.
According to this aspect, the address information is a URL, and a URL newly set by rewriting the URL is selected from URLs of Web pages having the same domain name.

In order to solve the above problems, a bookmark management apparatus according to the present invention receives an operation for a user to input a condition for classifying a plurality of contents for each content, and accepts the operation by the operation unit. Associated with the identification information designated by the user, storage means for storing the condition storage means for storing the specified conditions, address information assigned to the content, and identification information unique to the content in association with each other Based on the address information stored in the storage means, content display means for acquiring and displaying content, and the identification information stored in the storage means based on the conditions stored in the condition storage means Classification means for classifying and identification information stored in the storage means by the classification means And a list display means for displaying in accordance with the kind of content.
Thereby, it becomes possible to classify the identification information registered in the bookmark based on the condition designated by the user.

Further, in a preferred aspect of the bookmark management apparatus according to the present invention, the condition is a keyword, and the classification means includes the keyword in any of the address information, the identification information, or text information constituting the content. Is classified according to whether or not is included.
According to this aspect, the user can specify whether the keyword defined by the user is address information, identification information,
Alternatively, the identification information is classified according to whether it is included in any of the text information constituting the content.

In order to solve the above-described problem, the bookmark management apparatus according to the present invention is specified by a user, storage means for storing address information assigned to content and identification information unique to the content in association with each other. Based on the address information associated with the identification information and stored in the storage means, content display means for acquiring and displaying content, and the frequency at which the content display means displays the content is measured for each content. Among the contents to which the address information stored by the storage means is allocated, the measurement means, the specifying means for specifying the content that is measured by the measurement means below a certain threshold, and the storage means Among the identification information, the identification information of the identified content Includes a list display means for displaying in a display mode different from the identification information other than the content.
Thereby, it becomes possible to display the identification information of the content having the browsing frequency below the threshold value among the content having the identification information registered in the bookmark in a different manner.

Moreover, in a preferable aspect of the bookmark management apparatus according to the present invention, the different display aspect is an aspect in which information stored in a specific storage area is displayed.
According to this aspect, the identification information of the content specified when the browsing frequency falls below a certain threshold is stored in a specific storage area.

Moreover, in a preferred aspect of the bookmark management apparatus according to the present invention, the different display aspect is an aspect in which a message that prompts deletion is displayed.
According to this aspect, the identification information of the content specified when the browsing frequency falls below a certain threshold value is displayed with a message prompting deletion.

The present invention can also be provided as a program for causing a computer to realize the functions of the bookmark management apparatus described above.

(1) Configuration Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.
FIG. 1 is a diagram showing an overall configuration of a system according to the present embodiment. As shown in the figure,
This system includes a computer 1, the Internet 2, and WWW (World Wide Web) servers 3a, 3b, and 3c. The computer 1 and the WWW servers 3a, 3b, 3c are each connected to the Internet 2.

The WWW servers 3a, 3b, and 3c store a plurality of Web page data files described in HTML and a WWW server application program that describes a procedure for distributing these Web pages via the Internet 2. It is a computer. Each of these Web pages (hereinafter simply referred to as “pages”) is assigned address information (ie, URL) indicating a position in the Internet 2, but a group of pages to which a URL including the same domain name is assigned is described below. It is called “Web site”.
In FIG. 1, for convenience of explanation, only three WWW servers are shown, but there are actually many such WWW servers. In the following description, the WWW servers 3a, 3b, and 3c are collectively referred to as the WWW server 3 when it is not necessary to distinguish them.

FIG. 2 is a block diagram showing a hardware configuration of the computer 1. As shown in the figure, the computer 1 includes a CPU (Central Processing Unit) and a ROM (Read Only).
A control unit 11 including a memory (RAM) and a random access memory (RAM), a storage unit 12 such as an HDD (Hard Disk Drive) for storing the web browser program BR and various data files, and pages and bookmarks acquired from the WWW server 3 A display unit 13 such as a liquid crystal display for displaying various information such as registered shortcuts, an operation unit 14 such as a keyboard and a mouse for receiving various operations from the user, and a communication unit connected to the Internet 2 for transmitting and receiving data. 15. The control unit 11 connects to the WWW server 3 via the Internet 2 by executing the browser application program BR stored in the storage unit 12, downloads various pages from the WWW server 3, and displays them on the display unit 13. To do.

The browser application program BR describes a procedure for the computer 1 to realize the bookmark function. In addition to a general bookmark function (hereinafter referred to as a main function), this bookmark function has three auxiliary functions, a URL rewriting function, a category classification function, and a non-browsing page classification function. The outline of these functions will be described below.

First, the URL rewriting function is a function for rewriting the URL registered in the bookmark to the URL of the page that the user accesses most frequently in the Web site including the page of the URL. In other words, although the URL of a page on a certain website is registered as a bookmark, the page that is actually browsed is a different page from that page, and several hyperlinks are traced to reach the desired page. This function is intended to solve such problems. Specifically, the user has counted all the time that each page is being viewed, and determined that it is optimal for bookmarking the page with the longest viewing time within the same website, and has already bookmarked The registered URL is rewritten to the URL of the page.

Next, the category classification function is a function for classifying pages determined to be the same genre as the same category among the pages indicated by the bookmark registered URL. For example, as the number of URLs registered as bookmarks increases, shortcuts of various genres are mixed in the bookmark list, which is very difficult to see as it is. In addition, since the display area of the bookmark list is limited, when the number of shortcuts in the list increases, it becomes impossible to display all the shortcuts at once, and a wasteful operation such as scrolling is required. This function is for solving such a problem, and is a function for collecting pages determined to be in the same category based on a keyword set by the user.

Finally, the non-browsing page classification function is a function for extracting URLs with a low browsing frequency from bookmark registered URLs and classifying them with other URLs. For example, it may happen that a bookmark is registered with interest in a certain page, but the interest gradually decreases and the page cannot be viewed. In addition, since the display area of the bookmark list is limited, when the number of shortcuts in the list increases, it becomes impossible to display all the shortcuts at once, and a wasteful operation such as scrolling is required. This function is for solving such a problem. Specifically, the URL of a page whose browsing frequency is low is changed from a folder stored so far to a predetermined folder (referred to as a “non-browsing folder”). It is a function to move to.

Next, a specific configuration for realizing the above-described URL rewriting function, category classification function, and non-browsing page classification function will be described.
FIG. 3 is a block diagram showing a functional configuration of the computer 1. As shown in the figure, the computer 1 includes an access history storage unit 101, a URL registration unit 102, a bookmark list display unit 103, a browsing frequency storage unit 104, a browsing frequency comparison unit 105, and a URL rewriting unit 106.
A category classification condition storage unit 107 and a URL classification unit 108.

The access history storage unit 101 is a URL assigned to the page displayed on the display unit 13.
Are stored as an access history. That is, the access history storage unit 101 stores the URL of the page every time the user views the page. The URL registration unit 102 extracts the URL of the page instructed to be bookmarked by the user from the URLs stored in the access history storage unit 101, and uses the title of the page or the name set by the user Stored together with the identification information (ie, shortcut) represented by.

Next, the bookmark list display unit 103 displays the page shortcut stored in the URL registration unit 102 in association with the URL on the display unit 13 in a list format.
FIG. 4 shows an example of a browser screen displayed on the display unit 13 of the computer 1 and a bookmark list displayed there. The shortcuts SC1, SC2, SC3,... Are identification information of the page represented by images such as characters or icons, and the URL of a specific page
Associated with. The user can browse the page associated with this shortcut by selecting this using the operation unit 15. At this time, the content of the page is displayed in the page display area PG1.

The browsing frequency storage unit 104 stores the time when the page is displayed on the display unit 13 (that is, viewed by the user) in association with the URL of the page. The browsing storage unit 104 stores the page display time by classifying it for each domain name included in each URL. The browsing frequency comparison unit 105 compares the display times of a plurality of pages stored for each domain name by the browsing frequency storage unit 104, and U stored in the URL registration unit 102 based on the comparison.
It is determined whether the RL should be rewritten or the storage folder should be changed, and the determination result is supplied to the URL rewriting unit 106 and the URL classification unit 108. The URL rewriting unit 106 determines the URL of the page associated with the shortcut based on the determination result of the browsing frequency comparison unit 105.
Rewrite.

The category classification condition storage unit 107 stores a category name designated by the user and keywords belonging to the category. The URL classification unit 108 includes a category classification condition storage unit 107.
The shortcuts are categorized based on the categories and keywords stored in, and the display mode of the bookmark list display unit 103 is changed. Also, the URL classification unit 108 changes the shortcut and URL storage folder based on the determination result of the browsing frequency comparison unit 105.

The above is the description of the functional configuration, but these functions are realized when the control unit 11 of the computer 1 executes the browser application program BR. The storage areas of the access history storage unit 101, URL registration unit 102, and browsing frequency storage unit 104 are shown in FIG.
Is provided in the storage unit 12 shown in FIG.

(2) Operation With the configuration described above, various functions of the browser application program BR executed by the computer 1 will be described with reference to the drawings.
As a bookmark function, the browser application program BR has three functions, a URL rewriting function, a category classification function, and a non-browsing page classification function, in addition to a main function for registering a normal bookmark. It can be switched on / off. Hereinafter, each function will be described in detail.

First, the main function of the bookmark function will be described.
The main function is a function that is always executed while the computer 1 is executing the browser application program BR, stores the history of page browsing by the user, and uses the URL of the page received by the user as a shortcut. This is a function for registering bookmarks in association with each other.
FIG. 6 is a flowchart for explaining the main processing of the bookmark function. Hereinafter, a description will be given with reference to FIG.

When the user browses the page, the computer 1 executes the browser application program BR according to the user's instruction. This browser application program BR
Is executed, the display unit 13 displays the browser screen. Then, the user browses various pages by performing page transition operations such as browsing pages displayed on the browser screen and clicking a hyperlink.

When the user starts browsing the page, in the computer 1, the access history storage unit 101 detects this and stores the URL of the page (step Sa1). The access history storage unit 101 always determines whether or not there is a page transition (step Sa2). When the user performs a page transition operation (step Sa2; YES), this is again performed by the access history storage unit 10.
1 is detected, and the URL of the page to be displayed next is stored (step Sa1).
In addition, if an operation for bookmarking the page that the user is browsing is performed,
The registration unit 102 detects this (step Sa3; YES), and performs bookmark registration by storing the URL of the page and the shortcut name displayed on the bookmark list (
Step Sa4). When the bookmark registration is completed, the page transition determination shown in step Sa2 is performed again.
The above is the processing content of the main function of the bookmark function. In this way, the user's page browsing history is stored, and the bookmark registration of the page designated by the user is performed. Then, the computer 1 executes the three types of functions described below at a predetermined timing while performing the main process.

(2-1) URL Rewriting Function Next, the URL rewriting function will be described.
FIG. 5 is an EEE website (http: //www.eee) used to explain this function.
.co.jp) is a diagram showing a site configuration. This site (hereinafter referred to as “site E”) has a hierarchical structure as shown in FIG.

Note that the file name of the top page of each layer is “layer name.html”. In other words, on the top page of Site E (http://www.eee.co.jp/index.html)
There is a link to each level of “Latest Information” and “Product Information”. The top page of “Product Information” (http://www.eee.co.jp/products/products.html) "computer","
Links to each level of “scanner”, “display”, and “printer” are provided. And the top page of “Printer” (http://www.eee.co.jp/products/printer/prin
ter.html) "Inkjet printer (http://www.eee.co.jp/products/printer/in
kjet / inkjet.html), "Laser Printer (http://www.eee.co.jp/products/printer/la
ser / laser.html) "," dot impact printer (http://www.eee.co.jp/products/pr
inter / dot / dot.html) "," Printer driver (http://www.eee.co.jp/products/printe
r / driver / driver.html) ").

Now, assume that the user views this site E. The user uses the computer 1 to
First, suppose you browse the top page (http://www.eee.co.jp/index.html) and register this page as a bookmark. The processing performed by the computer 1 at this time is as described in the flowchart of FIG. The computer 1 performs a bookmark registration process as shown in the figure, and then the user continues browsing the page.

At this time, the computer 1 executes the URL rewriting process simultaneously with the main process described above. The URL rewriting process measures the browsing time of each page viewed by the user, and the bookmark registered page when the browsing time of the bookmark registered page (the top page of the site E) exceeds a predetermined value. Is a process of comparing the browsing time of other pages in the site and rewriting the URL of the top page of the site E registered as a bookmark to the URL of the page with the longest browsing time.
FIG. 8 is a flowchart for explaining the above-described URL rewriting process. Hereinafter, a description will be given with reference to FIG.

When this process is being performed, the user is browsing the page. At this time, in the computer 1, the browsing time of each page on which the browsing frequency storage unit 104 is displayed is measured and accumulated (step Sb1).
When the user browses the site E, the user accesses the site E using the shortcut of the top page of the site E registered as a bookmark, and browses each page in the lower hierarchy sequentially from the top page of the site E.
While the user repeats such browsing, the browsing time of the top page of the site E registered as a bookmark reaches a predetermined time (for example, 30 minutes). Then, the browsing frequency comparison part 105 detects this (step Sb2; YES) and prepares for URL rewriting.
Specifically, the browsing frequency comparison unit 105 first extracts all URLs of pages in the same site, that is, pages having the same domain “www.eee.co.jp” (step Sb3), and browsing from these pages. The page with the longest time is specified (step Sb4).

FIG. 7 is a diagram illustrating a list of URLs extracted in step Sb3 and the browsing time thereof in this operation example. Using this figure as an example, when the browsing time of the page registered as a bookmark on site E, that is, the top page (http://www.eee.co.jp/index.html) reaches 30 minutes, “Topics” page (http://www.eee.co.jp/topics/
topics.html) browsing time is 5 minutes, "latest information" page (http://www.eee.co.jp/news/n
The browsing time of ews.html) is 20 minutes. Similarly, the browsing time of each page is shown, but the longest browsing time is the “inkjet printer” page (http: //www.e
ee.co.jp/products/printer/inkjet/inkjet.html). The browsing frequency comparison unit 105 determines this and stores the URL of this page.

Subsequently, referring to the flowchart of FIG. 8 again, the description of the operation is continued.
As described above, once the page with the longest browsing time is identified in the site, the browsing frequency comparison unit 105
Compares the URL of the identified page with the URL of the page registered as a bookmark (step Sb5). As mentioned above, the longest browsing time in this site is “Inkjet Printer” page (http://www.eee.co.jp)
Since it is /products/printer/inkjet/inkjet.html), it can be seen that it is different from the bookmarked page (http://www.eee.co.jp/index.html). In such a case (
(Step Sb5; NO), the browsing frequency comparison unit 105 outputs the URL of the page of the “inkjet printer” with the longest browsing time to the URL rewriting unit 106 (step Sb6). URL
Rewriting unit 106 accepts the input of this URL, and rewrites the URL of the page associated with the shortcut of the top page of site E to the input URL (step Sb).
7). Also, the URL of the page with the longest browsing time and the U of the bookmark registered page
If the RL matches (step Sb5; YES), the browsing frequency comparison unit 105 proceeds to step Sb8 without rewriting the URL.
Finally, the browsing frequency storage unit 104 clears the browsing time of the URL having the same domain “www.eee.co.jp” extracted in step Sb3 from the browsing time of all stored URLs. The process is terminated (step Sb8).

By performing the processing described above, the URL registered in the bookmark is rewritten to the URL of the page having the longest browsing time in the same site, and the time until the user reaches the desired page can be shortened. It becomes possible.

(2-2) Category Classification Function Next, the category classification function will be described.
FIG. 9 is a bookmark list for explaining this function, and when this function operates,
It is assumed that a bookmark as shown in FIG.
Now, assume that the user creates a folder in the bookmark list in order to organize the contents of the bookmark list. At this time, for example, a setting screen as shown in FIG. 10 is displayed on the display unit 13 in order to create a folder associated with the category. In the figure, TB
Reference numeral 1 denotes a text box, and the user inputs a folder name here. PD1 is a pull-down menu, and the user selects “URL”, “shortcut name”, or “page title” here. TB2 is a text box, and the user inputs a keyword as a category classification condition (hereinafter, this keyword is referred to as “category classification condition”). In addition, a plurality of category classification conditions can be set, and a logical sum (OR search) or a logical product (AND search) can be selected as the plurality of search conditions. PD2 is a pull-down menu for selecting either “OR search” or “AND search”. BT1 is a button, and the user clicks this button after setting all the conditions. The user can set a folder name and a category classification condition using the setting screen shown in FIG. In the following, the user creates a folder named “Job” and includes “eee.co.jp” in the URL or “Printer” in the shortcut name.
The case where the category classification condition of “including” is set will be described.

In addition, this function is executed at the timing when the user instructs to create a folder or when the category classification condition of the folder is changed. That is, the category classification condition of the folder is set when a folder is newly created, and the category classification condition can be changed as appropriate according to a user instruction.
FIG. 11 is a flowchart for explaining the category classification processing. Hereinafter, a description will be given with reference to FIG.

First, in order to organize the contents of the bookmark list, the user inputs a folder creation instruction or a category classification condition change instruction. Then, the computer 1 detects a folder creation instruction or a category classification condition change instruction from the user, and starts this processing.
First, the URL classification unit 108 determines whether there is a folder to be classified by this processing in the bookmark list (step Sc1). If this process is started by a category classification condition change instruction from the user, this determination is affirmative because a folder already exists, but if this process is started by a folder creation instruction from the user, a folder This decision is negative because has not yet been created. In this operation example, since the user newly creates a “work” folder, the above determination is negative. For this reason, URL classification unit 1
In 08, a new folder is created (step Sc2). If the above determination is affirmative, the folder has already been created, and the process proceeds to the next process without creating a new folder.

When the user inputs a folder creation instruction or a category classification condition change instruction, the computer 1 causes the display unit 13 to display the category classification condition setting screen shown in FIG. Using this screen, the user inputs the category classification condition and clicks the button BT1 to determine the category classification condition.
When the user clicks the button BT1, the category classification condition set by the user is URL
The data is input to the classification unit 108. At this time, the URL classification unit 108 reads the category classification condition set by the user (step Sc3). After loading the category classification conditions, UR
The L classification unit 108 reads one shortcut from the bookmark list, and extracts a URL, a shortcut name, and a page title name from the shortcut (step S).
c4). After extracting the URL, shortcut name, and page title name from the shortcut, the URL classification unit 108 determines whether or not these match the extracted category classification conditions (step Sc5).

If the above determination is affirmative (step Sc5; YES), the URL classification unit 108
Moves the shortcut to the folder in which the category classification condition is set, that is, the “work” folder in this case (step Sc6). If the above determination is negative (step Sc5; NO), the process proceeds to the next process without moving the shortcut.
Subsequently, the URL classification unit 108 determines whether or not all shortcuts have been read (step Sc7). If all the shortcuts have been read (step Sc7; YES), the URL classification unit 108 associates the category classification condition with the folder name and stores it in the category classification condition storage unit 107, thereby terminating this process (step Sc8).
), If all shortcuts have not been read (step Sc7; NO),
The next shortcut is read (step Sc4), and thereafter the same processing is repeated.

When the above processing is executed for all shortcuts in the bookmark list, the category classification processing ends. This process is described below with reference to FIG.
As described above, the category classification condition of this “work” folder is “URL“ eee.co.jp
”Or“ Printer ”in the shortcut name”. If this processing is executed sequentially from the first line in FIG. 9, first, the “EEE homepage (http: //www.eee.c)
o.jp/index.html) ”is moved to the“ work ”folder because“ eee.co.jp ”is included in the URL. Similarly, on the second line, “EEE printer (http://www.eee.co.jp/products/prin
ter / index.html) "is also moved to the" work "folder because" eee.co.jp "is included in the URL.
The “Printer of Company C” on the third line contains “Printer” in the shortcut name.
Moved to the “Work” folder. The fourth and fifth lines do not meet the category classification condition, and these shortcuts are not moved and are in the same positions.
Subsequently, “Printer World” on the sixth line is moved to the “Work” folder because “Printer” is included in the shortcut name. Lines 7 and 8 do not meet the category classification conditions, and these shortcuts are not moved and remain in their positions.

As described above, shortcuts registered as bookmarks by this processing are classified. Similarly, if the category classification condition is set so that, for example, a shortcut including “baseball” or “soccer” in the shortcut name is moved to a folder “sports”, the fourth, fifth, seventh, and eighth lines in FIG. The shortcut is moved to the “Sports” folder. Then, all the shortcuts shown in FIG. 9 are stored in either the “work” or “sports” folder, and all the shortcuts in the bookmark list are classified and organized into two categories. It will be.

Note that this processing can also be executed at the timing when a new shortcut is registered as a bookmark. If the newly registered shortcut matches the category classification condition set by the user, the shortcut moves to the folder simultaneously with the bookmark registration. In this case, the above-described processing is performed for all existing folders.
However, since the folder already exists, the process of FIG. 10 is started by omitting steps Sc1 and Sc2. Also, since only one shortcut is loaded, step S
c7 can also be omitted. Furthermore, since the category classification conditions are already stored, step Sc8 can also be omitted.

By performing the processing described above, the shortcuts registered as bookmarks are classified for each category desired by the user, and it is possible to improve the user's convenience in using the bookmark.

(2-3) Non-browsing page classification function Next, the non-browsing page classification function will be described.
FIG. 12 is a flowchart for explaining the non-browsing page classification process. Hereinafter, a description will be given with reference to FIG.
This process is an interruption process periodically executed while the user uses the browser, and the computer 1 stores the last browsing date of all shortcuts in the bookmark list in the browsing frequency storage unit 104. doing.

First, in the computer 1, the browsing frequency comparison unit 105 refers to the last browsing date of each shortcut stored in the browsing frequency storage unit 104, and determines whether there is a shortcut that has not been browsed for a predetermined period (for example, 30 days). (Step Sd1). If there is no corresponding shortcut (step Sd1; NO), this process is immediately terminated. If there is a corresponding shortcut (step Sd1; YES), the following processing is executed for the shortcut.

For a shortcut to a page that is not permitted to be browsed for a predetermined period, the browsing frequency comparison unit 105 sets this shortcut to a predetermined folder (here, “non-browsing” folder).
A command to move to is output to the URL classification unit 108 (step Sd2). The URL classifying unit 108 to which this command has been input displays a message to the effect that the shortcut is to be moved to the “non-browsing” folder on the display unit 13 (step Sd3), and waits for an input by the user (step Sd4). If the input by the user is to approve the movement (step Sd4
YES), the URL classification unit 108 moves the shortcut to the “non-browsing” folder, and outputs a command to the bookmark list display unit 103 to change the display mode of the bookmark list display unit 103 in this manner. Is terminated (step Sd5). If the input by the user is to reject the movement (step Sd4; NO), the process is terminated without moving the shortcut.

By performing the processing described above, among the shortcuts registered in the bookmark, those with low browsing frequency are automatically classified into a predetermined folder, and it is possible to improve the user's convenience in using the bookmark. Become.

By executing the three types of functions described above by selecting whether or not each function can be used, the user can organize the shortcuts in the bookmark appropriately and easily, and more smoothly. Page browsing is possible.

(3) Modifications Note that the present invention is not limited to the above-described embodiments, and various modifications as shown below are possible.

In (2-1) above, the time that triggers the URL rewriting process is 30 minutes. However, this is merely an example, and any time can be set. Similarly, it is of course possible to allow the user to determine the time for this trigger by accepting input by the user.
Further, although the page browsing time is used as a determination criterion for the processing, it can be set as a browsing frequency. Furthermore, it is of course possible to comprehensively determine the browsing time and browsing frequency and use the result as a criterion.

In the above (2-1), the processing for rewriting the URL registered in the bookmark according to the browsing frequency of each page in the site has been described. But such U
When the RL rewriting process is performed, the URL information registered in the bookmark before that process is lost. In order to avoid such a problem, for example, in the bookmark list, “URL
A folder having a name such as “rewritten” may be provided, and a bookmark before the above URL rewriting process may be stored in this folder.

In the above (2-2), a folder is created in accordance with a user's folder creation instruction. However, it is also possible to automatically create a folder based on the determination of the computer 1. In this case, the category classification condition storage unit 107 refers to the URL, shortcut name, and page title, sets a character string having a high appearance frequency as the category classification condition, creates a folder based on the category classification condition, Classification may be performed.
In addition to the above-mentioned URL, shortcut name, and page title, the text information constituting the content, that is, the H as a reference destination when determining the category classification condition
It is also possible to include text data of a TML file. That is, in this case, HTM
The text data of the L file is read, and a character string that matches the category classification condition is searched from the data. In this case, the access history storage unit 101 stores the URL described above.
In addition, if the HTML file itself of the URL is stored as a cache,
The text data of the TML file can be acquired from here.

In the above (2-3), in step Sd3, the computer 1 displays a message to the user to move the shortcut with low browsing frequency to the “non-browsing” folder. However, this function is not limited to the above-described mode, and for example, a mode for displaying a message prompting deletion of the shortcut may be displayed. Of course, it is also possible to move or delete shortcuts without displaying the message as described above.

In (2-3) above, when the shortcut is moved, the computer 1 displays a confirmation message to the user, notifies the user of the execution of the operation, and selects whether or not to execute the operation (step Sd3). , Sd4). In the above (2-1) and (2-2), explanations are omitted as appropriate in order to facilitate understanding of the functions. However, operations such as rewriting and moving shortcuts are also performed in these cases. In this case, it is more realistic to display a message notifying the user of the operation on the display unit 13 as appropriate, and allowing the user to select whether or not the operation can be performed. By doing so, it is possible to prevent the problem that the shortcut registered by the user is moved against the user's intention, and the user cannot know where the shortcut has moved.

In (2-3) above, the non-browsing page classification process is performed for a shortcut that has not been browsed for 30 days. However, this 30 days is merely an example, and any number of days Is possible. Of course, the number of days can be set by the user.

1 is a diagram illustrating an overall configuration of a system according to an embodiment of the present invention. 2 is a block diagram showing a hardware configuration of a computer according to the embodiment. FIG. It is a block diagram showing a functional configuration of a computer according to the embodiment. It is an example of the browser screen displayed on a display part in the same embodiment, and the bookmark list displayed there. It is the figure which showed the site structure of the website (http://www.eee.co.jp) of EEE company used in order to demonstrate the URL rewriting function concerning the embodiment. It is a flowchart for demonstrating the main process of the bookmark function which concerns on the embodiment. It is the figure which illustrated browsing time of each page in order to explain URL rewriting function concerning the embodiment. It is a flowchart for demonstrating the function. It is the figure which showed the bookmark list for demonstrating the category classification | category function based on the embodiment. It is the figure which illustrated the category classification condition setting screen in the same function. It is a flowchart for demonstrating the function. It is a flowchart for demonstrating the non-browsing page classification | category function which concerns on the same embodiment.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 ... Computer, 2 ... Internet, 3 ... WWW server, 11 ... Control part, 12 ... Memory | storage part, 13 ... Display part, 14 ... Communication part, 15 ... Operation part, 101 ... Access history memory | storage part, 102
... URL registration part, 103 ... Bookmark list display part, 104 ... Browsing frequency storage part, 105
... browsing frequency comparison unit, 106 ... URL rewriting unit, 107 ... category classification condition storage unit, 108 ...
URL classification part.

Claims (11)

Storage means for storing address information assigned to content and identification information unique to the content in association with each other;
List display means for displaying identification information stored by the storage means;
Content display means for acquiring and displaying content based on address information stored in the storage means in association with the identification information designated by the user;
Measuring means for measuring the frequency at which the content display means displays content for each content;
A specifying unit for specifying a content that exceeds a threshold value that is measured by the measuring unit, among a plurality of contents assigned with address information that is at least partially in common with the address information stored by the storing unit; ,
A bookmark management apparatus comprising: rewriting means for rewriting address information stored by the storage means to address information assigned to the specified content. The certain threshold is
The bookmark management apparatus according to claim 1, wherein the address information stored by the storage unit is a value indicating a display frequency of the assigned content. The address information is a URL (Uniform Resource Locator),
The bookmark management apparatus according to claim 1, wherein the common part is a domain name. An operation means for accepting an operation for a user to input a condition for classifying a plurality of contents for each content;
Condition storage means for storing conditions accepted by the operation means;
Storage means for storing address information assigned to content and identification information unique to the content in association with each other;
Content display means for acquiring and displaying content based on address information stored in the storage means in association with the identification information designated by the user;
Classification means for classifying the identification information stored by the storage means based on the conditions stored by the condition storage means;
A bookmark management apparatus comprising: list display means for displaying the identification information stored in the storage means according to the classification contents of the classification means. The condition is a keyword,
The bookmark management apparatus according to claim 4, wherein the classification unit performs classification based on whether or not the keyword is included in any of the address information, the identification information, or text information constituting the content. Storage means for storing address information assigned to content and identification information unique to the content in association with each other;
Content display means for acquiring and displaying content based on address information stored in the storage means in association with the identification information designated by the user;
Measuring means for measuring the frequency at which the content display means displays the content for each content;
Among the contents assigned the address information stored by the storage means, a specifying means for specifying a content that is less than a threshold having a frequency measured by the measuring means;
A bookmark management apparatus comprising: list display means for displaying the identification information of the identified content among the identification information stored by the storage means in a display mode different from the identification information other than the content. The bookmark management apparatus according to claim 6, wherein the different display mode is a mode of displaying that the data is stored in a specific storage area. The bookmark management apparatus according to claim 6, wherein the different display mode is a mode of displaying with a message prompting deletion. On the computer,
A storage function that associates and stores address information assigned to content and identification information unique to the content;
A list display function for displaying the identification information stored by the storage function;
A content display function for acquiring and displaying content based on address information stored in the storage function in association with the identification information designated by the user;
A measurement function for measuring the frequency at which the content display function displays content for each content;
A specific function for identifying content that exceeds a threshold value that is measured by the measurement function, among a plurality of contents assigned address information that is at least partially in common with the address information stored by the storage function; ,
The bookmark management program for implement | achieving the rewriting function which rewrites the address information memorize | stored by the said memory | storage function into the address information allocated to the said specified content. On the computer,
An operation function for accepting an operation for a user to input a condition for classifying a plurality of contents by content;
A condition storage function for storing a condition received by the operation function;
A storage function for storing address information assigned to content and identification information unique to the content in association with each other;
A content display function for acquiring and displaying content based on address information stored in the storage function in association with the identification information designated by the user;
A classification function for classifying the identification information stored by the storage function based on the conditions stored by the condition storage function;
A bookmark management program for realizing a list display function for displaying the identification information stored by the storage function according to the classification contents by the classification function. On the computer,
A storage function for storing address information assigned to content and identification information unique to the content in association with each other;
A content display function for acquiring and displaying content based on address information stored in the storage function in association with the identification information designated by the user;
A measurement function for measuring the frequency at which the content display function displays the content for each content;
A specific function for identifying a content that is less than a threshold with a frequency measured by the measurement function, among the contents assigned the address information stored by the storage function;
A bookmark management program for realizing a list display function for displaying the identification information of the specified content among the identification information stored by the storage function in a display mode different from the identification information other than the content.

Images