Abstract: Excess capacity available to a database system in a capacity controlled environment can be effectively managed for maintenance and/or tuning activities. In this context, excess capacity can be used as needed and/or on a temporary basis. Furthermore, maintenance and/or tuning activities can be performed without requiring the use of the configured or allotted capacity. As a result, these operations can be performed without adversely affecting other operations which may be deemed more critical by the users of databases. System maintenance and tuning (or fine tuning) of a database environment can, for example, include operations associated with “Physical Tuning,” and “Index Tuning”. Some exemplary operations include collecting Statistics, analyzing a database workload, sampling, analyzing an execution plan, creating indexes.

Abstract: To process a sequence of outer joins in a database system, the database system performs a first outer join of the sequence of outer joins. A result of the first outer join is stored in a result table stored across plural storage modules of the database system. At least a subset of records of the result table is redistributed across the storage modules according to a first join attribute of the result table, where any record of the result table that has a null value for the first join attribute is not redistributed. A second outer join of the sequence is performed using the redistributed result table and another table, where the second outer join is based on the first join attribute of the result table.

Abstract: System and method for translating statements and expressions within statistical language programs into SQL. These statements include one or more input statements and have a plurality of data rows. These statements include one or more array statements, the array statements having a set of original variables. The method for translating statements and expressions within statistical language programs into SQL includes the step of defining a select statement including a subset of the original variables. The expressions include one or more assignment expressions, the assignment expressions including a set of original variables and a set of new variables affected by the assignment expressions.

Abstract: Techniques for time-bound batch status rollup for logged events are provided. A status for each action defined in a database log is resolved during a configured interval of time. The statuses for the actions are aggregated at the end of the interval of time and then joined back into the log.

Abstract: A SEQUENCED request a) to apply a temporal Source table to a temporal Target table under a predicate is received. The Source table includes a plurality of rows that qualify to apply to a single Target table row under the predicate. The predicate specifies a Source table join column. Each of the plurality of Source table rows and the single Target table row include a ValidTime dimension. The plurality of Source table rows is b) ordered by the Source table join column and a period-to-be-modified. The next of the ordered plurality of Source table rows is c) applied by determining that the Target table row has a TransactionTime and, in response, closing out the TransactionTime of the Target table row. Applying the next of the ordered plurality of Source table rows includes identifying an RDIFF range as the period-to-be-modified of the Source table row being applied that is later than the ValidTime range of the single Target table row.

Abstract: A method, computer program and database system are disclosed for guiding the development of workload group definition (WD) classifications for a database system having resources. WD classification information is provided where a workload group is a set of system requests having characteristics defined by a WD and a WD classification identifies one or more WDs with similar performance requirements. If WD classification is not acceptable, one or more of the following functions is performed until WD classification is acceptable: (a) splitting one or more WDs; and (b) merging two or more WDs.

Abstract: Trip data that includes points traversed during corresponding trips is received. Transportation network data that describes geographic locations and links between the geographic locations is received. The trip data and transportation network data are partitioned across a plurality of processing units executing on one or more processors. At each of the plurality of processing units, a subset of the trip data at the corresponding processing unit is locally matched to a subset of the transportation network data at the corresponding processing unit to identify a subset of paths of the transportation network data traversed by one or more of the trips.

Abstract: Apparatus, systems, and methods may operate to receive a request to move at least a portion of a database table stored on a tangible medium from a current partition to a history partition, wherein the database table is partitioned into physical partitions according to a selected mapping update frequency. In response to receiving the request, activities may include modifying a logical partitioning of the database table by updating a mapping of the physical partitions to logical partitions. Other apparatus, systems, and methods are disclosed.

Abstract: The subject matter herein relates to database management systems and, more particularly, encrypted data management in database management systems. Various embodiments provide systems, methods, and software to maintain database tables, some of which are encrypted. Some embodiments include holding clear text in cache and servicing queries from the cache. When a query is received, a file system of the database management system determines if a table holding data to service the query is encrypted. If the table is encrypted, the file system decrypts the data and writes the data to the cache as clear text. Some embodiments, when writing clear text to a table from the cache, determine if the table to which the data is to be written is an encrypted table. If the table is encrypted, the file system encrypts the clear text and stores the cipher text to the encrypted table.

Abstract: Apparatus, systems, and methods may operate to receive a set of ordered user-selected compression rules as a compression rule set comprising at least one compression threshold condition, to create or transform a database object with rows to be selectively compressed according to the compression rules in the compression rule set (providing a transformed object), and to publish at least a portion of the transformed object to one of a storage medium or a display screen. Other apparatus, systems, and methods are disclosed.

Abstract: There is provided a method, system and computer program for updating at least one component in a multi-component software application. The method includes receiving application data describing characteristics of the software application, receiving update data describing at least one update applicable to the software application and reviewing the application data and update data to determine whether the at least one update is applied to the software application.

