Abstract: In a cloud database system, a system and method for analyzing query workloads on installed customer systems and generating tiered offers promoting higher query execution speeds in the form of better response times for a selected portion of queries in exchange for a higher price. Upon selecting an offer, the cloud database system is automatically configured to include additional compute resources as required to execute future instances of the selected queries to take advantage of the performance improvements provided with the selected offer.

Abstract: A database system receives a query. The database system retrieves an old query execution plan (QEP), OldPlan, for the query. The database system submits the query to an optimizer. The optimizer returns a new QEP, NewPlan, for the query. The database system submits the OldPlan and the NewPlan to a machine learning classifier (ML classifier). The ML classifier predicts that executing the NewPlan will result in a performance regression as compared to executing the OldPlan. The database system executes the OldPlan instead of the NewPlan.

Abstract: A method for determining an actual geometry of a track by a track inspection vehicle which is movable on the track, wherein reference points positioned in a lateral environment of the track are automatically recorded by a non-contacting recording system arranged on the track inspection vehicle and their respective actual distance from the track is determined. A three-dimensional trajectory of the track is recorded by an inertial measuring system arranged on the track inspection vehicle, wherein the trajectory is divided by a computing unit into trajectory sections each having a section starting point related to a first reference point and a section end point related to a second reference point, wherein a virtual longitudinal chord is defined for each trajectory section in relation to the assigned reference points, and wherein actual distances between the trajectory and the respectively defined longitudinal chord are calculated for each trajectory section.

Abstract: A measuring system for measuring the elasticity of an overhead line of a track includes a non-contacting sensor for detecting the position of a measuring point of the overhead line and an evaluation device for calculating the elasticity. A mechanical excitation device sets the overhead line into vibration through active excitation. The sensor is set up to detect a vibration progression and the evaluation device is set up to derive mechanical properties of the overhead line from the vibration progression. The mechanical properties, such as the elasticity of the overhead line, are derived from characteristics of the corresponding vibration curves in the evaluation device. A method for measuring the elasticity of an overhead line of a track and a track construction vehicle are also provided.

Abstract: An apparatus, method and computer program product for estimating as-a-Service (aaS) query prices in a relational database management system (RDBMS). An optimizer of the RDBMS inserts an EXPLAIN modifier into a query, wherein the EXPLAIN modifier results in the optimizer generating a summary of a query execution plan for the query that includes one or more cost estimates for the RDBMS to perform the query. A price estimate for the query is then generated based on the cost estimates, wherein the price estimate is generated using one or more configurable pricing formulae. The price estimate is merged into the summary of the query execution plan for the query. Moreover, a price guarantee may be generated for the price estimate, wherein the price guarantee is honored when the query is subsequently invoked for execution by the RDBMS.

Abstract: An apparatus, method and computer program product for physical database design and tuning in relational database management systems. A relational database management system executes in a computer system, wherein the relational database management system manages a relational database comprised of one or more tables storing data. A Deep Reinforcement Learning based feedback loop process also executes in the computer system for recommending one or more tuning actions for the physical database design and tuning of the relational database management system, wherein the Deep Reinforcement Learning based feedback loop process uses a neural network framework to select the tuning actions based on one or more query workloads performed by the relational database management system.

Abstract: A method for determining an actual geometry of a track by a track inspection vehicle which is movable on the track, wherein reference points positioned in a lateral environment of the track are automatically recorded by a non-contacting recording system arranged on the track inspection vehicle and their respective actual distance from the track is determined. A three-dimensional trajectory of the track is recorded by an inertial measuring system arranged on the track inspection vehicle, wherein the trajectory is divided by a computing unit into trajectory sections each having a section starting point related to a first reference point and a section end point related to a second reference point, wherein a virtual longitudinal chord is defined for each trajectory section in relation to the assigned reference points, and wherein actual distances between the trajectory and the respectively defined longitudinal chord are calculated for each trajectory section.

Abstract: An apparatus, method and computer program product for estimating as-a-Service (aaS) query prices in a relational database management system (RDBMS). An optimizer of the RDBMS inserts an EXPLAIN modifier into a query, wherein the EXPLAIN modifier results in the optimizer generating a summary of a query execution plan for the query that includes one or more cost estimates for the RDBMS to perform the query. A price estimate for the query is then generated based on the cost estimates, wherein the price estimate is generated using one or more configurable pricing formulae. The price estimate is merged into the summary of the query execution plan for the query. Moreover, a price guarantee may be generated for the price estimate, wherein the price guarantee is honored when the query is subsequently invoked for execution by the RDBMS.

