IPC분류정보
| 국가/구분 |
United States(US) Patent
등록
|
| 국제특허분류(IPC7판) |
|
| 출원번호 |
US-0970976
(1992-11-03)
|
|
발명자
/ 주소 |
- Dann Ronald E. (Andover MA)
|
| 출원인 / 주소 |
- Bull HN Information Systems Inc. (Billerica MA 02)
|
| 인용정보 |
피인용 횟수 :
179 인용 특허 :
0 |
초록
▼
A method of searching the directory of a database, held in the store of an information processing system, to identify an entry in the directory which most closely matches a search entry, each of said directory entries containing first, second and third fields, said search entry containing at least a
A method of searching the directory of a database, held in the store of an information processing system, to identify an entry in the directory which most closely matches a search entry, each of said directory entries containing first, second and third fields, said search entry containing at least a first field, and each of said fields having the capability of including multiple parts: wherein the set of all directory entries which have the first part of the first field thereof the same as the first part of the first field of the search entry are retrieved from the directory; wherein all parts of the first field of each entry of said set are compared with a similar number of parts of the search entry and according to the degree of match of such comparison, a respective value is calculated for such degree of match; wherein similar comparisons are made between the second and third fields, if any, of each entry of the set and the search entry; and wherein the highest of such calculated values indicates the directory entry which most closely matches the search entry.
대표청구항
▼
A method of searching the directory of a database, held in a store of an information processing system, to identify an entry in said directory which most closely matches a search entry; wherein each of said directory entries contains first, second and third information fields, wherein said search en
A method of searching the directory of a database, held in a store of an information processing system, to identify an entry in said directory which most closely matches a search entry; wherein each of said directory entries contains first, second and third information fields, wherein said search entry contains at least a first field, wherein said first field in each of said entries occupies a predetermined position relative to a unique symbol in said entry, wherein each of said fields comprises a string of at least one part, and wherein at least one part of each of said first fields in each of said entries comprises a plurality of characters; said method being carried out by said information processing system executing the steps of: a) determining the value of a first polynomial by substituting the number of pats in the search entry for a variable in said first polynomial, which value represents an exact match value between the search entry and a directory entry; b) selecting a first part from said first field of said search entry, said first part being an end part of the string of said first field of said search entry when said first field string of said search entry comprises more than one part; c) selecting from said directory the set of all directory entries having a first part of the first field thereof which is the same as the part selected in step (b) and entering said set into a store of said system, said first part of said first field of each of the selected directory entries being an end part of the string of the first field of said directory entry when said first field string of said selected directory entry comprises more than one part; d) selecting from said store one of said directory entries of the set entered into said store in step (c); e) initializing the variables of a second polynomial, each variable of said second polynomial being used to represent respectively the number of successful comparisons between portions of a field of the search entry and portions of a corresponding field of a directory entry; f) determining the number of parts of the first field of said selected directory entry, and (f1) if said first field of said selected directory entry comprises a single part, increasing by a first predetermined amount the values of corresponding certain variables of said second polynomial, and then proceeding to step (g) but (f) if said first field of said selected directory entry comprises a string of more than one part, comparing said first field of said selected directory entry with said first field of said search entry, and, f2-1) if said first field of said selected directory entry is the same as a string of parts of said first field of said search entry, increasing by a second predetermined amount the values of corresponding certain variables of said second polynomial, and then proceeding to step (g), but (f2-2) if said first field of said selected directory entry is not the same as a string of parts of the first field of said search entry, proceeding to step (g); g) comparing the value of said second polynomial with said exact match value for said search entry, and (g1) if said value of said second polynomial equals said exact match value, identifying the corresponding directory entry of said set as the entry searched for, but (g2) if said value of said second polynomial is not equal to said exact match value, determining whether all directory entries have been selected from said store, and (g2-1) if all directory entries have not been selected from said store, selecting another directory entry from said store and proceeding to step (e), but (g2-2) if all directory entries have been selected from said store, identifying the directory entry in said store for which the highest value of said second polynomial was developed as the entry searched for.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.