Abstract: A system, method, and computer-readable medium that facilitate management of data skew during a parallel multiple join operation are provided. Portions of tables involved in the join operation are distributed among a plurality of processing modules, and each of the processing modules is provided with a list of skewed values of a join column of a larger table involved in the join operation. Each of the processing modules scans the rows of first and second tables distributed to the processing modules and compares values of the join columns of both tables with the list of skewed values. Rows of a larger table having non-skewed values in the join column are redistributed, and rows of the larger table having skewed values in the join column are maintained locally at the processing modules. Rows of the smaller table that have non-skewed values in the join column are redistributed, and rows of the smaller table that have skewed values in the join column are duplicated among the processing modules.

Abstract: Techniques for organizing single or multi-column temporal data into R-tree spatial indexes are provided. Temporal data for single or multiple column data, within a database system, is converted into one or more line segments. The resulting line segments are transformed into a minimum bounding rectangle (MBR). Finally, the MBR is inserted into an R-tree spatial index.

Abstract: Apparatus, systems, and methods may operate to retrieve multiple rows of a database in response to receiving a request to execute an aggregate user defined function (UDF) over the multiple rows, to sort each of the multiple rows into common groups, grouping together individual ones of the multiple rows that share one of the common groups, and to send UDF execution requests to apply the aggregate UDF to aggregate buffers of the common groups to produce an aggregate result, so that one of the UDF execution requests and one context switch are used to process each of the aggregate buffers used within one of the groups to provide at least one intermediate result that can be processed to form the aggregate result. Other apparatus, systems, and methods are disclosed.

Abstract: Matrices involved in a data analysis are stored in predetermined blocks, where blocks for a first matrix contain respective rows of the first matrix, and blocks for a second matrix contain respective columns of the second matrix. Results for the data analysis are computed using the blocks of the first and second matrices.

Abstract: Techniques are presented for query generation, population, and management. Queries are generically defined with metadata. The metadata identifies specific queries and specific parameters associated with a given query. When a query instance is desired, parameter values are dynamically acquired and used to populate portions of the metadata associated with a desired query. The query instance may then be executed as desired.

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.

Abstract: Embodiments of the present invention provide for batch and incremental loading of data into a database. In the present invention, the loader infrastructure utilizes machine code database instructions and hardware acceleration to parallelize the load operations with the I/O operations. A large, hardware accelerator memory is used as staging cache for the load process. The load process also comprises an index profiling phase that enables balanced partitioning of the created indexes to allow for pipelined load. The online incremental loading process may also be performed while serving queries.

Abstract: A method or apparatus for use with a database system that stores a join view associated with plural base relations includes receiving modification operations to modify at least two of the base relations of the join view, and re-ordering the received modification operations to avoid concurrent execution of modification operations of more than one of at least two base relations.

Abstract: The present invention addresses the problem of partitioning database relations across a plurality of hosts in a shared-nothing cluster while minimizing communication costs. A new partitioning approach for database relations—join-partitioning—is introduced that focuses on relations and their dependencies to a priori partition the plurality of relations to the plurality of hosts such that each host can locally compute a large class of queries over its partitioned data in isolation at query time, independent of other hosts in the cluster. Such an approach thus overcomes the primary bottleneck, i.e., the network, in deploying database systems over shared-nothing clusters by allowing them to seamlessly scale linearly to tens of thousands of hosts and manage tens or hundreds of terabytes of data.

Abstract: A method, system, apparatus, and article of manufacture is configured to expose a database asset as a web service. A relational database management system (RDBMS) that stores information is executed in a computer system. As part of a process and framework, a series of business rules and process workflows are maintained that manage data that resides in RDBMS tables. A rule is created that contains an application programming interface definition with predefined input and output for exposing the database asset as the web service. The rule is exposed as the web service. The web service is used to invoke a database operation based on the database asset, and to output a result.

Abstract: A method, system, apparatus, and article of manufacture is configured to merge hierarchies in a computer system. A relational database management system (RDBMS) stores information in the computer system. As part of a process and framework, a series of business rules and process workflows that manage data (that is hierarchical in nature) that resides in one or more RDBMS tables are maintained. A first and second hierarchy table are obtained/defined. A placeholder column that will contain mapping information may be defined with the database schema. User input is accepted that identifies data in the second table that maps to data in the first table. Based on the user input, the data in the second table is mapped to the data in the first table. The mapping is utilized to create a merged hierarchy in RDBMS.

