Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives, from a requestor, a query for data comprising a condition on a column of a table. The table includes a plurality of records divided into a plurality of zones. The program further determines a set of zones in the plurality of zones that include records that satisfy the condition based on metadata associated with each zone in the plurality of zones comprising a data interval of an expression on data values in the column of the table. The program also determines a result set of records in the table that satisfy the condition based on records in the set of zones. The program further sends the result set of records to the requestor.

Abstract: Increasing the efficiency of performing queries on databases by eliminating partitions during a database query. The database query configured to access a database table having one or more columns and one or more rows, the database query including a condition on a specified basis column. The database table being partitioned on the basis of the specified column, the specified column having one or more distinct values and the partitioning including mapping, by the at least one programmable processor, individual ones of the one or more distinct values to individual partitions causing each row in the table to be mapped to a specific partition. Candidate partitions and guaranteed partitions can be identified. The database query can be applied only to candidate partitions. All rows which satisfy the database query and all the rows of the guaranteed partition can be forward for processing.

Abstract: Disclosed herein are methods for retrieving data from a database. An embodiment operates searching for a key in a first index. The method determines that the searching will require a storage access request and issues the storage access request. The method continues searching for the key in a second index.

Abstract: Disclosed herein are methods for retrieving data from a database. An embodiment operates searching for a key in a first index. The method determines that the searching will require a storage access request and issues the storage access request. The method continues searching for the key in a second index.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives, from a requestor, a query for data comprising a condition on a column of a table. The table includes a plurality of records divided into a plurality of zones. The program further determines a set of zones in the plurality of zones that include records that satisfy the condition based on metadata associated with each zone in the plurality of zones comprising a data interval of an expression on data values in the column of the table. The program also determines a result set of records in the table that satisfy the condition based on records in the set of zones. The program further sends the result set of records to the requestor.

Abstract: Disclosed herein are methods for retrieving data from a database. An embodiment operates searching for a key in a first index. The method determines that the searching will require a storage access request and issues the storage access request. The method continues searching for the key in a second index.

Abstract: Systems, methods and computer program product embodiments for providing table parameterized function (TPF) functionality in a database are disclosed herein. An embodiment includes defining a TPF in a database, wherein the definition of the TPF defines one or more parameters of the TPF, at least one of the parameters being a table parameter. A query is received that operates to call the TPF, wherein the query defines one or more input parameters, the input parameters comprising at least one table input parameter to be used as input for calling the TPF. The query is processed to produce a result, and the result of the query is returned.

Abstract: Disclosed herein are system, method, and computer program product embodiments for accelerating queries with zone map enhancements. An embodiment operates by receiving a query, including a condition on a column of data within a table with one or more data zones. For the condition, the data zones of the database are classified based on per zone metadata. These data zone categories include: guaranteed zones that only include data that satisfies the condition; border zones that include data that may or may not satisfy the condition; and disqualified zones that only include data that does not satisfy the condition. The rows of the border zones that satisfy the condition are identified. From amongst the rows of the guaranteed zones and the identified rows of the border zones that satisfy the range condition, a result set of rows that satisfy the condition are identified. The result set is returned.

Abstract: Increasing the efficiency of performing queries on databases by eliminating partitions during a database query. The database query configured to access a database table having one or more columns and one or more rows, the database query including a condition on a specified basis column. The database table being partitioned on the basis of the specified column, the specified column having one or more distinct values and the partitioning including mapping, by the at least one programmable processor, individual ones of the one or more distinct values to individual partitions causing each row in the table to be mapped to a specific partition. Candidate partitions and guaranteed partitions can be identified. The database query can be applied only to candidate partitions. All rows which satisfy the database query and all the rows of the guaranteed partition can be forward for processing.

