International Business Machines Corporation

Robert Neugebauer

Nattavut Sutyanyong

David R Vyvyan

Dmitri Abrashkevich

Ioanna Maria Attarian

Calisto Paul Zuzarte

David C Sharpe

Linqi Liu

Mir Hamid Pirahesh

Ian R Finlay

Bruce Gilbert Lindsay

Abhinav Goyal

Glenn P Steffler

Mohammad Wasif Khan

Afiya Nusrat

Embodiments are disclosed for a method. The method includes receiving a plurality of local deltas for a query execution against a corresponding plurality of data sources hosted by a corresponding plurality of distributed nodes of a dynamic distributed network. The method also includes generating a combined delta by combining the local deltas. Additionally, the method includes generating a determined delta result by performing additional processing on the combined delta. Further, the method includes providing the determined delta for one of the distributed nodes.

Generating a global delta in distributed databases

Embodiments are disclosed for a method. The method includes parsing a distributed database query into component queries corresponding to distributed nodes. The method also includes matching component queries to central cache to determine whether the component queries can be satisfied. This matching generates matched and unmatched component queries. The method further includes transforming the matched component query to a cache query and local delta query for a first node. Additionally, the method includes executing the cache query to generate a cache result. Also, the method includes providing the local delta query for the first node to generate a local delta. Further, the method includes providing the unmatched component query for a second node to generate a remote result. The method also includes generating a global delta based on the local delta. The method additionally includes generating a result by combining the cache result, local delta, and remote result.

Querying distributed databases

Aggregation in a computing system can include receiving, at a service node of the computing system, a first query specifying aggregation and translating the first query into a second query having a first canonical format and specifying the aggregation. The method can include forwarding the second query to a first subset of a plurality of endpoint nodes and translating, at each endpoint node of the first subset, the second query into a third query having a format executable by a data source connected to the endpoint node. The third query can specify a level of the aggregation to be performed by the data source determined based upon a processing capability of the data source. The endpoint nodes can initiate execution of the third query by the data sources and provide an aggregated result including a result from the data source(s) to the service node.

Aggregation in dynamic and distributed computing systems

Table discovery in a distributed and dynamic computing system can include detecting an event of a type indicating an update to a data source of a selected node of a plurality of nodes of a computing system, in response to the event, generating, within the selected node, a first collaborative trigger having a query identifier correlated with the type of the event, and distributing the first collaborative trigger through other ones of the plurality of the nodes of the computing system so that the first collaborative trigger reaches an actor of the computing system. Table discovery further can include, in response to receiving the first collaborative trigger within the actor, generating, within the actor, a query for table definition information. The query may be implemented as an aggregation query and may be distributed through the plurality of the nodes.

Table discovery in distributed and dynamic computing systems

A method, computer system, and a computer program product for transforming a scalar sub-query to join with non-provable singleton output, responsive to receiving a parsed representation of a statement, containing a scalar operation, which is correlated to predetermined types of objects, by analyzing the parsed representation to determine eligibility for transformation of any scalar operations. Responsive to a determination of eligibility, a query engine injects additional processing into the parsed representation to defer checking of a 1 row condition required by statement semantics. The query engine further injects processing to utilize a result of the additional processing to validate a single row is produced for each GROUPING/PARTITION key. The parsed representation is modified to remove the 1 row condition. The query engine decorrelates the parsed representation using a predetermined method absent a requirement for a unique key to be present in a predicate of the scalar operation.

Transforming a scalar subquery

A method for transforming a scalar sub-query to join with non-provable singleton output, responsive to receiving a parsed representation of a statement, containing a scalar operation, which is correlated to predetermined types of objects, by analyzing the parsed representation to determine eligibility for transformation of any scalar operations. Responsive to a determination of eligibility, a query engine injects additional processing into the parsed representation to defer checking of a 1 row condition required by statement semantics. The query engine further injects processing to utilize a result of the additional processing to validate a single row is produced for each GROUPING/PARTITION key. The parsed representation is modified to remove the 1 row condition. The query engine decorrelates the parsed representation using a predetermined method absent a requirement for a unique key to be present in a predicate of the scalar operation.

Disclosed is a data processing system implemented method, a data processing system and an article of manufacture for executing a query having a union operator. A data processing system implemented method direct the data processing system to execute a query against a database having data objects. The query has sub-queries and having a union operator. The union operator is operable on sub-queries associated with the query. The database is operatively coupled to the data processing system. The data processing system implemented method including grouping the sub-queries of the union operator according to identified structural similarities, the identified structural similarities being based on an analysis of the sub-queries, grouping the data objects of the database according to the grouped sub-queries, replacing the grouped data objects and any sub-queries associated with the grouped data objects with a reference to a representative data object and a representative sub-query, and accessing at least one member of the grouped data objects, the accessing of the at least one member of the grouped data object being based on the reference.

Method, system and program for executing a query having a union operator

Disclosed is a data processing system, a data processing system implemented method and an article of manufacture for executing a query having a union all operator. The data processing system implemented method directs the data processing system to execute a query against a data object. The query has a union all operator and has a set of data modifying operators. The set of data modifying operators is associated with the union all operator. The union all operator references the data object. The data processing system implemented method includes preventing the union all operator from being applied to the data object, and applying the set of data modifying operators against the data object.

Method, system, and program for executing a query having a union all operator and data modifying operations

Disclosed is a data processing system implemented method, a data processing system and an article of manufacture for executing a query having a union operator. The data processing system implemented method directs the data processing system to process a query against data objects. The data objects are operatively coupled to the data processing system. The query includes a parent operator. The parent operator references a union operator. The union operator references sub-queries. The sub-queries reference the data objects. The data processing system implemented method includes noting a set of partitionings for the union operator, the noted set of partitionings being based on the sub-queries and being based on the data objects reference by the sub-queries, and executing the query having the union operator, the execution of the query being based on the noted set of partitionings and the parent operator.

Growing community of inventors

Stouffville, Canada

Robert Neugebauer