CN1204094A

CN1204094A - Fuzzy input inquiry processing method for data base

Info

Publication number: CN1204094A
Application number: CN 98116377
Authority: CN
Inventors: 胡筱罡; 张景嵩
Original assignee: Inventec Corp
Current assignee: Inventec Corp
Priority date: 1998-07-22
Filing date: 1998-07-22
Publication date: 1999-01-06
Anticipated expiration: 2018-07-22
Also published as: CN1154949C

Abstract

The present invention relates to a fuzzy input inquiry processing method of data base, can be used on CCITT keyboard or other similar keyboard for inputting inquiry data. Firstly, using the keyboard to receive inputted word string, then according to the sequence of all inputted codes contained in the inputted word string, comparing every inputted code of the inputted word string with identical position character in the index entry recorded in the data base to find the record matching with corresponding relationship,and then displaying the information related to the record, for example index entry portion. If the number of matched records exceeds one, selecting one from them so as to find the record required for inquiry.

Description

The fuzzy input inquiry processing method of database

The present invention is relevant for a kind of treatment technology of data base querying, particularly utilize CCITT (the Consultative Committee for International Telephoneand Telegraph overseas call telegram board of consultants) keyboard that often adopts in regular phone machine or the electronics account device, database is blured the querying method of input (fuzzy input).

The CCITT keyboard is often adopted as input media by telephone set and better simply electronics account device.Fig. 1 promptly represents general CCITT keyboard arrangement plan.As shown in the figure, have 12 buttons on the CCITT keyboard at least, be respectively 0～9 numerical key and special symbol " * " and " # ".Wherein, above numerical key 2～9, indicating 3 to 4 English alphabets respectively.For instance, numeral " 2 " corresponds to English alphabet " ABC ", and numeral " 3 " then corresponds to English alphabet " DEF ", and the rest may be inferred for all the other.So, the CCITT keyboard on input structure, the typical keyboards of the many inputs of a kind of individual palpation key correspondence of can saying so.In general, the mode of utilizing numerical key indicated on the CCITT keyboard English alphabet to import has two kinds.First kind is to utilize the relation between numerical key and the English alphabet directly to import, and this mode generally is to use in the memory of telephone number, directly utilizes significant English-word to remember telephone number to make things convenient for the user.But telephone keypad does not need this mode is done any special processing.Another kind of mode then is to utilize the actual data information of CCITT keyboard input, the part that this that is institute of the present invention desire are handled.

Will utilize the CCITT keyboard to carry out data input traditionally, mainly be to reach by the mode of final election button.For instance, numerical key " 2 " is being represented English alphabet " A ", " B ", " C " respectively.When the user clicks numerical key " 2 ", represent inputting English letter " A ", represent inputting English letter " B " when double clicking, represent inputting English letter " C " during by three times.If during the next letter of input, generally be to click the key that moves to right, the next letter of input again.In the CCITT keyboard, normally with " * " key definition for moving to left key, " # " key definition is the key that moves to right.Table one is to be example with reality input English name-to " ANDERSON ", and general user's sequence of operation is described.

Table one

Letter	The input button	Press bond number
“A”	" 2 "+key moves to right	2
“N”	" 6 "+" 6 "+key moves to right	3
“D”	" 3 "+key moves to right	2
“E”	" 3 "+" 3 "+key moves to right	3
“R”	" 7 "+" 7 "+" 7 "+key moves to right	4
“S”	" 7 "+" 7 "+" 7 "+" 7 "+key moves to right	5
“O”	" 6 "+" 6 "+" 6 "+key moves to right	4
“N”	“6”+“6”	2
The bond number of feeling the pulse with three fingers simulataneously		25

As shown in Table 1, utilize English name-to that comprises 8 letters of CCITT keyboard input, the user just must press at least 25 buttons.Therefore, unusual inconvenience in the operation is not only elongated input time, also is easy to input erroneous data simultaneously.Hence one can see that, is necessary to provide a kind of new CCITT keyboard input pattern, can allow the user operate the CCITT keyboard more efficiently and import.

