KR20100025123A - Method for generating query word chain for providing searching service and method for providing searching service using the same - Google Patents

Abstract

PURPOSE: A query language chain formation method for offering retrieval service and a method for offering search service using the same are provided to offer a user-friendly retrieval service which is optimized to the search intention of the user by analyzing the correlation of the query languages which the user inputs . CONSTITUTION: A search word and a second query language are decided by analyzing the inputted query language(S100). A search system decides a query language chain in which a second query language belongs when the search word and the second query language are decided(S110). The search is operated using combination of the other second query language included in the query language chain(S120). The search result is offered to a client(S130). According to a search result selection by a user, a task adjusting the query language chain is operated(S140).

Description

Method of forming query chain to provide search service and providing search service using same {METHOD FOR GENERATING QUERY WORD CHAIN FOR PROVIDING SEARCHING SERVICE AND METHOD FOR PROVIDING SEARCHING SERVICE USING THE SAME}

The present invention relates to a method for forming a query chain for providing a search service and a method for providing a search service using the same, and more particularly, to form a query chain composed of correlated query terms by analyzing a query input by a user. The present invention relates to a method for improving a user's search satisfaction, utilization, and reliability by performing a search service using a query chain.

With the development of the Internet and related technologies, various search services through the web are also being developed, and various search services that provide such a search service have their own characteristics in order to secure a competitive edge. I'm trying to equip the engine. In particular, the need for a quick and accurate search of information desired by a user in the flood of information is becoming more important, and various search techniques have been used to improve the accuracy and reproducibility of the search as well as collecting a lot of information. The exposure ranking of the search results is also a feature that represents the characteristics of the search engine. Conventional search engines generally process by assigning weights, weighting search terms, weighting information selected from search results, and Methods such as weight calculation based on the degree of matching of keywords are used. Of course, each search engine has developed and used unique calculations for the resulting exposure rankings, which are often considered very important secrets.

Meanwhile, as another method for improving a search service, techniques such as a search word completion function and a related word suggestion function have been actively supported recently. In addition, many studies and investments are being made in methods such as authority, thesaurus, and ontology-based semantic search in order to increase the convenience, accuracy, and reproducibility of user search.

However, the broad query method currently supported by most search service sites is search term completion, which is mainly supported by search of related words by using the index database or by the relationship between the query entered by the user and the selected materials. have. However, authority, thesaurus, and ontology-based semantic search not only requires knowledge-intensive investment of experts, but it is also difficult to guarantee extended query services that require immediateness and scalability such as rapidly changing events, events, and new words. If investment is not made, it has a structure that is forced to be eliminated as time passes.

In addition, the advertising market through search service is not only forming a huge scale, but also generating huge profits. However, the keyword advertising service that is widely used now causes distortion of search results that first appear information that may be irrelevant to the search intention, even though the user wants to expose the information he is looking for at the top. Not only that, but also forcing the user to be uncomfortable. In other words, not only the advertisements that are closely related to the data selected by the searcher are exposed, but also that many advertisement information related to the entered query words are exposed before the necessary information is found, which is a major factor that hinders the quality of the search service. It is becoming. In addition, since the search results for the same query can only be presented to all users in the same way, it is a limitation of the current search service that a differentiated service is impossible for a professional or a specific group. Desirable search service should be able to provide professional service differentiated from general search service to professional group, and accurate and rapid search service by exposing advertisement media suitable for searcher searching for and selecting the material. It is a selective personalized search service that minimizes the exposure of ads that are unnecessary and have little effect for the majority of searchers.

In this regard, there is an urgent demand for the development of a search service system that can solve the limitations of the conventionally provided search service.

An object of the present invention is to solve the above limitations, and to provide a user-friendly search service that can be optimally matched to the user's search intention by analyzing the correlation of the query words input by the user.

In addition, the present invention improves and integrates search term expansion methods such as authority, thesaurus, and ontology-based semantic search based on academic background, and the correlation between the query words entered by the user is improved. By forming a query chain by analyzing the query and expanding the query input by the user using the query and the query chain, a search method is provided to improve the accuracy and reproducibility of the search and to increase the user's satisfaction. For other purposes.

In addition, the present invention dynamically adjusts and maintains and develops the closeness between the query chain formed according to the correlation between the query words and the query words included in each query chain according to the user's response, thereby searching for the evolutionary structure according to the user's selection Providing a service is another purpose.