Abstract: A method, system, apparatus, and article of manufacture provide the ability to maintain multiple versions of structured views of data in a computer system. A relational database management system (RDBMS) is executed that stores master data in the computer system in master RDBMS tables. The master data is hierarchical in nature and hierarchy metadata for the master data is stored in the RDBMS tables. As part of a process and framework, a series of business rules and process workflows are maintained to manage the master data. Version tables are created in the RDBMS that correspond to each of the master RDBMS tables. Each of the version tables includes an attribute denoting version information. Versions of the master data are defined by replicating the master data and hierarchy metadata into the corresponding version tables. The version tables are used to graphically visualize, manage, and manipulate the versions of the master data.

Abstract: A database system includes a regulator subsystem that is configured to attempt to satisfy service level goals of multiple workloads that are executing in the database system. The regulator subsystem is configured to monitor execution of a particular request belonging to a particular workload and to assign, at plural event intervals, corresponding priority levels to the particular request based on the monitored execution.

Abstract: A system and method for migrating data, in parallel, from a source database system into a target database system includes storing data in groups (e.g., clusters) in the source database system. The groups of data are transferred, in parallel, to respective temporary staging tables in the target database system. The data in the temporary staging tables are then inserted, in parallel, into a target table in the target database system to complete the migration.

Abstract: A user request is received for a workflow guide that pertains to a workflow involving tasks of multiple applications that cooperate with database management software. In response to receiving the indication, the workflow guide is presented for display, where the workflow guide provides information regarding tasks associated with the multiple applications involved in the workflow. Interactive selections made by a user in the displayed workflow guide are received to cause further information to be retrieved.

Abstract: A Customer Relationship Management (CRM) system includes a CRM Client, CRM Engine, and Relational Database Management System (RDBMS). The CRM Client, CRM Engine, and RDBMS integrate a suite of services that allow users to plan, manage, and execute promotional or marketing campaigns, build customer segments, score customers, and analyze customer behavior, product purchases, and response to promotional campaigns. The services include an automated Analytic Data Set Creation service, which simplifies and automates the process of creating analytic data sets useful for modeling and analysis out of operational data stored in the relational database, and a Response Modeling service, which automatically creates promotion response models to score individual customers based on that model in order to predict which customers are most likely to respond to a future promotional campaign.

Abstract: A system, method, and computer-readable medium for optimizing execution of a join operation in a parallel processing system are provided. A plurality of processing nodes that have at least one row of one or more tables involved in a join operation are identified. For each of the processing nodes, respective counts of rows that would be redistributed to each of the processing nodes based on join attributes of the rows are determined. A redistribution matrix is calculated from the counts of rows of each of the processing nodes. An optimized redistribution matrix is generated from the redistribution matrix, wherein the optimized redistribution matrix provides a minimization of rows to be redistributed among the nodes to execute the join operation.

Abstract: Apparatus, systems, and methods may operate to receive user-specified input data from a user input device as a segment query that includes a plurality of criteria, and to store individual counts and at least one additional count in a storage medium. The individual counts are derived from processing the segment query as a corresponding plurality of queries associated with each of the criteria, and the at least one additional count comprises an intersection of at least two of the criteria, regardless of whether the user-specified input data includes an intersection operation. Other apparatus, systems, and methods are disclosed.

Abstract: A method, apparatus, and article of manufacture for accessing data in a computer system. One or more user-defined functions (UDFs) implementing a desired compression or decompression algorithm are created, wherein the UDFs are associated with one or more columns of a table when the table is created or altered, in order to perform compression or decompression of data stored in the associated columns, such that the data is compressed by the UDF implementing the desired compression algorithm when the data is inserted or updated in the table, and the data is decompressed by the UDF implementing the desired decompression algorithm when the data is retrieved from the table.

Abstract: A system and method for managing SQL queries in a database system. The system and method allocates database sessions to database queries and manages the database sessions and queries to provide improved, near real-time access to a database system.