Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for tuning query execution performance in a database management system are described. In an aspect, query optimization in a database management system (DBMS) with awareness of limited resource usage includes identifying limited resource usage for each possible plan being considered for query execution by a query engine. A determination of whether any possible plan has limited resource usage that does not exceed a threshold level is made, and when at least one possible plan does not exceed the threshold level, the identified limited resource usage is included as a consideration during plan selection by the query engine. In an embodiment, temporary database usage is identified for each possible plan.

Abstract: A system, method, and computer program product are provided for producing aspects of a generation model. These include a domain model having one or more elements, and templates defined for the elements. The generation model is used to compile a code generator, which can be used to generate code from an input conforming to the domain model.

Abstract: A system, method, and computer program product for improving physical lock acquisition for database transaction logs are described herein. In an embodiment, the method operates by receiving a request for a transaction log page and determining whether a requested log page is newly-allocated or already exists. A determination is made regarding whether the last log page is being modified. A physical lock is taken on the requested log page when it has been determined that the requested log page is not newly-allocated and that the last log page is not being modified. Operations on the last log page are synchronized without a physical lock when it is determined that the requested log page is newly-allocated or that the last log page is being modified.

Abstract: A hybrid approach for evaluating expressions in database management systems is described herein. For each expression in an execution location (XL), an execution strategy is selected. The strategies considered are lazy, lazy with memoization, eager, and eager with memoization. The execution strategies are assigned in a way that minimizes the estimated cost of evaluation.

Abstract: A system, method, and computer program product are provided for initiating an application in communication with a database management system via a bridge. Application memory is allocated to the application from a shared memory space within the database management system.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for tuning query execution performance in a database management system are described. In an aspect, query optimization in a database management system (DBMS) with memory I/O (input/output) awareness includes determining compensated physical I/O (PIO) values indicative of memory I/O operations, including an approximate cache occupancy level, of an executing query in a DBMS, and utilizing the compensated PIO values as feedback to a query optimizer of the DBMS for optimization of future query execution.

Abstract: A database system with methodology for generating bushy nested loop join trees is described. In one embodiment, for example, an improved method is described for optimization of a query requesting data from a database, the method comprises steps of: generating a left deep operator tree for returning data requested by the query based on traversing a left deep operator tree search space; transforming the left deep operator tree into a semantically correct structure for returning data requested by the query; and building a query execution plan for returning data requested by the query based on the semantically correct structure.

Abstract: Systems, methods, computer program product embodiments for representing markup language document data in a searchable format in a database system are provided. An embodiment includes parsing a markup language document into a data stream, the data stream including a plurality of fields in a predefined format having a symbol table for at least one field of the data stream, and optimized field size based on a maximum value of data within each field, and storing the data stream in data storage.

Abstract: Methods, systems, and computer program products for tuning query execution performance in a database management system are described. In an embodiment, query performance issues of chosen database operational logic in a database management system are identified with an external utility provided for use on top of the database management system. The identified query performance issues are resolved selectively in the database management system without modifying the chosen database operational logic.

Abstract: A system, method, and computer program product for reducing data storage requirements in a database system are described herein. An embodiment includes identifying at least one data candidate of fixed length data type in at least one row of database data for compression based upon a predetermined threshold level and a boundary of compression, providing at least one bit within the at least one row for an identified data candidate according to the boundary of compression, and storing the at least one row as compressed data in the database system. For compression based on a row boundary, the identified data candidates for compression include fixed length columns having lengths that do not fall below the predetermined threshold level in a row of data and the at least one bit comprises a bitmap for a length of the identified data candidates following compression.

Abstract: Methods, systems, and computer program products for dynamically monitoring, processing, and managing alerts are described herein. In an embodiment, the method operates by receiving messages that are either alerts or responses to existing alerts. The messages are parsed to determine if whether they are alerts or responses to alerts. Actions including updating alert states and storing alert data are executed, and then the method sends notifications regarding the alert messages and responses to a collaboration list of registered subscribers that dynamically expands over time based upon alert escalations. The method then determines whether additional messages have been received; and performs actions associated with these additional messages until there are no remaining alerts or alert responses to process. The method stores updated alert and response data in a repository so that the alerts and responses can be monitored and managed.