In addition, another object of the present invention is to provide a search service that can maximize the efficiency of the advertisement by providing a new form of advertisement exposure technique while using the query chain.

In order to achieve the above object, the present invention provides a method for forming a query chain for providing a search service in a search system, wherein the search is performed based on a query input from a client and provides a search result to the client. A first step of doing; A second step of forming an index word set by a second query word configured based on an index word corresponding to a search result selected by a client from among the provided search results and the query word; A third step of determining whether or not an intersection exists by comparing the index word set formed in the second step with each other index word set already formed when there is another index word set already formed; A fourth step of including the second query word corresponding to the other index word set in which the intersection is present and the second query word corresponding to the index word set formed in the second step in the same query chain when the intersection is present in the third step; And a fifth step of determining a closeness between the second query words in the fourth step.

Here, performing the search based on the query word input from the client side in the first step may be performed by a search word composed of a query word input from the client side in a form suitable for searching, and in the second step, The secondary query may be selected from among search terms configured in a form suitable for the search.

In addition, the closeness of the fifth step is the number of elements of the intersection determined in the third step, the number of page views of the web page corresponding to the result selected by the client in the first step, The web page may be determined by a combination of at least one of an exposure ranking of a web page corresponding to the selected result, a time spent on the web page corresponding to the result selected by the client side, and a number of times of selecting the result selected by the client side.

The method may further include forming secondary query words having a degree of closeness between secondary query words included in the query chain into sub query chains included in the query chain.

According to another aspect of the present invention, in a method for providing a search service in a search system using a query chain and / or a sub-query chain formed by the above method, receiving a query input from a client side, Determining a search term to be searched from the received query word; Constructing a secondary query based on the received query and determining a query chain to which the secondary query belongs; If there is a query chain to which the secondary query word belongs in the second step, the search is performed based on the search word determined in the first step and the query chain determined in the second step, and the search result is performed to the client side. Determining a priority for providing; In the second step, if there is no query chain to which the secondary query word belongs, a search is performed by the search word determined in the first step, and a priority for determining a priority for providing the performed search result to the client side. 4 steps; Providing a search result to a client side according to the determined priority; And adjusting a query chain according to a search result selected by the client among the search results provided to the client.

The performing of the search in the third step may be configured to perform a search by a combination of the search word and the query words included in the query chain determined in the second step.

In addition, the priority determination in the third step may be the highest priority of a search result including only a search word having a complete word form among the search terms, and the query chain determined in the second step or the query chain determined in the second step. It may be configured to determine the search results performed by the combination of the query words included in the sub-query chain containing the search word having the complete word form among the next.

In addition, the sixth step may include a step 6-1 of forming a new query chain with other secondary query words according to the search result selected by the client by the search result; And recalculating the closeness between the secondary query words included in the existing query chain according to the search result selected by the client by the search result.

In addition, the step 6-1 may include: configuring an index word set based on the index word corresponding to the search result selected by the client by the search result and the secondary query word; Determining whether there is an intersection with the index word set configured in the step and another index word set already existing; And in the step, if there is another set of index words in which the intersection exists, including the second query word and a second query word corresponding to the other set of index words in which the intersection exists in the same query chain.

Further, in the third step, after determining the search results performed by the combination of the secondary query words belonging to the sub-query chain containing the search word having the complete word form among the query chain determined in the second step as the next The advertisement data preset in the query chain or sub-query chain of the third stage may be provided together with the search result according to the determined priority in the fifth stage.

In addition, in the sixth step, when the client side selects a search result, the advertisement data preset for the secondary query is pre-determined for a period of time before the result data corresponding to the selected search result is provided to the client side. The output may be removed after being output to the output means on the client side, or may be provided to the client side to be in a standby state after being output to the output means on the client side for a predetermined time.

According to the present invention, it is possible to provide a user-friendly search service that can be optimally matched to a user's search intent by analyzing the correlation of query terms input by the user.

In addition, according to the present invention, by analyzing the correlation between the query input by the user to form a query chain, by using the query and query chain to expand the query input by the user to perform a search, It is possible to provide a way to improve the user satisfaction by improving the recall rate.

In addition, according to the present invention, by closely adjusting and maintaining the degree of closeness between the query chain formed according to the correlation between the query words and the query words included in each query chain according to the user's response, the evolutionary structure according to the user's selection Search service can be provided.

