JP2009282593A - Method, server and program for managing index data for retrieving content - Google Patents

Abstract

A method, server, and program for managing index data based on usefulness of identification data of content are provided.
A search server receives a bookmark associated with a Web page by a user viewing the Web page, extracts a set of words of a predetermined type included in the received bookmark, and is extracted For the same combination of a set of phrases and the Web page associated with the bookmark from which the set of phrases is extracted, the number of users associated is stored in association with the combination and stored. Based on the number of users, for each combination corresponding to the number of users, index data is generated using each of the phrases included in the set of phrases as a keyword.
[Selection] Figure 3

Description

  The present invention relates to a method, a server, and a program for managing index data.

  Conventionally, since there are a large amount of contents provided as Web pages, image files, and the like on the Internet, a user who wants to obtain necessary information has performed a search using a keyword using a search system. In many cases, this search system generates index data in which keywords and contents are associated in advance in order to improve the search efficiency.

  In such index data, words extracted from the content and tags attached to the content are used as keywords. Thereby, the user can search by inputting the keyword which shows the content content.

  In addition, a bookmark is registered for content recognized as useful by the user, and the user can quickly reach the corresponding content by selecting the bookmark. This bookmark is not limited to a terminal device used by the user, and bookmarks registered by a plurality of users may be managed by a predetermined server.

By the way, when such a large number of bookmarks are registered, it is difficult to find a desired bookmark itself. Therefore, a management method for searching a bookmark and presenting a search result has also been proposed (for example, see Patent Document 1). . Therefore, it is also conceivable that the word extracted from the bookmark is used as a keyword of the index data, like the word or tag in the content.
JP 2001-357055 A

  However, when a search is performed using identification data such as words in content, tags, bookmarks, and the like as keywords, the extracted keywords may include those having a low degree of association with the content contents. In particular, tags specified by users and keywords based on bookmarks are often difficult for other users to understand. In many cases, such a low-relevance keyword reduces the accuracy of search, and unnecessary index data is generated by a keyword that is difficult to understand.

  Therefore, it is important to generate index data in consideration of the usefulness of individual keywords. Therefore, an object of the present invention is to provide a method, a server, and a program for managing index data based on the usefulness of content identification data.

  The present invention provides the following solutions.

(1) A method in which a server manages index data in which a keyword is associated with content searched for by the keyword,
A receiving step of receiving identification data associated with the content by the user;
An extraction step of extracting a set of words of a predetermined type included in the identification data received by the reception step;
For the same combination of the set of phrases extracted by the extraction step and the content associated with the identification data from which the set of phrases is extracted, the number of users associated is associated with the combination. Memory step for storing
Generating based on the number of users stored in the storing step, the index data for the combination corresponding to the number of users, the index data using each of the words included in the set of words as the keyword. Method.

  According to such a configuration, the server that executes the method receives identification data (for example, a bookmark or a tag) associated with the content by a user who has viewed the content (for example, a web page or an image file). A set of phrases of a predetermined type (for example, nouns) included in the received identification data is extracted, and the set of extracted phrases and the set of phrases are associated with the extracted identification data For the same combination with content, the number of associated users is stored in association with the combination, and based on the stored number of users, the combination corresponding to the number of users is stored in a set of phrases. Index data using each included phrase as a keyword is generated.

  As a result, the server stores the number of registered groups (number of users) in units of keyword groups included in identification data such as bookmarks and tags. A large number of users indicates that there are many users who have registered identification data from which the same keyword set is extracted. Therefore, it can be determined that this keyword set is deeply related to the content and is a useful combination of keywords. And since the said server produces | generates the index data regarding the keyword contained in a set based on this memorize | stored number of users, it can produce | generate index data based on the useful keyword recognized by many users. .

  Therefore, the search system using the index data can execute a highly accurate search using a useful index having a high degree of association with the content. Therefore, the user may be able to efficiently extract and browse useful content that meets the requirements.

  (2) The method according to (1), wherein the storing step stores the number of users for the identification data received by the receiving step during a predetermined period.

  According to such a configuration, the server that executes the method counts the number of registered identification data (number of users) in a predetermined period. Therefore, the server can generate index data that matches the current trend.

  (3) According to (1) or (2), in the generation step, when the number of users exceeds a predetermined threshold, the index data is generated for the combination corresponding to the number of users. The method described.

  According to such a configuration, when the number of registered identification data (number of users) exceeds a predetermined threshold, the server that executes the method generates index data using the keyword included in the identification data. Therefore, there is a possibility that the server can generate highly accurate index data using highly useful keywords included in the keyword set that has received support from a predetermined number of users.

  (4) In the generation step, the index data is generated for a predetermined number of combinations in descending order of the number of users among the combinations stored in the storage step. ) Any one of the methods.

  According to such a configuration, the server that executes the method generates index data by extracting keywords in descending order of the number of registered identification data (number of users). Therefore, there is a possibility that the server can generate highly accurate index data by using highly useful keywords included in the keyword set that is currently receiving much support.

  (5) The method according to any one of (1) to (4), further including an adjustment step of adjusting a weight related to the priority order of the index data based on the number of users.

  According to such a configuration, the server that executes the method can increase the priority order of the content with respect to the keyword included in the identification data having a large number of registrations, for example, based on the number of identification data registered (number of users). it can. As a result, there is a possibility that highly useful content can be easily extracted and browsed by a combination of keywords and content supported by many users.

