International Business Machines Corporation

Kaarel Truuvert

Xun Xue

Jeffrey James Goss

Jack Hon Wai Ng

Hebert Walter Pereyra

Bishwaranjan Bhattacharjee

Sriram Kolinjivadi Padmanabhan

Matthew Albert Huras

Bruce Gilbert Lindsay

Eugene Jon Shekita

David Everett Simmen

Timothy Ray Malkemus

Leslie Anne Cranston

Tony Wen Hsun Lai

Herbert Walter Pereyra

A database management system in which a plurality of nodes form a database instance, each node including a communication manager for dynamically configuring inter-nodal communication resources. The communication manager receives communication resource allocation requests from clients or a self-tuning algorithm. A resource self-tuning mechanism allocates or de-allocates memory blocks used for communication resource elements dynamically in real time without cycling the instance. Memory blocks are de-allocated asynchronously by placing associated communication resource elements in quarantine until all communication resource elements associated with the memory block are quarantined.

Dynamic configuration and self-tuning of inter-nodal communication resources in a database management system

Dynamic configuration and self-tuning on inter-nodal communication resources in a database management system

A method to process a query for information stored in a relational database using indexes which have different granularity and/or composition is provided. The method involves selecting indexes of various granularity and/or composition based on the query, ordering and combining them (if necessary) in order to subset the data from a relational table to be optimally scanned. The ability to combine indexes is very useful to answer ad hoc queries for which no specific index exists. This requirement may be met by using index ANDing and index ORing techniques.

Method and system for query processing by combining indexes of multilevel granularity or composition

A system and method for a relational database system for identifying star joins in a query and for breaking the query down for bitmap ANDing. The fact table of the star join is located, and cycles between and within dimension tables are broken. Then, the minimal set of tables necessary to execute the star join is identified, and the dimension tables that should appear in the bitmap ANDing plan are also identified. A bitmap ANDing plan is then generated, or, if the query does not qualify for bitmap ANDing, a conventional execution plan is generated.

System and method for identifying and constructing star joins for

Growing community of inventors

Toronto, Canada

Kaarel Truuvert