In addition, according to the present invention, it is possible to provide a search service that can maximize the efficiency of the advertisement by using a new form of advertising exposure at the same time using the query chain.

EMBODIMENT OF THE INVENTION Hereinafter, the Example by this invention is described in detail with reference to an accompanying drawing.

1 is a view schematically showing the overall connection relationship of a system for providing a search service providing method according to the present invention, a view for explaining the overall outline of the present invention.

Referring to FIG. 1, a system for providing a search service providing method according to the present invention (hereinafter referred to as a search system) 20 includes a database 30 and is connected to a client 10 through a network. .

In FIG. 1, the network may be, for example, an internet network, a LAN, a mobile communication network, and the like, and the client 10 may transmit data by connecting to the search system 20 through a network, for example, a personal computer (PC), a mobile communication terminal, or the like. It means all means having the ability to receive and receive, the present invention does not depend on the specific configuration of this network and the client (10).

The search system 20 of FIG. 1 receives a query input from a client 10 connected through a network, performs a search with reference to the database 30 based on the received query, and performs a search result. In the present invention, the search system 20 according to the present invention does not merely search for and provide a query word input from the client 10 side, but analyzes the correlation of the input query words and has a certain relation. In this case, one of the main features is that queries are combined into the same query chain and search is performed based on the input query and the query chain.

To this end, the retrieval system 20 according to the present invention has a structure for determining whether or not there is a constant relationship by analyzing the correlation between the query words input from the client 10 side, the query chain by this configuration It is another feature that forms a.

In addition, the search system 20 of the present invention may determine the ranking of the search results provided when providing the performed search result to the client 10 side with reference to the query chain, and the search result selected by the client 10. Another feature is that the query chain is continuously evolved by reconstructing the query chain based on the C, thereby providing dynamic search results that truly match the user's search intent.

On the other hand, the database 30 connected to the search system 20 of FIG. Although a database for forming and managing a query chain as described above is separately provided, this is an expression for functional division, and it is obvious to those skilled in the art that a physical structure may be integrated in one database, and thus detailed description thereof will be omitted.

FIG. 2 is a flowchart schematically illustrating an entire process of a search service providing method performed by the search system 20 as described above.

Referring to FIG. 2, first, when a query is input from the client 10, the search system 20 analyzes the input query to determine a search word and a second query (S100). Here, the term "search term" means a form in which a query word input from a user is analyzed and organized into a form suitable for a search. For example, an index word database is formed by a method such as n-gram, bi-gram, morpheme analysis, or the like. It can be said to be a unit word in a form arranged for reference. For example, when the query word input by the client 10 is in the form of a complete word, the query word and the search word may be the same. However, when the query word is not a complete word form, or a sentence is incorrectly spaced or composed of a compound noun May be different from the query language. Since this is a technique widely used in a conventional search system, a detailed description thereof will be omitted. In addition, in the present invention, the secondary query word is defined as the secondary query word only those having a meaningful complete word form among the search words as described above. For example, when the query is "rogue", the search term may be composed of "gut", "gube", "worm", "gutworm" and the like in the manner described above, wherein the secondary query is It could be "words", "worms" or "worms" in the complete and meaningful word form. As described above, the secondary query word is defined because a complete and meaningful word form is used in forming the query chain as described below.

As such, when the search word and the secondary query word are determined, the search system 20 determines a query word chain to which the secondary query word belongs (S110). Here, the query chain may be defined as a set of secondary query words that are related to each other. A detailed method of forming the query chain will be described later.

If there is a query chain to which the secondary query belongs, the search is performed based on the secondary query or by at least one of a combination of the secondary query and another secondary query included in the query chain ( S120). At this time, the search method is a general search method used in a conventional search service providing method. For example, an index word database is determined by comparing an index word database stored in the database 30 with a secondary query word and corresponding to the index word database. Since the address and index data of the stored web page are found, detailed description is omitted.

When the search is performed as described above, the search result is provided to the client 10 (S130). This means, for example, that when the search result is transmitted to the client 10 side, the search result is displayed via text, image data, or the like on an output means such as a monitor on the client 10 side.

Next, the client 10 looks at the provided search result and selects a specific search result among them. At this time, the client 10 stores data stored at an address of a web page corresponding to the selected search result by using a browser program or the like. To the side output means. At the same time, the query chain is adjusted according to the user's search result selection (S140). A detailed process of adjusting the query chain will be described later.

