KR100709984B1 - Query matching method and system for outputting results matched to query by processing the query according to various logics - Google Patents

Abstract

The present invention relates to a query matching method and system for a predetermined database including a search index. More particularly, the present invention deviates from the conventional database search method that provides only a search result including the original query. The present invention relates to a query matching method and system, comprising: outputting a predetermined number of search results having a high probability of matching the original query by processing the plurality of steps according to various search logics. The query matching method for a predetermined database including a search index according to the present invention may include: searching the database using a first query word having a space or a special character removed from the original query word, and generating a first search result; When the number of the first search results is less than a predetermined reference value, the original query word is divided into a plurality of words according to a space, and the first letter and the last letter of the plurality of words are alphabets or numbers, and include at least one number. Searching the database using a word as a second query word and generating a second search result, when the sum of the number of the first search result and the number of the second search result is less than the reference value, the second query word To generate a plurality of tokens by separating them with spaces or special characters, and opening the tokens with spaces. Searching the database using a third query, generating a third search result, and matching at least one of the first search result, the second search result, and the third search result to the original query word; And outputting a total search result.

Query Matching, Search Logic, Database Search, Product Models

Description

QUERY MATCHING METHOD AND SYSTEM FOR OUTPUTTING RESULTS MATCHED TO QUERY BY PROCESSING THE QUERY ACCORDING TO VARIOUS LOGICS}

1 is a flowchart illustrating a query matching method according to an embodiment of the present invention.

2 illustrates an example of a search field according to an embodiment of the present invention.

3 is a diagram illustrating an example of a search result screen that may be output by performing a query matching method according to the present invention.

4 is a diagram illustrating another example of a search result screen that may be output by performing a query matching method according to the present invention.

5 is a block diagram illustrating a configuration of a query matching system according to an embodiment of the present invention.

6 is an internal block diagram of a general purpose computer device that may be employed to perform a query matching method in accordance with the present invention.

<Explanation of symbols for the main parts of the drawings>

500: Query Matching System

501: First search unit 502: Second search unit

503: third search unit 504: output unit

The present invention relates to a query matching method and system for a predetermined database including a search index. More particularly, the present invention deviates from the conventional database search method that provides only a search result including the original query. The present invention relates to a query matching method and system, which processes a plurality of steps according to various search logics to output various search results matching the original query.

In general, a shopping mall brokerage service refers to a service for brokering shopping malls entered into a predetermined brokerage website to a product buyer through a contract with a service operating company. The shopping malls are classified into categories and introduced or Various information such as comparing and presenting prices of each shopping mall for the same product is provided to the buyer of the product.

The shopping mall brokerage service introduces products of the shopping malls to the product buyers in various ways, and when the product buyer selects a specific product sold by the specific shopping mall, the product buyer is mediated to the selected shopping mall to actually sell the product. Is done in affiliate shopping malls.

For such a shopping mall brokerage service, product information registered in each shopping mall must be registered in a shopping mall mediation server. In the related art, a process of registering product information that a product registrant intends to sell to the shopping mall server by using the product registration procedure; (2) the process of transmitting the product information registered from the entry shopping mall server to the shopping mall mediation server, and (3) the product model name of the product information transmitted from the entry shopping mall server through the manual operation in the department in charge of managing the shopping mall mediation server And the process of registering the organized product information in the shopping mall mediation server must be performed.

As a result, in the conventional product registration procedure, excessive time is required for the product registration / matching operation, and the limitations of the work resources began to be revealed, such that the ratio of unprocessed product information exceeds the ratio of registered product information.

In addition, when the marketplace area is expected to continue to increase in the number of products, it is expected that the limitation of the work resource will be clearer if the conventional product registration procedure is followed.

In addition, in general, the database search system can output only the search result that exactly includes the original query input from the user or another system, and process the original query in a plurality of steps according to various search logic to match the original query. It was not possible to output a predetermined number of search results that are likely to be.

However, a conventional shopping mall brokering server has a general database search system as described above. (1) When a product registrant registers a product registered by an entry shopping mall server is incorrect or the model name field is empty, a matching product model is searched. It is not possible, and (2) it does not search for keywords registered in the product model, so if a product name is registered as a specific keyword, it is impossible to search for a matching product model, and (3) it is not a search based on a search engine. It is not easy to search by using, and (4) there is a problem that it is impossible to search for a matching product model if there is a typo in the product name registered by the product registrant shopping mall server.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problems of the prior art, and it is a departure from the conventional database search method that provides only the search results that exactly contain the original query word, and the original query word in accordance with various search logic. It is an object of the present invention to provide a query matching method and system capable of processing through steps to output a predetermined number of search results that are likely to match the original query.

