Referentially-complete data subsetting using relational databases
US8935234B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 4, 2012 |
| Grant date | Jan 13, 2015 |
| Priority date | — |
| Expiry date | Mar 15, 2033 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/24542
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method, system, and computer program product for relational database management. The method constructs a referentially-complete target subset database from a source database by first estimating the expected size of the target subset database based on application of one or more subsetting rules. If the estimated size needs reduction, the user can modify the subsetting rules, and then modules are invoked to receive the modified subset rules. The method continues by generating a subsetting execution plan by applying the user-modified subset rules to the source database, and then modules process the generated execution plan, which processing results in storage of a referentially-complete target subset database. The user can influence the construction of the execution plan by suggesting an execution model to use during processing of the subsetting execution plan. Techniques estimate the expected size by constructing a directed graph wherein edges in the directed graph represent relationships between database tables.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.