KR200426027Y1 - User definition data searching system - Google Patents

Abstract

A user defined information retrieval system is disclosed. The user-defined information retrieval system receives a first keyword, a second keyword, and a definition relationship between the first keyword and the second keyword received from a first user computer, and receives the first keyword and the second keyword. A definition relationship database for storing a definition relationship between a keyword and the first keyword and the second keyword, and a search request for any one of the first keyword and the second keyword is received from a second user computer. A search processing unit for searching the definition relation database for at least one keyword having a definition relationship with the searched keyword among the keywords stored in the definition relation database; At least one of the first keyword and the second keyword included in the searched result Search me on the Internet, and sends the results to the second user's computer.

Custom, information retrieval system

Description

User definition data searching system

A brief description of each drawing is provided to more fully understand the drawings, which are incorporated in the detailed description of the invention.

1 is a block diagram of a user-defined information retrieval system according to an embodiment of the present invention.

2 shows a change in the database when the correction request is reflected according to an embodiment of the present invention.

3 illustrates a screen of a search result of a user according to an embodiment of the present invention.

The present invention relates to a user-defined information retrieval system, and more particularly to a system that allows a user to search for data using a definition relationship of the data.

With the development of computers, the spread of telecommunication networks represented by the Internet has a great impact on our society as a whole. As the so-called offline work gradually shifted to the Internet, or online, the Internet became a living.

For example, to collect information, you had to go to a library, review a large number of books, newspapers, magazines, etc., and collect and gather the necessary information. Now, you can easily get the data you want by entering keywords, etc., through the computer or terminal connected to the Internet.

However, the information search method using the Internet also has a problem in that it can not search all of the information desired by the user because it searches only the keyword input by the user.

For example, when a user searches for the keyword 'Bae Yong-Joon', a user searches for a document or file including the keyword 'Bae Yong-Jun' among numerous information on the Internet. However, the search results using 'Jeong Yong Jun' as a keyword may not include all of the information desired by the user.

This occurs because the keyword 'Yongsama', which is generally used in the same meaning as the keyword 'Bae Yong-jun', searches only the keyword 'Bae Yong-jun' even though the keyword 'Yon-sama' has the same meaning. In particular, this phenomenon may occur when a file including the keyword 'Yongsama' does not include the keyword 'Bae Yong Joon'.

In addition, this phenomenon occurs even when a keyword desired by the user can be expressed in abbreviation or foreign language notation.

In order to prevent this problem, operators that provide some search services are used to search by inputting 'Bae Yong-jun' and 'Yon-sama' into the search database. However, in this case, there is a problem that the database administrator must manually enter. There is a problem that synonyms, abbreviations, or foreign language notation are unknown.

Therefore, the technical problem to be achieved by the present invention relates to a system that allows service users to directly define the relationship of keywords, and to search for information using the relationship defined by the users.

In addition, the present invention relates to a system that allows users to correct a relationship defined by the user, so that users can make a relationship database of keywords.

A user-defined information retrieval system according to the present invention for achieving the above technical problem is provided with a definition relationship database and a search processing unit.

The definition relationship database receives a first keyword, a second keyword, and a definition relationship between the first keyword and the second keyword, inputted from a first user computer, and receives the first keyword, the second keyword, And the definition relationship between the first keyword and the second keyword.

When the search processor receives a search request for any one of the first keyword and the second keyword from a second user computer, the search processor has a definition relationship with the searched keyword among the keywords stored in the definition relationship database. At least one keyword is retrieved from the definition database. The search processor may search at least one of the first keyword and the second keyword included in the search result in the definition relation database and transmit the search result to a second user computer.

The search processor may transmit information indicating a definition relationship between the first keyword and the second keyword stored in the definition relationship database together with the search result to the second user computer.

The definition relationship database may receive a definition relationship correction request between the first keyword and the second keyword from a third user computer, and reflect the received definition relationship correction request in the definition relationship database.

The definition relationship correction request may include at least one of a definition relationship deletion request or a definition relationship modification request. The positive relationship may include at least one of an equality relationship and a vertical relationship.

In order to fully understand the present invention, the operational advantages of the present invention, and the objects achieved by the practice of the present invention, reference should be made to the accompanying drawings that illustrate preferred embodiments of the present invention and the contents described in the accompanying drawings.

Hereinafter, the present invention will be described in detail by explaining preferred embodiments of the present invention with reference to the accompanying drawings. Like reference numerals in the drawings denote like elements.

1 is a block diagram of a user-defined information retrieval system according to an embodiment of the present invention and a flowchart for explaining a user-defined information retrieval method according to an embodiment of the present invention.

