JP4842237B2 - Search device and search method - Google Patents

Description

  The present invention relates to a search device and a search method, and more particularly to a search device and a search method that can satisfy a wide variety of preferences of users who desire to acquire information published on a network.

  Currently, a search site is generally used to obtain desired information from information disclosed on a network such as the Internet. Since the search site is published on the Internet, the user can easily use it via a browser, and when the user inputs a keyword related to desired information, a web page including the keyword And a list of corresponding web pages is provided to the user as a search result. In this search result, URLs (Uniform Resource Locators) of the respective web pages, excerpts of keyword portions, and the like are displayed, and links to these web pages are provided. Therefore, the user can obtain desired information from the web page by browsing the search result and following the link of the web page that seems to be related to the desired information.

  Further, in recent years, since the number of web pages published on the Internet has increased, the number of web pages including keywords input on a search site has inevitably increased. As a result, a list of web pages displayed as search results may include web pages that are not very relevant to the desired information. Therefore, for the convenience of the user in web page search, as described in Patent Document 1, for example, the importance of each web page is ranked based on the link relationship between the web pages, and the web page with high rank A search result is provided by placing it in a conspicuous position (for example, the top part of a list of web pages).

  In addition, as described in Non-Patent Document 1, for example, in a search site called Google (registered trademark), an evaluation value for each web page is calculated from the link / linked relationship of the web page, and the evaluation value Web pages that are larger in size are placed in more prominent positions to provide search results. The evaluation value described in Non-Patent Document 1 is that the more links from other web pages, the better the web page, and the better the link source web page, the better the linked web page. It is calculated based on the idea.

JP 2006-127529 A Satoshi Baba, “Google's Secret-A Complete Description of PageRank”, published on February 1, 2001, [online], [searched on October 2, 2007], Internet <URL: http://www.kusastro.kyoto -u.ac.jp/~baba/wais/pagerank.html>

  As in the related art described above, when web page evaluation values are determined based on the link relationship between web pages and a list of web pages is provided in descending order of evaluation values, the evaluation value is large by many users. Only web pages will be viewed. In other words, a web page with a high degree of attention linked from many web pages is frequently browsed.

  However, there is a problem that it is difficult for a user who wants to acquire information and topics that are not attracting much attention to reach a desired web page from a search result that has been conventionally ranked. In other words, for users who want to acquire not-so-conspicuous and excellent information from the network, but not the information known to many people, the search results in which the web pages are ranked by the existing method are used to acquire the desired information. Not suitable. As described above, in the conventional search site, a satisfactory search result is not always obtained depending on the preference of the user.

  The present invention has been made in view of such points, and an object of the present invention is to provide a search device and a search method that can satisfy a wide variety of preferences of users who desire to acquire information published on a network. .

In order to solve the above-described problem, a search device according to the present invention searches a database storing information related to a web page, links information to a web page that matches a search keyword specified by the user, and the web page An acquisition unit that acquires an evaluation value indicating a degree of attention; a calculation unit that calculates a reciprocal of the evaluation value acquired by the acquisition unit; and link information and a link information by the acquisition unit according to the reciprocal calculated by the calculation unit A ranking means for ranking all web pages from which evaluation values have been obtained, and a search result display web page that is arranged in a more conspicuous position as the link information to the higher-ranking web page is generated according to the ranking result by the ranking means. generation means for, with corresponding to the identification information of the user specified the search keyword Search history storage means for storing the link information acquired by the acquisition means in the past as search history information, and the ranking means has a plurality of web pages having the same reciprocal number calculated by the calculation means. In this case, among the plurality of web pages, the rank of the web page whose link information is not included in the search history information is set higher than the rank of the web page whose link information is included in the search history information. .

