公开(公告)号：CA2876466C

公开(公告)日：2022-07-05

申请号：CA2876466

申请日：2014-12-29

Applicant: IBM CANADA LTD IBM CANADA LIMITEE

Inventor： FINLAY IAN R ,  KELLER JEFFREY M ,  STORM ADAM J ,  ZUZARTE CALISTO P

IPC: G06F16/14 ,  G06F7/00 ,  G06F16/9035

Abstract: An illustrative embodiment for optimizing scans using a Bloom filter synopsis, defines metadata to encode distinct values in a range of values associated with a particular portion of a managed object in a database management system into a probabilistic data structure of a Bloom filter that stores an indicator, encoded in a fixed size bit map with one or more bits, indicating whether an element of the particular portion of the managed object is a member of a set of values summarized in the Bloom filter using a value of / or definitely not in the set using a value of 0. The Bloom filter is compressed to create a compressed Bloom filter. The Bloom filter is added to the metadata associated with the managed object and used when testing for values associated with predicates.

公开(公告)号：CA2876466A1

公开(公告)日：2016-06-29

申请号：CA2876466

申请日：2014-12-29

Applicant: IBM CANADA LTD - IBM CANADA LIMITEE

Inventor： FINLAY IAN R ,  KELLER JEFFREY M ,  STORM ADAM J ,  ZUZARTE CALISTO P

IPC: G06F17/30 ,  G06F7/00

Abstract: An illustrative embodiment for optimizing scans using a Bloom filter synopsis, defines metadata to encode distinct values in a range of values associated with a particular portion of a managed object in a database management system into a probabilistic data structure of a Bloom filter that stores an indicator, encoded in a fixed size bit map with one or more bits, indicating whether an element of the particular portion of the managed object is a member of a set of values summarized in the Bloom filter using a value of / or definitely not in the set using a value of 0. The Bloom filter is compressed to create a compressed Bloom filter. The Bloom filter is added to the metadata associated with the managed object and used when testing for values associated with predicates.

公开(公告)号：CA2427228A1

公开(公告)日：2004-10-30

申请号：CA2427228

申请日：2003-04-30

Applicant: IBM CANADA

Inventor： FINLAY IAN R ,  VALENTIN GARY

IPC: G06F7/00 ,  G06F9/44 ,  G06F17/30

Abstract: In an information retrieval system, a query optimization method for transforming maximum or minimum function aggregation predicates on a non-indexed column into a singl e sort function. The method first evaluates the query to identify a table and a predicate equating a column of the table to a sub-query that applies a maximum or minimum aggregation function to the column to return an aggregate value for the column. The aggregate value is used for selecting rows from the table to produce a query result. A determination is then made as to whether an index has not been created using the column of the table. And, in response to these steps of evaluating and determining, the method reforms the query as a sort function on the column. The sort function scans the table once to provide the query result.

公开(公告)号：CA2363187A1

公开(公告)日：2003-05-19

申请号：CA2363187

申请日：2001-11-19

Applicant: IBM CANADA

Inventor： FINLAY IAN R ,  ZUZARTE CALISTO P

IPC: G06F17/30

Abstract: An optimized query processing system and method for a database system. The database system includes a table of data and an index correlated to both the query and to the table. The optimized query processing system includes an index accessing module adapted to access the index to determine if the table contains an ent ry satisfying a query predicate; and a tablescan module for scanning substantially the entire table and retrieving data satisfying the query. A method is also disclosed for generating database diagnostic data.

公开(公告)号：CA2279222A1

公开(公告)日：2001-01-30

申请号：CA2279222

申请日：1999-07-30

Applicant: IBM CANADA

Inventor： FINLAY IAN R ,  DOOLE DOUGLAS J

IPC: G06F17/30

Abstract: A pre-pass and direct call mechanism which replaces the interpreter. The mechanism moves static decisions out of the repeated runtime path, info a pre-pass operation. Advantageously, the mechanism reduces runtime overhead, and improves overall performance of the DBMS during runtime, while maintaining the considerable investment in opcode generation and plan representation, already invested in the implementation of the DBMS.

公开(公告)号：CA2427273A1

