KR20020034547A - Method for searching database by using inverse data type - Google Patents

Abstract

PURPOSE: A method for searching a database by using an inverse data type is provided to offer information to a client by promptly searching the information corresponding to a query language interlocked with a wild card inputted without the head of a terms. CONSTITUTION: The method comprises steps of storing a store name as an inversed store name in a search terms database, searching the information related with a search terms interlocked with a wild card inputted by a client from the inversed store name stored in the search terms database by converting the search terms into a machine language read by a computer and regarding the machine language as a new inverse type search terms, and selecting the sought inversed store names and outputting the original store name corresponding to the selected inverse type search terms to the client.

Description

Database search method using inverse data type {METHOD FOR SEARCHING DATABASE BY USING INVERSE DATA TYPE}

The present invention relates to a database search method using an inverse data type. In particular, a search corresponding to a query by applying an inverse data type to a query having a wildcard (*) linked to a word without knowing the previous word is applied. It's about how to make it fast.

In general, a database (hereinafter, referred to as DB) refers to a collection of operational data that is integrated and stored in duplicate in order to share various application systems. That is, a program that collects a plurality of data and generates and manages a DB stored in a form that can be processed by a computer, and extracts an answer to a user's query from the DB described above. Abbreviated DBMS). Oracle, Infomix, MySQL, and MS-SQL are typical DBMSs currently on the market.

However, most of these DBMSs are produced in English-speaking countries, so there are some parts that do not match the characteristics of Korean. In other words, searching only a specific word is not a problem, but a plurality of problems occur when searching for a complex word.

In other words, in the case of the "query" with the wildcard (*), the index can be used for a quick search, but in many cases, the form of the "* query" with the wildcard (*) is preceded. The query is made with.

When the wildcard (*) is in front of the character, it will be described with reference to the chart shown in FIG. 1 to explain how to search the database.

That is, when a "* pizza house" type search word is input from the client, a total of 67 comparison searches are performed as shown in FIG. 1 through a complicated process to search for all words ending with the word pizza place in the DB.

In order to describe in more detail, the "* pizza" type search term will be described with reference to the chart of FIG. 2 and the flowchart of FIG. 3, and the first letter (A11) of record 1 in the chart in the search word DB is described. Read (S301), check whether A11 is "blood" (S302), if "blood", check if A12 is "child" (S303), if "child", check if A13 exists (S304) If it does not exist, record 1 is selected (S305) and output to the client. Here, if A12 is not " child ", A12 is read (S306), and A12 is determined to be blood (S307). If A13 is present to be checked (S304), record 2 is recorded. It reads (S312) and repeats from the step of checking whether A21 is "blood" (S313).

If it is not " blood " in the step of checking whether A11 is " blood ", A12 is read (S306), A12 is " blood " If it is checked (S308), if it is "child", it is checked whether A14 exists (S309). If it is not present, record 1 is selected and outputted to the client (S310). Here, if A13 is not " character ", A13 is read (S311), and A13 is determined to be blood, and if A14 is present at step S309, if present, record 2 is read ( S312), A21 is repeated from the step of checking whether or not "blood" (S313).

The above process is performed up to the first character (A31) (S314), ..., the first character (Ai1) (S315) of record N, and finally, repeatedly performed up to the end character (Aij) of record N As the record N (S316) is selected, the search result for the "* pizza" type is output to the client.

As described above, the complicated process described is for one record, and if the same process is repeated for all records, the search speed is significantly reduced as a large number of read and compare operations are performed. There was a problem.

Accordingly, the present invention has been made to solve the above-described problem, and its object is to search for a query corresponding to a query by applying an inverse data type to a query in the form of a query with a wildcard (*) that does not know the previous word. It provides a database search method using an inverse data type that can quickly retrieve a result and output it to a client.

In order to achieve the above object, the present invention provides a method for searching a database using an inverse data type, the method comprising: storing in a search word database in a mutually inversed relation to each other in record units; In the stored state, if a search word linked with a wild card (*) is input from the client, the computer converts it into a machine language that can be understood by the computer, and then takes the machine language as a new inverse search form and stores it in the search word database. Searching through inversed trade names; Selecting a searched inverse mutual result and reading the original mutual name corresponding to the selected inverse mutual result and outputting the result to the client.

1 is a diagram illustrating a data type chart for a conventional database search.

2 is a diagram illustrating a data table chart for searching a conventional database.

