International Business Machines Corporation

Brian Thinh-Vinh Tran

Yun Yu Wang

Nelson Mendonca Mattos

Gene Y C Fuh

Michelle Mei-Chiou Jou

Bruce Gilbert Lindsay

Guogen Zhang

Yao-Ching Stephen Chen

Gene Y Fuh

Fen-Ling Lin

Jyh-Herng Chow

Hsin Pan

Linda Gail DeMichiel

Ping Li

Daniel Tsunfang Lee

Mir Hamid Pirahesh

Hong Min

Terence Patrick Purcell

Roberta Jo Cochrane

Ruiping Li

Tuong Chanh Truong

Patrick Dooling Bossman

Yefim Shuf

Lee-Chin Hsu Liu

Mary C Lehner

Irene Ching-Hua Liu

Robert L Huddleston

Neal R Eisenberg

Charles S Tribolet

Gary R Karasiuk

Tony Kuen Lee

Yue Huang

Ou Jin

Ding-Wei Chieh

Hsuiying Yen Cheng

Shahrokh Talmoud

Jeffrey D Richey

You-Chin (Gene) Fuh

Serge Philippe Rielau

Kamilla Kazimierowicz

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 variable-length binary string is utilized to encode node identifiers in a tree for an XML document object model. A general prefix encoding scheme is followed; a node identifier is generated by the concatenation of encodings at each level of a tree along a path from a root node to another particular node. Arbitrary insertions are supported without change to existing node identifier encodings. In addition, the method provides for document order when unsigned binary string comparison is used to compare encoded node identifiers. In support of sub-document concurrency control, prefix encoding provides a way to derive ancestor-descendant relationships among nodes in a tree. Lastly, the encoding method provides a natural pre-order clustering sequence, also known as depth-first clustering. If a prefix is applied to an encoding with a level number, starting with zero at the root, width-first clustering will result. A mixed clustering can also be supported.

Self-adaptive prefix encoding for stable node identifiers

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 and system for efficiently identifying materialized view candidates for queries filters materialized views using certain criteria, using the materialized view signatures. This filtering rejects some of the unqualified materialized views prior to the performance of the query rewrite matching algorithm, resulting in a group of materialized view candidates. The query rewrite matching algorithm is then performed on the materialized view candidates. By first filtering the materialized views based on their signatures, the number of materialized views on which the query rewrite matching algorithm is performed is significantly reduced, improving performance.

Materialized view signature and efficient identification of materialized view candidates for queries

A method, apparatus, and article of manufacture for a computer-implemented embedded storage mechanism for structured data types. A statement is stored in a database stored on a data storage device connected to a computer. At compile-time, specific methods for a structured data type are mapped to generic methods using parse trees. At run-time, an in-memory representation of the structured data type is generated using information conveyed in the parse trees. Then, linearization of the generated in-memory representation is performed.

Embedded storage mechanism for structured data types

A method, apparatus, and article of manufacture for run-time support for user-defined index ranges and index filters. A statement is executed in a database stored on a data storage device, which is connected to a computer. The database contains data. A search range is generated based on a user-defined range function associated with a user-defined index.

Run-time support for user-defined index ranges and index filters

A method, apparatus, and article of manufacture for a computer-implemented integrated architecture for user-defined search. A statement is executed in a database stored on a data storage device connected to a computer, and the database contains data. Under control of the database, a statement is received that requests manipulation of the data. The statement includes a user-defined function. An index of a user-defined index type is used to access the data. The user-defined function is processed with the accessed data.

Fully integrated architecture for user-defined search

A method, apparatus, and article of manufacture for a computer-implemented model for user-defined search in Relational Database Management Systems. A statement is executed in a database stored on a data storage device connected to a computer. Data that is qualified by user-defined functions is located based on a model that supports user-defined search.

User-defined search using index exploitation

A method, apparatus, and article of manufacture for computer-implemented exploitation of database indexes. A statement is executed in a database stored on a data storage device connected to a computer. The database contains data. A model based on pattern matching for a user-defined predicate and selection of an index exploitation rule based on a matched user-defined predicate is provided to be used for exploiting an index to retrieve data from the database.

Generalized model for the exploitation of database indexes

A method, apparatus, and article of manufacture for a computer implemented storage mechanism for persistent objects in a database management system. A statement is executed in a computer. The statement is performed by the computer to manipulate data in a database stored on a data storage device connected to the computer. It is determined that an object is to be stored in an inline buffer. When the object can be entirely stored in the inline buffer, the object is stored in the inline buffer. When the object cannot be entirely stored in the inline buffer, a selected portion of the object is stored in the inline buffer and the remaining portion of the object is stored as a large object.