Referring to FIG. 1, the definition relationship database 111 of the server 110 of the user-defined information retrieval system 100 according to the present invention includes a first keyword, a second keyword, and an input from the first user computer 130. In operation S101, a definition relationship between the first keyword and the second keyword is received. The definition relationship database 111 stores the received first keyword, the second keyword, and the definition relationship between the first keyword and the second keyword (S103).

When the search processing unit 113 receives a search request for any one of the first keyword and the second keyword from the second user computer 150 (S105), the keywords stored in the definition relationship database 111 are displayed. In step S107, at least one keyword having a definition relationship with the searched keyword is present in the definition relation database.

The search processing unit 113 searches (S109) at least one of the first keyword or the second keyword included in a result searched from the definition relation database 111 and retrieves a search result from the second user computer ( 150) (S113).

The server 110 of the user-defined information retrieval system 100 has an interface for receiving a definition relationship between the first keyword and the second keyword and the first keyword and the second keyword is the same as the interface for the search. You may.

That is, in order for any user to access the server 110 of the user-defined information retrieval system 100 and search for a predetermined keyword, an interface (eg, a search keyword input box) for inputting a keyword to be searched may be provided. However, a separate interface may be provided or a single interface may be used to input a definition relationship between the first keyword, the second keyword, and the first keyword and the second keyword.

If one interface is used, a predetermined format is preferably set to distinguish between entering a definition relationship or a keyword to be searched. For example, if the input [[Bae yong = Yon-sama]] is to enter a positive relationship, if you input "bae yong = Yon-sama" it can be set to enter a search keyword. The predetermined form may be set in various ways.

The first user computer 130 and the second user computer 150 may be the same computer. That is, although only the first user computer 130 and the second user computer 150 may be the same user and illustrated for convenience of description, a plurality of different user computers may input definition relations of keywords or make a search request. Can be.

For example, when receiving a definition relationship of 'Dae-Joon = Yon-Sama' from the first user computer 130 (S101), the definition relationship database 111 stores the information of 'Dae-Jun', 'Yon-Sama' and 'equality relationship (=)'. (S103).

When the search processing unit 113 receives a search request for 'Bae Yong-jun' (or 'Yon-sama') from the second user computer 150 (S105), the search processing unit 113 from the definition relationship database 111 The keyword 'Yon-sama' (or 'Bae Yong-jun') that has a positive relationship with 'Bae Yong-jun' (or 'Yon-sama') is searched (S107).

The search processing unit 113 searches 'Bae Yong-jun' and 'Yon-sama' included in the search results from the definition relation database 111 on the Internet (S109) and transmits the search result to the second user computer 150. (S113).

In addition, when receiving a definition relationship of 'bae yong jun' from the first user computer 130, the second user computer 150, or another user computer (S101), the definition relationship database 111 is 'Bae Yong Joon' And stores information such as 'bae yong jun' and 'parity relationship (=)' (S103).

When the search processing unit 113 receives a search request for 'Bae Yong-jun' (or 'Yon-sama', 'bae yong jun') from the second user computer 150 (S105), the search processing unit 113 defines the definition. 'Yesama' and 'bae yong jun' ('bae yong jun', 'bae yong jun' and 'bae yong jun') exist from the relational database 111 And 'Yon-sama') is searched for (S107).

The search processing unit 113 searches (S109) at least one of 'Bae Yong-jun', 'Yon-sama', and 'bae yong jun' included in the search results from the definition relation database 111, and retrieves the search result. The transmission is transmitted to the second user computer 150 (S113).

The positive relationship may include at least one of an equality relationship (=) and a vertical relationship (<,>). In addition, the present invention may include various correlations that may indicate a relationship between two keywords, such as a similarity and a representative relationship.

For example, when the first user computer 130 receives the information 'Bae Yong-Joon = Yon-Sama', 'Bae Yong-Joon' and 'Yon-Sama' are stored as 'parity' (=). In addition, when the first user computer 130 receives the information 'Bae Yong Joon <Entertainer', 'Bae Yong Joon' is stored as a 'sub-relation' of 'Celebrity', 'Celebrity' is a 'parent' of 'Bae Yong Joon' Relationship ".

Receiving the definition relationship from the first user computer 130 may vary. For example, it may be in the form of 'baeyongjun = Yon-sama', or may be in various forms such as 'baeyongjun equal Yon-sama', or 'bae Yong-jun same Yon-sama'.

The definition relationship database 111 may be implemented as a single table or may be implemented as a separate table. In addition, it can be implemented in various ways such as linked-list, tree, relational DB.

The search processor 113 preferably includes a search engine for searching for information on a plurality of websites connected through the Internet.

