Patent US2709827A successfully refreshed from Google Patents.
Patent US5274730A successfully refreshed from Google Patents.
Patent EP0510634A2 successfully refreshed from Google Patents.
EP0510634A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Data base retrieval system
Assignee: Nippon Steel Corp
•
Filing: 1992-04-23
•
Granted: —
•
Expires: 2012-04-23
Abstract
Abstract A data base retrieval system includes a memory (16) for storing vicinity feature values of data records as search (or retrieval) objects of the data records. The vicinity feature values indicate a correspondence between data characters of the data records which are in the same vicinity. A searching device (42) obtains matching degrees between a vicinity feature value of a search (or retrieval) key and the vicinity feature values of the search objects of the data records. Data record numbers are output arranged in a descending order of the matching degrees. Since phase information of data (position information indicating the position of a search key in a record) as a factor for prolonging the search time upon execution of full-record direct searching is abstracted by a vicinity feature value calculation, a high-speed and fuzzy searching operation can be performed so that the search time depends only on the length of the search key information, and does not depend on the volume of data.
Inventors
- 👤 Hiroshi c/o Nippon Steel Corporation Takada
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-04 11:20
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/30; G06F16/33; G06F16/3331; G06F16/334; G06F16/3341; Y; Y10; Y10S; Y10S706/00; Y10S706/90; Y10S706/902; Y10S706/934; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99935
Claims Analysis
Total Claims: 39
Claim 1
Independent Claim
132 words
A data base retrieval system for retrieving information from data records of a search object of a data base in response to an input search key, said system comprising: first means for storing vicinity feature values of the data records, said vicinity feature values indicating a correspondence between data characters of the data records; and second means for obtaining matching degrees for the data records indicating a degree of correspondence between the data record vicinity feature values stored in said first means and a vicinity feature value of the search key, said vicinity feature value of the search key indicating a correspondence between data characters of the search key, and for providing as search results of said data base retrieval system data record numbers and corresponding matching degrees for the data records.
Claim 2
Dependent Claim
28 words
A system according to claim 1, wherein said searching means provides said data record numbers and corresponding matching degrees in a descending numerical order of said matching degrees.
Claim 3
Dependent Claim
36 words
A system according to claim 1 or 2, further comprising means for extracting the vicinity feature values of the data records from the search object by a convolution calculation among data characters of the search object.
Claim 4
Independent Claim
34 words
A system according to any of claims 1 to 3, further comprising means for extracting the vicinity feature value of the search key by a convolution calculation among data characters of the search key.
Claim 5
Independent Claim
34 words
A system according to any of claims 1 to 4, wherein the vicinity feature values of the data records are calculated in a similar manner as the vicinity feature value of the search key.
Claim 6
Independent Claim
136 words
A system according to any of claims 1 to 5, wherein a quantization value x associated with a j-th data character C i,j in an i-th data record of the search object, and a quantization value y associated with k data characters C i,j+1 , C i,j+2 , ... C i,j+k in the vicinity of the data character C i,j are obtained by: x = f(C i,j ) y = g(C i,j , C i,j+1 , C i,j+2 , ... C i,j+k ) wherein f(A) and g(B) are functions of A and B, respectively, wherein i,j and k are integers, and wherein a data record number i and a significance w(x,y,i) of the data record are stored for each data record in said first means in a location defined by the obtained values x and y.
Claim 7
Dependent Claim
12 words
A system according to claim 6, wherein the significance w(x,y,i) is 1.
Claim 8
Dependent Claim
20 words
A system according to claim 6 or 7, wherein the quantization value x is expressed by one of n-stage values.
Claim 9
Independent Claim
103 words
A system according to any of claims 1 to 8, wherein quantization values x = f(c i ) and y = g(c i , c i+j ) are given to i-th data character c i of a data sequence of the search object, and data c i+j (j = 1, 2,...) in the vicinity of the data character c i , the quantization values are used as element numbers of a matrix, one element value (= 1) of two values (1, 0) is given to the element numbers, and a bit matrix generated for all i's is used as the vicinity feature values.
Claim 10
Dependent Claim
109 words
A system according to claim 9, wherein the quantization values x = f(c i ) and y = g(c i , c i+j ) are given to i-th data character c i of a data sequence of the search object, and data c i+j (j = 1, 2,...) in the vicinity of the data character c i , an element value of the corresponding element number of the bit matrix is checked using the quantization values as the element numbers of the matrix, when the element value is 1, +1 is counted as the matching degree, and the matching degrees for all i's are obtained in units of records.
Claim 11
Independent Claim
37 words
A system according to any of claims 1 to 10, further comprising means for converting data characters of the search object and the search key into integer data characters in which each data character is n-gradation data.
Claim 12
Dependent Claim
8 words
A system according to claim 11, wherein n=256.
Claim 13
Dependent Claim
160 words
A system according to claim 11 or 12, further comprising: means for dividing said integer data characters by a predetermined value, said integer data characters being arranged in an ascending order of value; means for comparing a new quotient obtained by said means for dividing with a previously stored old quotient, and when the new quotient is larger than the old quotient, providing a difference between the new and old quotients; a compressed data memory, storing, when said means for comparing provides a difference between the new and old quotients, a remainder obtained by said means for dividing together with the difference between the new and old quotients, and storing, when said means for comparing does not provide a difference between the new and old quotients, only the remainder obtained by said means for dividing; and a decoder decoding original integer character data on the basis of the difference data and the remainder data stored in said compressed data memory.
Claim 14
Dependent Claim
37 words
A system according to claim 13, wherein when the new quotient is larger than the old quotient, said means for comparing provides the difference between the new and old quotients together with a mark indicating a carry.
Claim 15
Independent Claim
135 words
A system according to any of claims 6 to 14, further comprising: means for sequentially storing variable-length data corresponding to data records of said search object; means for assigning identification numbers to the variable-length data stored in said means for sequentially storing; and means for storing storage locations of the variable-length data in said means for sequentially storing in correspondence with the identification numbers assigned by said means for assigning; wherein when data is stored in said means for sequentially storing, the identification number and storage location of the data is stored said means for storing storage locations, and when data is to be read from said means for sequentially storing, the storage location of the data is read from said means for storing storage locations memory means to access said means for sequentially storing.
Claim 16
Dependent Claim
20 words
A system according to claim 15, further comprising means for temporarily storing data read from said means for sequentially storing.
Claim 17
Independent Claim
101 words
A system according to any of claims 6 to 16, further comprising: means for searching a data base using the search key to obtain matching degrees between the search key and each of the data records; a comparator comparing the matching degrees obtained by the searching means of each of the data records with a predetermined threshold value; means for preparing a list of data records which are determined by said comparator to have matching degrees larger than the threshold value; and means for storing as search results the list of data records prepared by said means for preparing a list.
Claim 18
Dependent Claim
23 words
A system according to claim 17, further comprising means for sorting the data records in a descending numerical order of the matching degrees.
Claim 19
Independent Claim
91 words
A system according to any of claims 6 to 18, further comprising: means for performing full-record searching under predetermined conditions; search result memory storing search results of said means for performing full-record searching; and means for performing conditional searching using the search results stored in said search result memory; wherein said conditional search means of performing conditionally searching searches under conditions as a combination of the conditions used in the searching of said means for performing full-record searching, on the basis of the search results stored in said search result memory.
Claim 20
Dependent Claim
13 words
A system according to claim 19, further comprising means for inputting the conditions.
Claim 21
Independent Claim
121 words
A method for retrieving information from data records of a search object of a data base in response to an input search key, the method comprising the steps of: storing vicinity feature values of the data records, said vicinity feature values indicating a correspondence between data characters of the data records; obtaining matching degrees for the data records indicating a degree of correspondence between the stored vicinity feature values of the data records and a vicinity feature value of the search key, the vicinity feature value of the search key indicating a correspondence between data characters of the search key; and providing as search results of the information retrieving method data record numbers and corresponding matching degrees for the data records.
Claim 22
Dependent Claim
26 words
A method according to claim 21, wherein said data record numbers and corresponding matching degrees are provided in a descending numerical order of said matching degrees.
Claim 23
Dependent Claim
37 words
A method according to claim 21 or 22, further comprising the step of extracting the vicinity feature values of the data records from the search object by a convolution calculation among data characters of the search object.
Claim 24
Independent Claim
35 words
A method according to any of claims 21 to 23, further comprising the step of extracting the vicinity feature value of the search key by a convolution calculation among data characters of the search key.
Claim 25
Independent Claim
34 words
A method according to any of claims 21 to 24, wherein the vicinity feature values of the data records are calculated in a similar manner as the vicinity feature value of the search key.
Claim 26
Independent Claim
138 words
A method according to any of claims 21 to 25, wherein a quantization value x associated with a j-th data character C i,j in an i-th data record of the search object, and a quantization value y associated with k data characters C i,j+1 , C i,j+2 , ... C i,j+k in the vicinity of the data character C i,j are obtained by: x = f(C i,j ) y = g(C i,j , C i,j+1 , C i,j+2 , ... C i,j+k ) wherein f(A) and g(B) are functions of A and B, respectively, wherein i,j and k are integers, and wherein a data record number i and a significance w(x,y,i) of the data record are stored for each data record as said vicinity feature values in a memory location defined by the obtained values x and y.
Claim 27
Dependent Claim
12 words
A method according to claim 26, wherein the significance w(x,y,i) is 1.
Claim 28
Dependent Claim
20 words
A method according to claim 26 or 27, wherein the quantization value x is expressed by one of n-stage values.
Claim 29
Independent Claim
103 words
A method according to any of claims 21 to 28, wherein quantization values x = f(c i ) and y = g(c i , c i+j ) are given to i-th data character c i of a data sequence of the search object, and data c i+j (j = 1, 2,...) in the vicinity of the data character c i , the quantization values are used as element numbers of a matrix, one element value (= 1) of two values (1, 0) is given to the element numbers, and a bit matrix generated for all i's is used as the vicinity feature values.
Claim 30
Dependent Claim
109 words
A method according to claim 29, wherein the quantization values x = f(c i ) and y = g(c i , c i+j ) are given to i-th data character c i of a data sequence of the search object, and data c i+j (j = 1, 2,...) in the vicinity of the data character c i , an element value of the corresponding element number of the bit matrix is checked using the quantization values as the element numbers of the matrix, when the element value is 1, +1 is counted as the matching degree, and the matching degrees for all i's are obtained in units of records.
Claim 31
Independent Claim
38 words
A method according to any of claims 21 to 30, further comprising the step of converting data characters of the search object and the search key into integer data characters in which each data character is n-gradation data.
Claim 32
Dependent Claim
8 words
A method according to claim 31, wherein n=256.
Claim 33
Dependent Claim
124 words
A method according to claim 31 or 32, further comprising the steps of: dividing said integer data characters by a predetermined value, said integer data characters being arranged in an ascending order of value; comparing a new quotient obtained by said dividing means with a previously stored old quotient; when the new quotient is larger than the old quotient, providing a difference between the new and old quotients and storing a remainder obtained by said dividing step together with the difference between the new and old quotients; when the new quotient is not larger than the old quotient, storing only the remainder obtained by said dividing step; and decoding original integer character data on the basis of the stored difference data and remainder data.
Claim 34
Dependent Claim
37 words
A method according to claim 33, further comprising the step of storing the difference between the new and old quotients together with a mark indicating a carry when the new quotient is larger than the old quotient.
Claim 35
Independent Claim
99 words
A method according to any of claims 26 to 34, further comprising the steps of: sequentially storing in a variable-length data memory means variable-length data corresponding to data records of said search object; assigning identification numbers to the stored variable-length data; storing in a storage location memory means the assigned identification numbers in correspondence with storage locations of the variable-length data stored in said variable-length memory means; and when data is to be read from said variable-length memory means, reading the storage location of the data from said storage location memory means to access said variable-length data memory means.
Claim 36
Dependent Claim
21 words
A method according to claim 35, further comprising the step of temporarily storing data read from said variable-length data memory means.
Claim 37
Independent Claim
97 words
A method according to any of claims 26 to 36, further comprising the steps of: searching a data base using the search key to obtain matching degrees between the search key and each of the data records; comparing the matching degrees obtained by the data base searching step for each of the data records with a predetermined threshold value; preparing a list of data records which are determined by said comparing step to have matching degrees larger than the threshold value; and storing as search results the list of data records prepared by said list preparing step.
Claim 38
Dependent Claim
24 words
A method according to claim 37, further comprising the step of sorting the data records in a descending numerical order of the matching degrees.
Claim 39
Independent Claim
44 words
A method according to any of claims 26 to 38, further comprising the steps of: performing full-record searching under predetermined conditions; storing search results of said full-record searching step; and performing conditional searching using the search results stored in said search result storing step.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.