Abstract:
The system, method, and program of this invention allows a two-phase commit protocol to work properly, even when the client acting as the coordinator does not have a log to record two-phase state information. In a preferred embodiment, the client in a client/server distributed transaction processing system is a personal computer. The client, without a recovery log, acts as a coordinator of a commit process. The coordinator migrates, i.e., passes, responsibility for resynchronization, and any associated logging requirement, to a server, e.g., to any of the connected relational database management system (RDBMS) servers, which is a participant in the transaction. The server uses its own recovery log for use in satisfying the logging requirement.
Abstract:
A method and implementing system are provided in which CORBA (Common Object Request Broker Architecture) Life Cycle Service factory finding capabilities are utilized by a CORBA Query Service query evaluator to find queriable collections using simple names. The Life Cycle Service, using the simple name, searches a distributed object oriented environment for both Home and non-Home collections. Means are also provided to make known to Life Cycle Services, the queriable collections which are not also Homes.
Abstract:
A method and system for handling foreign key database updates. The database includes one or more tables where each table includes at least one row and a primary key or foreign key. The method and system include evaluating a list of row operations for foreign key relationships. After evaluating the foreign key relationships, the tables determined to have acyclic foreign key relationships are grouped into a first set of tables and the tables determined to have cyclic foreign key relationships are grouped into a second set of tables. The method and system further include ordering the first set of tables into a list based on the foreign key relationships among the set of tables, such that a parent table will be processed before a child table. The row operations are then applied to each table in the list in the specified order.
Abstract:
A method and system for transparently caching and reusing database query execution plans. The method and system include caching a first query that contains a first constant. A first query is associated with an execution plan that represent the first constant with a parameter name. The method and system further include receiving a new query that contains a second constant and comparing the new query with the first query. A match is determined to exist even when the second constant fails to match the first constant. Upon a match, the first query execution plan is reused by substituting the parameter name in the query execution plan with the second constant from the new query, thereby avoiding generating a new query
Abstract:
A method and system for handling foreign key database updates. The database includes one or more tables where each table includes at least one row and a primary key or foreign key. The method and system include evaluating a list of row operations for foreign key relationships. After evaluating the foreign key relationships, the tables determined to have acyclic foreign key relationships are grouped into a first set of tables and the tables determined to have cyclic foreign key relationships are grouped into a second set of tables. The method and system further include ordering the first set of tables into a list based on the foreign key relationships among the set of tables, such that a parent table will be processed before a child table. The row operations are then applied to each table in the list in the specified order.