3 is a flowchart illustrating an embodiment of a process of forming a query chain in order to provide a search service using a query chain in the search system 20 of the present invention.

First, the search system 20 receives a query word from the client 10 side, performs a search based on this, and provides a search result to the client 10 side (S200). Herein, the search based on the query word means that the search word or the second query word is selected from the query word and the search is performed by any one or a combination thereof, as described with reference to FIG. 2.

Next, when the client 10 checks the provided search result and selects a specific search result, the client 10 constructs a set of index words by the second query word generated based on the index word and the query word corresponding to the selected search result. (S210). Of course, at the same time, the data stored in the address of the web page corresponding to the search result selected by the client may be provided by, for example, the browser program. Here, the index word corresponding to the search result selected by the client 10 means an index word corresponding to a web page corresponding to the search result selected by the client 10. For example, when the search result selected by the client 10 corresponds to a web page stored at an address of www.abc.com/index.html, it means index words included in the web page. This index word is a method commonly used in a conventional search system, for example, when a search robot collects data of a web page while crawling a web page, it means by a predetermined criterion in the collected web page. Meaning indexes are selected as the data present, which is widely used in the prior art, so a detailed description thereof will be omitted.

As such, when the index word set is constructed, it is checked whether another index word set already exists, and if another index word set exists, the intersection is compared with each of the index word set formed in the step S210 and the existing index word set. It is determined whether or not (S220). If there is an intersection, since there may be a certain correlation between secondary query words corresponding to the index word set, the second query words corresponding to each index word set are included in the same query chain (S230). If there is no intersection, it is assumed that there is no correlation between the secondary queries and the procedure ends.

Next, in determining the closeness between the secondary query words included in the same query chain (S240), the determination of the closeness may be made by the following method.

First, when the intersection exists in the step S240, it can be determined by the number of elements included in the intersection.

Alternatively, for example, the number of page views of the web page corresponding to the result selected by the client in the above step, the exposure rank of the web page corresponding to the result selected by the client, the web page corresponding to the result selected by the client It may be determined by a combination of at least any one of the time stayed in the client, the number of times the client selects the selected result. In addition, a combination may be formed in consideration of the number of elements included in the intersection, and may be determined by calculation therebetween.

In consideration of this point, the degree of closeness can be expressed by, for example, the following equation.

[Equation 1]

C (a, b) = F (cap.ab, G (a / b))

(Where C (a, b) is the closeness between the secondary query a and the secondary query b, cap.ab is the number of intersections, and G (a / b) is the weight)

In this case, G (a / b) may be expressed as follows.

G (a / b) = k {G1 (click.pageview-a / b) + G2 (rank.order-a / b) + G3 (click.staytime-a / b) + G4 (click.count-a / b)}

(Where k is a constant, G1 is the number of page wiews of the client-selected results, G2 is the ranking of information exposure of the client-selected results, G3 is the time spent on the web page corresponding to the client-selected results, and G4 is Function of the number of selections of the selected result)

Among the factors for determining such closeness, appropriate factors can be selected and cooked according to need, and weights can be appropriately adjusted, so that the correlation between the query words can be more precisely controlled.

Meanwhile, when the steps of FIG. 3 are repeated, the query chain gradually evolves, which means that the number of query words included in the query chain increases and the degree of closeness between the query words continuously changes. When the query chain evolves through such an iterative process, there may be cases where the degree of closeness is very high between the secondary query words belonging to a specific query chain. If the degree of closeness is higher than a certain level, they may be formed as separate sub-query chains. . Such a concept of a subquery query chain can be used as a useful method in providing a search service, which will be described later in detail.

FIG. 4 is a diagram illustrating the query chain forming process described with reference to FIG. 3.

In the example of FIG. 4, it is assumed that a first query is temporally input as a first query and a second query is input as a second query. For convenience of description, one word having a complete meaning is entered. For example, query = search term = secondary query.

Referring to FIG. 4, the first query is input as “diabetes” from the client 10 side, the search system 20 performs a search to provide a search result, and any one of the search results is selected by the client 10. In this case, since the index word corresponding to the selected search result is composed of "diabetes, swimming, blood sugar, injection", it can be seen that the first index word is formed by these. Similarly, when the second query word is input to "swim", it can be seen that the second index word set consists of "diabetes, swimming, running, swimming pool, and health".

