US6018734A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multi-dimensional pattern analysis
Assignee: RAYMOND WALSH & ENWRIGHT PC AS AGENT
•
Filing: 1998-09-28
•
Granted: 2000-01-25
•
Expires: 2018-09-28
Abstract
Abstract A pattern recognition method applicable to unique associated pattern recognition in a structured information system or structured database is presented. The process may be used to find patterns in a column which are associated with unique data values in another column, or to find the number of unique values in the second column which are paired with the same associated pattern in the first column. The technique is easily extended to more general cases in which both the condition field and the associated pattern field may be two groups of fields.
Inventors
- 👤 Tao Zhang
- 👤 K. R. Raghavan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 17:38
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/903; G06F16/90335; G06F16/90339; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
302 words
A method of rearranging data within a computer to perform certain query operations, comprising the steps of: loading the computer with data having two fields corresponding to a left leaf node a having left leaf node tokens relating to left node data values and a right leaf node b having right leaf node tokens relating to right node data values of a tree structure, and wherein the left leaf node has a first immediate ancestor node n 1 , wherein n 1 is an ancestor node of leaf node a, but not of leaf node b, and the right leaf node has a second immediate ancestor node n r , wherein n r is an ancestor node of leaf node b, but not of leaf node a, locating the immediate ancestor node the left leaf node n 1 of n a of n 1 , wherein n 1 has left ancestor tokens associated therewith; locating the immediate ancestor node n r of the right leaf node wherein n r has right ancestor tokens associated therewith; recalling the left leaf node tokens to node n 1 and recalling the right leaf node tokens to node n r , thereby propagating the left leaf node tokens to node n 1 and the right leaf node tokens to node n r ; replacing the left ancestor tokens of node n 1 with the recalled left leaf node tokens and replacing the right ancestor tokens of node n r with the right leaf node tokens to form a plurality of lists; combining right leaf node tokens that pair with the same left node tokens; eliminating those of the plurality of lists which store the same right leaf node tokens; accounting for those of the plurality of the lists which are eliminated; and sorting the remaining elements.
Claim 2
Independent Claim
302 words
A method of rearranging data within a computer to perform certain query operations, comprising the steps of: loading the computer with data having two fields corresponding to a left leaf node a having left leaf node tokens relating to left node data values and a right leaf node b having right leaf node tokens relating to right node data values of a tree structure, and wherein the left leaf node has a first immediate ancestor node n 1 , wherein n 1 is an ancestor node of leaf node a, but not of leaf node b, and the right leaf node has a second immediate ancestor node n r , wherein n r is an ancestor node of leaf node b, but not of leaf node a, locating the immediate ancestor node the left leaf node n 1 of n a of n 1 , wherein n 1 has left ancestor tokens associated therewith; locating the immediate ancestor node n r of the right leaf node wherein n r has right ancestor tokens associated therewith; recalling the left leaf node tokens to node n 1 and recalling the right leaf node tokens to node n r , thereby propagating the left leaf node tokens to node n 1 and the right leaf node tokens to node n r ; replacing the left ancestor tokens of node n 1 with the recalled left leaf node tokens and replacing the right ancestor tokens of node n r with the right leaf node tokens to form a plurality of lists; combining right leaf node tokens that pair with the same left node tokens; eliminating those of the plurality of lists which store the same right leaf node tokens; accounting for those of the plurality of the lists which are eliminated; and sorting the remaining elements.
Claim 3
Independent Claim
201 words
A method for identifying unique data values in a computer loaded structured information system having a condition field and an associated pattern field, comprising the steps of: relating the condition field to a first unique value leaf node having first leaf node tokens relating to first data values, and the pattern field to a second unique value leaf node having second leaf node tokens relating to second data values; determining a first immediate ancestor of the first unique value leaf node, the first ancestor not also being an immediate ancestor to the second unique value leaf node, wherein the first ancestor has first ancestor tokens; determining a second immediate ancestor of the second unique value leaf node, such that the second ancestor is not also an immediate ancestor to the first unique value leaf node, wherein the second ancestor has second ancestor tokens; pairing the first and second ancestor tokens to form a list; replacing the first ancestor tokens with the first leaf node tokens and the second ancestor tokens with the second leaf node tokens; replacing the first leaf node tokens in the list with the first data values and the second leaf node tokens with the second data values.
Claim 4
Independent Claim
201 words
A method for identifying unique data values in a computer loaded structured information system having a condition field and an associated pattern field, comprising the steps of: relating the condition field to a first unique value leaf node having first leaf node tokens relating to first data values, and the pattern field to a second unique value leaf node having second leaf node tokens relating to second data values; determining a first immediate ancestor of the first unique value leaf node, the first ancestor not also being an immediate ancestor to the second unique value leaf node, wherein the first ancestor has first ancestor tokens; determining a second immediate ancestor of the second unique value leaf node, such that the second ancestor is not also an immediate ancestor to the first unique value leaf node, wherein the second ancestor has second ancestor tokens; pairing the first and second ancestor tokens to form a list; replacing the first ancestor tokens with the first leaf node tokens and the second ancestor tokens with the second leaf node tokens; replacing the first leaf node tokens in the list with the first data values and the second leaf node tokens with the second data values.
Claim 5
Dependent Claim
39 words
The method of claim 2 further comprising the steps of: eliminating redundant first and second leaf node tokens from the list prior to replacing the first and second leaf node tokens with the first and second data values respectively.
Claim 6
Dependent Claim
53 words
The method of claim 3 further comprising the steps of: eliminating redundant second leaf node tokens and the corresponding first leaf node tokens from the list; and accounting for eliminated token redundancies prior to replacing the first and second leaf node tokens in the list with the first and second data values, respectively.
Claim 7
Dependent Claim
18 words
The method of claim 2 wherein the first and second immediate ancestors have a common ancestor node therebetween.
Claim 8
Dependent Claim
41 words
The method of claim 2 wherein the step of pairing the first and second ancestor tokens to form a list utilizes a hashing list to store a plurality of the second ancestor tokens with one of the first common ancestor tokens.
References Cited (Backward Citations)
US5018075A
Cited
US5245337A
Cited
US5293164A
Cited
US5592667A
Cited
US5692171A
Cited
US5659725A
Cited
US5809499A
Cited
US5832182A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-01-24 | 2003-07-26 | 2004-01-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-01-24 | 2007-07-26 | 2008-01-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-01-24 | 2011-07-26 | 2012-01-25 | $7700.00 | Window Closed / Lapsed |