International Business Machines Corporation

David Joseph Wisneski

Gopi K Attaluri

Sandhya C Turaga

Nisha K Nair

Dinesh K Nirmal

Ahmad Nouri

George F Hongell

Harisch R Nayak

Chih-Cheng Hsu

Curt Lee Cotner

Stephen Andrew Brodsky

James Willis Pickel

Paul Arnold Ostler

Anshul Dawra

William Robert Bireley

Russell Ley Newcombe

Swaminathan Gounder

Stephen James Cocks

Brian Keith Howell

Richard A Crus

Bharat D Rathi

Dilip Kumar Biswal

Delmar Eugene Blevins

Terry L Borden

William K Kelley

Robert Dean Jackson

Catalina Y Fan

Gerald A Fisher

Manish Sehgal

Lori Milhans VanGulick

Catalina Y Wei

Charlene Xiaoqin Sun

Iderpal S Narang

Harry Rohidas Nayak

A method for synchronizing a database with displayed data, includes providing a data feed to receive data from the database to provide displayed document data, detecting a database change to the data within the database by a database synchronizer to provide a change event, polling the database synchronizer using an HTTP message to detect the change event, and pushing the database change to the displayed document data to update the displayed document data in accordance with the database change and the polling. The polling includes long polling and short polling. A polling servlet within the database synchronizer performs the polling by the database synchronizer. The database synchronizer updates the displayed document data by way of a data structure. The data structure is a queue.

Document synchronization solution

Systems, methods and articles of manufacture are disclosed for batching heterogeneous database commands. The heterogeneous database commands may include at least two database command types. Further, at least two of the heterogeneous database commands may include host variables. A request to execute the heterogeneous database commands may be received. The heterogeneous database commands may be sent to a database system for execution, responsive to the request.

Batching heterogeneous database commands

A method for synchronizing a database with data stored at a client includes providing a data feed to receive data by the client from the database and provide received data, caching the received data in a client side cache to provide client side cached data, detecting a database change to data within the database corresponding to the client side cached data according to a polling operation to provide a change event, pushing the change event to the client side cached data to update the client side cached data in accordance with the database change and the polling operation, requesting further data from the database, determining whether the further data includes data of the client side cached data to determine remaining data exclusive of the client side cached data and pushing the remaining data to the client side cached data.

Client side caching of synchronized data

Provided are a method, system, and article of manufacture for using different groups of query graph transform modules to generate execution plans for queries for different database types. A plurality of first type query translator modules include information indicating a first data store type to which the first query translator modules apply and a plurality of second query translator modules include information indicating a second data store type to which the first query translator modules apply. A query is received to query a target data store. A determination is made as to whether the target data store is of the first data store type or the second data store type. The first query translator modules are used to translate the received query to a query execution plan in response to determining that the target data store is of the first data store type. The second query translator modules are used to translate the received query to a query execution plan in response to determining that the target data store is of the second data store type.

Using different groups of query graph transform modules to generate execution plans for queries for different database types

Provided is an object oriented query path expression to relational outer join translator. A path expression, comprising a navigation path through a relationship in a schema, in an object oriented query is translated to a relational database outer join by analyzing each path expression defined in each level of the object oriented query, and by identifying each path expression which can be a candidate for a translation to an outer join. A quantifier is created for each path expression. A translation of the object oriented query to a relational query is then completed. An optimization may also be performed on the grouped quantifiers. After the optimization, an inner join is generated for each quantifier which remains a candidate for a translation to an inner join, and an outer join is generated for each quantifier which remains a candidate for a translation to an outer join.

Object oriented query path expression to relational outer join translator method, system, and article of manufacture, and computer program product

A path expression is translated to a relational database outer join by analyzing each path expression defined in each level of the object oriented query, and by identifying each path expression which can be a candidate for a translation to an outer join. The path expressions are ordered staffing with path expressions defined in a FROM clause. These ordered path expressions are grouped sequentially based upon on a source-target dependency between ordered path expressions and based upon the identifications as a candidate for a translation to an outer join. A quantifier is created for each path expression, said quantifier comprising a variable representing a table in a relational database, and each grouped path expression is replaced with a corresponding quantifier and related table in a relational database. A translation of the object oriented query to a relational query is then completed.

Object oriented query path expression to relational outer join translator method, system, article of manufacture, and computer program product

Methods and apparatus for executing a query on dynamic properties of a plurality of objects in a database are provided. In one implementation, the method includes obtaining a query; determining that a first portion of the query comprises a method for accessing a dynamic property of the plurality of objects; obtaining mapping data associated with the dynamic property of the plurality of objects, the mapping data mapping the dynamic property to a pre-determined location in the database; translating the first portion of the query in accordance with the mapping data such that the first portion of the query is executable against the pre-determined location in the database without creating instances of the plurality of objects; executing the query including executing the translated first portion of the query without creating instances of the plurality of objects; and displaying a result of the executed query to a user.

Method and apparatus for executing a query on dynamic properties of objects in a database

The present invention provides a method and system for a query on dynamic properties of objects. The method includes: obtaining a query; determining that the query pertains to at least one mapped dynamic property; obtaining mapping data for the at least one mapped dynamic property; and translating the query for the at least one mapped dynamic property according to the mapping data to run against a database. The method uses the stored mapping data of the dynamic property to translate the query on the mapped dynamic property such that it may be run against the database. In this manner, queries on mapped dynamic properties are performed through pushdown rather than in object space. This increases the efficiency of the queries.

Efficient object query processing technique on object's dynamic properties via pushdown

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.

Finding named collections via life cycle interfaces

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.

Method and system for handling foreign key update in an object-oriented database environment

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

Method and system for transparently caching and reusing query execution plans efficiently

A computer-implemented component broker series server for optimized caching of SQL data is implemented. In an object-oriented computer system, relational data from a relational database is cached in a data cache. The object-oriented computer system has a server that includes an instance manager and that is connected to at least one client. Objects that represent the relational data are created and managed under control of the instance manager. The relational data is stored in the data cache, which includes a virtual memory data cache for each client.

Optimized caching of SQL data in an object server system

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.

Growing community of inventors

Morgan Hill, CA, United States of America

David Joseph Wisneski