(6) A server that manages index data in which a keyword is associated with content searched by the keyword,
Receiving means for receiving identification data associated with the content by the user;
Extracting means for extracting a set of words of a predetermined type included in the identification data received by the receiving means;
For the same combination of the set of phrases extracted by the extraction unit and the content associated with the identification data from which the set of phrases is extracted, the number of associated users is associated with the combination. Storage means for storing
Generating means for generating the index data using each of the words included in the set of words as the keyword for the combination corresponding to the number of users based on the number of users stored by the storage means; server.

  According to such a configuration, the same effect as in (1) can be expected by operating the server.

(7) A program for causing a server to manage index data in which a keyword is associated with content searched by the keyword,
A receiving step of receiving identification data associated with the content by the user;
An extraction step of extracting a set of words of a predetermined type included in the identification data received by the reception step;
For the same combination of the set of phrases extracted by the extraction step and the content associated with the identification data from which the set of phrases is extracted, the number of users associated is associated with the combination. Memory step for storing
Generating, based on the number of users stored in the storage step, the index data for the combination corresponding to the number of users, using the words included in the set of phrases as the keywords. Program to make.

  According to such a configuration, the same effect as in (1) can be expected by executing the program.

  According to the present invention, index data based on usefulness of content identification data can be managed.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings. It is assumed that the content according to the present invention is a Web page and the identification data is a bookmark title.

[System Overview]
FIG. 1 is a schematic diagram showing the overall configuration of the search system according to the present embodiment. The search server 10 is connected to the bookmark management server 20, the user terminal 30, and the content server 40 via a network.

  In response to a request from the user terminal 30, the search server 10 searches for a web page managed by the content server 40 and transmits the search result to the user terminal 30.

  The bookmark management server 20 accepts registration of a bookmark for a web page browsed on the user terminal 30. And the bookmark management server 20 memorize | stores the combination of the bookmark and URL of a web page for every user.

  Here, the search server 10 collects bookmark information from the bookmark management server 20 and generates index data based on the number of registrations, thereby improving search efficiency and accuracy.