The query matching method and system according to the present invention is to load the product information registered in the shopping mall server to register the shopping mall mediation server to realize the automation of the product registration / matching task to significantly reduce the related work resources .

Query query matching method and system according to the present invention is to apply a different search logic according to the characteristics of the product corresponding to each query, to more efficiently search for a product model having a high probability to match the query.

The query matching method and system according to the present invention extracts an appropriate query from the original query, which is the product name input by the product registrant to the shopping mall server, and searches the product model matching the corresponding product through the extracted query, thereby providing a shopping mall server of the product registrant. It is an object of the product registration / matching operation to be performed in advance in the product registration process to the product, and a separate manual work for subsequent product registration / matching is unnecessary.

In order to achieve the above object and solve the above problems of the prior art, the query matching method for a predetermined database including a search index according to an embodiment of the present invention, the space or special characters in the original query Searching the database using the removed first query word, generating a first search result, when the number of the first search result is less than a predetermined reference value, dividing the original query word into a plurality of words according to a space; Searching the database using the first query and the last letter of the plurality of words as alphabets or numbers and including at least one number as a second query, and generating a second search result, the first search result If the sum of the number of times and the number of the second search results is less than the reference value, the second query is spaced. Generates a plurality of tokens separated by a special character, searches the database using a third query word that connects the tokens to spaces, generates a third search result, and the first search result, the first search result. And outputting at least one of a second search result and a third search result as a total search result that matches the original query word.

Hereinafter, a query matching method and system according to the present invention will be described in detail with reference to the accompanying drawings.

1 is a flowchart illustrating a query matching method according to an embodiment of the present invention. The query matching method according to the present embodiment may be performed on a predetermined database including a search index, and the query matching method may be performed by a predetermined query matching system.

In step S101, the query matching system searches the database using the first query word from which a space or a special character is removed from the original query word, and generates a first search result.

For example, the query matching system generates the first query by removing '', '/', '-', '+', etc. from the original query, and searches the database to include the first query. The first search result may be generated.

In step S102, the query matching system determines whether the number of the first search results is less than the reference value.

For example, the predetermined reference value may be set to any one of 2 to 10. For example, when the reference value is 5, the query matching system determines whether the number of the first search results is less than 5 in step S102. By judging this, it is possible to determine the progress of the next step.

If the number of the first search result does not fall below the predetermined reference value as a result of the determination in step S102, the process proceeds to step S110 and outputs the first search result as a total search result, but the step ( As a result of the determination in S102, if the number of the first search results is less than the predetermined reference value, the process proceeds to step S103.

In step S103, when the number of the first search results is less than a predetermined reference value, the query matching system divides the original query word into a plurality of words according to a space, and the first letter and the last letter of the plurality of words are alphabetical. Or search the database using a word including a number and at least one number as a second query word, and generating a second search result.

For example, when the original query is "tag heuer sungrass [1000002538]", the query matching system may perform a search by determining '1000002538' as the second query in step S102.

As another example, when the original query is "[6 months interest-free installment] Ferragamo bracelet [34-2821_esp]", the query matching system may perform a search by determining '34_2821_esp' as the second query in step S102. .

In this case, the query matching system may generate the second search result by sorting the plurality of second queries in descending order according to the length, and performing a search on the database according to the sorted order. .

In step S104, the query matching system determines whether the sum of the number of the first search results and the number of the second search results is less than the reference value.

For example, when the reference value is 5, the query matching system determines whether the sum of the number of the first search result and the number of the second search result is less than 5 in step S104 to determine the progress of the next step. have.

If the sum of the number of the first search results and the number of the second search results does not fall below the predetermined reference value as a result of the determination in step S104, the process proceeds to step S110 and the first search result and The second search result is output as a total search result, but if the sum of the number of the first search result and the number of the second search result is less than the predetermined reference value as a result of the determination in step S104 (step S104); Proceed to S105).

In step S105, the query matching system generates a plurality of tokens by separating the second query word into a space or a special character, searches the database using a third query word that connects the tokens to a space, and then Generate search results.

For example, the query matching system returns the second query again as '/', '-', '+', '_', '.' Tokens can be generated by separating

In addition, the query matching system generates the third search result by repeatedly searching the database while reducing the number of tokens included in the third query word from a later stage of the third query word in step S105. can do.

