Sybase, Inc.

Digital Equipment Corporation

Sap Se

Steven A Kirk

Roland F McKenney

David Walrath

William S Yerazunis

William Barabash

Roger D MacNicol

Anil Kumar Goel

Blaine French

Anant Agarwal

Nandan Marathe

Kaushal Mittal

Shailesh Kamalakar Mungikar

Fang-Ying Yen

Kurt Wilhelm Deschler

Anisoara Nica

Jun Rao

Ivan T Bowman

Muhammed Sharique

Randall G Bello

Clark D French

Peter W White

Evguenia A Eflov

Mark Delafranier

Yong Min Chen

Xiqing Li

Katherine Tsouya Yang

Jeffrey J Plager

Kenneth A Gilbert

Vipul Sharma

Ken A Gilbert

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.

Accelerating queries based on zone expression maps

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 one or more values from a column of a database table. It is determined that the values from the column are divided into a plurality of data zones, and that a sorted dictionary includes an ordered arrangement of the values from the column. A min value and a max value from a satisfaction array that indicates which values satisfy the condition are determined. Which of the data zones are disqualified are determined based on the values of the disqualified data zone falls outside of the range between the minimum value and the maximum value. The values of any remaining zones are evaluated to determine a result of the query. The result set is returned.

Accelerating queries with complex conditions using zone map enhancements

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 a plurality of tallies associated with the plurality of zones. Each tally in the plurality of tallies is for indicating whether a zone in the plurality of zones include records with data values in the column of the table that satisfy the condition. 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.

Accelerating queries based on zone condition tallies

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.

Accelerating database queries using enhanced partition elimination

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.

Query access optimizations for tiered index architecture

A method may include accepting a database query including an operator requesting two or more incoming tuple streams be combined into a result tuple stream. At least one data value in the incoming tuple streams may be represented by an enumeration value. The method may include generating a query execution plan for the database query. The query execution plan may include encoding the enumeration value and a corresponding source identifier into a composite union enumeration. The source identifier may identify which of the two or more tuple streams corresponds to the enumeration value. The method may further include executing the database query according to the query execution plan to obtain the data value and providing the data value in response to the database query.

Accelerating database queries using composite union enumeration

A database query may include an operator requesting two or more incoming tuple streams be combined into a result tuple stream. Generating a query execution plan may include constructing an equivalence union enumeration lookup table for a result domain of an element within the result tuple stream by taking a set union of incoming tuple domains, wherein each distinct value within that result domain is assigned an enumeration value. Generating the query execution plan may include constructing a secondary enumeration for each incoming tuple stream, wherein each secondary enumeration maps enumerated values within the incoming tuple stream into secondary ordinal values that correspond to equivalence union enumeration values. Generating the query execution plan may include mapping an incoming enumeration value through the secondary enumeration to produce an equivalence union enumeration value, and/or mapping, with the equivalence union enumeration lookup table, the equivalence union enumeration value to a cell value.

Accelerating database queries using equivalence union enumeration

Tiered index management

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.

Table parameterized functions in database

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.

Accelerating database queries containing bitmap-based conditions

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.

Accelerating queries using delayed value projection of enumerated storage

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.

Accelerating database queries comprising positional text conditions plus bitmap-based conditions

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.

B-tree ordinal approximation

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.

Accelerating queries based on exact knowledge of specific rows satisfying local conditions

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.

Growing community of inventors

Chelmsford, MA, United States of America

Steven A Kirk