[Hardware configuration]
FIG. 2 is a diagram illustrating an example of a hardware configuration of the search server 10 according to the present embodiment. The search server 10 includes a CPU (Central Processing Unit) 1 (1010) constituting the control device 101 (a plurality of CPUs such as CPU 2 (1012) may be added in a multiprocessor configuration), a bus line 1005, and a communication I / F 1040. A main memory 1050, a basic input output system (BIOS) 1060, a USB port 1090, an I / O controller 1070, an input device 1100 such as a keyboard and a mouse, and a display device 1022.

  The BIOS 1060 stores a boot program executed by the control device 101 when the search server 10 is started up, a program depending on the hardware of the search server 10, and the like.

  A storage device 107 such as a tape drive 1072, a hard disk 1074, an optical disk drive 1076, and a semiconductor memory 1078 can be connected to the I / O controller 1070.

  The hard disk 1074 constituting the storage device 107 stores various programs for the search server 10 to function as a server and programs for executing the functions of the present invention, and can configure various databases as necessary.

  As the optical disk drive 1076, for example, a DVD-ROM drive, a CD-ROM drive, a DVD-RAM drive, a CD-RAM drive, or the like can be used. In this case, the optical disk 1077 corresponding to each drive is used. A program or data can be read from the optical disk 1077 by the optical disk drive 1076 and provided to the main memory 1050 or the hard disk 1074 via the I / O controller 1070. Similarly, the tape medium 1071 corresponding to the tape drive 1072 can be used mainly for backup.

  The program provided to the search server 10 is provided by being stored in a recording medium such as the hard disk 1074, the optical disk 1077, or a memory card. This program may be installed in the search server 10 and executed by being read from a recording medium via the I / O controller 1070 or downloaded via the communication I / F 1040.

  The aforementioned program may be stored in an internal or external storage medium. Here, as a storage medium constituting the storage device 107, in addition to the hard disk 1074, the optical disk 1077, or the memory card, a magneto-optical recording medium such as an MD or a tape medium can be used. Further, a storage device such as a hard disk 1074 or an optical disk library provided in a server system connected to a dedicated communication line or the Internet may be used as a recording medium, and the program may be provided to the search server 10 via the communication line.

  Here, the display device 1022 displays a screen for accepting data input to the user, or displays a screen of a calculation processing result by the search server 10, and includes a cathode ray tube display device (CRT), a liquid crystal display device ( LCD).

  Here, the input device 1100 accepts input by the user, and may be configured by a keyboard, a mouse, and the like.

  The communication I / F 1040 is a network adapter that enables the search server 10 to be connected to a terminal via a dedicated network or a public network. The communication I / F 1040 may include a modem, a cable modem, and an Ethernet (registered trademark) adapter.

  In the above example, the search server 10 has been mainly described. However, the functions described above can also be realized by installing a program in a computer and operating the computer as a server device. Therefore, the functions realized by the search server 10 described as one embodiment in the present invention can be realized by executing the above-described method on the computer, or by introducing the above-described program into the computer and executing it. It is feasible.

