Abstract:
A system, method and computer-readable media are provided for repairing corrupted data related to a software database. An electronic information technology system includes (1.) a logical page index; (2.) a free page map; and (3.) a computer-readable medium. The logical page index includes a plurality of logical page index pairs, each logical page index pair having a logical page number and a physical page location address of the computer-readable medium that reference a same record. The database system also includes a means to detect a logical page index pair having a logical page number and a physical page location that are not referencing a same record, and another means to search for a free page map entry that references the physical page address of the record referenced by the logical page index pair.
Abstract:
Apparatus, system, method and computer-readable media for organizing a listing of key pairs to increase the likelihood that key pairs more likely to satisfy database queries will be examined in the course of the query execution before key pairs that are less likely to satisfy a database query.
Abstract:
A system and method for repairing software database corruption are provided. The corruption may be due to an object being associated with an invalid type number. The information of an object with invalid type can become effectively or actually beyond retrieval and the data may be lost. The invention uses a computer to gather attributes of the corrupted object, e.g., object size. The computer then looks in the schema “type number” repository for type numbers associated with the same attributes as they are for the instant object. The object may then be organized presented by the computer to a user using a schema associated with a matched type number. Then the user may select a type number to replace the corrupted or invalid type number of the instant object.
Abstract:
Methods, systems and computer-readable medium 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.
Abstract:
Methods, systems and computer-readable medium are provided for selecting and ordering pathways identified between two selected nodes of a hybrid network. Nodes within the network have 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 of one or more relational databases, including relationships defined between other tables. The schemas of one or more target relational databases, 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 schemas are analyzed and optimal search paths are derived and stored for subsequent use. A query engine accesses the predefined search paths in order to execute queries.
Abstract:
Methods, systems and computer-readable medium are provided for selecting and ordering pathways identified between two selected nodes of a hybrid network. Nodes within the network have 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 of one or more relational databases, including relationships defined between other tables. The schemas of one or more target relational databases, 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 schemas are analyzed and optimal search paths are derived and stored for subsequent use. A query engine accesses the predefined search paths in order to execute queries
Abstract:
A method and system for use with object oriented databases provides schema evolution with deferred propagation of schema changes. The method and system provide a schema that persistently maintains class objects by storing an initial class definition, and shape objects associated with particular class objects and storing subsequent class definitions. The shape objects associated with a particular class object form a shape chain, the last shape object in the shape chain being the current shape object, and maintaining the current class definition. Client objects representing actual instances of data in the database, are instantiated from whichever client object or shape object is current at the time of instantiation, so the all newly created client objects always have the current class definition. Existing client objects, which are those that were created prior to one or more subsequent modifications of the class definition and instantiations of the shape objects in the shape chain of the class, are updated to the current class definition only when they are accessed in the database, thereby providing deferred propagation. Updating such client objects includes copying data members for which there was no change in the definition of the member, and performing type conversion on those data members for which there was a change in the definition of the member.