Optimal storage mechanism for persistent objects in DBMS

A framework for a query compiler and run-time environment for resolving a table reference to a dynamic table that is first identified at run-time but is initially unknown at compile-time. A parser parses the table reference and creates a parsed representation for the table that identifies the type of dynamic table. A code generator creates executable plans containing run-time table object representations (TAOB), from the parsed representations, that contain the type of dynamic table. The TAOB is also extended to provide for parameters that are definable at run-time, including a table ID of the actual table entity being referenced. A routine is embedded in a run-time routine that checks the type of dynamic table in the TAOB and dispatches control to one of a plurality of corresponding routines, depending upon the type of dynamic table. The corresponding routines use the extended TAOB to dynamically link the table reference to the dynamic table, depending upon the type of dynamic table. Once the dynamic table has been linked to the table reference, query processing continues as if that table were a base or derived table.

Supporting dynamic tables in SQL query compilers

This invention provides an integrated compiler for compiling SQL3 control statements having procedural, i.e., control, information packaged together with query, i.e., non-procedural, statements. A query extractor contained within the parser extracts the query statement from the control statement leaving a control skeleton. The query statement is processed as usual through a query compiler for generating executable plans with the exception that the name resolution function for resolving variables is modified for looking up local variables. This modification takes into account the mapping of local and host variables to create a unification of local and host variables. The control skeleton is processed through a control analyzer which generates a representation of the control flow and a scope and symbol table. The control analyzer also unifies the local and host variables. A plan synthesizer then takes as input the control flow information, symbol tables, and individual executable plans for the query statements and generates a meta-plan comprising a merger of a top level plan for the control skeleton and sub-plans representing the executable plans of the query statement. Therefore, this invention provides a uniform way of treating local and host variables, provides an efficient way of performing bind-in/bind-out processes, creates a single execution plan requiring only a single run-time interpreter, and requires minimum enhancements to existing SQL2 compilers. In addition, this invention enables the application of global optimization techniques for optimizing both the control aspects and query aspects of the original control statement.

System, method, and program for extending a SQL compiler for handling

The system, method, and program of this invention avoids potential write/write conflicts and read/write conflicts when a subcomponent of a composite object (e.g., an ADT) is mutated. The embodiments of this invention define a copy semantic for the mutation function. In one embodiment, a copy function is inserted prior to any mutation function. In a another embodiment, a global compile-time analysis is performed to determine if a write/write or read/write conflict exists; and to eliminate redundant copy constructors if a conflict does exist. In a preferred embodiment, only a local analysis is performed during the parsing phase, thereby avoiding a global compile-time analysis. A mutation safe flag is associated with each parse tree node. A read target leaf parse tree node is set to false while non-leaf parse tree nodes (functions) derive their value from an incoming node, except that constructors and copy constructor functions are always true. Whether or not a copy is made of the composite object (i.e., whether or not a copy constructor is inserted) prior to a mutation is determined according to the setting of the mutation safe flags and according to the following. If a mutation safe flag for a mutation function is false, a copy constructor is inserted for the mutated composite object and the mutation safe flag is set to true. In addition, for update and trigger statements, the mutation safe flag for a mutated target is defaulted to true. Furthermore, related update entries are grouped together and a copy is generated for the common target. The generated copy is used as the common target for all of the mutations caused by the update entries grouped together in order to accumulate all of the desired mutations in a same copy of the composite object.

Database management system, method and program for supporting the

A versioned-data management system is provided with a method for detecting independent changes to a part when an attempt is made to promote a variant of the part. For each variant of a part, there is maintained two identifiers and a flag. The first identifier is the identifier of the last change to that variant. The second identifier is the last-change identifier of the variant which was the source of the drawdown. When the variant is successfully promoted, and there was not previously a variant at the level to which it is promoted, its drawdown-from identifier value is not changed. When the variant is successfully promoted, and there was previously a variant at the level to which it is promoted, the drawdown-from identifier is set to the drawdown-from identifier value of the variant which was previously at the level to which the promote is made. When the promote of a variant fails, the drawdown-from identifier is set to the last-change identifier value of the variant which is first in the search path beginning at the level to which the promote is being made. The flag indicates whether the variant can be promoted by normal means, or must be promoted using promote.sub.-- force. The identifiers and flag are used to identify independent changes and control data integrity in the VDMS at promotion time.

Growing community of inventors

San Jose, CA, United States of America

Brian Thinh-Vinh Tran