[Function configuration]
FIG. 3 is a block diagram showing a functional configuration of the search server 10 according to the present embodiment. The search server 10 includes a bookmark receiving unit 11, a keyword set extraction unit 12, a bookmark count unit 13, an index generation unit 14, and a priority adjustment unit 15 in the control device 101, and the storage device 107 includes A count DB 16 and an index DB 17 are provided.

  The bookmark receiving unit 11 receives bookmark data from the bookmark DB 21 provided in the bookmark management server 20. Here, the bookmark data is data in which the identification data (bookmark title) of the web page registered by the user of the user terminal 30 is associated with the URL of the web page.

  FIG. 4 is a diagram showing a bookmark table according to the present embodiment. Here, the ID of the user who registered the bookmark, the bookmark title, the URL of the web page, and the bookmark registration date and time are stored in association with each other. Each user can acquire and browse a Web page with a corresponding URL by selecting a bookmark title registered by the user. In addition, the bookmark may be open to others, and a flag indicating whether to open the bookmark is given to the bookmark table.

  The bookmark receiving unit 11 receives data having a registration date and time of a predetermined period among the bookmark data stored in the bookmark table (FIG. 4). This reception may be performed in a predetermined cycle, and bookmark data registered from the previous reception to the present is received.

  Note that the received bookmark data may be limited to published data. According to this, the search server 10 generates index data using the title of the bookmark named on the assumption that the user shows it to others. Therefore, there is a possibility that index data with useful keywords that are easily supported by others is generated, and the accuracy of the search can be improved.

  The keyword set extraction unit 12 extracts a set of keywords included in the bookmark title received by the bookmark receiving unit 11. Specifically, the keyword set extraction unit 12 extracts a predetermined type of word such as a noun by performing a morphological analysis on the title of the bookmark, and sets a combination of the extracted words as a keyword set.

  The bookmark count unit 13 counts the number of times the combination of the keyword set extracted by the keyword set extraction unit 12 and the URL included in the corresponding bookmark data appears, and stores the count in the count DB 16. That is, the bookmark count unit 13 counts and stores the number of registrations when the same bookmark title including the same keyword set is registered for the same Web page.

  FIG. 5 is a diagram showing a count table stored in the count DB 16 according to the present embodiment. Here, for a combination of a set of keywords and a URL of a Web page, the number of users who registered bookmarks of that combination is stored.

  The index generation unit 14 refers to the count table (FIG. 5) and generates index data used for search processing. Here, the index data is data including a combination of a keyword and a URL, and is referred to by a search engine in Web page search processing.

  Specifically, the index generation unit 14 extracts a combination of a keyword set and a URL having a relatively large number of registrations from the count table (FIG. 5). For example, a combination in which the number of registrations exceeds a predetermined threshold or a predetermined number of combinations may be extracted in descending order of registration numbers. Then, the index generation unit 14 generates index data in which each keyword included in the keyword set is associated with the URL for the extracted combination, and stores the index data in the index DB 17.

  Although the index data associates each keyword with a URL, the present invention is not limited to this, and a keyword set or a subset may be associated with a URL.

  The priority adjustment unit 15 adjusts the priority indicating the search priority for the index data stored in the index DB 17 based on the number registered in the count table (FIG. 5). The priority may be a weight for determining the rank (display order) of URLs as a search result, and the priority is adjusted higher as the number of registrations increases. As a result, the combination of the keyword and the URL associated with the bookmarks of a large number of users has a higher priority, and thus is easily searched.

  Each function described above is realized by each unit of the search server 10, but is not limited thereto, and may be distributed to a plurality of servers as appropriate.

[First processing]
FIG. 6 is a diagram showing a flow of the first process in the search server 10 according to the present embodiment. In this process, index data is generated when the number of registered combinations of keyword sets and URLs is equal to or greater than a predetermined threshold.

  In step S1, the control apparatus 101 extracts one combination of the keyword set and the URL from the count table (FIG. 5) of the count DB 16.

  In step S2, the control apparatus 101 determines whether the number of registrations is equal to or greater than a predetermined threshold for the data extracted in step S1. If this determination is YES, the process proceeds to step S3, and if the determination is NO, the process proceeds to step S6.

  In step S3, the control apparatus 101 determines whether or not index data has already been registered for the combination of the keyword set and URL for which the number of registrations is determined to be greater than or equal to the threshold in step S2. If this determination is YES, the process proceeds to step S5, and if the determination is NO, the process proceeds to step S4.

  In step S4, the control apparatus 101 generates index data and registers it in the index DB 17 with respect to the combination of the keyword and URL determined that the index data is not registered in step S3.

  In step S5, the control apparatus 101 weights the registered index data with respect to the priority of search based on the number of registrations extracted from the count table (FIG. 5).

  In step S6, the control device 101 determines whether or not all cases stored in the count table (FIG. 5) have been processed. If this determination is YES, the process ends. If the determination is NO, the process returns to step S1 to process the next one.

