Abstract: Methods for distributed histogram computation in a framework utilizing data stream sketches and samples are performed by systems and devices. Distributions of large data sets are scanned once and processed by a computing pool, without sorting, to generate local sketches and value samples of each distribution. The local sketches and samples are utilized to construct local histograms on which cardinality estimates are obtained for query plan generation of distributed queries against distributions. Local statistics of distributions are also merged and consolidated to construct a global histogram representative of the entire data set. The global histogram is utilized to determine a cardinality estimation for query plan generation of incoming queries against the entire data set. The addition of new data to a data set or distribution involves a scan of the new data from which new statistics are generated and then merged with existing statistics for a new global histogram.

Abstract: A contact pin, in particular a spring contact pin, comprising a test head for contacting an electrically conductive contact surface of a test object, in particular a wafer, a printed circuit board or the like, and comprising a pin sleeve, in which the test head is mounted with a guide end in a longitudinally displaceable manner. At least in some sections, a flexible, deformable/deformed circuit carrier is provided, on which at least one electrical/electronic component is arranged and which is or can be axially inserted into the pin sleeve by rolling and/or folding.

Abstract: Architecture that enables a Database-as-a-Service (DaaS) to auto-scale container sizes on behalf of tenants. An abstraction is provided that enables tenants to reason about monetary budget and query latency, rather than resource provisioning. An auto-scaling module automatically determines a container size for a subsequent billing interval based on telemetry that comprises latencies (e.g., waits), resource utilizations, and available budget, for example. A set of robust signals are derived from database engine telemetry and combined to significantly improve accuracy of resource demand estimation for database workloads. In a more specific implementation, resource demands can be estimated for arbitrary SQL (structured query language) workloads in a relational database management system (RDBMS).

Abstract: Intelligent memory brokering for multiple process instances, such as relational databases (e.g., SQL servers), reclaims memory based on value, thereby minimizing cost across instances. An exemplary solution includes: based at least on a trigger event, determining a memory profile for each of a plurality of process instances at a computing node; determining an aggregate memory profile, the aggregate memory profile indicating a memory unit cost for each of a plurality of memory units; determining a count of memory units to be reclaimed; identifying, based at least on the aggregate memory profile and the count of memory units to be reclaimed, a count of memory units to be reclaimed within each process instance so that a total cost is minimized to reclaim the determined count; and communicating, to each process instance having identified memory units to be reclaimed, a count of memory units to be reclaimed within the process instance.

Abstract: Intelligent memory brokering for multiple process instances, such as relational databases (e.g., SQL servers), reclaims memory based on value, thereby minimizing cost across instances. An exemplary solution includes: based at least on a trigger event, determining a memory profile for each of a plurality of process instances at a computing node; determining an aggregate memory profile, the aggregate memory profile indicating a memory unit cost for each of a plurality of memory units; determining a count of memory units to be reclaimed; identifying, based at least on the aggregate memory profile and the count of memory units to be reclaimed, a count of memory units to be reclaimed within each process instance so that a total cost is minimized to reclaim the determined count; and communicating, to each process instance having identified memory units to be reclaimed, a count of memory units to be reclaimed within the process instance.

Abstract: Intelligent memory brokering for multiple process instances, such as relational databases (e.g., SQL servers), reclaims memory based on value, thereby minimizing cost across instances. An exemplary solution includes: based at least on a trigger event, determining a memory profile for each of a plurality of process instances at a computing node; determining an aggregate memory profile, the aggregate memory profile indicating a memory unit cost for each of a plurality of memory units; determining a count of memory units to be reclaimed; identifying, based at least on the aggregate memory profile and the count of memory units to be reclaimed, a count of memory units to be reclaimed within each process instance so that a total cost is minimized to reclaim the determined count; and communicating, to each process instance having identified memory units to be reclaimed, a count of memory units to be reclaimed within the process instance.

Abstract: A solution is disclosed for memory management of serverless databases that includes: based at least on detecting a trigger event, determining whether memory is to be reclaimed; based at least on determining that memory is to be reclaimed, determining an amount of memory to be reclaimed; identifying memory to be reclaimed; and reclaiming the identified memory. Disclosed solutions are flexible, enabling customization of the aggressiveness and manner of memory reclamation. This permits users to specify a tailored balance point between performance and cost, for arrangements that bill users based on resource usage (e.g., memory consumed by a serverless database). In some examples, users specify a ramp-down parameter that is used to determine how much memory can be evicted in a particular reclamation event, time intervals (or another criteria) for triggering a reclamation event, and a definition for whether a cache is active.

Abstract: A method for producing a contact spacing converter space transformer) which has electrical contacts that form electrical paths and in which a first contact spacing of the contacts is converted into a comparatively different, second contact spacing of the electrical contacts including producing at least one base part from each of at least some of the electrical contacts. At least a section of the base part is produced from plastic. The method subsequently includes metallization of at least the section of the base part that is produced from plastic.

Abstract: A method for producing at least one spring contact pin acting as an electrical contact, or a spring contact pin arrangement comprises at least one such spring contact pin. The following steps are provided: producing at least one base part of the spring contact pin, at least one section of said base part being made of plastic, and subsequently metallizing at least the section of the base part that is made of plastic. The invention also relates to a spring contact pin produced to according to said method, or a spring contact pin arrangement having at least one such spring contact pin.