In this state, the intersection of the first set of index words and the second set of index words is "diabetes, swimming", so that the intersection exists, and the first query "diabetes" and the second query "swimming" are considered to have a certain correlation. Then, they are combined into the same query chain. Similarly, when a third query word, a fourth query word, or the like is input later, the query chain may be continuously formed through the above-described process.

On the other hand, the degree of closeness between the query words determined to be correlated with each other, for example, "diabetes" and "swimming" can be calculated by the process described with reference to FIG. 3, and the query words input from the client 10 are variously expanded. When combined, the query chain and its closeness also evolve continuously and dynamically correspondingly, and the query chain and its closeness may be utilized to apply to a search service as described below.

In addition, when the degree of closeness between the secondary query words forming the query chain is greater than or equal to a certain level, the sub query chain is formed as described in FIG. 3, which may be formed as shown in FIG. 5.

FIG. 5 is a diagram for explaining an example of a sub query chain. Referring to FIG. 5, secondary queries included in one query chain A, ie, "diabetes, insulin, swimming, exercise, health, marathon," , "Syringe, blood sugar", the two secondary queries of "diabetes, insulin" are more than a certain level as the degree of closeness continues to accumulate as the process is repeated in Figure 4, so that they can be combined into the subquery chain a Similarly, the three secondary query words of "swimming, exercise, and fitness" can be combined into the sub-query chain b because the degree of closeness is higher than a certain level. It is possible to extend the search service and increase the search accuracy by utilizing such a subquery query chain, which will be described later.

6 is a flowchart illustrating an embodiment of a method for providing a search service using a query chain and / or a sub-query chain formed as described above in the search system 20 according to the present invention.

Referring to FIG. 6, the search system 20 first receives a query input from the client 10 and determines a search term and a second query (S300). Here, since the search word and the secondary query word are the same as described above, detailed description thereof will be omitted.

Next, it is determined whether there is a query chain in which the secondary query belongs, that is, the secondary query is included based on the input query (S310).

When there is a query chain to which the secondary query word belongs in step S310, a search is performed based on the determined search word and the query chain determined in step S310 (S320). In this case, the search may be performed by at least one of a combination of the search word and the secondary query words included in the query chain determined in step S310.

Next, the search system 20 determines the priority for providing the performed search results to the client (S330). In this case, the priority may be determined by, for example, a search result including only the search word as the highest priority, and the search result performed by the combination of the second query words included in the query chain determined in the step S310 as the next priority. Can be configured to make decisions. As another method, for example, a search result including only a search word having only a complete word form among the search terms is a top priority, and a search result performed by a combination of secondary query words included in the query chain determined in step S310. It can also be configured to determine the next rank.

On the other hand, prioritization when the sub-query chain exists in the query chain has a search result including only the search word as the highest priority, and the second query word is included in the query chain determined in the step S310. The search results performed by the combination of the secondary query words in the sub query chain may be configured to be ranked next. As another method, for example, a search result including only a search word having only a complete word form among the search terms is given the highest priority, and belongs to a sub query chain including the second query word in the query chain determined in step S310. The search results performed by the combination of secondary query terms may be configured to be ranked next.

On the other hand, if there is no query chain to which the secondary query word belongs in step S310, the search is performed using only the search word (S340), and priorities for providing the performed search result to the client 10 side are provided. Determine (S350). In this case, the prioritization may use the method described above, and there is no particular limitation, so it is sufficient to determine the appropriate method as necessary.

Next, the search system 20 provides the search results to the client 10 according to the priorities determined in the steps S330 and S350 (S360). If at least one of the search results provided by the client 10 is selected (S370), the web page or electronic document information stored in the result data corresponding to the selected search result, that is, the address corresponding to the selected search result In operation S380, the query chain is adjusted in accordance with the selected search result in parallel with operation S390.

The query chain is adjusted by forming a new query chain with other secondary queries according to the search result selected by the client 10 side, and the query chain already existing according to the search result selected by the client 10 side. It may consist of recalculating the closeness between the secondary query words included in.

The process of forming a new query chain is the same as the process of forming a query chain described with reference to FIGS. 3 to 5. First, an index word corresponding to a search result selected by the client 10 by the search result and a second query word are used. Construct an index word set, determine whether the index word set configured in the step and another index word set and intersection exist in advance, and if there is another index word set in which the intersection exists, convert the secondary query to another index word in which the intersection exists The second query may be included in the same query chain. As a result, the query chain formed by linking the second query based on the query input in operation S300 of FIG. 6 with other query chains that already exist may be formed.