For example, when the third query is "34-2821_esp", the query matching system may repeatedly search the database in the order of '34 2821 esp ', '34 2821', and '34'.

As another example, when the third query is "DGB 020 BE," the query matching system rearranges the number of tokens included in the third query in the order of 'DGB 020 BE', 'DGB 020', and 'DGB'. The database can be searched repeatedly, decreasing from.

In this case, if it is determined that a search result exists while performing step S105, the query matching system may stop the repetitive search process and generate the existing search result as the third search result. have.

According to an embodiment of the present invention, the search index included in the database includes a plurality of search fields including a product model name field and a keyword field, and step S105 of FIG. 1 includes the product model name field of the search index. A query matching method is provided that is limited to and a keyword field.

2 is a diagram illustrating an example of the search field.

As shown in FIG. 2, the search index included in the database includes a product model name field 201, a keyword field 202, and a plurality of search fields such as a category field, a brand field, a price field, a year of manufacture field, and the like. Include.

Generally, when searching a database, all search fields of a search index should be searched. However, according to an embodiment of the present invention, step S105 of FIG. It may be performed by being limited to the product model name field 201 and the keyword field 202.

Conventional shopping mall mediation server is equipped with a general database search system, it is not possible to search for a matching product model when a product name is registered as a specific keyword, because it does not search the keyword registered in the product model, the query matching system according to the present invention Searches for the keyword field 302, so that even if a product name is registered as a specific keyword, a product model matching the search may be output.

Referring back to Figure 1 will be described the present invention.

In step S106, the query matching system determines whether the sum of the numbers of the first to third search results is less than the reference value.

For example, when the reference value is 5, the query matching system may determine whether to proceed with the next step by determining whether the sum of the number of the first to third search results is less than 5 in step S106.

As a result of the determination in step S106, when the sum of the number of the first to third search results does not fall below the predetermined reference value, the process proceeds to step S110 to search the first to third search results for the total search. If the sum of the number of the first to third search results is less than the predetermined reference value, the process proceeds to step S107.

In step S107, the query matching system separates the original query token using a predetermined engine indexer, searches the database using the token, and generates a fourth search result.

In step S108, the query matching system determines whether the sum of the number of the first to fourth search results is less than the reference value. As a result of the determination in step S108, when the sum of the number of the first to fourth search results does not fall below the predetermined reference value, the flow advances to step S110 to search the first to fourth search results for the total search. If the sum of the number of the first to fourth search results is less than the predetermined reference value, the process proceeds to step S109.

In step S109, the query matching system generates a fifth search result including at least one of the tokens in the database. That is, the query matching system performs a search for all words containing at least one token if the previous search result is less than a predetermined reference value.

In operation S110, the query matching system outputs at least one of the first to fifth search results as a total search result that matches the original query.

3 is a diagram illustrating an example of a search result screen that may be output by performing a query matching method according to the present invention.

Conventional shopping mall mediation server has a general database search system, it is impossible to search for a matching product model if the product registrant registered through the entry shopping mall server is incorrect or the model name field is empty. Reference numeral 301 shown in FIG. 3 shows a search result according to the prior art. In the prior art, as shown by reference numeral 301, when the model name field is empty, the matching operation has to fail.

However, according to the present invention, even when the model name field is empty, the brand name 302 corresponding to the original query is processed according to various search logic shown in FIG. The product model matching 302 can be accurately retrieved.

4 is a diagram illustrating another example of a search result screen that may be output by performing a query matching method according to the present invention.

Conventional shopping mall mediation server has a general database search system, there is a problem that it is impossible for the product registrant to find a matching product model when there is a typo in the product name of the product registered through the entry shopping mall server.

However, according to the present invention, even when there is a typo in the product name, since the product name 401 corresponding to the original query is processed according to various search logic shown in FIG. 1, the search is performed. The product model matching 401 may be accurately searched and output.

Meanwhile, the query matching method illustrated in FIG. 1 may be performed in a predetermined product information registration system having a query matching system according to the present invention, and the search index included in the database may include a plurality of search fields relating to a product model. It may include, the product model may be a product model classified into luxury series.

In the case of product models classified as luxury series, the product model names are mostly numbers or a combination of alphabets and numbers, and in the case of Korean, most of them are merely descriptions of products. It is highly likely that a very suitable search result is output when the search is performed accordingly.