According to this configuration, the web pages are ranked in the reverse order to the normal ranking based on the evaluation value indicating the degree of attention, and the search result is obtained in which the link information to the web page with the lower degree of attention is arranged at a more prominent position. For this reason, it is possible to preferentially provide users with information that is rarely viewed in ordinary searches and is not generally attracting attention, and various preferences of users who wish to obtain information published on the network Can satisfy a wide range. In addition, when the ranking of the web page cannot be performed only by the reciprocal of the evaluation value, the rank is determined depending on whether or not each web page has been searched in the past. The rank of a web page that has not been noticed in the past can be made relatively high.

  In the search device according to the present invention, in the configuration described above, the acquisition unit receives, from the user terminal, ranking type information indicating whether or not a search for giving priority to a web page with a low degree of attention is desired together with a search keyword. The calculation means employs a configuration for calculating the reciprocal of the evaluation value only when the ranking type information received by the receiving means indicates a search request that prioritizes a web page with a low degree of attention.

  According to this configuration, since the reciprocal of the evaluation value is calculated only when there is a user's request, when there is no desire to search for a web page with a low degree of attention, the original evaluation value is used as it is. Pages can be ranked, and the ranking method of search results can be switched according to the user's wishes.

In the search device according to the present invention, in the configuration described above, the generation unit may detect a virus only when the ranking type information received by the reception unit indicates a search request that prioritizes a web page with low attention. A search result display web page is generated by excluding the link information of the web page in which is stored.

In the search device according to the present invention, in the configuration described above, the generation unit may be disabled only when the ranking type information received by the reception unit indicates a search request that prioritizes a web page with low attention. A search result display web page is generated that excludes link information of a web page for the purpose of collecting user e-mail addresses for advertisement distribution to a specific number of users.

  The search device according to the present invention further includes advertisement data acquisition means for acquiring advertisement data related to a search keyword specified by a user in the above configuration, wherein the generation means includes a margin of a search result display web page. The advertisement data acquired by the advertisement data acquisition means is arranged in the configuration.

  According to this configuration, since the advertisement data related to the keyword that the user is interested in is arranged on the search result display web page, the appealing power of the advertisement data can be enhanced.

Further, the search method according to the present invention searches a database storing information related to a web page, and evaluates the link information to the web page that matches the search keyword specified by the user and the attention level of the web page. In accordance with the reciprocal number calculated in the calculating step, the calculating step calculating the reciprocal number of the evaluation value acquired in the acquiring step, the link information and the evaluation value in the acquiring step A ranking step for ranking all the acquired web pages, and a generation step for generating a search result display web page arranged in a more conspicuous position according to the ranking result in the ranking step, the link information to the web page having a higher rank. If, corresponding to the identification information of the user specified the search keyword And a search history storage step of storing the link information acquired in the acquisition step in the past as search history information in the search history storage means, and the ranking step is an inverse number calculated by the calculation step. When there are a plurality of web pages with the same web page, the rank of the web pages in which the link information is not included in the search history information is more than the rank of the web pages in which the link information is included in the search history information. It is characterized by being raised .

