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 for detecting and handling skew and spillover in in-memory hash join operations. To improve the detection of skew and spillover in parallel processing systems, a Poisson distribution of unique hash values to Units of Parallelism (UoPs) is employed to determine the number of rows per UoP and in turn, the potential of spillover at a UoP. Hash join plan options can be selected or adjusted to reduce the likelihood of spillover.

Abstract: A method for performing in-memory hash join processing. This method utilizes bulk processing within the hash join steps, such as performing bulk reads of hash values from tables to be joined, and performing bulk probes of hash values in tables to be joined, thereby providing more efficient utilization of memory bandwidth and CPU throughput, reducing memory accesses in the execution path, and reducing CPU cycles per instruction.

Abstract: A determination is made to co-locate geographical dispersed data of a Relational Database Management System (RDBMS). Costs associated with the direction of moving a portion of the dispersed data from one site to another site are computed. A comparison of the costs is made to determine which direction to move the data to co-locate it at one site for optimal performance of a RDBMS operation.

Abstract: Techniques for annotation driven Representational State Transfer (REST) web services are presented. A platform-independent World-Wide Web application is annotated to expose the methods of the application when accessed via a WWW site. The methods are described when rendered via a WWW site in a REST compliant format (RESTful).

Abstract: A system and method for performing distributed execution of database queries includes a query server that receives a query to be executed on a database, forms a query plan based on the query, assigns tasks to task slots on a plurality of worker nodes in a cluster, and, upon receipt of a notification that a task has completed on a worker node, immediately assigns an unassigned task to a free task slot on that worker node, such that the task may begin executing on that worker node substantially immediately thereafter. The task slots on worker nodes include pools of resources that run tasks without start-up overhead.

Abstract: Data portions of a database can be grouped and ranked in order of priory for reassignment from one or more maps to another one or more maps. It should be noted that a first map can assign the data portions to a first configuration of processors for processing the data portions, and a second map assigns the data portions to a second configuration of processors, different than the first configuration, for processing the data portions in a database system and/or environment. The data portions are reassigned in groups during an available time (window) for reassignment by taking the first one of the groups can be reassigned (“moved”) in the available, then the second one in the available reaming time, and so on, until no group of data portions can be moved in the remaining time or all of them have been moved.

Abstract: Storage devices and components, including memory components (e.g., non-volatile memory) can be trained by executable code that facilitates and/or performs reads and/or write requests to one or more storage sub-modules of a storage component (e.g., memory configured on a memory channel) made up of multiple storage components (e.g., DIMMs). The executable code can also train multiple storage components at the same time and/or in parallel.

Abstract: An order (or priority) for reassigning data portions of a database from a first map to a second map can be determined. It should be noted that the first map assigns the data portions to a first configuration of processors for processing the data portions, and the second map assigns the data portions to a second configuration of processors, different than the first configuration, for processing the data portions in a database system and/or environment. The order can be determined by grouping the data in multiple groups and ordering the groups in accordance with a determined priority for reassignment In doing so, one or more relationships between the data portions and/or cost of use for each one the groups can be considered.

Abstract: The number of processors that store data can be limited for some data in order to improve efficiency in database system that uses multiple processing units to process data. For example, a map can be provided for one or more sparse database tables (or tables) that are relatively small in view of the number of processors that are available. The map can effectively assign distinct portions of the data, e.g., rows of a database, for processing only to a limited number of processers (or processing units). The database system can use the map to process data accordingly.

Abstract: A database-management system (DBMS) initiates execution of an incoming database query according to an initial query-execution plan that identifies an expected path for execution. Then, at some point after execution of the query has begun, the DBMS concludes that execution has not proceeded along the expected path and, in response, chooses an alternative query-execution plan for continued execution of the query.

Abstract: A database system monitors a metric for a Workload Definition (WD) and adjusts a metric throttle for the WD to a new metric throttle level Cn, computed as the average of a theoretical metric level Cc that would drive a metric to a target T and a theoretical metric level Cr that would drive a rolling average of the metric to the target T.

