US6751607B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for the identification of latent relationships amongst data elements in large databases
Assignee: Individual
•
Filing: 2001-10-02
•
Granted: 2004-06-15
•
Expires: 2021-10-02
Abstract
Abstract A database tool comprises a computer-implemented method for quick low-intensity processing to identify latent relationships among data elements in very large databases and to determine whether a keyword or character string is contained in a document which is part of a large collection of documents. Text in data fields of source documents are enciphered into surrogate vectors comprising wide binary numbers. Each keyword of text will set a corresponding group of bits in the associated surrogate vector. Any non-true bit required in the enciphered word is a quick indication the word cannot possibly be found in the associated document.
Inventors
- 👤 Thomas A. Kraay
- 👤 Charles E. Brisbin
- 👤 Ralph Carlson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 15:00
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/903; G06F16/90335; G06F16/90344; G06F16/30; G06F16/33; G06F16/3331; G06F16/334; G06F16/3341; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99941; Y10S707/99942
Claims Analysis
Total Claims: 2
Claim 1
Independent Claim
191 words
A method for searching database, comprising: converting plain-language text or character string in various fields of an input document into a surrogate vector comprising a digital binary word; translating particular plain-language words or character strings included in said text into a surrogate vector, wherein, each distinct plain-language word or character string sets a particular group of bits true in said surrogate vectors, and each surrogate vector is encoded with more that one such distinct plain-language word or character string; generating a first numeric seed from a first plain-language word or character string in said text during a preprocessing step of building a surrogate database; generating a first set of pseudorandom numbers from said first numeric seed during said preprocessing step; generating a second numeric seed from a first query word during a search of a surrogate database for an enciphered match; generating a second set of pseudorandom numbers from a numeric seed during said query that reproduces said first set of pseudorandom numbers when said query matches said first plain-language word or character string; and recovering for inspection a corresponding said input document that originally included a word matching said query.
Claim 2
Independent Claim
191 words
A method for searching database, comprising: converting plain-language text or character string in various fields of an input document into a surrogate vector comprising a digital binary word; translating particular plain-language words or character strings included in said text into a surrogate vector, wherein, each distinct plain-language word or character string sets a particular group of bits true in said surrogate vectors, and each surrogate vector is encoded with more that one such distinct plain-language word or character string; generating a first numeric seed from a first plain-language word or character string in said text during a preprocessing step of building a surrogate database; generating a first set of pseudorandom numbers from said first numeric seed during said preprocessing step; generating a second numeric seed from a first query word during a search of a surrogate database for an enciphered match; generating a second set of pseudorandom numbers from a numeric seed during said query that reproduces said first set of pseudorandom numbers when said query matches said first plain-language word or character string; and recovering for inspection a corresponding said input document that originally included a word matching said query.
References Cited (Backward Citations)
US4322576A
Cited
US5195136A
Cited
US20020009208A1
Cited
US5956717A
Cited
US6028939A
Cited
US6378073B1
Cited
US20030018608A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-06-15 | 2007-12-15 | 2008-06-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-06-15 | 2011-12-15 | 2012-06-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-06-15 | 2015-12-15 | 2016-06-15 | $7700.00 | Window Closed / Lapsed |