US6931418B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for partial-order analysis of multi-dimensional data
Assignee: Gula Consulting LLC
•
Filing: 2002-03-26
•
Granted: 2005-08-16
•
Expires: 2022-03-26
Abstract
Abstract A method and system for performing data analysis where multiple, categorical dimensions and statistical measures are used. The method includes preparing multi-dimensional data into nodes and arranging them logically in the form of a partial-order database. The database may then be traversed by a data-mining tool, or queried in an OLAP manner. Queries are answered through a process of associative partial-order search, which includes optional support for “children-of” requests, and optional support for fuzzy pattern-matching. By aggregating measures on-the-fly, this method is able to preform well without requiring a large number of summary nodes, when taken as a percentage of the total node count.
Inventors
- 👤 Steven M. Barnes
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 20:29
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/22; G06F16/2228; G06F16/2264; Y; Y10; Y10S; Y10S707/00; Y10S707/953; Y10S707/957; Y10S707/961; Y10S707/99931; Y10S707/99933; Y10S707/99935; Y10S707/99936; Y10S707/99941; Y10S707/99942; Y10S707/99943; Y10S707/99944; Y10S707/99945
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
208 words
A method for supporting data analysis through use of a partial-order structuring of multi-dimensional data and aggregated measurements stored in computer memory, and use of a pattern-comparison means, said pattern-comparison means having the ability to compare two patterns across a multiplicity of dimensions so as to determine whether the first pattern is more-general-than the second pattern, comprising the steps of: (a) loading of metadata defining the type hierarchy; (b) transforming multi-dimensional fact data into a plurality of nodes, said nodes containing at least a pattern part and a measures part, and said pattern part having the ability to store a multiplicity of dimension values simultaneously; (c) loading of said data nodes into a partial-order structure providing a functional representation of a rooted directed-acyclic graph whose arcs embody an ordering by the relationship established by the pattern-comparison means; (d) loading of a plurality of additional nodes into said partial-order structure, wherein said additional nodes contain a pattern part that is more general than any pattern contained in said data nodes; (e) aggregating the measures part from said data nodes into the measures part of said additional nodes; (f) performing on-demand aggregation, facilitated by said partial-order structure, in response to a query for which insufficient pre-aggregated data is currently stored.
Claim 2
Independent Claim
208 words
A method for supporting data analysis through use of a partial-order structuring of multi-dimensional data and aggregated measurements stored in computer memory, and use of a pattern-comparison means, said pattern-comparison means having the ability to compare two patterns across a multiplicity of dimensions so as to determine whether the first pattern is more-general-than the second pattern, comprising the steps of: (a) loading of metadata defining the type hierarchy; (b) transforming multi-dimensional fact data into a plurality of nodes, said nodes containing at least a pattern part and a measures part, and said pattern part having the ability to store a multiplicity of dimension values simultaneously; (c) loading of said data nodes into a partial-order structure providing a functional representation of a rooted directed-acyclic graph whose arcs embody an ordering by the relationship established by the pattern-comparison means; (d) loading of a plurality of additional nodes into said partial-order structure, wherein said additional nodes contain a pattern part that is more general than any pattern contained in said data nodes; (e) aggregating the measures part from said data nodes into the measures part of said additional nodes; (f) performing on-demand aggregation, facilitated by said partial-order structure, in response to a query for which insufficient pre-aggregated data is currently stored.
Claim 3
Dependent Claim
85 words
The method of claim 1 , further comprising the step of: (g) topologically-ordered associative searching of said partial-order structure using pattern-comparison against a query pattern, so as to return aggregate data specific to said query pattern by: 1. returning pre-aggregated data, should said query pattern be present in a node of said partial-order structure; 2. returning aggregation data assembled on-the-fly by means of said query pattern's virtual position in the partial-order, should said query pattern not be present in a node of said partial-order structure.
Claim 4
Dependent Claim
102 words
The method of claim 1 , further comprising the steps of: (h) assembling a list of nodes through use of associative look-up means separate from said partial-order structure, said nodes being predecessors of a query pattern, as part of means for accelerating associative search; (i) returning a null result for the query, in the case that said list is empty; (j) proceeding with a topologically-ordered associative search of said partial-order structure using pattern-comparison against a query pattern, so as to return aggregate data specific to said query pattern, in the case that said list is non-empty, said associative search employing accelerating means.
Claim 5
Dependent Claim
60 words
The method of claim 1 , further comprising the step of: (k) traversing said partial-order structure, while processing data contained therein so as to separately accumulate data for specializations of a query pattern, said specializations along any number of dimensions being controlled by means of a children-of specification accompanying the query, and said accumulation being facilitated by means of pattern-promotion.
Claim 6
Dependent Claim
18 words
The method of claim 1 , wherein said pattern-comparison means is able to return a fuzzy-valued test result.
Claim 7
Independent Claim
223 words
A system of logic circuitry and computational instructions for supporting data analysis through use of a partial-order structuring of multi-dimensional data and aggregated measurements stored in computer memory, and use of a pattern-comparison means, said pattern-comparison means having the ability to compare two patterns across a multiplicity of dimensions so as to determine whether the first pattern is more-general-than the second pattern, comprising: (a) means for loading of metadata defining the type hierarchy; (b) means for transforming multi-dimensional fact data into a plurality of nodes, said nodes containing at least a pattern part and a measures part, and said pattern part having the ability to store a multiplicity of dimension values simultaneously; (c) means for loading of said data nodes into a partial-order structure providing a functional representation of a rooted directed-acyclic graph whose arcs embody an ordering by the relationship established by the pattern-comparison means; (d) means for loading of a plurality of additional nodes into said partial-order structure, wherein said additional nodes contain a pattern part that is more general than any pattern contained in said data nodes; (e) means for aggregating the measures part from said data nodes into the measures part of said additional nodes; (f) means for performing on-demand aggregation, facilitated by said partial-order structure, in response to a query for which insufficient pre-aggregated data is currently stored.
Claim 8
Independent Claim
223 words
A system of logic circuitry and computational instructions for supporting data analysis through use of a partial-order structuring of multi-dimensional data and aggregated measurements stored in computer memory, and use of a pattern-comparison means, said pattern-comparison means having the ability to compare two patterns across a multiplicity of dimensions so as to determine whether the first pattern is more-general-than the second pattern, comprising: (a) means for loading of metadata defining the type hierarchy; (b) means for transforming multi-dimensional fact data into a plurality of nodes, said nodes containing at least a pattern part and a measures part, and said pattern part having the ability to store a multiplicity of dimension values simultaneously; (c) means for loading of said data nodes into a partial-order structure providing a functional representation of a rooted directed-acyclic graph whose arcs embody an ordering by the relationship established by the pattern-comparison means; (d) means for loading of a plurality of additional nodes into said partial-order structure, wherein said additional nodes contain a pattern part that is more general than any pattern contained in said data nodes; (e) means for aggregating the measures part from said data nodes into the measures part of said additional nodes; (f) means for performing on-demand aggregation, facilitated by said partial-order structure, in response to a query for which insufficient pre-aggregated data is currently stored.
Claim 9
Dependent Claim
84 words
The system of claim 6 , further comprising: (g) means for topologically-ordered associative searching of said partial-order structure using pattern-comparison against a query pattern, so as to return aggregate data specific to said query pattern by: 1) returning pre-aggregated data, should said query pattern be present in a node of said partial-order structure; 2) returning aggregation data assembled on-the-fly by means of said query pattern's virtual position in the partial-order, should said query pattern not be present in a node of said partial-order structure.
Claim 10
Dependent Claim
105 words
The system of claim 6 , further comprising: h. means for assembling a list of nodes through use of associative look-up means separate from said partial-order structure, said nodes being predecessors of a query pattern, as part of means for accelerating associative search; i. means for returning a null result for the query, in the case that said list is empty; j. means for proceeding with a topologically-ordered associative search of said partial-order structure using pattern-comparison against a query pattern, so as to return aggregate data specific to said query pattern, in the case that said list is non-empty, said associative search employing accelerating means.
Claim 11
Dependent Claim
58 words
The system of claim 6 , further comprising: (k) means for traversing said partial-order, while processing data contained therein so as to separately accumulate data for specializations of a query pattern, said specializations along any number of dimensions being controlled by means of a children-of specification accompanying the query, and said accumulation being facilitated by means of pattern-promotion.
Claim 12
Dependent Claim
18 words
The system of claim 6 , wherein said pattern-comparison means is able to return a fuzzy-valued test result.
References Cited (Backward Citations)
US5257365A
Cited
US5359724A
Cited
US5511190A
Cited
US5999192A
Cited
US5799300A
Cited
US5822751A
Cited
US5978788A
Cited
US5890151A
Cited
US6205447B1
Cited
US6278977B1
Cited
US6134541A
Cited
US6275818B1
Cited
US6003036A
Cited
US6055529A
Cited
US6154746A
Cited
US6289352B1
Cited
US6487546B1
Cited
US6212515B1
Cited
US6424967B1
Cited
US6321379B1
Cited
US20020194167A1
Cited
US20030018642A1
Cited
US20030023608A1
Cited
US6728728B2
Cited
US6684207B1
Cited
US20030220926A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2008-08-15 | 2009-02-14 | 2009-08-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2012-08-15 | 2013-02-14 | 2013-08-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2016-08-15 | 2017-02-14 | 2017-08-16 | $7700.00 | Window Closed / Lapsed |