Abstract: A database system may include a storage device configured to store a plurality of database tables. The database system may further include a processor in communication with the storage device. The processor may determine a first sampling percentage to be used on a column of a database table. The first sampling percentage may be based on a respective frequency of each column value in the column. The processor may determine a second sampling percentage to be used on the column in generation of the plan to respond to the database query. The second sampling percentage may be based on size of the database table. The processor may select the maximum of the first sampling percentage and the second sampling percentage. The selected sampling percentage may be used to collect statistics on the column. The collected statistics may be used to generate at least one database query response plan associated with the column. A method and computer-readable medium may also be implemented.

Abstract: A database system may include a storage device to store a plurality of database tables. At least a portion of the database tables may be column-partitioned. The database system may also include a processor in communication with the storage device and a row-column subsystem executable by the processor to receive a request to locate a row of a column-partitioned database table. The row in the request may be used to provide a response to a query. The row-column subsystem may be further executable to determine if referenced column values of the requested row are stored in a cache associated with the row-column subsystem. The row-column subsystem may be further executable to retrieve the referenced column values of the row in the request from the cache in response to the determination that the column values are in the cache. The row-column subsystem may be further executable to provide the referenced column values for evaluation with respect to query conditions of the query.

Abstract: A method for spooling data for use in joining a small table with a large table in a relational database system. The method analyzes a join condition for combining records from the small and large tables, selects qualified rows from the large table, and writes the qualified rows to a spool file. The spool file includes a first partition containing hash values of all bind terms for the join condition; a second partition including a join column with a best selective bind term; and at least one additional partition including additional join columns used in bind terms. The partitions are grouped together within a container row in the spool file, and multiple container rows are written together within a super-container row in the spool file.

Abstract: A method for performing row qualification in database table retrieval and join operations. This method, referred to as bulk qualification, evaluates conditions on multiple rows in a database table at the same time, providing more efficient utilization of memory bandwidth and CPU throughput.

Abstract: A combination of non-persistent-based and persistent-based schemes are used to effectively manage volatile storages which are conventionally managed solely by using non-persistent schemes (e.g., LRU schemes in cache memory). Generally, the persistent-based schemes can be based on persistent information associated with a non-volatile storage environment (e.g., persistent data temperatures associated with data stored in non-volatile storages). In this context, a persistent-based scheme can, for example, be effectively used in addition or combination with a conventional scheme provided for volatile memory. By way of example, a LRU scheme can be combined with a scheme based on persistent data temperatures in order to more effectively manage cache memory provided to enhance the performance of a system. As another example, a LRU, a LFU aging schemes can be combined with a scheme based on persistent data temperatures.

Abstract: Excess capacity (or excess resources) can be used in a capacity controlled environment to effectively manage data storage of a database. In this context, excess capacity can, for example, be controlled used as needed, as configured and/or on a temporary basis. Management of data storage in a database can, for example, include operations associated with moving or relocating data of the database. Relocation of data can, for example, be performed to relocate data deemed to be “hot” data to a location that can provide a faster access time in order to improve the overall efficiency of the database system.

Abstract: A database request can be processed at least partly based on one or more differences between multiple database systems and/or environments. The differences can, for example, include differences between one or more database capabilities respectively provided by the multiple database systems, differences between the representation of data in the multiple database systems, and differences in the interfaces for accessing the multiple database systems.

Abstract: Methods and systems that implement enhanced user interactions with a grid are described. A method may include generating a grid of cells arranged in a number of rows and columns. Each row may correspond to a data record of a database. The grid may be displayed to a user while identifying one or more cells as editable cells. Input data may be received from the user for each of the editable cells. The input data may be validated using predefined criteria to identify incorrect input data and errors associated with the incorrect input data may be displayed to the user. Additional methods and systems are disclosed.