Have in view of that, fundamental purpose of the present invention provides a kind of CCITT of utilization keyboard or other similar keyboard input inquiry processing method of data, can reduce the number of times that needs button when practical operation, can shorten operation simultaneously and go up the needed time.

According to above-mentioned purpose, the invention provides a kind of fuzzy input inquiry processing method of database, in the database storage device applicable to similar telephone set and electronics account device or the like.Except being applied on the above-mentioned CCITT keyboard, in addition, be lower than for any enter key (or actual input code) quantity on the keyboard of character code quantity of database, can be suitable for.In these input keyboards, each enter key (or input code) all corresponds to one or more character.This fuzzy input inquiry processing method has comprised following step.At first, utilize keyboard to receive an input word string, in this input word string, comprised at least one input code.Then, import each input code order that word string comprised according to this, compare the character of same position in the index entry that writes down in this each input code of importing word string and the database in regular turn, find out the record that all meet corresponding relation, demonstrate the relevent information of record again, for example the index entry part.If the record that meet this moment surpasses one, just, find out the record that to inquire about by selecting one in the recording indexes item that shows.In addition, in order can to carry out more quickly in above-mentioned comparison procedure, so the present invention has proposed a kind of structure of character code in addition.Each character code comprises a code value district and a code area, wherein, the code value district be with since represent the pairing input code of this character.Therefore, when comparing, can directly utilize the association between this code value district judgement input code and the character code, acceleration relatively.

For above-mentioned purpose of the present invention, characteristic and advantage can be become apparent, preferred embodiment cited below particularly and conjunction with figs. are described in detail below:

Fig. 1 represents the planar configuration of general CCITT keyboard.

Fig. 2 represents the processing flow chart of fuzzy input inquiry in the first embodiment of the invention.

The detail flowchart of comparison step in Fig. 3 presentation graphs 2.

Fig. 4 represents the character code structural representation of data character inside the library among second embodiment.

Fig. 5 represent each character among second embodiment the corresponding tables of corresponding character code.

Database fuzzy input inquiry processing method of the present invention mainly is at utilizing CCITT keyboard or other similar keyboards, in the input inquiry processing method of data.CCITT keyboard and other similar keyboards are characterised in that, utilize less button (or input code), are used for a fairly large number of character of corresponding input.With the CCITT keyboard is example, mainly is 8 buttons that utilize numerical key 2～9, imports 26 English alphabets.Therefore, on corresponding relation, the situation of corresponding at least one or more characters of each button just appears.Fuzzy input inquiry processing method of the present invention mainly is exactly to solve the problem of this class keyboard in input.In following embodiment, mainly be to be example, but for knowing this operator, the described method of embodiment can be applicable on the keyboard of other these classes easily with the CCITT keyboard.[first embodiment]

At first be illustrated at the database features of general application CCITT keyboard as the input inquiry keyboard.As previously mentioned, CCITT keyboard or other similar keyboards generally are to be applied on telephone set or the better simply electronics account device, are used for inquiring about database wherein.And install interior database by these is not too big, relatively more simple on the data structure yet, for example telephone directory or the like.This class database is made of several note takings, and comprises an entry index item at least in every notes record, compares than usefulness as input inquiry.With the phonebook database is example, and every notes record mostly comprises two, and one is the name index entry, and another then is its telephone number.When inquiring about, the user can import name index item wherein, and shows the recorded content that will look for again after retrieval.

In the whole process of utilizing CCITT keyboard input inquiry index data, present embodiment and known techniques have 2 different.First is operator's a input mode.In known techniques, the user must repeat to press corresponding button for several times to each letter that need import, and wherein minimum situation is to press button twice, the promptly once corresponding enter key and the key that once moves to right.And in the present embodiment, the operator is each only need to press one-touch.With above-mentioned input English name-to " ANDERSON " is example, and known techniques need be pressed at least 25 buttons, then is that the digital ammonium key of directly pressing 8 correspondences gets final product in the present embodiment, that is " 26337766 ".Another then is the processing mode difference of input data query.Below promptly cooperate Fig. 2 that the handling procedure of present embodiment at fuzzy input inquiry is described.