Meanwhile, the step of recalculating the closeness may be performed in the same manner as described with reference to FIG. 3, and thus redundant description is omitted.

By this process, the query chain inputted by the client 10 can determine the query chain and / or sub-query chain correlated with the input query, and can perform an extended search according to the client. By re-adjusting the query chain, sub-query chain, and closeness based on the search result selected by the client 10 according to the search result provided to the (10) side, the query chain can be continuously and dynamically developed in response to the client's response. Will be. Therefore, the accuracy and reliability of the search can be improved.

Meanwhile, the present invention can be applied to an advertisement service. For example, advertisement data suitable for each of the query chain and / or the sub-query chain is set in advance, and the advertisement data is provided while providing a search result in step S360. It can also be provided with. In this case, since the advertisement data set for each of the query chain and / or the sub-query chain reflects the feedback according to the selection result of the client 10, it is possible to clarify the target of the advertisement data, thereby increasing the advertisement efficiency. There is an advantage.

On the other hand, if the client side selects a search result in the step (S370), the advertisement data is provided in advance for the secondary query between the time until the result data corresponding to the selected search result is provided to the client side. The advertisement data may be configured to be provided to the client side. That is, when the client selects any one of the search results, a slight time difference occurs until the client is provided with the result data corresponding to the selected result, and the advertisement data may be provided to the client between these times. To this end, the time for which the selected search result is provided to the client side may be delayed for a predetermined time.

Further, after providing the advertisement data in this way, the advertisement data may be removed after being output to the output means on the client side for a predetermined time or may be in a standby state after being output to the output means on the client side for a predetermined time. For example, if the advertisement data is provided by a web browser program, it is provided to the output means on the client side only for a predetermined time and configured to disappear automatically, or after being output for a predetermined time, the user waits on the screen box in the form of minimizing the window. It can be configured to exist in a state.

FIG. 7 is a diagram for explaining a search service providing method described with reference to FIG. 6.

Referring to FIG. 7, it can be seen that the query word “diabetes swimming” is input from the client 10. In this case, the search term may be "diabetes", "swimming", "diabetic swimming", and the secondary query is defined as a fully meaningful word form, and thus, "diabetes" and "swimming".

The search system 20 searches the query chain A containing the input "diabetic swimming". At this time, the search for the query chain A may select AND and OR operations such as diabetes AND swimming, diabetes OR swimming, etc. as necessary. In the case of the OR operation, the query chain may increase, and in the case of the AND operation, the query chain may decrease.

It can be seen that the retrieved query chain A (which may be a sub query chain) is composed of the query words "diabetes, swimming, insulin, marathon", and the search system 20 searches the query and the secondary query words included in these query chains. The search is performed by a combination of these. 7 illustrates six cases, which are combinations of all secondary query words included in the query chain, but when the query word is composed of two or more words as in the case of FIG. You can also select only combinations. In this case, the search will only be performed for "diabetic swimming insulin", "diabetic swimming marathon".

When the search is performed, the priority to provide the search results to the client 10 is determined. The first rank is determined to include only the search word, that is, "diabetes swimming", and the second rank is the second query. Determined by the search results for a combination of these. At this time, since the search results of the combination of the secondary query words can be regarded as equivalent, conventional methods such as the frequency of the index word and the inverse frequency may be used as needed. For example, the third rank may be determined as including only one of query terms among other search terms.

As such, when the search result providing priority is determined, the search result is provided to the client 10 accordingly, and when the client selects at least one, the query chain is adjusted in the manner as shown in FIG. 6 in accordance with the selected search result. Done.

In the above, the present invention has been described with reference to preferred embodiments of the present invention, but the present invention is not limited to the above embodiments, and the present invention is not limited to the above-described claims and drawings. It should be noted that branch variations and modifications are possible.

1 is a view schematically showing an overall connection relationship of a system for providing a search service providing method according to the present invention;

2 is a flowchart schematically illustrating an entire process of a search service providing method according to the present invention;

3 is a flowchart illustrating an embodiment of a process of forming a query chain according to the present invention;

4 is a diagram illustrating an example of a query chain forming process described with reference to FIG. 3;

5 is a diagram for explaining an example of a sub-query chain by way of example;