The search program according to the present invention is a search program executed by a computer, and searches the computer storing a database storing information related to the web page in the computer to match a search keyword specified by a user. An acquisition step of acquiring an evaluation value indicating the degree of attention of the link information and the web page, a calculation step of calculating an inverse number of the evaluation value acquired in the acquisition step, and an inverse number calculated in the calculation step In accordance with the ranking step of ranking all the web pages from which the link information and the evaluation value have been acquired in the acquisition step, and according to the ranking result in the ranking step, the position where the link information to the higher-ranked web page is more conspicuous Search result display web located in A generating step of generating over di-, in association with the identification information of the user specified the search keyword, the search history stored in the search-history storage means link information acquired by the acquisition step in the past as search log information And in the ranking step, when there are a plurality of web pages having the same reciprocal number calculated in the calculation step in the ranking step, link information is included in the search history information among the plurality of web pages. The step of causing the rank of the web page not included to be higher than the rank of the web page whose link information is included in the search history information is executed .

  According to these, the web pages are ranked in the reverse order to the normal ranking based on the evaluation value indicating the attention level, and the link information to the web page with the lower attention degree is obtained in a more conspicuous position. In general search, it is possible to preferentially provide users with information that is rarely viewed and is generally not attracting attention, and to satisfy various preferences of users who wish to obtain information published on the network. Can satisfy a wide range.

  ADVANTAGE OF THE INVENTION According to this invention, the various preference of the user who desires the acquisition of the information disclosed on the network can be satisfied widely.

  The gist of the present invention is calculated by calculating the reciprocal of the evaluation value indicating the degree of attention according to the link relationship or the number of times of browsing for each web page searched for the keyword input by the user. The ranking of web pages is performed in descending order of reciprocal numbers, and the rank of web pages that are not attracting attention is increased. Hereinafter, an embodiment of the present invention will be described in detail with reference to the drawings.

  FIG. 1 is a block diagram showing a configuration of a search system according to an embodiment of the present invention. The search system shown in FIG. 1 includes user terminals 100-1 to 100-m (m is an integer of 1 or more), an information search device 200, an index database (hereinafter abbreviated as “index DB”) 300, and an advertisement database (hereinafter referred to as “index database”). 400 (abbreviated as “advertisement DB”).

  Each of the user terminals 100-1 to 100-m is a terminal device such as a personal computer used by the user, and is connected to the information search device 200 via the network N. In the present embodiment, the user terminals 100-1 to 100-m transmit a search request including the search keyword input by the user to the information search apparatus 200 via the network N, and the web page related to the search keyword is transmitted. A search result including the list is received from the information search apparatus 200 via the network N.

  The information search apparatus 200 receives a search request from the user terminals 100-1 to 100-m, and searches the index DB 300 for a web page related to the search keyword included in the search request. Then, the information search apparatus 200 generates a search result page capable of listing URLs of web pages obtained by the search, and transmits the search result page to the user terminals 100-1 to 100-m that are the search request transmission sources. . The detailed configuration and operation of the information search apparatus 200 will be described later in detail.

  The index DB 300 stores, for example, an index or a URL serving as a heading for page contents for each web page published on a network such as the Internet. Specifically, for example, as illustrated in FIG. 2, the index DB 300 stores an index indicating page content, an index acquisition date, URL, and an evaluation value for each web page.

  In the so-called directory type search site, the index is a headword or the like registered as a word representing the page by the author of the web page. In the so-called robot-type search site, an index for each web page collected by patrol called crawling by a predetermined program is stored. In the present embodiment, the index DB 300 may store both the index registered by the creator of the web page and the index collected by crawling. Further, the index DB 300 may store a plurality of indexes in association with one web page.

  The acquisition date and time of the index indicates the date and time when the index was stored in the index DB 300. That is, if the index is registered by the author of the web page, the registration date / time is stored, and if the index is collected by crawling, the execution date / time of crawling is stored.

  The URL is address information indicating the position of each web page on the network. Since each web page is given a unique URL, each web page can be specified by the URL.

  The evaluation value indicates the attention level of each web page. That is, the evaluation value becomes larger as the web page attracts attention, such as being linked from many web pages. In addition, the index for determining the evaluation value includes the number of browsing by the user. Specifically, the evaluation value increases as the web page is browsed by many users. Such an evaluation value for each web page is calculated by analyzing the link relation of each web page or analyzing the link click log by the index DB 300 or a processing device (not shown), and is stored in the index 300.

  The index DB 300 may store a cache of the entire web page, an excerpt of the index portion of the web page, and the like in addition to the index and URL for each web page described above.

  Returning to FIG. 1, the advertisement DB 400 stores advertisement data to be inserted into a result page that displays search results. Specifically, for example, as shown in FIG. 3, the advertisement DB 400 stores advertisement data such as linked banners in association with various advertisement genres. The advertisement genre is a word related to the content of the advertisement, and can be freely set by an advertiser who provides the advertisement. The advertisement data is a banner image including, for example, a link to an advertiser's web page. By associating the advertisement genre with the advertisement data in this way, for example, advertisement data of the advertisement genre that matches the keyword searched by the user can be inserted into the result page, and the appeal of the advertisement can be enhanced.

  FIG. 4 is a block diagram showing an internal configuration of information search apparatus 200 according to the present embodiment. The information search apparatus 200 shown in the figure includes a search request receiving unit 201, an index search unit 202, a history holding unit 203, a ranking unit 204, an advertisement selection unit 205, a result page generation unit 206, and a search result transmission unit 207. ing.

  The search request receiving unit 201 receives search requests transmitted from the user terminals 100-1 to 100-m. The search request received by the search request receiving unit 201 includes user (terminal) identification information, a search keyword, and a ranking type, for example, as shown in FIG.

  The user (terminal) identification information is identification information of a user who uses the user terminals 100-1 to 100-m or identification information of the user terminals 100-1 to 100-m itself. When the user is in a login state, For example, when the user ID corresponds to the identification information and the user is in a non-login state, for example, the IP addresses of the user terminals 100-1 to 100-m correspond to the identification information.

  The search keyword is a keyword input by the user on the user terminals 100-1 to 100-m, and is a word related to information desired by the user. The search keyword may be a single word or a plurality of words. Moreover, not only a simple word but an arithmetic expression combining a plurality of words according to a predetermined arithmetic rule may be used.

  The ranking type is a flag indicating a web page arrangement method desired by the user when displaying a list of web pages as search results. That is, the ranking type indicates whether the user desires a normal search in which web pages with a high degree of attention are arranged at the top or a tail search in which web pages that are not attracting much attention are arranged at the top. Here, tail search refers to the portion of the attention level for each web page that is arranged in descending order of attention level, and the degree of attention level is low, and the entire histogram has a contour that extends long like a tail. A search that ranks web pages preferentially. That is, “tail” refers to a web page that is generally not attracting much attention, and tail search indicates a method of preferentially searching for a web page corresponding to this tail.

  When the search request receiving unit 201 receives a search request including the above information, the search request receiving unit 201 outputs user (terminal) identification information (hereinafter simply referred to as “identification information”) and a ranking type to the history holding unit 203, and the search keyword Is output to the index search unit 202.

  When a search keyword is input from the search request receiving unit 201, the index search unit 202 searches the index DB 300 and acquires URLs and evaluation values of all web pages corresponding to the index that matches the search keyword. At this time, if the index DB 300 stores a cache of the entire web page, an excerpt of the index portion, or the like, the index search unit 202 may acquire the cache or excerpt of the web page together with the URL and the evaluation value. good.

  In addition, when the search keyword includes a plurality of words or when the search keyword is an arithmetic expression, the index search unit 202 performs an appropriate web page URL and evaluation from the index DB 300 according to a predetermined search method. Get the value. Specifically, for example, when the search keyword is “word A word B” or the like, the index search unit 202 indexes a web page including “word A” and “word B” in the index. Search from 300 and obtain the URL and evaluation value of the corresponding web page. For example, when the search keyword is “word A-word B”, the index search unit 202 includes a web page that includes “word A” in the index and does not include “word B” in the index. A search is performed from the index DB 300, and the URL and evaluation value of the corresponding web page are acquired.

  Then, the index search unit 202 outputs the acquired URL to the history holding unit 203 and outputs the acquired URL and evaluation value to the ranking unit 204. When a web page cache or excerpt is acquired together with the URL and the evaluation value, the index search unit 202 outputs all of the information to the ranking unit 204.

  The history holding unit 203 stores the identification information input from the search request receiving unit 201 and the URL input from the index search unit 202 in association with each other. In other words, the history holding unit 203 holds a search result history for each user (terminal). Specifically, for example, as illustrated in FIG. 6, the history holding unit 203 stores the URL of the web page obtained by the search in association with identification information such as a user ID or an IP address. Therefore, if the identification information and the history URL input from the search request receiving unit 201 have already been registered in the history holding unit 203, the history holding unit 203 additionally registers the URL input from the index search unit 202 as the history URL. To do. The history holding unit 203 may delete the history of search results of the user (terminal) for a user (terminal) that has passed a predetermined time since the last search request.

  In addition, when the ranking type is input from the search request receiving unit 201, the history holding unit 203 sets the history URL corresponding to the identification information input from the search request receiving unit 201 when the ranking type is tail search. The data is output to the ranking unit 204. At this time, the history holding unit 203 outputs the history URL to the ranking unit 204 before additionally registering the URL newly input from the index search unit 202. Therefore, when the ranking type designated by the user is tail search, the history holding unit 203 outputs the history URL included in the search results of the user up to the previous time to the ranking unit 204.

  When a URL and an evaluation value are input from the index search unit 202, the ranking unit 204 ranks URLs of search results based on the evaluation value. Specifically, when the ranking type is normal search, the ranking unit 204 ranks URLs in descending order of evaluation value.

  On the other hand, when the ranking type is tail search, the ranking unit 204 calculates the reciprocal of the evaluation value for each URL, and ranks the URLs in descending order of the calculated reciprocal. The ranking unit 204 compares the history URL output from the history holding unit 203 with the URL of the search result when the reciprocals calculated for a plurality of URLs are equal, and increases the rank of the URL that does not match the history URL. To do. That is, when the ranking of the URL is not determined only by the reciprocal of the evaluation value, the ranking unit 204 preferentially ranks the URL of the web page that has not been searched in the past to the high rank.

  The ranking unit 204 outputs the ranking result to the result page generation unit 206 and outputs the search keyword used for the search in the index search unit 202 to the advertisement selection unit 205.

  When a search keyword is input from the ranking unit 204, the advertisement selection unit 205 searches the advertisement DB 400 and acquires advertisement data corresponding to an advertisement genre that matches the search keyword. Then, the advertisement selection unit 205 outputs the advertisement data to the result page generation unit 206.

  The result page generation unit 206 arranges the ranking result input from the ranking unit 204 and the advertisement data input from the advertisement selection unit 205 on a web page, and generates a result page that presents the search result to the user. Specifically, the result page generation unit 206 arranges the advertisement data in a predetermined margin by placing the URL having a higher rank in a conspicuous position, for example, near the title of the web page. Therefore, when a normal search is performed, the result page generation unit 206 generates a result page arranged at a position where the URL of a web page with a high evaluation value and a high degree of attention is conspicuous. On the other hand, when the tail search is performed, the result page generation unit 206 generates a result page in which the URL of a web page with a large reciprocal of the evaluation value and a low degree of attention is arranged at a conspicuous position.

  When the tail search is performed, the result page generation unit 206 collects a user's e-mail address for advertisement delivery (spam) to, for example, a web page loaded with a virus or an unspecified number of users. A process such as removing URLs of harmful web pages such as web pages from search results may be performed.

  The search result transmission unit 207 transmits the result page generated by the result page generation unit 206 to the user terminals 100-1 to 100-m that are the search request transmission source.

  Next, information search processing by the information search apparatus 200 configured as described above will be described with reference to the flowchart shown in FIG. In the following description, it is assumed that the user performs a search using the user terminal 100-1.

  When the user inputs a desired search keyword and ranking type to the user terminal 100-1, a search request in which identification information of the user or the user terminal 100-1 is added to these information is transmitted from the user terminal 100-1. The transmitted search request is received by the search request receiving unit 201 of the information search device 200 via the network N (step S101). The identification information and the ranking type included in the received search request are output to the history holding unit 203, while the search keyword is output to the index search unit 202.

  When a search keyword is input to the index search unit 202, the index DB 300 is searched, and URLs and evaluation values of all web pages corresponding to the index that matches the search keyword are acquired (step S102). The search here is not limited to a search for a web page where the search keyword and the word in the index match, but also includes a case where a web page matching the condition is searched from a search keyword including a predetermined operator. The URL and the evaluation value of the search result acquired by the index search unit 202 are output to the ranking unit 204. The URL of the search result is also output to the history holding unit 203.

  When the identification information and the ranking type are input to the history holding unit 203, it is determined whether or not the ranking type is a tail search (step S103). When the ranking type is a normal search (No in step S103), The URL of the search result input from the index search unit 202 to the history holding unit 203 is additionally registered as a history URL. The ranking unit 204 ranks the URLs of the search results in descending order of evaluation value (step S104).

  On the other hand, if the ranking type is tail search (Yes in step S103), the history URL corresponding to the identification information input to the history holding unit 203 together with the ranking type is acquired by the ranking unit 204 (step S105). Here, the history URL acquired by the ranking unit 204 is a past search result until the previous search performed by the user who transmitted the search request or the user terminal 100-1. Then, after the history URL is acquired by the ranking unit 204, the search result of the search executed this time is additionally registered in the history holding unit 203.

  At the same time when the history URL is output from the history holding unit 203 to the ranking unit 204, the ranking unit 204 calculates the reciprocal of the evaluation value output from the index search unit 202 (step S106). Then, the ranking unit 204 uses the reciprocal of the calculated evaluation value and the history URL to perform ranking processing for determining the rank of the URL of the search result (step S107). This ranking process will be described in detail later with reference to FIG.

  When the ranking of the search result URL is completed by the ranking unit 204, the ranking result is output to the result page generation unit 206 and the search keyword used for the search is output to the advertisement selection unit 205. Then, the advertisement selection unit 205 selects advertisement data that matches the search keyword from the advertisement data stored in the advertisement DB 400 (step S108). The selected advertisement data is output to the result page generation unit 206.

  Then, the result page generation unit 206 generates a result page in which URLs of search results are arranged in order of ranking and advertisement data is arranged in a predetermined margin (step S109). In the result page, the URL of a web page with a higher ranking is arranged in a more conspicuous position, and a user who has viewed the result page can easily follow a link to a web page with a higher ranking. The generated result page is transmitted from the search result transmission unit 207 (step S110), and is received by the user terminal 100-1 via the network N.

  Next, ranking processing when tail search according to the present embodiment is performed will be described with reference to the flowchart shown in FIG. The ranking process described below is executed by the ranking unit 204.

  First, the ranking unit 204 arranges the evaluation results for each URL in the search result in descending order (step S201). At this time, it is determined whether there are URLs having the same reciprocal evaluation value (step S202). If the reciprocal evaluation values of all URLs are different from each other (No in step S202), the reciprocal evaluation values are arranged in descending order. The ranking result is output to the result page generation unit 206, and the ranking process is completed.

  If the reciprocals of the evaluation values of the plurality of URLs are equal (Yes in step S202), these URLs are compared with the history URL acquired from the history holding unit 203 (step S203). If the URL of the search result and the history URL do not match, in other words, if no URL with the same reciprocal of the evaluation value is a past search result (No in step S203), either The URLs are ranked higher, and the ranking result is output to the result page generation unit 206 to complete the ranking process.

  On the other hand, if the URL of the search result matches the history URL, in other words, if any of the URLs having the same reciprocal evaluation value is a past search result (step S203 Yes), the past search result and The ranking URL is ranked lower (step S204), the ranking result is output to the result page generation unit 206, and the ranking process is completed. In other words, when there are URLs whose reciprocal evaluation values are equal and cannot be ranked only with this reciprocal number, this URL is compared with the history URL, and URLs not included in past search results are ranked higher. This is based on the idea that in the tail search according to the present embodiment, a web page that generally has a low level of attention and that has not been noticed by individual users is ranked higher. In other words, since the history URL is a search result obtained by a past search by the user, the history URL is browsed at least once by the user. Such a URL is lower if the reciprocal of the evaluation value is the same. Ranked.

  When such a tail search is executed, for example, a result page as shown in FIG. 9 is displayed on the user terminal 100-1. In the result page, the URL of the web page that has the largest reciprocal of the evaluation value and is not included in the user's past search results is displayed at the top. That is, in the example of FIG. 9, the web page of “ΔΔ store” is the web page that has the lowest general attention and is not included in the past search results of the individual user. Therefore, the user can discover a web page on which high-quality information is posted, although it has not been noticed so far, by following the link while browsing the result page. In FIG. 9, “discount home appliance” on the right side of the page is advertisement data selected to match the search keyword “washing machine”.

  As described above, according to the present embodiment, when a user desires a search that prioritizes a web page with a low degree of attention, the reciprocal of the evaluation value of the URL searched from the search keyword is calculated and calculated. URLs that have a large reciprocal number and have not been searched by the user in the past are ranked higher. Then, a search result web page is provided to the user, which is arranged at a more prominent position as the URL has a higher ranking. For this reason, it is possible to search not only web pages that are generally attracting attention but also web pages that are not attracting attention, giving various preferences to users who wish to obtain information published on the network. Can satisfy a wide range.

  Note that a search program in which the information search method described in the above embodiment is described in a computer-executable format is generated, and the search program and search method of the present invention are realized by causing the computer to execute the search program. It is also possible. At this time, the search program can be stored in a computer-readable recording medium, and the search program can be introduced into the computer using the recording medium.

  The present invention can be applied to a case where a wide range of various preferences of users who desire to acquire information published on a network are satisfied.