Abstract: A system and method for determining optimal query plans within a distributed processing system. The system includes a query optimizer for receiving a query and generating a query plan for execution by the distributed processing system; a repository including statistics related to prior executed query plans; a plan execution engine for receiving and executing the query plan, collecting statistics corresponding to the query plan, and storing the statistics and optimizer usage metadata corresponding to the query plan and prior executed query plans in the repository. The system further includes a statistics advisory tool for mining the metadata to generate a collection of histogram statistics and storing said histogram statistics in the repository. When generating a query plan, the query optimizer searches the statistics repository for statistics, including histogram statistics, useful to the generation of the current query plan and uses selected statistics from the repository to generate the query plan.

Abstract: An apparatus, method and computer program product for physical database design and tuning in relational database management systems. A relational database management system executes in a computer system, wherein the relational database management system manages a relational database comprised of one or more tables storing data. A Deep Reinforcement Learning based feedback loop process also executes in the computer system for recommending one or more tuning actions for the physical database design and tuning of the relational database management system, wherein the Deep Reinforcement Learning based feedback loop process uses a neural network framework to select the tuning actions based on one or more query workloads performed by the relational database management system.

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: Data of a database (e.g., database tables) can be reassigned from a first map to a second map in a database system that uses maps to assign data for processing to multiple processing units of a database system in accordance with one or more distributions schemes. Data portions can be selected in groups and moved in the selected groups in an efficient manner. The selection and/or movement of the data portions can be automated without requiring input for users of database systems.

Abstract: A pyrotechnic safety element is particularly suited for use in motor vehicles. The safety element includes a conductor, a pyrotechnic unit with a pyrotechnic propellant charge, a severing member for severing the conductor, and a housing. The conductor is composed of two separate conductor parts which are joined at a joining point and are severed by the severing member when the device is triggered.

Abstract: A pyrotechnic circuit breaker, comprising a body, an igniter, a bus bar, and a piston which comprises a cutting edge and is movable along a normal direction to cut a portion of the bus bar, thereby separating the bus bar to break a circuit, wherein the cutting edge of the piston is stepped so that the portion of the bus bar is cut sequentially, in at least two successive cutting operations, characterized in that the bus bar comprises a breakable portion configured to be cut by the cutting edge of the piston, wherein said breakable portion comprises slots in order to divide the breakable portion into multiple sub-portions that are adapted to be cut sequentially by the stepped cutting edge of the piston.

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 invention relates to the use of a composition A based on aromatic polycarbonate, containing a) aromatic polycarbonate, wherein the polycarbonate has an average weight-average molecular weight Mw of 22000 g/mol to 27000 g/mol, determined by means of gel permeation chromatography according to DIN 55672-1:2007-08, and calibrated in relation to bisphenol A-polycarbonate standards using dichloromethane as an eluent, and wherein the polycarbonate has 0 to max. 19 mol % carbonate units of formula (1) where R1, R2, R3, R4, R5, R6, R7 and R8 independently represent H or C1- to C6-alkyl, and b) 0 to less than 0.2 wt.

Abstract: A measuring head of an endoscopic device is provided. The measuring head has an optical projection unit (projection optics) intended and designed to illuminate an object to be examined with light, and an optical measurement unit (measurement optics) intended and designed to record the light reflected or diffused from the object to be examined. It is provided that the optical measurement unit (measurement optics) has an aperture diaphragm of which the aperture is settable.

Abstract: Capacity of a database system and/or a computing system that includes a database can be effectively changed from a current computing capacity to another computing capacity. This can be achieved by causing usage capacity of at least one of resource to be changed when the database is active. By way of example, capacity of a database system can be regulated by delaying the execution of the database work based on a target capacity. As a result, database work can take relatively longer to complete when the capacity of a database is effectively regulated to be below its full capacity. In effect, a portion of available capacity (excess capacity) can be made inaccessible to the database. However, excess capacity can be used to manage various services of the database in accordance with one or more service criteria (e.g., Service Level Goals or Agreements).

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: 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.