Abstract: A domain index for a partitioned database can be created using a user-defined indexing scheme. Partition maintenance operations performed on the partitioned database objects cause corresponding partition maintenance operations to be performed on the domain indexes. The user-supplied partitioning code is partition operation-unaware.

Abstract: A method, system, and computer program product provides improved performance for rebuild of user-defined indexes during partition maintenance operations (partition split, merge, and move). A method of maintaining a index of a partitioned database table comprises performing a partition maintenance operation on the partitioned database table wherein a plurality of rows of the partitioned database table are moved from one partition to another, storing mapping information for at least some of the plurality of moved rows, including an old mapping for each of the moved rows and a corresponding new mapping for each of the moved rows, and when rebuilding the index, replacing an old mapping in the index for each of the plurality of moved rows with the corresponding stored new mapping for each of the plurality of moved rows.

Abstract: In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The one or more functions are operable to generate index entries of the user-defined index for the one or more auxiliary properties. The one or more auxiliary properties are different than, and in addition to, a primary property of the user-defined index that provides for evaluating a query operator. The database server receives a first statement that defines the user-defined index, where the first statement includes one or more parameters that define the one or more auxiliary properties. The database server invokes the one or more functions in response to the first statement, where the one or more functions when invoked generate and store the index entries of the user-defined index according to the one or more parameters that define the one or more auxiliary properties.

Abstract: In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The database server receives a query that specifies one or more parameters. A query optimizer generates a plurality of execution plans for evaluating the query. The query optimizer estimates a plurality of total costs respectively associated with the plurality of execution plans, where estimating a particular total cost associated with a particular execution plan comprises: invoking the one or more functions with one or more function arguments based on the one or more parameters; receiving one or more index costs that are associated with using the one or more auxiliary properties of the user-defined index to evaluate the query; and determining the particular total cost based on the one or more index costs.

Abstract: Systems, methodologies, media, and other embodiments associated with supporting materialized views with user-defined aggregates are described. One example system includes logic for exposing a set of interface actions to support a user-defined aggregate in a materialized view associated with a base table. The materialized view may store both the user-defined aggregate and a user-defined aggregate context that facilitates logically connecting the user-defined aggregate to the base table. The example system may also include logic for supporting the user-defined aggregate. The support may be based on the set of interface actions. Example systems and methods may, therefore, facilitate incremental updating of the materialized view and/or rewriting a query to access the materialized view.

Abstract: Systems, methodologies, media, and other embodiments associated with supporting queries with hard time constraints are described. One exemplary system embodiment includes logic for accepting a query having a hard time constraint. The example system may also include logic for selectively rewriting the query having the hard time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the hard time constraint. The example system may also include logic for establishing a timer(s) associated with the rewritten query.

Abstract: Systems, methodologies, media, and other embodiments associated with supporting queries with soft time constraints are described. One exemplary system embodiment includes logic for accepting a query having a soft time constraint. The example system may also include logic for rewriting the query having the soft time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the soft time constraint.

Abstract: A database management system that has bitmap values in which set bits in a representation of a bitstring specify a set of objects whose definitions are built into the database management system. The database management system further includes user-accessible operations on the bitmap values. The bitmap values are represented by means of a mapping specifier that specifies a range of the set of objects and a representation of a string of bits that has been mapped onto the set of object specified by the range specifier. Objects containing bitmap values may be indexed by means of an index tree that includes summary bitmap values.

Abstract: A database management system that has bitmap values in which set bits in a representation of a bitstring specify a set of objects whose definitions are built into the database management system. The database management system further includes user-accessible operations on the bitmap values. The bitmap values are represented by means of a mapping specifier that specifies a range of the set of objects and a representation of a string of bits that has been mapped onto the set of object specified by the range specifier. The representation of the string of bits may be compressed. Bitmap operations on the values may alter the range specifier, the size of the string of bits, or individual bits in the string of bits. The objects represented by the bitmap values may be objects in the database management system or objects external thereto. An example of bitmap values of the first kind are bitmap values representing sets of rowids.

Abstract: A domain index for a partitioned database can be created using a user-defined indexing scheme. Partition maintenance operations performed on the partitioned database objects cause corresponding partition maintenance operations to be performed on the domain indexes. The user-supplied partitioning code is partition operation-unaware.

Abstract: Domain indexes (indexes created and maintained by user-defined indexing schemes) are managed on partitioned database objects that store data using a system-managed approach. Partition maintenance operations performed on the partitioned database objects cause corresponding partition maintenance operations to be performed on the domain indexes. Partition maintenance operations are performed on both the database objects and the indexes by a system-supplied partition manager. Changes in the partition maintenance operations or partitioning methods supplied by the database management system do not affect user-supplied code which is provided by the user-defined indexing scheme. User-supplied code is therefore partition operation-unaware.

Abstract: Described herein is a framework for providing statement atomicity for DDL statements. The framework allows the ability to perform, as multiple transactions, the DDL operations specified by a DDL statement. To begin execution of a DDL statement, a DBMS, for example, updates a flag to indicate that DDL operations have commenced. While the flag is set to this state, the DBMS prevents execution of operations that depend on the DDL statement being executed as an atomic unit. If the DDL operations are aborted, the flag is set to a state that indicates that the execution of the DDL operations did not complete, and the DBMS continues to disallow dependent operations that depend on the atomicity of the DDL statement. Because the flag is used to provide statement atomicity, DDL operations may be performed as multiple transactions. For a DML statement, a mechanism described herein preserves the transactional context of a DML statement.