公开(公告)日：2004-10-30

申请号：CA2427273

申请日：2003-04-30

Applicant: IBM CANADA

Inventor： FINLAY IAN R ,  LOHMAN GUY M

IPC: G06F16/2455 ,  G06F17/30

Abstract: For an information retrieval system adapted to process a query having an associated plan, the associated plan includes applying predicates, including local predicates and a join predicate, to at least two tables, method and system of applying the predicates is provided. Index ANDing is used to construct a filter for filtering a first of the tabl es in accordance with the local predicates. The join predicate is applied to the tables for determining row identifiers of rows satisfying the join predicate. The row identifiers are used to probe the filter for determining whether the rows satisfying the join predicate also satisfy the local predicates. The rows that satisfy both the join and local predicates are fetched and the join predicate is completed. Results of the join predicate are then returned .

公开(公告)号：CA2353015A1

公开(公告)日：2003-01-12

申请号：CA2353015

申请日：2001-07-12

Applicant: IBM CANADA

Inventor： FINLAY IAN R ,  LAI TONY WEN HSUN ,  ZUZARTE CALISTO P ,  ZILIO DANIEL C

IPC: G06F17/30

Abstract: The retrieval of distinct tuples in a relational database management system. In response to a request from a consumer process for distinct tuples in a relational database table matching a defined criteria, a distinct operator component sequentially requests tuples from a source component. The source component access the database table and returns a tuple in the sequence to the distinct operator component. The distinct operator component passes each tuple in the sequence to an auxiliary logger. The auxiliary component receives a tuples from the distinct component and determines if it is distinct from other previously received tuples in the sequence to verify its uniqueness to the distinct operator. Tuples that are verified as unique by the auxiliary logger are returned to the consumer process by the distinct operator upon verification.

公开(公告)号：CA2427216A1

公开(公告)日：2004-10-30

申请号：CA2427216

申请日：2003-04-30

Applicant: IBM CANADA

Inventor： HORNIBROOK JOHN F ,  STORM ADAM J ,  ZILIO DANIELE C ,  FINLAY IAN R ,  FLASZA MIROSLAW A

IPC: G06F7/24 ,  G06F17/30 ,  G06F9/44

Abstract: The invention improves performance of a query in a database system when a pl an for the query includes sorting an input that is at least partially sorted such that a slow materialization sort can be applied. The invention applies the slow materialization sort by determini ng a sequence of subsets in accordance with the partially sorted input. As each of the subset s is determined, the subset is output for further processing. Advantageously, the invention reduc es the waiting period for obtaining results from a sorting operation under certain circumstances.

公开(公告)号：CA2279222C

公开(公告)日：2002-07-16

申请号：CA2279222

申请日：1999-07-30

Applicant: IBM CANADA

Inventor： DOOLE DOUGLAS J ,  FINLAY IAN R

IPC: G06F17/30

Abstract: A pre-pass and direct call mechanism which replaces the interpreter. The mechanism moves static decisions out of the repeated runtime path, info a pre-pass operation. Advantageously, the mechanism reduces runtime overhead, and improves overall performance of the DBMS during runtime, while maintaining the considerable investment in opcode generation and plan representation, already invested in the implementation of the DBMS.

公开(公告)号：CA2306946C

公开(公告)日：2005-09-20

申请号：CA2306946

申请日：2000-04-28

Applicant: IBM CANADA

Inventor： FINLAY IAN R ,  LOHMAN GUY M ,  SHARPE DAVID C ,  LINDSAY BRUCE G ,  ZILIO DANIEL C

IPC: G06F17/30

Abstract: A query processing system having a data manager, and a query manager also includes a buffer. The query manager calls the data manager to access data based on a query. Where there is no predicate check or consumption operation on the record accessed, the data manager will notionally return the record to the query manager. However, the data manager accomplishes the retu rn by writing the relevant portions of the record to a buffer. The data manager maintains stabilization of the page containing the record while the buffer is being written to. The data manager continues to access records on the stabilized page and to write such records to the buffer where appropriate. The query manager retrieves the records from the buffer after the data manager has completed its operation resulting from the query manager call.