International Business Machines Corporation

Serge Philippe Rielau

Linqi Liu

Xiaoyan Qian

Zhimin Chen

Michael James Carey

George Lapis

Bennet Vance

Mir Hamid Pirahesh

Richard Sefton Sidle

Calisto Paul Zuzarte

Ting Yu Leung

Roberta Jo Cochrane

David C Sharpe

Miroslaw Adam Flasza

Hamid Pirahesh

Mokhtar Kandil

Josep Aguilar Saborit

Biao Zhu

Michael J Carey

There is disclosed a system and method for executing multiple distinct aggregate queries. In an embodiment, the method comprises: providing at least one Counting Bloom Filter for each distinct column of an input data stream; reviewing count values in the at least one Counting Bloom Filter for the existence of duplicates in each distinct column; and if necessary, using a distinct hash operator to remove duplicates from each distinct column of the input data stream, thereby removing the need for replicating the input data stream and minimizing distinct hash operator processing. Also, the use of Counting Bloom Filters for monitoring data streams allow an early duplicate removal of the input stream of data, resulting in savings in computation time and memory resources.

System and method for multiple distinct aggregate queries

For a data processing system having memory for storing a database, a method, a system and a computer program product for directing the data processing system to process a record to be inserted into the database is disclosed. The database includes a plurality of base tables. The method includes the steps of making a record copy matching the record, for each base table to be selected from the plurality of base tables: providing a base table candidate indication for a selected base table, the base table candidate indication indicating whether the selected base table is a candidate base table that may receive the record, the base table candidate indication being determined on an outcome of executing before triggers and an outcome of testing constraints in association with the record copy, the before triggers and the constraints being associated with the selected base table; and restoring the record copy so that the record copy matches the record before providing a next subsequent base table candidate indication for another base table to be selected.

Method, system and computer program for inserting records into a database

System and computer program for inserting records into a database

Method for inserting records into a database

A method and system for use in a computing environment for selecting a subset of records from a set of records for placement of the subset of records in a plurality of destinations. A group of replica records is formed for a record of the subset of records, and a destination identification is assigned to each replica record, except one, of the group of replica records. A replica record associated with one of the plurality of destinations can be selected and can be placed in the associated destination.

Classification of data for insertion into a database

A computer system identifies a predicate in a computer language containing constant expressions as vacuous. The system identifies distinct variables contained in the predicate and represents the predicate by a set of bounding rectangles. The bounding rectangles are represented in a space having a number of dimensions equal to the number of variables. There are finite limits on dimensions of a bounding rectangle which represent the relationship between the variables in the predicate and the constant expressions in the predicate. The predicate is identified as vacuously FALSE where the set of bounding rectangles is empty.

Identification of vacuous predicates in computer programs

A mechanism for supporting generated materialized columns without explicitly adding triggers and a check constraint in a database management system (DBMS). When a column affecting the generated materialized column is updated, a &ldquo;before-update&rdquo; trigger is internally generated in the DBMS and added as the last trigger before the update occurs. Similarly, when an insert operation is performed, a &ldquo;before-insert&rdquo; trigger is generated internally by the DBMS and added as the last trigger before the insert operation occurs. Since the triggers are generated internally in the DBMS, a constraint is not needed for either the update or the insert operations.

Method for providing a system maintained materialized functionally dependent column for a database management system

A method for typed view hierarchies for an object-relational database management (OPDBMS). The views in the hierarchy are merged into a unified hierarchy view through case expressions for mapping and wrapping of overloaded columns. During the merge, the underlying logical tables are eliminated which results in a simplified query graph. The transformation is a non-loss operation which condenses the type information within the case expressions. This allows update, delete and insert operations to be resolved on the query graph on a local level. Using query rewrite rules, the case expressions may be simplified further.

Efficient implementation of typed view hierarchies for ORDBMS

Growing community of inventors

Greenwood, Canada

Serge Philippe Rielau