Abstract: The invention relates to a partition (1) for sealing and/or supporting a cavity, comprising a carrier (2) and an expansion material (3) arranged on the carrier (2), which expansion material can be transferred from an initial state to an expanded state by means of activation, wherein the carrier (2) comprises at least one compensation element (4), which provides variability of the effective sealing surface (5) of the carrier (2), such that a change in the effective sealing surface (5) of the carrier (2) can be brought about by means of a force acting on the carrier (2), a limiting element (6) being provided, by means of which a movement of at least one portion of the carrier (2) which accompanies the change in the effective sealing surface (5) is limited.

Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

Abstract: A system includes generation of a query to retrieve, from a first database table, a result set conforming to query parameters for all entries of a second table stored in a volatile memory of a query client, serialization of the second table into the volatile memory, copying of the serialized second table into a second volatile memory of a data server, de-serialization of the serialized second table into the second volatile memory, determination of a plurality of entries of the first database table which are associated with the second table, and determination of the result set from the plurality of entries based on the query parameters.

Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

Abstract: A system includes generation of a definition of a table including a partitioning column of the table and a threshold size, allocation of a first memory partition for the table, determination that a size of the records of the table in the first memory partition is greater than the threshold size, and, in response to the determination that the size of the records of the table in the first memory partition is greater than the threshold size, determination that a maximum value of the partitioning column in the records of the table in the first memory partition, determination of a minimum value of the partitioning column in the records of the table in the first memory partition, generation of metadata indicating that records of the table in which the value of the partitioning column is in a range between and including the minimum value and the maximum value are stored in the first memory partition, and allocation of a second memory partition for the table.

Abstract: A system includes determination of a value identifier for each value of a first table, based on a data dictionary of a second table, generation of a hash function, the hash function mapping, for each row of the first table, one or more value identifiers of one or more columns of the row to a pointer to the row, application of the hash function to one or more value identifiers of a row of a second table, determination of whether the output of the hash function is a valid hash, and, if it is determined that the output of the hash function is a valid hash, determination that the row of the second table is associated with the first table.

Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

Abstract: A system includes determination of a value identifier for each value of a first table, based on a data dictionary of a second table, generation of a hash function, the hash function mapping, for each row of the first table, one or more value identifiers of one or more columns of the row to a pointer to the row, application of the hash function to one or more value identifiers of a row of a second table, determination of whether the output of the hash function is a valid hash, and, if it is determined that the output of the hash function is a valid hash, determination that the row of the second table is associated with the first table.

Abstract: A system includes determination of a value identifier for each value of a first table, based on a data dictionary of a second table, generation of a hash function, the hash function mapping, for each row of the first table, one or more value identifiers of one or more columns of the row to a pointer to the row, application of the hash function to one or more value identifiers of a row of a second table, determination of whether the output of the hash function is a valid hash, and, if it is determined that the output of the hash function is a valid hash, determination that the row of the second table is associated with the first table.

Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

Abstract: In a method for producing a brake carrier for a disc brake of a vehicle braking system, wherein the brake carrier has at least one guiding shaft for guiding a brake lining in a guiding direction in relation to a receiving region for a brake disc, first a brake carrier blank is produced in a casting step and then the brake carrier blank is reworked. In the casting step, the brake carrier blank forms two converging tapers, facing the receiving region, in the region in which the guiding shaft is formed and, during the reworking, material is removed in the region of the tapers to produce the at least one guiding shaft, with the effect that the receiving region for the brake disc has a predetermined clear width transversely in relation to the guiding direction.

Abstract: A system includes generation of a definition of a table including a partitioning column of the table and a threshold size, allocation of a first memory partition for the table, determination that a size of the records of the table in the first memory partition is greater than the threshold size, and, in response to the determination that the size of the records of the table in the first memory partition is greater than the threshold size, determination that a maximum value of the partitioning column in the records of the table in the first memory partition, determination of a minimum value of the partitioning column in the records of the table in the first memory partition, generation of metadata indicating that records of the table in which the value of the partitioning column is in a range between and including the minimum value and the maximum value are stored in the first memory partition, and allocation of a second memory partition for the table.

Abstract: A system includes determination of a value identifier for each value of a first table, based on a data dictionary of a second table, generation of a hash function, the hash function mapping, for each row of the first table, one or more value identifiers of one or more columns of the row to a pointer to the row, application of the hash function to one or more value identifiers of a row of a second table, determination of whether the output of the hash function is a valid hash, and, if it is determined that the output of the hash function is a valid hash, determination that the row of the second table is associated with the first table.

Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

Abstract: A system includes generation of a query to retrieve, from a first database table, a result set conforming to query parameters for all entries of a second table stored in a volatile memory of a query client, serialization of the second table into the volatile memory, copying of the serialized second table into a second volatile memory of a data server, de-serialization of the serialized second table into the second volatile memory, determination of a plurality of entries of the first database table which are associated with the second table, and determination of the result set from the plurality of entries based on the query parameters.

Abstract: In a method for producing a brake carrier for a disc brake of a vehicle braking system, wherein the brake carrier has at least one guiding shaft for guiding a brake lining in a guiding direction in relation to a receiving region for a brake disc, first a brake carrier blank is produced in a casting step and then the brake carrier blank is reworked. In the casting step, the brake carrier blank forms two converging tapers, facing the receiving region, in the region in which the guiding shaft is formed and, during the reworking, material is removed in the region of the tapers to produce the at least one guiding shaft, with the effect that the receiving region for the brake disc has a predetermined clear width transversely in relation to the guiding direction.

Abstract: A combustion chamber head of a gas turbine has a substantially annular combustion chamber outer wall 18 as well as a substantially annular combustion chamber inner wall 42 and several burners 6 distributed around the circumference. The combustion chamber head 5 has an inflow-side wall 13 which together with a wall 14 facing the combustion chamber 7 forms a combustion chamber head volume 15. The inflow-side wall 13 is provided with at least one inflow opening 32, the wall 14 facing the combustion chamber 7 is provided with at least one outflow opening 17 for connecting the combustion chamber head volume 15 to the combustion chamber 7, and at least one cooling air duct 29 is provided in the wall 14 facing the combustion chamber 7. A method for cooling and damping of the combustion chamber head is also disclosed.