International Business Machines Corporation

Cynthia Ann Rogers

Wilson D Lee

Tracy Kim Burroughs

Laura Jane Zaborowski

Steven John Gansemer

Vance Palmer Morrison

Erik Edward Voldal

John J Vriezen

Michael John Snyder

Leonard William Koser

Mary Christine Manges

Frances Mary Ring

A method and system for persisting an object in a relational database schema by creating a new relational table at application program run-time for each class of objects to be persisted. The method may generate a schema map object for each class of objects to be persisted. The schema map object may be generated in response to the first transaction in which an object of a certain class is to be persisted and remains in memory for persisting, querying, restoring or deleting objects of that class. The schema map object determines the fields of each class of objects to be persisted, defines one or more columns in the table in accordance with the data types of the fields, and controls the passing of data between the table and the object fields.

Default schema mapping

A method and system for mapping between relational schema and object schema, wherein the relational schema includes a table having a tiebreaker column. In accordance with the present invention, an object-oriented application program may instantiate a persistent dependent object with one of two or more specific instances that is selected in response to the value of a data element in a tiebreaker column. Alternatively, an object-oriented application program may instantiate a persistent entity object in accordance with one of two or more entity classes that is selected in response to the value of a data element in a tiebreaker column.

Legacy subclassing

A method and system for mapping an object and an associated handle between the object-oriented schema of an application program and the relational schema of a database in which the object is persisted. The handle is reconstructed in response to a run-time request by an application program to instantiate the object. The handle may be an independent handle or an embedded handle. The relationships afforded by primary keys and foreign keys in a legacy, i.e., existing, relational database, can be preserved by mapping them to the independent and embedded handles, respectively. The mapping is performed prior to application program run-time, and is defined in a high-level schema mapping language, which may be generated with the aid of a schema mapping software tool.

Schema mapping to a legacy table with primary and foreign key support

A method and system for mapping a persistent dependent object between object-oriented schema and relational data store schema. Prior to application program run-time, schema mapping code is generated that defines a logical combination of null and non-null columns in the relational tables for each dependent class and dependent subclass. The code maps each instance variable of each class and subclass of the dependent to one column of the relational data store schema. The code maps a null value to each column for which a dependent subclass has no corresponding instance variable. At run-time, an application program may invoke the services of a schema map object, which in turn calls an object database driver such as ODBC to store an object in the data store or retrieve an object from the data store. In response to such calls referencing an object, the object database driver accesses the data store and associates the data elements with instance variables of the object in accordance with the mapping defined by the mapping code. The subclasses of the dependent are determined by comparing the pattern or combination of null values and non-null values read from the columns corresponding to each class and subclasses to that which the mapping code defines for each class and subclass. The application program, having been provided with the class and subclasses of the dependent, may then store the (non-null) values read by the driver into the instance variables of the object.

Dependent object class and subclass mapping to relational data store

A method and apparatus is disclosed for moving a unit of data (such as an object, program, or file) from a computer operating at a current release level N to a computer operating at a previous release level N-M in a manner that assures that the unit of data will function predictably when restored to the previous release without having to make modifications or updates to the N-M level computer system. This invention allows a new release to be gradually phased in for a distributed computing system instead of requiring that all computers be upgraded to the new release before any units of data can be moved between systems.

Growing community of inventors

Rochester, MN, United States of America

Cynthia Ann Rogers