6 is a flowchart illustrating an embodiment of a method for providing a search service using a query chain and / or a sub-query chain in a search system according to the present invention;

FIG. 7 is a diagram for explaining a search service providing method described with reference to FIG. 6.

<Description of Signs of Major Parts of Drawings>

10 ...

20 ... search service providing system,

30 ... database.

Claims (11)

In the method for forming a query chain for providing a search service in a search system, A first step of performing a search based on a query input from a client side and providing a search result to the client side; A second step of forming an index word set by a second query word configured based on an index word corresponding to a search result selected by a client from among the provided search results and the query word; A third step of determining whether or not an intersection exists by comparing the index word set formed in the second step with each other index word set already formed when there is another index word set already formed; A fourth step of including the second query word corresponding to the other index word set in which the intersection is present and the second query word corresponding to the index word set formed in the second step in the same query chain when the intersection is present in the third step; And A fifth step of determining a closeness between the secondary query words of the fourth step Query chain forming method for providing a search service comprising a. The method of claim 1, Performing a search based on the query word input from the client side in the first step may be performed by a search word configured to form a query word input from the client side in a form suitable for searching, and in the second step, the second query word. The query chain forming method for providing a search service, characterized in that is selected from the search terms configured in a form suitable for the search. The method of claim 1, The closeness of the fifth step is the number of elements of the intersection determined in the third step, the number of page views of the web page corresponding to the result selected by the client in the first step, and the result selected by the client. Providing a search service, characterized in that it is determined by at least one combination of the exposure ranking of the web page corresponding to the time, the time of staying on the web page corresponding to the result selected by the client side, the number of times of the selection of the result selected by the client side. Query chain formation method for The method of claim 1, Forming secondary query words having a degree of closeness between secondary query words included in the query chain as sub query chains included in the query chain; Query chain forming method for providing a search service, characterized in that it further comprises. A method for providing a search service in a search system by using a query chain and / or a sub-query chain formed by the method according to any one of claims 1 to 4, A first step of receiving a query word input from a client side and determining a search word to be searched from the received query word; Constructing a secondary query based on the received query and determining a query chain to which the secondary query belongs; If there is a query chain to which the secondary query word belongs in the second step, the search is performed based on the search word determined in the first step and the query chain determined in the second step, and the search result is performed to the client side. Determining a priority for providing; In the second step, if there is no query chain to which the secondary query word belongs, a search is performed by the search word determined in the first step, and a priority for determining a priority for providing the performed search result to the client side. 4 steps; Providing a search result to a client side according to the determined priority; And A sixth step of adjusting a query chain according to a search result selected by the client among the search results provided to the client; Search service providing method comprising a. The method of claim 5, The performing of the search in the third step is to perform a search by a combination of the search word and the query words included in the query chain determined in the second step. The method of claim 5, The priority determination in the third step may be the highest priority of a search result including only a search word having a complete word form among the search terms, and the query word chain determined in the second step or the query chain determined in the second step may be selected. A method for providing a search service, comprising: determining search results performed by a combination of query words included in a sub-query chain including a search word having a complete word form as a next order. The method of claim 5, The sixth step, A step 6-1 of forming a new query chain with other secondary query words according to the search result selected by the client by the search result; And Step 6-2 to re-establish the closeness between the secondary query words included in the existing query chain according to the search result selected by the client by the search result; Search service providing method comprising a. The method of claim 8, The 6-1 step, Constructing a set of index words by the second query word and an index word corresponding to the search result selected by the client by the search result; Determining whether there is an intersection with the index word set configured in the step and another index word set already existing; And If there is another set of indexes in which the intersection exists, including the second query in the same query chain corresponding to the second query set and the other set of indexes in which the intersection exists. Search service providing method comprising a. The method of claim 7, wherein In the third step, after determining the search results performed by the combination of the secondary query words belonging to the sub-query chain containing the search word having the complete word form among the query chain determined in the second step, And providing advertisement data preset in the query chain or sub-query chain of the third stage, while providing the search result according to the determined priority in the fifth stage. The method of claim 5, In the sixth step, when the client side selects a search result, the client data is pre-set advertising data set for the secondary query word for a predetermined time between the time until the result data corresponding to the selected search result is provided to the client side. Providing to the client side so as to be removed after being output to the output means of the output means or to be in a standby state after being output to the output means on the client side for a predetermined time.

Images