3 is a flowchart of a method of performing a database search when a conventional wildcard (*) is preceded by a character.

4 is a block diagram for performing a database search method using an inverse data type according to the present invention;

5 is a diagram illustrating a data table chart for searching a database with an inverse data type when a wild card (*) is in front of a character according to the present invention.

6 is a flowchart illustrating a database searching method using an inverse data type when a wild card (*) is in front of a character according to the present invention.

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

10: Client 20: Database Search System

21: query receiving unit 23: conversion unit

25: query control unit 30: query database (DB)

A: Internet

Hereinafter, with reference to the accompanying drawings will be described in detail an embodiment according to the present invention.

Referring to FIG. 4, as a block diagram for performing a database searching method using an inverse data type according to the present invention, a client 10, a database (hereinafter, abbreviated as DB) searching system 20 and , Search word DB 30.

The client 10 is a plurality of users who use a personal computer and connect to the Internet A using a web browser (not shown) mounted in the above-described window program in the personal computer. After connecting to the Internet (A) through, and connected while logged in (log in) to the DB search system 20 via the connected Internet (A), through the connected DB search system 20, the desired search words, that is, Enter a search term of type "* pizza".

The DB search system 20 includes a search term receiver 21, a converter 23, and a query controller 25.

The search word receiver 21 provides the converter 23 a search word input from the client 10 through the Internet A, that is, a "* pizza collection" type search word.

The converting unit 23 converts a search word provided from the search word receiving unit 21, that is, a "* pizza collection" type search word into a machine language that can be understood by a computer, and provides it to the query control unit 25.

The query control unit 25 converts the machine language of "* pizza house" type provided from the conversion unit 23 into the inverse in the search word DB 30 using a new inverse query word, that is, "pizza blood *" form. After searching through the inverse data column stored as a type, the content of the original field (mutual) matched with this is selected and outputted to the client 10 through the Internet A.

The search word DB 30 stores a plurality of data, and inverts the form of the existing data and adds the data in one column. That is, the search word DB 30 replaces the existing data code (code) with the original field (mutual), that is, in the case of the word "pizza", the code corresponding to "p" and the code corresponding to "za" are replaced. Save them by swapping them together and adding them as a column. In this case, when a certain content is stored in the search word DB 30, an inverse type is generated automatically or manually and exists as an inverse field (mutual name) on the same record.

When a wild card (*) shown in FIG. 5 is preceded by a character, the inverse data type will be described with reference to a data table chart for searching a DB.

That is, the operator who manages the DB search system 20 provides an inverse type to a data type stored in the search word DB 30 as shown in FIG. 5, thereby indexing or hashing the inverse type. It lays the foundation for applying and proposes a structure that enables quick retrieval.

Here, the inverse type refers to a form in which each form stored in the existing search word DB 30 is inverted and stored. In other words, the code stored in the search word DB 30 is opposite to the original field (mutual), for example, in the case of the word "pizza", the code corresponding to "p" and the "child" It means swapping the code.

That is, when searching for "* pizza house" type in the prior art, a total of 67 comparison searches are performed through a complicated process. As shown in FIG. 5, the "house" is applied using a column to which an inverse type according to the present invention is applied. If you search for "Japi *" type, you will be able to search the information you need with only 14 comparative searches. Thus, including an inverse type of data field reduces to one quarter of the comparison and search operations.

With reference to the flowchart of FIG. 6, a wildcard (*) according to the present invention will be described in detail with respect to a database search method using an inverse data type.

First, the operator managing the DB search system 20 manages while storing a plurality of data in the search word DB (30). At this time, the operator inverts the form of the existing data stored in the search word DB 30 and adds it to one column and stores the same as an i-Data (inter) column inversed with respect to the mutual column as shown in FIG. 5. Step 601).

That is, an existing data code is stored in the search word DB 30 as opposed to the original field (mutual). For example, the word "pizza" corresponds to a code corresponding to "p" and "child". The code is replaced with each other and stored in one column. In this case, when a certain content is stored in the search word DB 30, an inverse type is generated automatically or manually and exists as an inverse field (mutual name) on the same record.

In the above state, the client 10 accesses the Internet A using a web browser (not shown), and then logs in to the DB search system 20 via the connected Internet A. in) and completes the authentication procedure, and inputs a desired search word through the DB search system 20, that is, a search word of "* pizza collection" type (step 602).