The query matching method according to the present invention may be implemented in the form of program instructions that can be executed by various computer means and recorded in a computer readable medium. The computer readable medium may include program instructions, data files, data structures, etc. alone or in combination. Program instructions recorded on the media may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well-known and available to those having skill in the computer software arts. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tape, optical media such as CD-ROMs, DVDs, and magnetic disks such as floppy disks. Magneto-optical media, and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. The medium may be a transmission medium such as an optical or metal wire, a waveguide, or the like including a carrier wave for transmitting a signal specifying a program command, a data structure, or the like. Examples of program instructions include not only machine code generated by a compiler, but also high-level language code that can be executed by a computer using an interpreter or the like. The hardware device described above may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

Hereinafter, a query matching system according to the present invention will be described.

5 is a block diagram illustrating a configuration of a query matching system according to an embodiment of the present invention. The query matching system 500 according to the present exemplary embodiment may perform a search process on a predetermined database including a search index.

As shown in FIG. 5, the query matching system 500 according to the present exemplary embodiment may include a first search unit 501, a second search unit 502, a third search unit 503, and an output unit 504. Include.

The first search unit 501 searches the database using the first query word from which a space or a special character is removed from the original query word, and generates a first search result.

For example, the first search unit 501 generates the first query by removing '', '/', '-', and '+' from the original query, and searches the database to search the database. The first search result may include.

When the number of the first search results is less than a predetermined reference value, the second search unit 502 divides the original query word into a plurality of words according to a space, and the first letter and the last letter of the plurality of words are alphabets or numbers. And search the database using a word including at least one number as a second query word and generate a second search result.

For example, when the original query word is "tag heuer sunglass [1000002538]", the second search unit 502 may determine '1000002538' as a second query word and perform a search.

As another example, when the original query is “[6 months interest-free installment] ferragamo bracelet [34-2821_esp], the second search unit 502 may determine '34_2821_esp' as the second query and perform a search.

In this case, the second search unit 502 generates the second search result by sorting the plurality of second query words in descending order according to the length, and searching the database according to the sorted order. can do.

When the sum of the number of the first search results and the number of the second search results is less than the reference value, the third search unit 503 generates the plurality of tokens by separating the second query word into a space or a special character, The database is searched using a third query word that connects the tokens to a space, and a third search result is generated.

For example, the third search unit 503 returns the second query word as '/', '-', '+', '_', '.' Tokens can be generated by separating Also, the third search unit 503 may generate the third search result by repeatedly searching the database while reducing the number of tokens included in the third query word from the rear end of the third query word. have.

For example, when the third query is "34-2821_esp", the third search unit 503 may repeatedly search the database in the order of '34 2821 esp ', '34 2821', and '34'. have.

The output unit 504 outputs at least one of the first search result, the second search result and the third search result as a total search result matching the original query word.

Meanwhile, the query matching system 500 according to the present embodiment may be included in a predetermined product information registration system and operate, and the search index included in the database may include a plurality of search fields related to a product model. The product model may be a product model classified into a luxury series. In the case of product models classified as luxury series, the product model name is mostly a number or a combination of alphabets and numbers, and in the case of Korean, most of them are merely descriptions of products, and thus, a query matching system according to the present embodiment ( When a search according to 500) is performed, a very suitable search result is likely to be output.

6 is an internal block diagram of a general purpose computer device that may be employed to perform a query matching method in accordance with the present invention.

Computer device 600 includes one or more processors 610 connected to a main memory including random access memory (RAM) 620 and read only memory (ROM) 630. The processor 610 may also be called a central processing unit (CPU). As is well known in the art, the ROM 630 serves to transfer data and instructions to the CPU unidirectionally, and the RAM 620 typically transfers data and instructions bidirectionally. Used to. RAM 620 and ROM 630 may include any suitable form of computer readable media. Mass storage 640 is bidirectionally coupled to processor 610 to provide additional data storage capability, and may be any of the computer readable recording media described above. The mass storage device 640 is used to store programs, data, and the like, and is a secondary memory device such as a hard disk which is generally slower than the main memory device. Certain mass storage devices such as CD ROM 660 may be used. The processor 610 may include one or more input / output interfaces such as a video monitor, trackball, mouse, keyboard, microphone, touchscreen display, card reader, magnetic or paper tape reader, voice or handwriting reader, joystick, or other known computer input / output device. 650 is connected. Finally, the processor 610 may be connected to a wired or wireless communication network through the network interface 670. Through this network connection, the procedure of the method described above can be performed. The apparatus and tools described above are well known to those skilled in the computer hardware and software arts. On the other hand, the hardware device described above may be configured to operate as one or more software modules to perform the operations of the present invention.

