Abstract: A database system is capable of processing a query and providing a progress indicator of the processing of the query based on at least a first cost factor. Initially, an estimate is set for the first cost factor. During processing of the query, the estimate of the first cost factor is updated to enable refinement of the progress indicator.

Abstract: A method, computer program, and computer network are disclosed for transferring data to a database system. The method includes preparing a plurality of input records, each including a plurality of fields and a selector configurable to represent a plurality of states. For each input record of the plurality of input records, the following steps are performed. A state represented by the selector for an input record is read. Based on the state represented by the selector, a subset of the fields for the input record is transferred to the database system.

Abstract: A computer system programmed as a database receives a query Q1. Q1 includes a predicate. The predicate includes a reference to a current timestamp of time TT1. The database has R data structures. The computer system creates a plan, Plan 1, to execute Q1. Plan 1 includes the identification of a first set of data structures, P1, to be accessed in executing Plan 1, at the current timestamp of time TT1. The number of data structures in P1 is less than R. The computer system determines that Plan 1 is valid for a period of time. The computer system stores in a cache Plan 1 and an indication that Plan 1 is valid for the period of time.

Abstract: Embodiments of the present invention provide a database system that is optimized by using hardware acceleration. The system may be implemented in several variations to accommodate a wide range of queries and database sizes. In some embodiments, the system may comprise a host system that is coupled to one or more hardware accelerator components. The host system may execute software or provide an interface for receiving queries. The host system analyzes and parses these queries into tasks. The host system may then select some of the tasks and translate them into machine code instructions, which are executed by one or more hardware accelerator components. The tasks executed by hardware accelerators are generally those tasks that may be repetitive or processing intensive. Such tasks may include, for example, indexing, searching, sorting, table scanning, record filtering, and the like.

Abstract: Techniques are presented for tracking status within object chains. Global objects are associated with unique identifiers and each dependent local object created within the context of a particular global object receives that particular global object's identifier. A unique counter value is maintained for each status type of each global object. The local object facilitates communicating changes in its status using the received global identifier, and the counter values are updated accordingly for the affected global object.

Abstract: A system, method, and computer-readable medium for optimized processing of queries that feature maximum or minimum equality conditions are provided. A table on which the query is applied is scanned a single time. Rows of the table distributed to respective processing modules are scanned by the processing modules. Each processing module maintains identification of any rows distributed to the respective processing module that have attribute values that equal the maximum or minimum attribute value locally identified by the processing module. Subsequently, a global aggregation mechanism is invoked to compute the query result without requiring an additional rescan of the table. Further, the disclosed mechanisms may be extended to compute top N queries featuring maximum or minimum equality conditions.

Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system. For example, table and column descriptors are embedded in the machine code database instructions. For ease of installation, the hardware accelerators employ a standard interconnect, such as a PCle or HT interconnect. The processing elements implement a novel dataflow design and Inter Macro-Op Communication (IMC) data structures to execute the machine code database instructions. The hardware accelerator may also comprise a relatively large memory to enhance the hardware execution of the query/operation tasks requested.

Abstract: A system, method, and computer-readable medium for optimization of query processing in a parallel processing system are provided. Skewed values and non-skewed values are treated differently to improve upon conventional DISTINCT and aggregation query processing. Skewed attribute values on which a DISTINCT selection or group by aggregation is applied are allocated entries in a hash table. In this manner, a processing module may consult the hash table to determine if a skewed attribute value has been encountered during the query processing in a manner that precludes repetitive redistribution of rows with highly skewed attribute values on which a DISTINCT selection or group by aggregation is applied.

Abstract: Techniques are presented for hierarchical report tool session management. A user interacts with a hierarchical reporting tool during a first session and reaches a specific nested level within the tool for a particular hierarchy being accessed by the user. At some point in time the user exits the tool (normally or abnormally). The specific nested level is maintained on behalf of the user. So, when the user initiates a second and subsequent session with the tool, the user is presented with the specific nested level when the tool is started for that subsequent session.

Abstract: A tree-structured database is collapsed into a two-column table. The two-column table includes a characteristic key value for a given leaf node in the first column and the system identification (SID) relating to the characteristic key value in the second column and also identifying the node that leads to the characteristic key value. Data is presented by coupling the characteristic key value with a transaction table. A query that is formulated in an infocube may be translated to a relational data base query, collapsed, and reformulated into an infocube result set, or vice versa.

Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system. For example, table and column descriptors are embedded in the machine code database instructions. For ease of installation, the hardware accelerators employ a standard interconnect, such as a PCle or HT interconnect. The processing elements implement a novel dataflow design and Inter Macro-Op Communication (IMC) data structures to execute the machine code database instructions. The hardware accelerator may also comprise a relatively large memory to enhance the hardware execution of the query/operation tasks requested.