Abstract: Systems, methods and articles of manufacture for accelerating database queries containing bitmap-based conditions are described herein. An embodiment includes determining a bitmap, where the bitmap represents a set of rows that have satisfied one or more conjunctive conditions which preceded a conjunct that is a disjunction in a query expression and restricting evaluation of a disjunct within the disjunction to the set of rows represented by the bitmap. Another embodiment includes determining a satisfaction bitmap, where the bitmap represents the result of one or more preceding disjuncts in a disjunction within a query expression and restricting scope of evaluation of a disjunct to a set of rows that are not within the determined satisfaction bitmap. In this way, embodiments of the present invention enable the acceleration of queries containing disjunctions of conditions on a database table, as well as reduce the temporary resources consumed for such queries.

Abstract: A system, method, and computer program product for processing a database query are presented. Steps for identifying a table needed to resolve the query, creating an enumeration value, determining whether the enumeration value is semantically equivalent to data from a data field in the table, and using a temporary data structure to evaluate the query are disclosed.

Abstract: Embodiments include systems, methods and computer-readable mediums for accelerating a database query containing multiple predicates connected conjunctively. The database system receives a database query on a table. The database query includes a first predicate and a second predicate connected conjunctively. The database system produces a search space that satisfies a pre-filter for the first predicate. The search space represents rows of the table that satisfy the first predicate. The database system then applies the search space to evaluation of the second predicate. In one embodiment, the first predicate is a LIKE predicate requesting rows matching a search string in a column, and the pre-filter is a word index representing rows of the table containing a token of the search string in the column.

Abstract: Disclosed herein are methods for retrieving data from a database. An embodiment operates searching for a key in a first index. The method determines that the searching will require a storage access request and issues the storage access request. The method continues searching for the key in a second index.

Abstract: A system, method, and computer program product are provided for improving performance of positional text conditions in concert with bitmap-based conditions. This is accomplished, for example, by focusing positional text condition evaluation to candidate rows based on a bitmap resulting from application of a prior condition. Additionally, the result of a positional text condition may itself be provided in the form of a bitmap to accelerate further bitmap-based condition processing.

Abstract: A system, method, and computer program product are provided for generating a range of ordinals corresponding to key values represented in a B-Tree data structure. This allows for a boundary point, usable, for example, for partitioning the B-Tree for parallel processing, to be specified using an ordinal value of the range of ordinals. Then an ordinal-to-key transformation can be performed in order to identify a key value corresponding to the boundary point. Additionally, ordinal values can be identified through the use of key-to-ordinal transformations, allowing for specification of ranges, for example, in terms of key values.

Abstract: A method, computer program product, and system are provided for accelerating a query in a database system. For example, an embodiment of the method may include generating a data structure identifying a set of rows that satisfy conditions local to a table prior to an evaluation of a query and modifying the query based on the data structure. In addition, the method may include repeating the steps with respect to generating the data structure and modifying the query, if one or more additional local conditions are inferred from modifying the query based on the data structure.

Abstract: Systems, methods and computer program product embodiments for providing table parameterized function (TPF) functionality in a database are disclosed herein. An embodiment includes defining a TPF in a database, wherein the definition of the TPF defines one or more parameters of the TPF, at least one of the parameters being a table parameter. A query is received that operates to call the TPF, wherein the query defines one or more input parameters, the input parameters comprising at least one table input parameter to be used as input for calling the TPF. The query is processed to produce a result, and the result of the query is returned.

Abstract: A system, method, and computer program product are provided for sorting a set of records in a sort run. As the records are sorted, metadata regarding the sort run is gathered, and subsequently used to determine bounds of two or more disjoint subsets of the sort run. This enables the parallelization of several tasks over the sort run data using efficient, dynamic bounds determination, such as the outputting of sorted data from the disjoint subsets in parallel.

Abstract: A system, method, and computer program product for processing a database query are presented. Steps for creating a secondary enumeration when necessary and utilizing the secondary enumeration to improve query operations by processing enumeration values of the secondary enumeration instead of data represented by the enumeration values are disclosed.

Abstract: A system, method, and computer program product are provided for improving performance of positional text conditions in concert with bitmap-based conditions. This is accomplished, for example, by focusing positional text condition evaluation to candidate rows based on a bitmap resulting from application of a prior condition. Additionally, the result of a positional text condition may itself be provided in the form of a bitmap to accelerate further bitmap-based condition processing.