Abstract: Described is sheetlike composite comprising as layers of a layer sequence in a direction from an outer surface of the sheetlike composite to an inner surface of the sheetlike composite; a) an outer polymer layer, b) a carrier layer, and c) a barrier layer; wherein the sheetlike composite comprises a first composite region and a second composite region; wherein in the first composite region the sheetlike composite further comprises a first colour application, superimposing the outer polymer layer on a side of the outer polymer layer which is facing away from the inner surface of the sheetlike composite; wherein in the second composite region the sheetlike composite further comprises a second colour application, superimposing the outer polymer layer on the side of the outer polymer layer which is facing away from the inner surface of the sheetlike composite; wherein the second colour application comprises a 2D-code.

Abstract: Architecture that enables a Database-as-a-Service (DaaS) to auto-scale container sizes on behalf of tenants. An abstraction is provided that enables tenants to reason about monetary budget and query latency, rather than resource provisioning. An auto-scaling module automatically determines a container size for a subsequent billing interval based on telemetry that comprises latencies (e.g., waits), resource utilizations, and available budget, for example. A set of robust signals are derived from database engine telemetry and combined to significantly improve accuracy of resource demand estimation for database workloads. In a more specific implementation, resource demands can be estimated for arbitrary SQL (structured query language) workloads in a relational database management system (RDBMS).

Abstract: Architecture that enables a Database-as-a-Service (DaaS) to auto-scale container sizes on behalf of tenants. An abstraction is provided that enables tenants to reason about monetary budget and query latency, rather than resource provisioning. An auto-scaling module automatically determines a container size for a subsequent billing interval based on telemetry that comprises latencies (e.g., waits), resource utilizations, and available budget, for example. A set of robust signals are derived from database engine telemetry and combined to significantly improve accuracy of resource demand estimation for database workloads. In a more specific implementation, resource demands can be estimated for arbitrary SQL (structured query language) workloads in a relational database management system (RDBMS).

Abstract: Bias correcting system for small number estimators. A computer system includes a distinct value estimator configured to estimate a number of distinct values in a data set. The computer system includes a bias table for the estimator. The bias table includes entries with values corresponding to biases caused by the distinct value estimator correlated to values corresponding to numbers estimated. The entries in the table are optimized by having a set of entries with an optimized number of biases in the entries. The biases in the entries are associated with predetermined confidence intervals. The system includes a bias corrector configured to correct the number of distinct values in the multiset data estimated by the distinct value estimator set using values from the bias table to produce a corrected value. The system includes a user interface coupled to the bias corrector configured to output the corrected value to a user.

Abstract: A method for producing at least one spring contact pin acting as an electrical contact, or a spring contact pin arrangement comprises at least one such spring contact pin. The following steps are provided: producing at least one base part of the spring contact pin, at least one section of said base part being made of plastic, and subsequently metallizing at least the section of the base part that is made of plastic. The invention also relates to a spring contact pin produced to according to said method, or a spring contact pin arrangement having at least one such spring contact pin.

Abstract: A method for producing a contact spacing converter space transformer) which has electrical contacts that form electrical paths and in which a first contact spacing of the contacts is converted into a comparatively different, second contact spacing of the electrical contacts including producing at least one base part from each of at least some of the electrical contacts. At least a section of the base part is produced from plastic. The method subsequently includes metallization of at least the section of the base part that is produced from plastic.

Abstract: The described implementations relate to tunable predicate discovery. One implementation is manifest as a method for obtaining a data set and determining anomaly scores for anomalies of an attribute of interest in the data set. The method can also generate a ranked list of predicates based on the anomaly scores and cause at least one of the predicates of the ranked list to be presented.

Abstract: Architecture that enables a Database-as-a-Service (DaaS) to auto-scale container sizes on behalf of tenants. An abstraction is provided that enables tenants to reason about monetary budget and query latency, rather than resource provisioning. An auto-scaling module automatically determines a container size for a subsequent billing interval based on telemetry that comprises latencies (e.g., waits), resource utilizations, and available budget, for example. A set of robust signals are derived from database engine telemetry and combined to significantly improve accuracy of resource demand estimation for database workloads. In a more specific implementation, resource demands can be estimated for arbitrary SQL (structured query language) workloads in a relational database management system (RDBMS).

Abstract: Incremental query results and confidence interval values associated with respective incremental query results may be obtained. Visualization shape objects indicating uncertainty values may be determined, based on mapping values of respective incremental query results and confidence interval values to points in the associated visualization shape objects, the uncertainty values visualized based on proportional shapes of the visualization shape objects. At least one visualization comparison object representing a comparison of a plurality of distributions associated with the obtained incremental query results and confidence interval values may be determined. Display of the plurality of visualization shape objects and the at least one visualization comparison object may be initiated.

Abstract: The described implementations relate to tunable predicate discovery. One implementation is manifest as a method for obtaining a data set and determining anomaly scores for anomalies of an attribute of interest in the data set. The method can also generate a ranked list of predicates based on the anomaly scores and cause at least one of the predicates of the ranked list to be presented.

Abstract: Architecture that detects and corrects writing errors in a human language based on the utilization of three different stages: error detection, correction candidate generation, and correction candidate ranking. The architecture is a generic framework for generating fluent alternatives to non-grammatical word sequences in a written sample. Error detection is addressed by a suite of language model related scores and other scores such as parse scores that can identify a particularly unlikely sequence of words. Correction candidate generation is addressed by a lookup in a very large corpus of “correct” English that looks for alternative arrangements of the same or similar words or subsequences of these words in the same context. Correction candidate ranking is addressed by a language model ranker.