Abstract: Embodiments of the present invention provide a hardware accelerator that assists a host database system in processing its queries. The hardware accelerator comprises special purpose processing elements that are capable of receiving database query/operation tasks in the form of machine code database instructions, execute them in hardware without software, and return the query/operation result back to the host system. For example, table and column descriptors are embedded in the machine code database instructions. For ease of installation, the hardware accelerators employ a standard interconnect, such as a PCle or HT interconnect. The processing elements implement a novel dataflow design and Inter Macro-Op Communication (IMC) data structures to execute the machine code database instructions. The hardware accelerator may also comprise a relatively large memory to enhance the hardware execution of the query/operation tasks requested.

Abstract: Several methods and a system for analyzing ordered data using pattern matching over an indefinitely long ordered sequence of rows in a relational database are disclosed. In one embodiment, a method of a server includes receiving an ordered data in a relational database. The method further includes matching a pattern specified in a query on ordered data in a relational database in a single pass in constant space for overlapping mode of results. The method also includes creating an output data in the single pass in constant space for overlapping mode of results based on the matching of the ordered data with the pattern in the relational database query.

Abstract: Apparatus, systems, and methods may operate to classify storage locations in a storage medium according to at least three response time grades, to classify data to be stored in the storage locations according to at least three access frequency grades, and to migrate the data between the storage locations according to a predicted access frequency assigned to preemptive allocations of some of the storage locations, based on the response time grade and the access frequency grade associated with the data prior to migration. Other apparatus, systems, and methods are disclosed.

Abstract: A method, apparatus, and article of manufacture for accessing data in a computer system. Compression and decompression functions are associated with a column of the table, in order to perform compression of decimal, numeric or date data stored in the column when the data is inserted or updated in the table, and in order to perform decompression of the data stored in the column when the data is retrieved from the table. The compression function compresses and stores the data in a fixed-length compressed field in the column without a length value, and the fixed-length compressed field has a size that is determined by a range of values for the data stored in the fixed-length compressed field. The decompression function retrieves and decompresses the data from the fixed-length compressed field.

Abstract: Apparatus, systems, and methods may operate to monitor database system resource consumption over various time periods, in conjunction with scheduled data loading, data export, and query operations. Additional activities may include generating a database system resource consumption map based on the monitoring, and adjusting database system workload throttling to accommodate predicted database system resource consumption based on the resource consumption map and current system loading, prior to the current database resource consumption reaching a predefined critical consumption level. The current system loading may be induced by data loading, data export, or query activity. Other apparatus, systems, and methods are disclosed.

Abstract: A method, computer program, database system and data structure for indexing spatial objects are disclosed. Each spatial object has a location in an n-dimensional space. The indexing is for use in a partitioned parallel environment including P partitions. Each partition resides on one or more parallel processing systems. The n-dimensional space is divided into quad-tree cells (QTCs) in a quad-tree structure. Each spatial object is assigned to one or more QTCs based on the location of the spatial object in the n-dimensional space. A spatial object index entry is created which includes a designator for the QTC to which the spatial object is assigned and a pointer to the spatial object. The entries are sorted by their QTC numbers into a list. The list of entries is divided into P substantially equal parts. The entries associated with each part are stored in a different one of the P partitions.

Abstract: A method, database system and computer program are disclosed for performing a temporal join between two temporal database tables. The method includes determining a selected table intersection between a period of interest and a time period value for a selected table row, scanning an inner table for a row that matches the selected table on the join conditions and overlaps the selected table intersection, and determining the remainder time period values from the selected table intersection.

Abstract: Techniques for processing operations on column partitions of a table in a database are provided. A table includes a control column partition. Each delete container of the control column partition representing multiple rows in the table (or a row partition, if any), and each row represented by a bit flag within a bit string. Rows of the table set for deletion have their corresponding bits within a particular delete container set to indicate those rows are deleted.

Abstract: Techniques for extending horizontal partitioning to column partitioning are provided. A database table is partitioned into custom groups of rows and custom groups of columns. Each partitioned column is managed as a series of containers representing all values appearing under the partitioned column. A logical row represents a row of the table logically indicating each column value of a row. Compression, deletion, and insertion within the containers are managed via a control header maintained with each container.