Fig. 2 represents the processing flow chart of fuzzy input inquiry in the present embodiment.At first, capture the input word string (S1) that the user is imported by the CCITT keyboard in regular turn, whole input word string is finished with each alphabetical pairing numerical key of individual character to be checked.Then, according to input each enter key that word string comprised, corresponding characters (S2) in index entry of each record of comparison database in regular turn.For instance, when the user presses first button " 2 " of individual character to be checked " ANDERSON ", promptly relatively first character of each index entry whether corresponding to this button, i.e. " A " or " B " or " C ".When pressing second button " 6 ", promptly relatively second character of each index entry whether corresponding to this button, i.e. " M " or " N " or " O ".The rest may be inferred for all the other.After the comparison of finishing each enter key, all data item that meet are stored into a search process buffer zone (S2) that pre-sets.Because embodiment adopts the mode of fuzzy input to carry out, and might find multinomial record corresponding to a certain input word string, does not therefore guarantee directly to find the record that will search.But, just as discussed previously, because this class database itself is not very big, even bigger database, different index item (for example name) can take place, and to correspond to the probability of identical input word string simultaneously not high yet.So even the record that meets surpasses one, actual quantity can be not too many yet.Therefore, will respectively write down related data in the search process buffer zone again, for example the name index item is presented at (S3) on the display device.At this moment, if when the record that shows surpasses one, just directly select one of them (S4), to finish the operation of search by the user.

In treatment scheme shown in Figure 2, key is comparison step (S2), below promptly describes the detailed process of comparison step 2 in the present embodiment in detail.The detail flowchart of comparison step S2 in Fig. 3 presentation graphs 2.In step S1, the user can import each enter key in regular turn, so when the beginning of step S2, can note the order (S21) of each enter key of input word string earlier.In follow-up processing, first enter key of input word string and other enter keies meeting separate processes, the purpose of separate processes is in order to set up the data in the search process buffer zone.When entering input inquiry at the beginning, do not have any data in the search procedure buffer zone, so when handling first enter key, must set up the data of search procedure buffer zone.At first, according to the input word string, judge whether to be first enter key (S22).If first character (S23) of each recording indexes item in the comparison database judges whether to correspond to first enter key of being pressed (S24) in regular turn.If meet corresponding relation between the two, the index entry that just will meet record stores (S25) in the search process buffer zone into, does not need to be stored in the search process buffer zone if just meet.Judge whether that then entire database all finished search (S26),, then get back to step S23 and proceed comparison if do not finish as yet; If finish, then get back to step S22 and continue other enter key is handled.After completing steps S23 handles to first enter key of step S26, stored the record of part in the search procedure buffer zone, and during follow-up processing, just can directly compare with the record in the search process buffer zone, do not need entire database is compared, therefore can reduce the number of times of comparison.In addition, if first enter key can't find corresponding index data, the practice in the present embodiment is that the index entry with whole all records of data bank all is presented on the display device, is browsed or is withdrawed from by user oneself selection.

When handling other enter keies, roughly the same with the situation of above-mentioned processing first enter key basically.So the index entry that difference stores in directly to the search process buffer zone compares, but not entire database, when the enter key that compares at present is not first enter key (S22), can relatively respectively write down corresponding characters (S27) in each enter key and the search process buffer zone in regular turn, to judge whether corresponding to the same position enter key of being pressed (S28).When if both corresponding relations meet, then keep the data item (S29) in buffer zone at present; If but when both corresponding relations do not meet, then delete this item number according to (S30).Above-mentioned processing is till whole buffer zone search finishes (S31).By comparison to each enter key, can reduce the data number in the search procedure buffer zone gradually, after all enter keies are all finished comparison,, finish the processing that input is searched again by selecting one in the record of user by quantity very limited (being generally 1).