Abstract: Several methods and a system of a replicated service for write ahead logs are disclosed. In one embodiment, a method includes persisting a state of a distributed system through a write ahead log (WAL) interface. The method also includes maintaining a set of replicas of a WAL through a consensus protocol. In addition, the method includes providing a set of mechanisms for at least one of detection and a recovery from a hardware failure. The method further includes recovering a persistent state of a set of applications. In addition, the method includes maintaining the persistent state across a set of nodes through the hardware failover. In one embodiment, the system may include a WAL interface to persist a state of a distributed system. The system may also include a WAL replication servlet to maintain and/or recover a set of replicas of a WAL.

Abstract: A method, computer program, and database system are disclosed. A plurality of instances of a request to a database system are received. All instances of the request have a same set of variables to use in executing the request. The values of the variables are supplied by data in a data source. A specific plan for executing one instance of the request is generated. Generating the specific plan includes taking into account data in the data source. The specific plan is executed on the database system. A system run-time metric and a parsing time for executing the specific plan are captured and saved. A generic plan is generated and cached based on a comparison of the system run-time metric and the parsing time for executing the specific plan.

Abstract: A computer running a database system receives a query. The database system services a plurality of collections. Each collection includes a plurality of workload groups. Each collection is assigned a percentage of a resource for its use. A donor collection, Cdonor, is not using its assigned percentage of the resource during a time slice tJ. The length in time of time slice tJ is less than a time in which the query is expected to execute. The query is assigned to a workload group. The assignment is determined by the computer applying a workload classification and an exception criteria to parameters of the query. The workload group is part of a donee collection, Cdonee, different from the donor collection. The donor collection donates, through the computer, use of a boost percentage of the resource to the donee collection during the time slice tJ.

Abstract: A request is received at a computer programmed as a database system. The request is a request selected from the group consisting of a query and a utility. A business concept is associated with the request. The business concept is a business concept selected from the group consisting of “who” information defining the source of the request, “what” information defining the processing to be performed by the request, “where” information defining a database object that the request will affect. The computer maps the received request to a database feature setting by mapping the business concept associated with the request to a workload. The workload is defined by a workload definition including a workload classification attribute that maps to the business concept of the request, a workload throttling attribute that defines conditions under which requests assigned to the workload are throttled. Submission of the request to the database system for processing is delayed based on the workload definition.

Abstract: A small table S is outer joined to a large table L on a join condition on a database system with a plurality B of parallel units (PUs). S and L are partitioned across the PUs. Each row in S has a unique row-id. Each row of S is duplicated on all PUs to form Sdup. On each PU, dangling rows in S that do not have a match in L under the join condition are identified and the row-ids of the dangling rows are saved in Tredis. Tredis is partitioned across the PUs. P is formed from dangling rows of S whose corresponding entries in Tredis appear in all PUs. A result is produced by unioning P and I. I is formed by inner joining non-dangling rows of S with L. The result is saved.

Abstract: A system, method, and computer-readable medium that facilitate efficient use of cache memory in a massively parallel processing system are provided. A residency time of a data block to be stored in cache memory or a disk drive is estimated. A metric is calculated for the data block as a function of the residency time. The metric may further be calculated as a function of the data block size. One or more data blocks stored in cache memory are evaluated by comparing a respective metric of the one or more data blocks with the metric of the data block to be stored. A determination is then made to either store the data block on the disk drive or flush the one or more data blocks from the cache memory and store the data block in the cache memory. In this manner, the cache memory may be more efficiently utilized by storing smaller data blocks with lesser residency times by flushing larger data blocks with significant residency times from the cache memory.

Abstract: Techniques for using database metric results are provided. Structure Query Language (SQL) statements are parsed for multiple metric calculations. Each metric calculation is dynamically processed against a database to obtain combined results. The combined results are fed to remaining portions of the SQL statements as a source for or a driver to the remaining portions of the SQL statements.

Abstract: A product demand forecasting methodology is presented that applies daily weight values to a weekly forecast to determine daily forecasts for a product or service. The method determines daily weight values for use in forecasting current product sales by blending daily weight values calculated from historical demand data for both recent weeks and year-prior weeks. Recent weeks are used to account for recent correlations and alternation effects, and year-prior weeks are used to account for seasonality effects. The method automatically calculates a measure of significance for the daily weights calculated from the recent weeks and year-prior weeks. The significance of each week is applied as a weighting factor during the blending of recent weeks and year-prior daily weight values.

Abstract: Apparatus, systems, and methods may operate to receive a request to move at least a portion of a database table stored on a tangible medium from a current partition to a history partition, wherein the database table is partitioned into physical partitions according to a selected mapping update frequency. In response to receiving the request, activities may include modifying a logical partitioning of the database table by updating a mapping of the physical partitions to logical partitions. Other apparatus, systems, and methods are disclosed.