It is a block diagram which shows the structure of the search system which concerns on one embodiment. It is a figure which shows the example of index DB which concerns on one embodiment. It is a figure which shows the example of advertisement DB which concerns on one embodiment. It is a block diagram which shows the internal structure of the information search device which concerns on one embodiment. It is a figure which shows the example of the search request which concerns on one embodiment. It is a figure which shows the example of the search log | history which concerns on one embodiment. It is a flowchart which shows the information search process which concerns on one embodiment. It is a flowchart which shows the ranking process which concerns on one embodiment. It is a figure which shows the example of the result page which concerns on one embodiment.

Explanation of symbols

201 Search Request Reception Unit 202 Index Search Unit 203 History Holding Unit 204 Ranking Unit 205 Advertisement Selection Unit 206 Result Page Generation Unit 207 Search Result Transmission Unit

Claims (7)

An acquisition unit that searches a database that stores information related to a web page, acquires link information to a web page that matches a search keyword specified by a user, and an evaluation value that indicates a degree of attention of the web page;
Calculating means for calculating the reciprocal of the evaluation value acquired by the acquiring means;
Ranking means for ranking all web pages for which link information and evaluation values have been acquired by the acquisition means according to the reciprocal calculated by the calculation means;
According to the ranking result by the ranking means , generating means for generating a search result display web page arranged at a position where the link information to the web page having a higher rank is more conspicuous ;
Search history storage means for storing link information acquired by the acquisition means in the past as search history information in association with identification information of a user who specified the search keyword;
The ranking means includes
When there are a plurality of web pages having the same reciprocal number calculated by the calculation means, among the plurality of web pages, the rank of the web page in which the link information is not included in the search history information, the link information is the search history information. A search device characterized in that the rank is higher than the rank of the included web page . The acquisition means includes
Receiving means for receiving, from a user terminal, ranking type information indicating whether or not a search for giving priority to a web page with a low degree of attention is desired or a search for giving priority to a web page with a degree of attention is desired;
The calculating means includes
2. The search device according to claim 1 , wherein the reciprocal of the evaluation value is calculated only when the ranking type information received by the receiving unit indicates that a search request that prioritizes a web page with a low degree of attention is desired. . The generating means includes
Only when the ranking type information received by the receiving means indicates that the web page with low attention is given priority to search, the search result display web page excluding the link information of the web page loaded with the virus is displayed. The search device according to claim 2, wherein the search device is generated. The generating means includes
Only when the ranking type information received by the receiving means indicates a search request that prioritizes a web page with a low level of attention, the user's e-mail address is collected for advertisement distribution to an unspecified number of users. The search apparatus according to claim 2 or 3, wherein a search result display web page is generated by excluding link information of a web page for the purpose. It further has advertisement data acquisition means for acquiring advertisement data related to the search keyword specified by the user,
The generating means includes
The search device according to any one of claims 1 to 4 , wherein the advertisement data acquired by the advertisement data acquisition means is arranged in a margin of a search result display web page. An acquisition step of searching a database storing information related to a web page and obtaining an evaluation value indicating link information to the web page that matches a search keyword specified by the user and an attention level of the web page;
A calculation step of calculating the reciprocal of the evaluation value acquired in the acquisition step;
In accordance with the reciprocal calculated in the calculating step, a ranking step ranking all the web pages from which the link information and the evaluation value are acquired in the acquiring step;
In accordance with the ranking result in the ranking step , a generation step of generating a search result display web page arranged at a position where the link information to the web page having a higher rank is more conspicuous ;
A search history storage step of storing the link information acquired in the acquisition step in the past as search history information in search history storage means in association with the identification information of the user who specified the search keyword;
The ranking step includes:
When there are a plurality of web pages having the same reciprocal number calculated in the calculating step, the rank of the web page in which the link information is not included in the search history information among the plurality of web pages, and the link information in the search history information The search method characterized by making it higher than the rank of the web page contained . A search program executed by a computer,
In the computer,
An acquisition step of searching a database storing information related to a web page and obtaining an evaluation value indicating link information to the web page that matches a search keyword specified by the user and an attention level of the web page;
A calculation step of calculating the reciprocal of the evaluation value acquired in the acquisition step;
In accordance with the reciprocal calculated in the calculating step, a ranking step ranking all the web pages from which the link information and the evaluation value are acquired in the acquiring step;
In accordance with the ranking result in the ranking step , a generation step of generating a search result display web page arranged at a position where the link information to the web page having a higher rank is more conspicuous ;
In association with the identification information of the user who specified the search keyword, the search history storage step of storing the link information acquired in the acquisition step in the past as search history information in the search history storage means is executed ,
In the ranking step, when there are a plurality of web pages having the same reciprocal number calculated in the calculation step in the computer, the rank of the web page in which the link information is not included in the search history information among the plurality of web pages A search program for executing the step of making the link information higher than the rank of the web page included in the search history information .

Images