As mentioned above, when relatively importing each enter key of word string, system all can upgrade the record in the search procedure buffer zone.Step display S3 in Fig. 2 then can be shown according to the record that stores in the search procedure buffer zone, and the user just can clearlyer in input process recognize present search progress, even can find required data in advance before input is not finished.

Therefore, by the fuzzy input inquiry processing procedure that is disclosed in this example, it is very simple that the user can become on loading routine, and whole query script can be grasped simultaneously, therefore effectively improved the ability of CCITT keyboard on the input inquiry data.Be example with input inquiry name individual character " ANDERSON " in the table two, tabular goes out first embodiment of the invention and the difference of known techniques on input characteristics.Table two

Item compared	Known techniques	First embodiment
Touch potential	25 times	8 times
Input results	Determine	Fuzzy
User's input mode	Complexity is very easy to make mistakes	Directly, be difficult for makeing mistakes

As shown in Table 2, be better than the known techniques part in the first embodiment of the invention, mainly be to reduce the number of times of user's required button when the input inquiry data.On the other hand, because the mode of user's button becomes very direct, as long as carry out in proper order according to the pairing button of character, therefore the probability of wrong input can reduce greatly during button.Therefore,, can simplify the loading routine of user, better man-machine interface is provided at the class keyboard of operation CCITT by the fuzzy input inquiry processing method of first embodiment.

[second embodiment]

Present embodiment is roughly the same with the processing mode of first embodiment basically, and difference only is on the form of character code.On the saving format of general data (being mainly literal), mainly be to store by ASCII (American Standard Code of AmericanStandard Codes for Information Interchange message exchange).ASCII character generally is to represent with 7 bits, but the overwhelming majority uses with 8 bits at present.ASCII character mainly is alphabetically layout in addition on the coding of English alphabet.Therefore, if utilize ASCII to store the data-base content of first embodiment, and fasten can be comparatively loaded down with trivial details in the pass of judging character and enter key.With digital input key " 2 " and its corresponding English alphabet " A ", " B ", " C " is example, when first character of index entry to a certain record compares, at first to judge whether to be " A ", judge whether again to be " B ", judge whether again at last to be " C ".That is to say that for the comparison of single index entry character, just must carry out at least three times, this manner of comparison can reduce the speed of search certainly.Present embodiment is mainly done further improvement at this part exactly again.

The mode that present embodiment adopted is a saving format of revising the data character inside the library, and it can be compared more quickly.At first with reference to the standard CC ITT keyboard format among the figure 1.In the CCITT of Fig. 1 keyboard, have 12 buttons, comprise 10 numerical keys (0～9) and two special symbols, and in the present embodiment, mainly be the saving format that comes definition character at 10 buttons of numeral 0～9.In detail, be exactly saving format with each character, directly be divided into two and can distinguish the zone of identification in addition, one of them is exactly directly to utilize the pairing button of this character (being numerical key 0～9) code value to represent.Therefore during with the stored character of this saving format, can directly utilize the code value of saving format to judge whether in processing when handling procedure corresponding to a certain input button.

In Fig. 4, then illustrate in greater detail the character code structural representation that present embodiment data character inside the library is adopted.As shown in the figure, each character code 10 remains by 8 bits and is constituted, and each bit is denoted as bit 0～bit 7 respectively.The saving format of each character code 10 can be divided into two parts, and one is code value district 10a, i.e. bit 7～bit (totally 4 bits); Another is numbering area 10b, i.e. bit 3～bit 0 (totally four bits).Enumerate the example that several store character code in addition at Fig. 4.For example the character code of character " B " is 22 (HEX) in the present embodiment, then is 00100010 with binary representation, and wherein preceding 4 bits are represented code value district 10a, and back 4 bits are represented numbering area 10b.In addition, the character code of character " C " is 23 (HEX), then is 00100011 with binary representation, and its code value district 10a with character " B " is identical, therefore all is to correspond to button " 2 ", and is then different at numbering area 10b.The pairing digital keys of character " K " is " 5 " in addition, and character code is 52 (HEX), and its code value district 10a is different with character " B " just.

