US2016098460A1PendingUtilityA1
Scalable computation of data
Est. expiryApr 18, 2023(expired)· nominal 20-yr term from priority
G06F 17/30539G06F 17/30477G06F 17/30592G06F 16/2455G06F 16/3331G06F 16/2465G06F 16/283G06F 16/244
51
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
Techniques for producing a cross tabulation are described. The techniques involve issuing a plurality of queries to a database. The queries are for each of at least one sublevel of data for each of at least one dimension of data associated with records in the database. The queries provide sublists of sorted identifiers for each one of the queries. The technique determines occurrences of intersections of levels of one dimension with levels of another dimension of the data associated with records in the database by traversing the sublists to detect intersections of the dimensions.
Claims
exact text as granted — not AI-modified1 - 48 . (canceled)
49 . A computer-implemented method of mining a database having records with each record including a record identifier and a plurality of dimensions, comprising:
issuing, to the database, a plurality of queries for multiple sublevels of data for a first dimension; issuing, to the database, a plurality of queries for multiple sublevels of data for a second dimension; receiving, from the database and for each one of the queries, a sub-list of record identifiers; and identifying, by traversing the received sub-lists, an occurrence of an intersection of a sublevel of the first dimension with a sublevel of the second dimension.
50 . The method of claim 49 , wherein
a cross-tabulation structure is generated using the received sublists.
51 . The method of claim 50 , wherein
the cross-tabulation structure is a multiple-dimensional array having a structure dimensioned with
the number of sublevels for the first dimension and
the number of sublevels for the second dimension.
52 . The method of claim 51 , wherein
the identified occurrence of the intersection is used to populate the array, and each cell in the array is populated based upon a total number of intersections for the sublevel in the first dimension and sublevel in the second dimension associated with the cell.
53 . The method of claim 49 , wherein
the occurrence is determined based upon a record identifier being found in a sublevel of the first dimension and a sublevel of the second dimension.
54 . The method of claim 49 , wherein
the plurality of dimensions includes three or more dimensions.
55 . A computer program product, comprising:
a computer readable storage device having stored therein instructions for mining a database having records with each record including a record identifier and a plurality of dimensions, the instructions, which when executed on a computer hardware system, cause the computer hardware system to perform: issuing, to the database, a plurality of queries for multiple sublevels of data for a first dimension; issuing, to the database, a plurality of queries for multiple sublevels of data for a second dimension; receiving, from the database and for each one of the queries, a sub-list of record identifiers; and identifying, by traversing the received sub-lists, an occurrence of an intersection of a sublevel of the first dimension with a sublevel of the second dimension.
56 . The computer program product of claim 55 , wherein
a cross-tabulation structure is generated using the received sublists.
57 . The computer program product of claim 56 , wherein
the cross-tabulation structure is a multiple-dimensional array having a structure dimensioned with
the number of sublevels for the first dimension and
the number of sublevels for the second dimension.
58 . The computer program product of claim 57 , wherein
the identified occurrence of the intersection is used to populate the array, and each cell in the array is populated based upon a total number of intersections for the sublevel in the first dimension and sublevel in the second dimension associated with the cell.
59 . The computer program product of claim 55 , wherein the occurrence is determined based upon a record identifier being found in a sublevel of the first dimension and a sublevel of the second dimension.
60 . The computer program product of claim 55 , wherein the plurality of dimensions includes three or more dimensions.
61 . A computer hardware system configured to mine a database having records with each record including a record identifier and a plurality of dimensions, comprising
at least one hardware processor configured to initiate the following operations:
issuing, to the database, a plurality of queries for multiple sublevels of data for a first dimension;
issuing, to the database, a plurality of queries for multiple sublevels of data for a second dimension;
receiving, from the database and for each one of the queries, a sub-list of record identifiers; and
identifying, by traversing the received sub-lists, an occurrence of an intersection of a sublevel of the first dimension with a sublevel of the second dimension.
62 . The system of claim 61 , wherein
a cross-tabulation structure is generated using the received sublists.
63 . The system of claim 62 , wherein
the cross-tabulation structure is a multiple-dimensional array having a structure dimensioned with
the number of sublevels for the first dimension and
the number of sublevels for the second dimension.
64 . The system of claim 63 , wherein
the identified occurrence of the intersection is used to populate the array, and each cell in the array is populated based upon a total number of intersections for the sublevel in the first dimension and sublevel in the second dimension associated with the cell.
65 . The system of claim 61 , wherein
the occurrence is determined based upon a record identifier being found in a sublevel of the first dimension and a sublevel of the second dimension.
66 . The system of claim 61 , wherein
the plurality of dimensions includes three or more dimensions.Join the waitlist — get patent alerts
Track US2016098460A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.