As described above, although the present invention has been described with reference to limited embodiments and drawings, the present invention is not limited to the above embodiments, and those skilled in the art to which the present invention pertains various modifications and variations from such descriptions. This is possible.

Therefore, the scope of the present invention should not be limited to the described embodiments, but should be determined not only by the claims below but also by the equivalents of the claims.

According to the present invention, it is possible to break away from the conventional database search method that provides only the search result exactly including the original query word, and process the original query word through a plurality of steps according to various search logics, and thus have a high probability of matching the original query word. Provided are a query matching method and system capable of outputting a number of search results.

According to the query matching method and system according to the present invention, in loading and registering the product information registered in the shopping mall server in the shopping mall mediation server, it is possible to realize the automation of the product registration / matching operation and significantly reduce the related work resources.

According to the query matching method and system according to the present invention, by applying different search logic according to the characteristics of the product corresponding to each query, it is possible to more efficiently search for a product model having a high probability of matching the query.

According to the query matching method and system according to the present invention, by extracting the appropriate query from the original query, which is the product name entered by the product registrant in the shopping mall server, and by searching the product model matching the product through the extracted query, The product registration / matching operation may be performed in advance in the product registration process in the shopping mall server, and a separate manual operation for product registration / matching may be unnecessary when the product is subsequently registered in the shopping mall mediation server.

Claims (11)

In the query matching method for a predetermined database including a search index, Searching the database using the first query word from which a space or a special character is removed from the original query word, and generating a first search result; When the number of the first search results is less than a predetermined reference value, the original query word is divided into a plurality of words according to a space, and the first letter and the last letter of the plurality of words are alphabets or numbers, and include at least one number. Searching the database using the word as a second query, and generating a second search result; When the sum of the number of the first search result and the number of the second search result is less than the reference value, the second query word is separated into a space or a special character to generate a plurality of tokens, and connects the tokens to a space. 3 searching the database using a query and generating a third search result; And Outputting at least one of the first search result, the second search result and the third search result as a total search result matching the original query word; Query matching method comprising a. The method of claim 1, When the sum of the number of the first to third search results is less than the reference value, the original query word is separated into tokens using a predetermined engine indexer, the database is searched using the tokens, and a fourth search result is generated. Further comprising: And the total search result comprises the fourth search result. The method of claim 2, Generating a fifth search result including at least one of the tokens in the database when the sum of the number of the first to fourth search results is less than the reference value, The total search result includes the fifth search result. The method of claim 1, The search index includes a plurality of search fields including a product model name field and a keyword field, The step of searching the database using the third query and generating a third search result is limited to a product model name field and a keyword field of the search index. . The method of claim 1, The step of searching the database with the second query and generating a second search result, Sorting the plurality of second queries in descending order according to length; And Generating the second search result by performing a search on the database according to the sorted order Query matching method comprising a. The method of claim 1, The step of searching the database using a third query and generating a third search result, Generating the third search result by repeatedly searching the database while reducing the number of the tokens included in the third query word from a rear end of the third query word. . The method of claim 6, The step of searching the database using a third query and generating a third search result, If there is a search result during the execution of the process, generating the third search result and stopping the process. The method of claim 1, The query matching method is performed in a predetermined product information registration system, The search index includes a plurality of search fields for product models, The product model is a query model matching method, characterized in that the product model classified into luxury series. A computer-readable recording medium in which a program for executing the method of any one of claims 1 to 8 is recorded. A query matching system for performing query matching on a predetermined database including a search index, A first search unit for searching the database using a first query word from which a space or a special character is removed from the original query word, and generating a first search result; When the number of the first search results is less than a predetermined reference value, the original query word is divided into a plurality of words according to a space, and the first letter and the last letter of the plurality of words are alphabets or numbers, and include at least one number. A second search unit for searching the database using the word as a second query word and generating a second search result; When the sum of the number of the first search result and the number of the second search result is less than the reference value, the second query word is separated into a space or a special character to generate a plurality of tokens, and the tokens are connected to a space. A third search unit which searches the database using a third query and generates a third search result; And An output unit configured to output at least one of the first search result, the second search result, and the third search result as a total search result matching the original query word Query matching system comprising a. The method of claim 10, The third search unit, And generating the third search result by repeatedly searching the database while reducing the number of tokens included in the third query word from a rear end of the third query word.

Images