Sum up the above, code value district 10a is above-described button identification district, is used for representing the pairing input code code value of this character.For instance, present embodiment is that therefore, all correspond to the character of button " 2 " with " 2 (HEX) " expression button " 2 ", as " A ", " B ", " C " (please refer to the CCITT keyboard among Fig. 1), its code value district 10a (bit 7～bit 4) is just be set at " 2 (HEX) ".Numbering area 10b is used for the number value of corresponding this character in pairing input code.That is to say that " A ", " B ", " C " of last example can set different values for to show difference in the numbering area.The pairing character code of each character in the detailed tabular present embodiment in Fig. 5, for example in the present embodiment, button " 2 " to the code value of button " 9 " is to be set at " 2 (HEX) " respectively to " 9 (HEX) ", therefore the code value district of each corresponding English alphabet is corresponding code value, and the numbering area then increases progressively respectively in regular turn.

When the data in the database (particularly index entry that wherein respectively writes down) are when utilizing the character code storage of Fig. 5, just can significantly reduce the more required number of times of character.With button " 2 " is example, when the index entry to a certain record compares, as long as according to the code value district in the character code of correspondence position character, just can judge whether meet corresponding relation, therefore only need once compare at the most.Therefore, this way can reduce the number of times of comparison greatly, increases to search the efficient of carrying out.

Below utilize the database example shown in the table three, and cooperate actual comparison procedure shown in Figure 3, the database search process that the ISN saving format that utilizes present embodiment is carried out is described.In following example, it is ANDERSON that the user wants the search index name, i.e. user can push button in regular turn " 26337766 ".The storage ISN of each index name then determines according to character shown in Figure 5-character code corresponding tables in table three.

Table three

The index name of data item to be checked	Store ISN (HEX)
…	…
ALEX	21 53 32 92
ANDERSON	21 62 31 32 73 74 63 62
CATHY	23 21 81 42 93
JONATHAN	51 63 62 21 81 42 21 62
PETER	71 32 81 32 73
…	…

When the user presses first button " 2 ", i.e. the processing of step S23～S26 in the execution graph 3, each index entry in the comparison sheet three.Mode relatively is very simple, as long as the saving format of first character of index name is " 2X (HEX) " (X is any 16 carry value), promptly meets the input of first button.In table three, index name " ALEX ", " ANDERSON ", and " CATHY " all meet, therefore can be stored in the search process buffer zone.Then, when the user presses second button " 6 ", then carry out step S27～step S31 of the 3rd figure, second character of the index name " ALEX " in the search process buffer zone, " ANDERSON " and " CATHY " compared.Mode relatively then is to judge whether second character saving format is " 6X (HEX) ".In this example, the index name in the search process buffer zone has only " ANDERSON " to meet this condition, so remaining index name can be deleted from the search process buffer zone.So far, the user has in fact found the data item that will look for.From the above, the user has only imported two buttons and has just found required data item, and when each more single index entry name, only need once judge and get final product at the code value district of each character saving format, compared to first embodiment, present embodiment has significantly reduced number of times relatively.

Last mandatory declaration be that character code structure shown in Figure 4 is designed according to the CCITT keyboard.That is code value district 10a wants to correspond to 10 numerical keys " 0 "～" 9 " on the CCITT keyboard.Therefore in the present embodiment, code value district 10a must take at least in the character ISN and surpass 3 bit number (2 ³=8＜10), be used for corresponding to respectively 10 numerical keys will representing.In the present embodiment, then be to adopt immediate 4 bits to represent, but also can adopt 5 or 6 bits to represent.In addition,, then can adjust the assigned bit number of code value district 10a and numbering area 10b, to cooperate actual situation for the keyboard of other types.

