Patent US5265193A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5265193A Expired / Lapsed US ⏱️ 0.0 years remaining

Efficiently organizing objects in a rete pattern matching network

Assignee: International Business Machines Corp
•
Filing: 1992-04-30
•
Granted: 1993-11-23
•
Expires: 2012-04-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An improved expert system method for use with the RETE pattern matching algorithm is disclosed. At the heart of the invention is the concept of a "shuffleboard," a data structure conducive to sorting elements. The shuffleboard is essentially a list of lists. It is comprised of a set of nodes which are linked together in a series of columns. Each column corresponds to a test condition within a rule, and each node within a column corresponds to a variable referenced by the test condition. The shuffleboard approach provides a means of finding all tests using a given variable and associating those tests. The shuffleboard provides a frame of reference for constructing a new ordering of tests from which the RETE network can be constructed.

Inventors

  • 👤 Charles R. Grady
  • 👤 Greig Greenwald

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 22:51
CPC Classifications
G; G06; G06N; G06N5/00; G06N5/04; G06N5/046; G06N5/047; G06F; G06F7/00; G06F7/02

Claims Analysis

Total Claims: 2
Claim 1
Independent Claim 200 words
An improved computer method for optimizing the ordering of tests in an expert system rule from which a RETE network is to be derived comprising the following steps: building separate lists of positively quantified tests, negatively quantified tests and mixed quantified tests in a computer memory; for each of the lists, constructing in memory a shuffleboard data structure containing a set of nodes linked together, said nodes corresponding to variables referenced by the tests; identifying all tests containing the same variable and including a pointer to the first test referencing that variable within each of the nodes containing the duplicate variables; working from the last condition to the first condition, construct a flow list of variables by first adding each variable encountered in the shuffleboard to the flow list, removing that node from the shuffleboard, and if the node contains a pointer to other occurences of that same variable, removing those nodes from the shuffleboard and processing all the variables associated with those tests; repeating the prior step for each variable encountered while working from the last condition to the first condition until all nodes are removed; and constructing an optimized RETE network using the resultant flow list of variables.
Claim 2
Dependent Claim 200 words
An improved computer method for optimizing the ordering of tests in an expert system rule from which a RETE network is to be derived comprising the following steps: building separate lists of positively quantified tests, negatively quantified tests and mixed quantified tests in a computer memory; for each of the lists, constructing in memory a shuffleboard data structure containing a set of nodes linked together, said nodes corresponding to variables referenced by the tests; identifying all tests containing the same variable and including a pointer to the first test referencing that variable within each of the nodes containing the duplicate variables; working from the last condition to the first condition, construct a flow list of variables by first adding each variable encountered in the shuffleboard to the flow list, removing that node from the shuffleboard, and if the node contains a pointer to other occurences of that same variable, removing those nodes from the shuffleboard and processing all the variables associated with those tests; repeating the prior step for each variable encountered while working from the last condition to the first condition until all nodes are removed; and constructing an optimized RETE network using the resultant flow list of variables.

References Cited (Backward Citations)

US4849905A Cited
US5179632A Cited
US4882691A Cited
US4951225A Cited
US4956791A Cited
US5119470A Cited
US5159662A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-11-22 1997-05-24 1997-11-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-11-22 2001-05-24 2001-11-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-11-22 2005-05-24 2005-11-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag