Abstract: Techniques for data assignment from an external distributed file system (DFS) to a database management system (DBMS) are provided. Data blocks from the DFS are represented as first nodes and access module processors of the DBMS are represented as second nodes. A graph is produced with the first and second nodes. Assignments are made for the first nodes to the second nodes based on evaluation of the graph to integrate the DFS with the DBMS.

Abstract: A system and method for determining optimal query plans within distributed database system employing table operators for performing analytic operations for storing and processing multi-structured data. The optimization of a query plan proceeds through a collaborative exchange between a database system optimizer, or planner, and a table operator, wherein multiple communications between said optimizer and said table operator are conducted to exchange input and output information relevant to optimizing execution of the query and table operator.

Abstract: A system includes a multi-system database management system having a plurality of database systems. An index selection subsystem combines sets of query information from respective ones of the plurality of database systems into a workload. The index selection subsystem then generates candidate indexes from the workload, and selects recommended indexes from the candidate indexes based on one or more criteria.

Abstract: A prediction regarding one or more functions can be made for a database environment. In particular, a predication can be made with respect to values stored in at least one column of at least one table in a database, based on the evaluation of one or more functions for a subset of possible column values (i.e., resultant values derived from the evaluation of a subset of possible column values) without the need to calculate the function(s) for all of the actual entries in the column of the table(s). In effect, a functional predicate can be transformed (or translated) to a predicate that is dependent on the column values instead of the evaluation of one or more functions for the column values.

Abstract: Data partitions are assigned to reducer tasks using a cost-based and workload balancing approach. At least one of the initial data partitions remains unassigned in an unassigned partitions pool. Each reducer while working on its assigned partitions makes dynamic run-time decisions as to whether to: reassign a partition to another reducer, accept a partition from another reducer, select a partition from the unassigned partitions pool, and/or reassign a partition back to the unassigned partitions pool.

Abstract: A message selection system may store message selection information. The processor may receive a request to determine a suggested message to transmit to a user interface. In one example, the suggested message may be selected to prompt a predetermined user-based response to be received through the user interface. Based on the received request, the processor may select a plurality of candidate messages from a plurality of messages included in the message selection information. The processor may select a numerical score associated with each of the candidate messages. Based on the numerical scores, the processor may select the suggested message from the plurality of candidate messages. A method and computer-readable medium may also be implemented.

Abstract: A message selection system may include a memory device to store a plurality of messages. Each message may prompt a user to provide a respective predetermined response. The message selection may further include a processor in communication with the memory device. The processor may determine at least one condition associated with a channel configured to transmit the plurality of messages to a user interface. The processor may further select, in response to the at least one condition associated with the channel, at least one of the plurality of messages to be transmitted to the user interface over the channel. A method and computer-readable medium may also be implemented in message selection.

Abstract: A system and method for allocating storage devices within a multi-node data storage system. The system maintains a data structure including a generation number indicating an incarnation of the data structure, a highest cylinder ID index value observed to be in use within the data storage system, and a safe index value indicating a lowest cylinder ID index value for use when allocating a new cylinder index. Following receipt of an allocation request, the system assigns a cylinder ID index to the allocation request, the cylinder ID index being greater than the safe index value. The assigned cylinder ID index is compared to the highest cylinder ID index value observed to be in use within said data storage system, and when the cylinder ID index is greater than the highest cylinder ID index value, increments the generation number and highest cylinder ID index value maintained within the data structure.

Abstract: An apparatus is provided for managing usage of database system resources by concurrent database users of a database system. The apparatus comprises a processor and a storage device communicatively coupled with the processor. The processor is programmed to (i) determine a number of in-use Access Module Processor Worker Tasks (AWTs) based upon at least one system-defined or user-definable Resource Limit rule, (ii) take a difference between the number of in-use AWTs and an AWT limit, and (iii) set the difference equal to a number of available AWTs for a new database job or request.

Abstract: A first workload that contains logged predicates contained in database queries is received. A subset of the predicates is selected based on costs associated with the predicates. A compressed workload is formed using the selected subset of the predicates. Indexes are then selected based on the compressed workload.

Abstract: Embodiments of the present invention provide one or more hardware-friendly data structures that enable efficient hardware acceleration of database operations. In particular, the present invention employs a column-store format for the database. In the database, column-groups are stored with implicit row ids (RIDs) and a RID-to-primary key column having both column-store and row-store benefits via column hopping and a heap structure for adding new data. Fixed-width column compression allow for easy hardware database processing directly on the compressed data. A global database virtual address space is utilized that allows for arithmetic derivation of any physical address of the data regardless of its location. A word compression dictionary with token compare and sort index is also provided to allow for efficient hardware-based searching of text. A tuple reconstruction process is provided as well that allows hardware to reconstruct a row by stitching together data from multiple column groups.

Abstract: A system may include a storage device configured to store a data store comprising data. The database system may further include a processor in communication with the storage device. The processor may receive a query that includes at least one predicate associated with the data. The processor may further determine that the at least one predicate is eligible to be converted to a range set predicate. The processor may further convert the at least one predicate to a range set predicate. The processor may further process the query with the range set predicate. A method and computer-readable medium may also be implemented.

Abstract: Router threads read real-time stream data as that data is received at processing nodes along a processing path for the data. The data is initially parsed into workloads. Each router thread maintains real-time analytics for the workloads and reports deviations in the analytics to a workload coordinator. The workload coordinator dynamically and in real time provides updated data distribution maps based on the reported deviations, and the router threads use the data distribution maps to determine a next processing unit to forward the workloads, where the next processing unit includes an instance of a next processing node in the processing path for the workload. The next processing node performs additional processing on the workloads along the processing path.

Abstract: Attributes, which are associated with successful customer results of a first marketing campaign, are archived and linked with that first marketing campaign. When an analyst wants to run a second campaign using the successful customer of the first campaign. The archived attributes are processed by a predictive analysis application to produce customer leads for the second campaign.

Abstract: Query conditions are received in a cache from a query optimizer of a Database Management System (DBMS). Dynamic statistics for the query conditions are maintained in the cache. Actual statistics are received in the cache after the query conditions are executed in the DBMS. Entropy-based estimated selectivity values for executing the query conditions are provided to the query optimizer to develop a query plan for executing queries having the query conditions. The entropy-based estimated selectivity values based, at least in part, on the dynamic statistics and the actual statistics.

Abstract: Sets of joins against relations in a query are identified. An optimal order for processing the joins is determined. The optimal order is then processed by an enhanced genetic algorithm to generate a second optimal order for processing the joins. The second optimal order is at least as good as the optimal order. The second optimal order is used when developing a query plan for processing the query in a Database Management System (DBMS).

Abstract: A system and method for allocating different temperature data to storage devices within a computer system including inexpensive non-volatile storage, such as hard disk drive (HDD) storage devices; expensive non-volatile storage, such as solid-state drive (SSD) storage devices; and expensive volatile storage, such as system cache memory. The system and method allocates cold to warm data having access frequencies up to a first access frequency threshold to inexpensive non-volatile storage; allocates hot data having access frequencies greater than the first access frequency value and ranging up to a second access frequency threshold, to expensive non-volatile storage; and allocates very hot data having access frequencies greater than the second access frequency value and which resides during normal system operation in expensive volatile storage, to said inexpensive non-volatile storage.

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: One or more assignments (e.g., one or more maps) can be used for assigning data to processing units of a database system with multiple processing. In other words, assignments can be provided as a more effective solution for assigning data to the processing units of database systems that can operate with multiple processing units. Generally, an assignment can be used to assign data to the processing units for processing, virtually in any desired manner (e.g., virtually any desired function). By way of example, maps can associate data to containers (e.g., buckets) and associate the containers to processing units of database system with multiple processing units.

Abstract: Methods and systems may operate to include displaying to a user a graphical user interface (GUI) to enable the user to combine multiple search criteria having variable parameters, used in searching of a database, to produce a predefined count of search results. User selections of the multiple search criteria, values for the variable parameters, and Boolean operations to combine the search criteria may be received from the user. As the received user selections change, a count of search results retrieved from the database, based on the user selections, may be dynamically displayed. Additional methods and systems are disclosed.