US 2020/0026705 A1 · AUTOMATIC OBJECT INFERENCE IN A DATABASE SYSTEM

Abstract

A binary relational database model is described whereby application-layer object structures are easily inferred from database query templates. The object structures take the form of acyclic hypergraphs, which are induced from primal graphs representing query templates. Database applications may iterate through the collection of returned object structures, accessing the data in each structure. The returned object structures are not based on a fixed object model, thereby permitting rich structures with greater applicability than traditional ORM systems. A relationship between non-primitive entities may be directly expressed without the need for alternative join tables. Development and maintenance costs are thus substantially reduced, and data is more efficiently stored and manipulated for database applications.

Claims19

Dependent claims

A system for inferring solution objects from a query template in a database management system storing data according to a data model, comprising:

a DBMS client device for issuing a query template;
a DBMS query server, in communication with the DBMS client device, for receiving an issued query template from the DBMS client device and comprising query solving means for inferring a result structure from the query template;
and
a display device, in connection with the DBMS client device, for displaying results from the inferred result structure.

1 more element

A method for inferring solution objects from a query template in a database management system according to a data model, the query template comprising a set of database variables and including a unary template of variables and a plurality of atomic templates of variables, the method comprising:

determining a primal graph representation for the query template, the primal graph representation comprising vertices and edges;
computing a node-link representation for an induced acyclic hypergraph corresponding to the primal graph representation, the node-link representation comprising multi-nodes, single-nodes and links;
for each multi-node in the node-link representation, applying a constraint satisfaction solver to determine an assignment to the multi-node;
for each link in the node-link representation, determining an assignment for the relation corresponding to the link;
computing an extension of the assignments to the multi-nodes and links;
and
computing an arc-consistent assignment from the extension.

4 more elements

Dependencies are inferred from the claim text.

Automatic object inference in a database system

Life of this patent

Automatic object inference in a database system

Life of this patent

Abstract

Claims19