According to above narration to second embodiment, below be example with input inquiry name individual character " ANDERSON ", according to the number of times of user's needs button and the number of times of comparison, illustrate that the present invention is better than the known techniques part.

Table four

Item compared	Known techniques	Second embodiment
Touch potential	25 times	8 times
Input results	Determine	Fuzzy
User's input mode	Complexity is very easy to make mistakes	Directly, be difficult for makeing mistakes
Number of comparisons	Each enter key is 1 to the number of comparisons of character	Each enter key is 1 to the number of comparisons of character

As shown in Table 4, second embodiment of the invention is still to be better than known techniques on touch potential and the input mode.And second embodiment also improves the shortcoming among first embodiment, and is identical with known techniques basically for the number of comparisons of each enter key.Therefore, generally speaking, the present invention is to be much better than known techniques handling on the similar CCITT keyboard input inquiry data.

Though the present invention discloses as above with preferred embodiment; right its is not in order to limiting the present invention, anyly has the knack of this skill person, without departing from the spirit and scope of the present invention; when can doing a little change and retouching, so protection scope of the present invention is as the criterion when looking appended the claim person of defining.

Claims

1. the fuzzy input inquiry processing method of a database, applicable to a database storage device, the index entry of every notes record is made of both characters of determined number in this database, this database storage device comprises input part, in order to import both input codes of determined number, wherein the quantity of these characters is greater than the quantity of these input codes, and each input code is corresponding at least one character, it is characterized in that, this method comprises the following steps: to receive an input word string by this input part, and this input word string comprises at least one input code; The input code order that is comprised according to this input word string, in regular turn relatively should input each input code of word string and the character of the same position of the index entry of these records, the same position character of finding out index entry all corresponds to all records of the input code of this input word string; The relevent information that shows the record of finding out; And by selecting a record in the record relevent information that shows.

2. fuzzy input inquiry processing method as claimed in claim 1, it is characterized in that, each character that constitutes this database is all corresponding to a character code, comprise a code value district and a numbering area in this character code, this code value district in order to should character the code value of corresponding input code, this code clerk district in order to should character the number value in the corresponding input code.

3. fuzzy input inquiry processing method as claimed in claim 2 is characterized in that, in the step that compares index entry and this input word string, utilizes the code value district of the character of index entry, directly judges whether the enter key corresponding to this input word string.

4. fuzzy input inquiry processing method as claimed in claim 3 is characterized in that, the corresponding relation of these input codes and these characters, and definition determines according to the CCITT keyboard.

5. fuzzy input inquiry processing method as claimed in claim 1 is characterized in that, in the step that compares index entry and this input word string, comprises the following steps: to be provided with a search process buffer zone; Relatively all records that this first input code and its first character meet corresponding relation found out in first character of the index entry of first input code of this input word string and these records; The index entry of all records of finding out is stored in this search process buffer zone; And when this input word string comprises above an input code, all the other input codes order that is comprised according to this input word string then, in regular turn with this search process buffer zone in the same position character of index entry compare, and remove the index entry that wherein is not inconsistent corresponding relation.

6. fuzzy input inquiry processing method as claimed in claim 5, it is characterized in that, also comprise the following steps: when first character of all index entries and this first input code all do not meet corresponding relation, then all index entries to be stored in this search process buffer zone.

7. fuzzy input inquiry processing method as claimed in claim 5, it is characterized in that, constitute the corresponding numeric data code of each character of this database, comprise a code value district in this numeric data code, in order to should the pairing input code of character, in the step of relatively index entry and this input word string, promptly utilize the code value district in the character of index entry, directly judge whether enter key corresponding to this input word string.

8. fuzzy input inquiry processing method as claimed in claim 5 is characterized in that, shows in all relevent information steps of finding out record, shows the index entry that this search process buffer zone is stored.