Loading patent…
AssigneeObjectivity, Inc.
InventorLEON GUZENDA
Estimating the term…
Methods, systems and computer-readable medium are provided for replicating the data fields used by relational join operations in transient or persistent data structures with explicit support for named relationships that may have 1:1, 1:many, many:1 or many:many cardinality. An algorithm is applied to predetermine the optional search path for finding relationships between any two rows of any of one or more tables, including relationships defined between other tables. The schema of a target relational database, either derived or input, is converted into an object-oriented schema that explicitly defines relationships between columns in the tables of the relational database and represents the tables as object classes. The schema is analyzed and optimal search paths are derived and stored for subsequent use. A query engine accesses the predefined search paths in order to execute the specific types of query listed above and incrementally populates instances of the transient or persistent structures.
In a computer having a relational database comprising a plurality of tables, each table having multiple columns and rows, a method comprising:
In a relational database system comprising a query engine and a database having a plurality of node types and a plurality of link types, a method comprising:
A computer-readable media comprising machine-readable instructions that direct a computational system to execute the method comprising:
Dependencies are inferred from the claim text.