Abstract: A secured database system with built-in antivirus protection is described. In one embodiment, for example, a method of the present invention is described for securing a database system, the method comprises steps of: provisioning storage from a storage device, for storing database information; generating an encryption key so that the database information is stored on the storage device in an encrypted manner; generating a decryption key for decrypting the database information stored on the storage device, wherein access to the decryption key is controlled by the database system based on user privileges; receiving a request from a user for access to the database information; determining whether the user has been granted sufficient privileges to access the database information; if the user has been granted sufficient privileges, automatically decrypting the database information to provide the access; and otherwise denying the request if the user has not been granted sufficient privileges.

Abstract: A development system with methodology providing optimized message parsing and handling is described. In one embodiment, for example, a computer-implemented method is described for improved processing of certain types of messages, the method comprises steps of: loading metadata at design time, the metadata characterizing a particular message type; based on the metadata, automatically generating source code for creating runtime components highly optimized for the particular message type; compiling the source code into the runtime components, for deployment in a runtime environment; and at runtime, processing messages of the particular message type with the runtime components, so that messages are processed in a manner that is highly optimized for the particular message type.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for protection of encryption keys in a database are described herein. An embodiment includes a master key and a dual master key, both of which are used to encrypt encryption keys in a database. To access encrypted data, the master key and dual master key must be supplied to a database server by two separate entities, thus requiring dual control of the master and dual master keys. Furthermore, passwords for the master and dual master keys must be supplied separately and independently, thus requiring split knowledge to access the master and dual master keys. In another embodiment, a master key and a key encryption key derived from a user password is used for dual control. An embodiment also includes supplying the secrets for the master key and dual master key through server-private files.

Abstract: A method for temporarily storing data objects in memory of a distributed system comprising a plurality of servers sharing access to data comprises steps of: reserving memory at each of the plurality of servers as a default data cache for storing data objects; in response to user input, allocating memory of at least one of the plurality of servers as a named cache reserved for storing a specified type of data object; in response to an operation at a particular server requesting a data object, determining whether the requested data object is of the specified type corresponding to the named cache at the particular server; if the data object is determined to be of the specified type corresponding to the named cache, storing the requested data object in the named cache at the particular server; and otherwise, using the default data cache for storing the requested data object.

Abstract: A method, in a continuous computation system, for processing a set of registered queries over a cluster of servers includes creating an execution plan for processing a set of queries over a cluster of servers, where the continuous computation system creates the execution plan by analyzing the semantics and requirements of the queries to determine how to distribute processing across the cluster. Analysis of a query can include determining whether input messages for the query can be processed independent of each other, whether input messages for the query can be partitioned into groups that can be processed independent of each other, whether the query includes an aggregator function, and whether the query includes a subquery.

Abstract: A system, method and computer program product for exchanging data between a client and information sources via a server. The invention operates by obtaining data objects from a plurality of sources, wherein the data objects have native data formats specific to the sources. The data objects are converted to a common data format, and are then transmitted to the client. At the client, the data objects are modified. The modified data objects are compliant with the common data format. The modified data objects are transmitted to the server, where they are converted to the native data formats specific to the sources associated therewith. Then, the converted modified data objects are transmitted to the associated sources.

Abstract: A method for processing messages ensures that every message that enters a continuous processing system is fully processed in its entirety, even in the event of a failure within the system. Messages are pushed through an execution plan that includes a set of connected “primitives” that process the message, where the primitives may be distributed across a group of servers. Messages are pushed through in accordance with a protocol that does not permit unprocessed messages to be permanently lost as they travel from input sources, between primitives, and to output sources within the execution plan. The input queue, output queue, and state (if any) associated with each primitive are saved in persistent storage at select checkpoints. If a failure occurs on a server, the server, after it starts up again, restores the primitives on that server to the input queues, output queues, and states saved at the last applicable checkpoint.

Abstract: A system, method, and computer program product for performing transactional prefetching are presented. Steps for sending correlated queries to a database server for processing are disclosed.

Abstract: Systems, methods and computer program products for testing the stability and efficiency of a database query engine are described herein. In an embodiment, all possible query execution plans considered by a query optimizer are retained in the form of abstract plans (APs). Each AP is then subsequently supplied with a query to test for stack traces and incorrect results that may occur during the execution of the query. An embodiment includes determining an optimizer efficiency index (OEI) by comparing each AP with a query execution plan chosen by the query optimizer and classifying the APs into various performance buckets based on the degree of improvement or degradation in performance with respect to the query execution plan chosen by the query optimizer. In another embodiment to determine the optimizer efficiency index, APs are ranked based on estimated cost and classified into a plurality of categories based on query optimizer estimates and actual execution behavior.