International Business Machines Corporation

Fen-Ling Lin

Yao-Ching Stephen Chen

Yun Yu Wang

Guogen Zhang

Jerry Mukai

Hong Sang Tie

You-Chin Gene Fuh

Mengchu Cai

Tammie Dang

Li-Mey P Lee

Allan Benjamin Lebovitz

Peter Hoa

Terence Patrick Purcell

Thomas Abel Beavin

Bryan Frederick Smith

Li Jun Xia

Paramesh Sampatrai Desai

Claire Willey McFeely

Yoichi Tsuji

Jason Alexander Cu

Hsiuying Yen Cheng

Ying Zeng

Balakrishna Raghavendra Iyer

Maryela Evelin Weihrauch

Piyush Goel

Gautam Bhargava

Akira Shibamiya

Brian Thinh-Vinh Tran

Ning Wang

William Robert Bireley

Lee-Chin Hsu Liu

Yao Ching Stephen Chen

Binghui Zhong

Irene Ching-Hua Liu

Binghua Zhen

Jerome Quan Wong

Demai Ni

David J Kuang

Annie S Tsang

Kathryn Ruth Zeidenstein

Ying-Lin Chen

Kouhorng Allen Yang

William Samuel Perlman

Illong A Huang

Vijayshankar Raman

Xin Yang

Hong Min

Inderpal Singh Narang

James Z Teng

James Zu-Chia Teng

James Willis Pickel

Wei Han

Julie Ann Watts

Lin Qiao

Donald J Haderle

Patrick Dooling Bossman

Andrei Fedorovich Lurie

Yefim Shuf

Kalpana Shyam

John Joseph Campbell

Christopher John Crone

Karelle Lynne Cornwell

Randy Mitchell Nakagawa

Shengxi Suo

Yumi Kimura Tsuji

Margaret Ann Bernal

Stephen Yao Ching Chen

Ou Jin

Adrian B Lobo

Desai Paramesh Sampatrai

Ted Eric Blank

Yue Huang

Euna Park

Hsuiying Yen Cheng

Kou Horng Yang

Terry Dennis Allen

Thomas Eng

Maureen Mae McDevitt

William Y Kyu

Lisa R Curran

Jung-Hsin Hu

Glenn M Yuki

Darren Benjamin Swank

Craig Leonard Sutton

Dino Carlo Tonelli

Aspects of the invention include techniques for providing a schema evolution on a live database system without an outage. A non-limiting example method includes initiating a schema change on a live database system. The schema change includes an attribute for a database object. A first application package having a user application that is dependent on the database object and that is bound with a release(deallocate) option is identified. Existing threads and new threads executing the first application package are routed to execute the first application package with a release(commit) option and the schema change on the live database system is completed. One or more additional threads concurrently executing one or more additional application packages remain executing with the release(deallocate) option.

Schema evolution on a live database system without an outage

In managing multiple versions of triggers, a database system creates a first version of a trigger to apply a first set of actions in response to a first triggering event. The database system also creates a second version of the trigger to apply a second set of actions to the database object in response to a second triggering event. Upon receiving a command to set the current version of the trigger to the second version, the database system sets the second version as the current version of the trigger. When the triggering event of the trigger occurs, the database system determines that the second version is the current version of the trigger, retrieves the second set of actions in the second version, and executes the second set of actions.

Multiple versions of triggers in a database system

Embodiments relate to a method, system, and computer program product for processing database grouping set query. The method includes receiving a grouping set query request; the grouping set query request including a plurality of groups and determining via said grouping set query request a plurality of to be assigned child tasks for parallel processing. Subsequently, one or more of the groups are assigned as child tasks to be parallel processed based on logical relationship among the groups and the number of available parallel child tasks determined and the parallel child tasks are executed to generate grouping set query result.

Database grouping set query

In managing multiple versions of triggers, a database system creates a first version of a trigger to apply a first set of actions in response to a first triggering event, which includes: creating a first package for the first version of the trigger to include the first set of actions; linking the first package to the database object; and setting the first package as a current version of the trigger. The database system creates a second version of the trigger to apply a second set of actions to the database object in response to a second triggering event, which includes: creating a second package for the second version of the trigger to include the second set of actions; and linking the second package to the database object. In response to a command, the database system sets the current version of the trigger to the second package.

A method, apparatus, and article of manufacture for optimizing a query in a computer system. Grouping operations are optimized during execution of the query in the computer system by: (1) translating the grouping operations into a plurality of levels, wherein each of the levels is comprised of one or more grouping sets with the same number of grouping expressions; (2) deriving the grouping sets on a level-by-level basis, wherein the grouping sets in a base level are obtained from the database and the grouping sets in a next one of the levels are derived by selecting as an input a smallest one of the grouping sets in a previous one of the levels with which it has a derivation relationship; and (3) combining the derived grouping sets into an output for the query.

Dynamic selection of optimal grouping sequence at runtime for grouping sets, rollup and cube operations in SQL query processing