[Second processing]
FIG. 7 is a diagram showing a flow of second processing in the search server 10 according to the present embodiment. In this processing, index data is generated for a predetermined number from the combination of the keyword set and the URL that has the largest number of registrations or the number of registrations.

  In step S11, the control device 101 sorts the data in the count table (FIG. 5) according to the number of registrations.

  In step S12, the control apparatus 101 extracts one combination of the keyword set and the URL in order from the data having the highest number of registrations among the data sorted in step S11.

  In step S13, the control apparatus 101 determines whether the number of registrations is equal to or greater than a predetermined threshold for the data extracted in step S12. If this determination is YES, the process proceeds to step S14. If the determination is NO, it is determined that there is no more data whose registration number is equal to or greater than the threshold value, and the process is terminated.

  In step S14, the control apparatus 101 determines whether or not the index data has already been registered for the combination of the keyword set and URL for which the number of registrations is determined to be greater than or equal to the threshold value in step S13. If this determination is YES, the process proceeds to step S16, and if the determination is NO, the process proceeds to step S15.

  In step S15, the control device 101 generates index data and registers it in the index DB 17 with respect to the combination of the keyword and URL determined that the index data is not registered in step S14.

  In step S16, the control apparatus 101 weights the registered index data with respect to the priority of search based on the number of registrations extracted from the count table (FIG. 5).

  In step S17, the control apparatus 101 determines whether or not a predetermined number that is the index data generation target is extracted from the count table (FIG. 5). If this determination is YES, the process ends. If the determination is NO, the process returns to step S12 to process the next one.

  As mentioned above, although embodiment of this invention was described, this invention is not restricted to embodiment mentioned above. The effects described in the embodiments of the present invention are only the most preferable effects resulting from the present invention, and the effects of the present invention are limited to those described in the embodiments of the present invention. is not.

1 is a schematic diagram illustrating an overall configuration of a search system according to an embodiment of the present invention. It is a figure which shows an example of the hardware constitutions of the search server 10 which concerns on embodiment of this invention. It is a block diagram which shows the function structure of the search server 10 which concerns on embodiment of this invention. It is a figure which shows the bookmark table which concerns on embodiment of this invention. It is a figure which shows the count table which concerns on embodiment of this invention. It is a figure which shows the flow of the 1st process in the search server 10 which concerns on embodiment of this invention. It is a figure which shows the flow of the 2nd process in the search server 10 which concerns on embodiment of this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Search server 11 Bookmark receiving part 12 Keyword set extraction part 13 Bookmark count part 14 Index production | generation part 15 Priority adjustment part 16 Count DB
17 Index DB
20 Bookmark management server 21 Bookmark DB
30 User terminal 40 Content server 101 Control device 107 Storage device

Claims (7)

A server manages index data in which a keyword is associated with content searched for by the keyword,
A receiving step of receiving identification data associated with the content by the user;
An extraction step of extracting a set of words of a predetermined type included in the identification data received by the reception step;
For the same combination of the set of phrases extracted by the extraction step and the content associated with the identification data from which the set of phrases is extracted, the number of users associated is associated with the combination. Memory step for storing
Generating based on the number of users stored in the storing step, the index data for the combination corresponding to the number of users, the index data using each of the words included in the set of words as the keyword. Method.   The method according to claim 1, wherein the storing step stores the number of users for the identification data received by the receiving step during a predetermined period.   The method according to claim 1, wherein the generation step generates the index data for the combination corresponding to the number of users when the number of users exceeds a predetermined threshold. .   4. The index data is generated for a predetermined number of combinations in descending order of the number of users among the combinations stored in the storing step. 5. The method of crab.   The method according to any one of claims 1 to 4, further comprising an adjustment step of adjusting a weight related to the priority of the index data based on the number of users. A server that manages index data in which a keyword is associated with content searched by the keyword,
Receiving means for receiving identification data associated with the content by the user;
Extracting means for extracting a set of words of a predetermined type included in the identification data received by the receiving means;
For the same combination of the set of phrases extracted by the extraction unit and the content associated with the identification data from which the set of phrases is extracted, the number of associated users is associated with the combination. Storage means for storing
Generating means for generating the index data using each of the words included in the set of words as the keyword for the combination corresponding to the number of users based on the number of users stored by the storage means; server. A program that causes a server to manage index data that associates a keyword with content searched for by the keyword,
A receiving step of receiving identification data associated with the content by the user;
An extraction step of extracting a set of words of a predetermined type included in the identification data received by the reception step;
For the same combination of the set of phrases extracted by the extraction step and the content associated with the identification data from which the set of phrases is extracted, the number of users associated is associated with the combination. Memory step for storing
Generating, based on the number of users stored in the storage step, the index data for the combination corresponding to the number of users, using the words included in the set of phrases as the keywords. Program to make.

Images