Abstract: A computer-implemented method for digital fingerprint obfuscation is disclosed. The computer-implemented method includes training a machine learning model to classify web traffic data into one or more personas. The computer-implemented method further includes identifying, using the trained machine learning model, a particular persona of a user based, at least in part, on a user's real traffic data generated during a current user session. The computer-implemented method further includes generating synthetic traffic data based, at least in part, on the identified particular persona of the user.

Abstract: Reducing data access resources by creating a scoring mechanism for computing a running score for data objects in a database having an associated score value in order to determine whether or not a set of data object(s) should remain in a caching gateway or whether or not the set of data object(s) should be removed from the caching gateway.

Abstract: One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Tuple sequence numbers are generated for the records and the records are written on groomed transaction blocks to the table.

Abstract: Reducing data access resources by creating a scoring mechanism for computing a running score for data objects in a database having an associated score value in order to determine whether or not a set of data object(s) should remain in a caching gateway or whether or not the set of data object(s) should be removed from the caching gateway.

Abstract: An approach is provided in which the approach receives a query request to execute a query. The approach provides multiple query execution options based on multiple hardware configurations. The multiple query execution options include multiple execution times and multiple execution costs. The approach receives a selection that selects at least one of the query execution options and, in turn, executes the query on at least one of the hardware configurations based on the received selection.

Abstract: One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Tuple sequence numbers are generated for the records and the records are written on groomed transaction blocks to the table.

Abstract: One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Each column in the table is loaded with column values based on the identifications. Records based on the column values are written to the groomed transaction blocks that are table based, and the tuple sequence numbers for each record on groomed blocks are generated. The table is shared/sharded across nodes handling transactional operations in the multi-master distributed data management system to increase processing handling of the transactional operations.

Abstract: One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Each column in the table is loaded with column values based on the identifications. Records based on the column values are written to the groomed transaction blocks that are table based, and the tuple sequence numbers for each record on groomed blocks are generated. The table is shared/sharded across nodes handling transactional operations in the multi-master distributed data management system to increase processing handling of the transactional operations.

Abstract: Methods and systems are provided for tuning memory allocated among a plurality of applications in a data processing system. In one implementation, the method includes generating memory benefit data for the plurality of applications, comparing the generated memory benefit data associated with each of the plurality of applications, and dynamically reallocating memory from one or more of the plurality of applications to one or more other of the plurality of applications based on the comparison. A method and system is also provided for tuning memory allocated among a plurality of individual memory consumers for a given application.

Abstract: Methods and systems are provided for executing a simulation of an operation in a data processing system. In one implementation, the method includes executing an operation under a first set of conditions, determining a characteristic associated with the execution of the operation under the first set of conditions, and executing a simulation of the operation under a second set of conditions different from the first set of conditions. The simulation of the operation is constrained by the determined characteristic. The method can further include determining a cost/benefit of executing the operation under a set of conditions different from the first set of conditions based at least in part on the simulation.

Abstract: There are disclosed systems, computer program products, and methods for dynamically resizing memory pools used by database management systems. In one aspect, if a decrease in allocation to the memory pool is required, at least one page grouping that may be freed from the memory pool is identified as a candidate based on its position in a list of page groupings. If the page grouping contains any used memory blocks, the used memory blocks may be copied from a candidate page grouping to another page grouping in the list in order to free the candidate page grouping. Once the candidate page grouping is free of used memory blocks, the candidate page grouping may be freed from the memory pool. As an example, this method may be used for dynamically resizing locklists or lock memory.

Abstract: There are disclosed systems, computer program products, and methods for self-tuning memory. In an embodiment, a method for self-tuning memory comprises setting a tuning interval and a target range for free memory for a memory pool. If memory consumption falls outside of the set target range for free memory during a tuning interval, a new target size for the memory pool is set based on the target range for free memory. Memory allocation for the memory pool is increased or decreased for the next tuning interval, such that the new target size for the memory pool is reached. A decrement rate may be used to provide a controlled decrease of the memory pool over a plurality of tuning intervals if necessary, until the new target size for the memory pool is reached.

Abstract: Providing cost model data for tuning query cache memory size in database systems. In one aspect, a query is received, and a query cache is checked to determine whether a stored query matches the received query. When a cache miss has occurred due to no stored queries matching the received query, the processing time saved by the avoidance of the cache miss and a cache size needed to avoid the cache miss are determined.

Abstract: A method for reducing oscillations of an output value associated with a program to be operatively coupled to a data processing system. The program having an internal process configured to read an input value provided by the program, the input value adjusting a performance aspect of the internal process, the internal process configured to provide an output value reflecting changes in the internal process responsive to the input value, the output value readable by the program.

Abstract: Systems and methods are provided for optimizing the performance and/or allocation of constrained resources in a dynamic computing environment using adaptive regulatory control methods. For example, systems and methods for providing constrained optimization in a dynamic computing system implement model-based adaptive (self-tuning) regulatory control schemes that are designed to handle the system dynamics and which take into consideration control costs (such as the overheads of changing resource allocations and performance degradation due to transient load imbalances) to find an optimal solution. To facilitate practical application, a dual control architecture is disclosed which combines a heuristic fixed step control process that is implemented when there is no valid system model for model-based control. A system model is continually obtained and validated during run-time to adapt control parameters to variations in system dynamics.