A method and system for providing a scalable storage scheme for native hierarchically structured data of relational tables, includes a base table with indicator columns with information pertaining to hierarchically structured data of a document, data tables for storing the hierarchically structured data corresponding to the indicator columns, and node identifier indexes corresponding to the data tables for mapping between the indicator columns and the hierarchically structured data in the data tables. In an embodiment, actual data for each hierarchically structured data (such as XML) column is stored in a separate data table, and each data table has a separate node identifier index. The node identifier index is searched with a key containing the document identifier and a logical node identifier is used, and a record identifier of a record in the data table containing the node assigned the logical node identifier is retrieved.

Scalable storage schemes for native XML column data of relational tables

A storage of nodes of hierarchically structured data uses logical node identifiers to reference the nodes stored within and across record data structures. A node identifier index is used to map each logical node identifier to a record identifier for the record that contains the node. When a sub-tree is stored in a separate record, a proxy node is used to represent the sub-tree in the parent record. The mapping in the node identifier index reflects the storage of the sub-tree nodes in the separate record. Since the references between the records are through logical node identifiers, there is no limitation to the moving of records across pages, as long as the indices are updated or rebuilt to maintain synchronization with the resulting data pages. This approach is highly scalable and has a much smaller storage consumption than approaches that use explicit references between nodes.

Packing nodes into records to store XML XQuery data model and other hierarchically structured data

A system and computer readable medium for executing a query to access data stored in a database, wherein the query includes a plurality of DISTINCT keys, is disclosed. The system and computer readable medium includes a capture module for identifying each of the plurality of DISTINCT keys in the query and a sort module coupled to the capture module for determining if more than one sort is needed to execute the query, performing a first DISTINCT operation on a first DISTINCT key of the plurality of DISTINCT keys, storing data fetched from the first DISTINCT operation in a master workfile only if more than one sort process is needed to execute the query, and utilizing the master workfile to perform subsequent DISTINCT operations on the other of the plurality of DISTINCT keys.

System for executing a query having multiple distinct key columns

Techniques for partitioning a query are provided. The techniques include establishing one or more criterion for partitioning a query, wherein the query comprises one or more tables, materializing a first of the one or more tables, partitioning the first of the one or more tables until the one or more criterion have been satisfied, and partitioning and joining a remainder of the one or more tables of the query.

Method for partitioning a query

A method, computer program product, and system for managing row identifier (RID) list processing on an index are provided. The method, computer program product, and system provide for accessing one or more key values in the index based on one or more keys specified in a query, retrieving a plurality of row identifiers corresponding to the one or more key values from the index, and predicting an actual number of row identifiers to be retrieved from the index based on the one or more key values accessed and the plurality of row identifiers retrieved.

Row-identifier list processing management

An XML schema is compiled into an annotated automaton encoding, which includes a parsing table for structural information and annotation for type information. The representation is extended to include a mapping from schema types to states in a parsing table. To validate a fragment against a schema type, it is necessary simply to determine the state corresponding to the schema type, and start the validation process from that state. When the process returns to the state, fragment validation has reached successful completion. This approach is more efficient than a general tree representation. Only the data representation of the schema information is handled, making it much easier than manipulating validation parser code generated by a parser generator. In addition, only one representation is needed for schema information for both document and fragment validation. This approach also provides a basis for incremental validation after update.

Efficient XML schema validation of XML fragments using annotated automaton encoding

A method, storage server, and computer readable medium for off-loading star-join operations from a host information processing system to a storage server. At least a first and second set of keys from a first and second dimension table, respectively are received from a host system. Each of the first and second set of keys is associated with at least one fact table. A set of locations associated with a set of foreign key indexes are received from the host system. A set of fact table indexes are traversed. At least a first set of Row Identifiers ('RIDs') associated with the first set of keys and at least a second set of RIDs associated with the second set of keys are identified. An operation is performed on the first and second sets of RIDs to identify an intersecting set of RIDs. The intersecting set of RIDs are then stored.

Off-loading star join operations to a storage server

Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.

Cost-based subquery correlation and decorrelation

A method for generating an execution plan for updating and retrieving data from a database in a single process includes: receiving a statement by a server to update a database with a first set of data and to retrieve a second set of data from the database; building a first execution plan to update the database with the first set of data; building a second execution plan to retrieve the second set of data from the database; and building a single execution plan including a combination of the first and second execution plans. The single execution plan allows for the updating and retrieval of data with a single crossing of an interface between a client and the database. By performing both functions in this manner, the efficiency of performing such tasks on the database is significantly increased.

Method of returning data during insert statement processing

Disclosed is method for processing an aggregate function. Rows that contain a reference to intermediate result structures are grouped to form groups. For each group, aggregate element structures are formed from the intermediate result structures and, if the aggregate function specifies ordering, the aggregate element structures are sorted based on a sort key.

Optimizing aggregate processing

Growing community of inventors

San Jose, CA, United States of America

Fen-Ling Lin