The search term reception unit 21 in the DB search system 20 provides a search term input from the client 10 through the Internet A, that is, a search word of a "* pizza collection" type to the conversion unit 23 (step 603). The converting unit 23 converts a search word provided from the search word receiving unit 21, that is, a "* pizza collection" type into a machine language which can be understood by the computer, and provides it to the query control unit 25 (step 604).

The query control unit 25 converts the machine language of "* pizza house" type provided from the conversion unit 23 into the inverse in the search word DB 30 using a new inverse query word, that is, "pizza blood *" form. The search is made through an inverse data column stored as a type (step 605).

That is, referring to the i-Data (mutual) portion shown in FIG. 5, the record 1 is read to determine whether the first character of "Zafiholtanaga" and "home" are the same (step). 606).

In the determination step 606, since "child" and "house" are not the same, record 2 is read to determine whether "bu" and "house", which are the first characters of the "Bon-dong Dong-unjin Hyo-min-guk-guk", are the same (step 607). .

In the determination step 607, since "part" and "house" are not the same, record 3 is read to determine whether "Seol" and "house", which are the first characters of the Founding Empire, are the same (step 608).

Since "Sol" and "House" are not the same in the determination step 608, the record 4 is read to determine whether "Hall" and "House", which are the first characters of the "Holding Western Republic," are the same (step 609). When the record 7 is completed through this process, the record 8 is read to determine whether the first character of the "home pizza pizza" and "home" are the same (step 610).

In the determination step 610, since "home" and "home" are the same, it is checked whether the next character "child" and "child" are the same (step 611).

In the checking step 611, since "child" and "child" are the same, it is checked whether the next character "blood" and "blood" are the same (step 612).

In the check step 612, since " blood " and " blood " are the same, record 8 is selected (step 613).

The query control unit 25 reads the next record 9 and determines whether the first character of the "home piercing machine" and "home" are the same (step 610).

In the determination step 610, since "home" and "home" are the same, it is checked whether the next character "child" and "child" are the same (step 611).

In the checking step 611, since "child" and "child" are the same, it is checked whether the next character "blood" and "blood" are the same (step 612).

In the check step 612, since " blood " and " blood " are the same, record 9 is selected (step 614).

Finally, the query control unit 25 reads the next record 10 and determines whether the first character of the "Jumbon blood donor seedling" and the "house" are the same (step 615).

Since "dot" and "house" are not the same in the determination step, the process of reading and determining the next record is continuously performed. In FIG. 5, only the record 10 is illustrated, and as described above, The original field (mutual) that matches record 9, that is, the "shadow pizza collection" of record 8 and the "giraffe pizza collection" of record 9, is read and output to the client 10 via the Internet A ( Step 616).

On the other hand, if it does not automatically support the inverse type, since it does not support the storage and retrieval of inverse type data, it must be designed to be processed in the DB search system 20, the operator managing the DB search system 20 First, it should be designed to generate an inversed field when interworking with the search word DB (30).

Therefore, if the wildcard (*) is "* query" type in front of the character, the new inverse type "word quality *" is used to search through the inverse data column stored as the inverse type in the search word DB (30). Search efficiency and speed can be increased.

Therefore, the present invention can increase the search efficiency by quickly searching the search results corresponding to the query by applying the inverse data type to the query of the query form linked to the wild card (*) that does not know the previous word, Search speed can be increased, user convenience due to increase of search efficiency and speed of various Korean web search engines, increase of work efficiency due to increase of search efficiency and speed of companies using DB, cooperation with DBMS developer It is effective to expect foreign currency acquisition by creating relationships.

Claims (4)

In the database search method in a database search system, Storing the search terms in the search terms database inverse to each other in record units; In the stored state, when a search word linked with a wildcard (*) is input from a client, the search word is converted into a machine language that can be understood by a computer, and then the machine language is taken as a new inverse type search word. Retrieving through an inverse traded name stored in a database; Selecting the searched inverse mutual result and reading the original mutual name corresponding to the selected inverse mutual result and outputting the original mutual name to the client. The method of claim 1, wherein the new inverse search term form is: And a "* search word" type search word input from the client in an inverse form of "awkward search *" type. The method of claim 1, wherein the inversed mutual is And searching and storing the data in one column of the data table of the search word database. The method of claim 1, When searching through the inverse mutual column, the database search method using an inverse data type, characterized in that for searching in a statistical pattern method.