The first user computer 130 and the second user computer 150 are preferably a desktop computer or a portable computer. However, the first user computer 130 and the second user computer 150 may be terminals capable of communicating by connecting to a telecommunication network such as a personal digital assistant (PDA) or a mobile phone. have.

The first user computer 130 and the second user computer 150 should be provided with various freeware, shareware or paid software including a function of searching through the Internet and storing the searched data in a storage medium. In addition, the first user computer 130 and the second user computer 150 may be the same computer. That is, it may be the same user.

The search processing unit 113 may transmit information including a definition relationship between the first keyword and the second keyword stored in the definition relationship database 111 to the second user computer 150 together with the search result. have.

That is, the search result for the first keyword, the search result for the second keyword, and the positive relationship between the first keyword and the second keyword may also be transmitted to the second user computer 150. For example, if the first keyword is 'Bae Yong-jun' and the second keyword is 'Yon-sama,' the search processing unit 113 may search for 'Bae Yong-jun', a search result for 'Yon-sama', and 'Bay Yong-jun' and 'Yon-sama'. The positive relationship may transmit the information of 'parity' to the second user computer 150.

2 shows a change in the database when the correction request is reflected according to an embodiment of the present invention. That is, one embodiment of the definition relationship database 111a before correction and one embodiment of the definition relationship database 111b after correction are shown.

Referring to FIG. 2, in the user-defined information retrieval method according to the present invention, the definition relationship database 111a receives a request for correcting a relationship of definition between the first keyword and the second keyword from a third user computer 170. The step S201 and the definition relationship database 111a may further include the step S203 of reflecting the received correction request to the definition relationship database 111a.

That is, in the definition relationship database 111a before the correction, the definition relationship between the first keyword and the second keyword was 'equal' relationship, but the second keyword from the third user computer 170 is the 'parent' of the first keyword. When the request for correcting a relationship is received, the definition may be changed from the definition relationship database 111a to the definition relationship database 111b by reflecting the contents of the correction request.

The user-defined information retrieval method may further comprise checking whether the correction request is valid when the definition relationship database 111a receives the definition relationship correction request and reflects the request to the definition relationship database 111a. have.

That is, the contents of the correction request may not be immediately reflected in the definition relationship database 111a, and a separate module or processing unit for checking the validity of the correction request may be provided. If so, the contents of the correction request may be reflected in the definition relationship database 111a with the permission of the administrator.

3 illustrates a screen of a search result of a user according to an embodiment of the present invention.

Referring to FIG. 3, for example, if a user searches for the keyword 'Bae Yong-Joon', together with the search results for 'Bae Yong-Jun', the keywords that are parallel to the keyword 'Bae Yong-Jun' (eg, Yon-sama), Keywords, keywords in subordinate relations can be disclosed. When a user selects and clicks one of the keywords, a search result corresponding to the keyword may be displayed.

Although the present invention has been described with reference to one embodiment shown in the drawings, this is merely exemplary, and it will be understood by those skilled in the art that various modifications and equivalent other embodiments are possible. Therefore, the true technical protection scope of the present invention should be defined by the technical spirit of the appended claims.

As described above, the user-defined information retrieval system according to the present invention can search for the information that the user wants to find by using the relationships in the search by allowing the users to define and correct the relationships of keywords. In addition, the user can obtain information about other keywords that are related to the keyword that the user wants to search for but have not thought about.

In addition, the search service provider also has the effect of reducing the burden on the administrator and providing a more satisfactory service by directly creating a relational database of keywords.

Claims (5)

Receives a first keyword, a second keyword, and a definition relationship between the first keyword and the second keyword received from a first user computer, and receives the first keyword, the second keyword, and the first keyword. A definition relationship database for storing the definition relationship between a second keyword and the second keyword; And At least one keyword having a positive relationship among the keywords stored in the definition relationship database when a search request for either the first keyword or the second keyword is received from a second user computer. A search processing unit for searching the definition relation database; The search processing unit searches for at least one of the first keyword and the second keyword included in the search result in the definition relation database on the Internet, and transmits a search result to a second user computer. system. The method of claim 1, wherein the search processing unit, And the information indicating a definition relationship between the first keyword and the second keyword stored in the definition relationship database together with the search result to the second user computer. The method of claim 1, And the definition relationship database receives a definition relationship correction request between the first keyword and the second keyword from a third user computer and reflects the received definition relationship correction request to the definition relationship database. Information retrieval system. The method of claim 3, wherein the positive relationship correction request, A user-defined information retrieval system comprising at least one of a request for deleting a relationship or a request for modifying a relationship. The positive relation according to any one of claims 1 to 3, wherein User-defined information retrieval system comprising at least one of equality and vertical relationship.

Images