Abstract: A system for unloading tables of a database is provided. In some aspects, the system performs operations including determining that a number of accesses to a table occurring within a time period has satisfied an access threshold. The operations may further include identifying, in response to the determining, a first timestamp indicating a most recent access to the table. The operations may further include determining whether a difference between a current timestamp and the first timestamp satisfies a first time threshold. The operations may further include comparing, in response to the difference satisfying the first time threshold, a ratio of the difference and a size of the table to a ratio threshold. The operations may further include unloading, in response to satisfying the ratio threshold, the table. The operations may further include adjusting, based on the feedback, the first time threshold and/or the ratio threshold.

Abstract: A system for unloading tables of a database is provided. In some aspects, the system performs operations including determining that a number of accesses to a table occurring within a time period has satisfied an access threshold. The operations may further include identifying, in response to the determining, a first timestamp indicating a most recent access to the table. The operations may further include determining whether a difference between a current timestamp and the first timestamp satisfies a first time threshold. The operations may further include comparing, in response to the difference satisfying the first time threshold, a ratio of the difference and a size of the table to a ratio threshold. The operations may further include unloading, in response to satisfying the ratio threshold, the table. The operations may further include adjusting, based on the feedback, the first time threshold and/or the ratio threshold.

Abstract: A system for unloading tables of a database is provided. In some aspects, the system performs operations including determining that a number of accesses to a table occurring within a time period has satisfied an access threshold. The operations may further include identifying, in response to the determining, a first timestamp indicating a most recent access to the table. The operations may further include determining whether a difference between a current timestamp and the first timestamp satisfies a first time threshold. The operations may further include comparing, in response to the difference satisfying the first time threshold, a ratio of the difference and a size of the table to a ratio threshold. The operations may further include unloading, in response to satisfying the ratio threshold, the table. The operations may further include adjusting, based on the feedback, the first time threshold and/or the ratio threshold.

Abstract: A system for unloading tables of a database is provided. In some aspects, the system performs operations including determining that a number of accesses to a table occurring within a time period has satisfied an access threshold. The operations may further include identifying, in response to the determining, a first timestamp indicating a most recent access to the table. The operations may further include determining whether a difference between a current timestamp and the first timestamp satisfies a first time threshold. The operations may further include comparing, in response to the difference satisfying the first time threshold, a ratio of the difference and a size of the table to a ratio threshold. The operations may further include unloading, in response to satisfying the ratio threshold, the table. The operations may further include adjusting, based on the feedback, the first time threshold and/or the ratio threshold.

Abstract: A system for unloading tables of a database is provided. In some aspects, the system performs operations including determining that a number of accesses to a table occurring within a time period has satisfied an access threshold. The operations may further include identifying, in response to the determining, a first timestamp indicating a most recent access to the table. The operations may further include determining whether a difference between a current timestamp and the first timestamp satisfies a first time threshold. The operations may further include comparing, in response to the difference satisfying the first time threshold, a ratio of the difference and a size of the table to a ratio threshold. The operations may further include unloading, in response to satisfying the ratio threshold, the table. The operations may further include adjusting, based on the feedback, the first time threshold and/or the ratio threshold.

Abstract: In some example embodiments, a system is provided for executing a primitive call that implements a query operation. The system may include a data processor and a memory. The memory may store instructions that result in operations when executed by the data processor. The operations may include: executing, at an data management engine, the primitive call by at least performing a first operation with respect to a value identifier set, the value identifier set including one or more value identifiers, and the primitive call being configured to access a database storing a plurality of value identifiers; and generating, based at least on a result of the first operation, a result for the primitive call. Related methods and articles of manufacture, including computer program products, are also described.

Abstract: A system for generating a query plan is provided. In some implementations, the system performs operations comprising: determining that a first query operation is a full table query operation, the full table query operation comprising a query operation operating on a database table as a whole; determining that a second query operation is a split table query operation, the split table query operation comprising a plurality of parallel query operations each operating on a portion of the database table; and inserting, based on the first query operation being a full table query operation and the second query operation being a split table query operation, a switch operation between the first and the second query operation, the switch operation being configured to distribute data output by the first query operation to the plurality of parallel query operations comprising the second query operation. Related methods and articles of manufacture are also described.

Abstract: A system for unloading tables of a database is provided. In some aspects, the system performs operations including determining that a number of accesses to a table occurring within a time period has satisfied an access threshold. The operations may further include identifying, in response to the determining, a first timestamp indicating a most recent access to the table. The operations may further include determining whether a difference between a current timestamp and the first timestamp satisfies a first time threshold. The operations may further include comparing, in response to the difference satisfying the first time threshold, a ratio of the difference and a size of the table to a ratio threshold. The operations may further include unloading, in response to satisfying the ratio threshold, the table. The operations may further include adjusting, based on the feedback, the first time threshold and/or the ratio threshold.

Abstract: In some example embodiments, a system is provided for executing a primitive call that implements a query operation. The system may include a data processor and a memory. The memory may store instructions that result in operations when executed by the data processor. The operations may include: executing, at an data management engine, the primitive call by at least performing a first operation with respect to a value identifier set, the value identifier set including one or more value identifiers, and the primitive call being configured to access a database storing a plurality of value identifiers; and generating, based at least on a result of the first operation, a result for the primitive call. Related methods and articles of manufacture, including computer program products, are also described.

Abstract: A system for generating a query plan is provided. In some implementations, the system performs operations comprising: determining that a first query operation is a full table query operation, the full table query operation comprising a query operation operating on a database table as a whole; determining that a second query operation is a split table query operation, the split table query operation comprising a plurality of parallel query operations each operating on a portion of the database table; and inserting, based on the first query operation being a full table query operation and the second query operation being a split table query operation, a switch operation between the first and the second query operation, the switch operation being configured to distribute data output by the first query operation to the plurality of parallel query operations comprising the second query operation. Related methods and articles of manufacture are also described.

Abstract: At runtime first and second cost functions associated with a request for a merge of a main partition of a table with a delta partition of the table can be calculated. The first and second cost functions can respectively quantify an urgency of the merge relative to availability of system resources required to perform the merge and an urgency of the merge relative to other merges. Determining whether the merge should occur can include comparing the calculated first and second cost functions with calculations of other first and second cost functions for other merge requests of one or more other tables. If the merge should occur, a merge thread can be assigned to execute the merge, and execution of the merge by the merge thread can be commenced if at least one merge token representing system resources usable for merge operations is available.

Abstract: At runtime first and second cost functions associated with a request for a merge of a main partition of a table with a delta partition of the table can be calculated. The first and second cost functions can respectively quantify an urgency of the merge relative to availability of system resources required to perform the merge and an urgency of the merge relative to other merges. Determining whether the merge should occur can include comparing the calculated first and second cost functions with calculations of other first and second cost functions for other merge requests of one or more other tables. If the merge should occur, a merge thread can be assigned to execute the merge, and execution of the merge by the merge thread can be commenced if at least one merge token representing system resources usable for merge operations is available.

Abstract: At runtime first and second cost functions associated with a request for a merge of a main partition of a table with a delta partition of the table can be calculated. The first and second cost functions can respectively quantify an urgency of the merge relative to availability of system resources required to perform the merge and an urgency of the merge relative to other merges. Determining whether the merge should occur can include comparing the calculated first and second cost functions with calculations of other first and second cost functions for other merge requests of one or more other tables. If the merge should occur, a merge thread can be assigned to execute the merge, and execution of the merge by the merge thread can be commenced if at least one merge token representing system resources usable for merge operations is available.

Abstract: At runtime first and second cost functions associated with a request for a merge of a main partition of a table with a delta partition of the table can be calculated. The first and second cost functions can respectively quantify an urgency of the merge relative to availability of system resources required to perform the merge and an urgency of the merge relative to other merges. Determining whether the merge should occur can include comparing the calculated first and second cost functions with calculations of other first and second cost functions for other merge requests of one or more other tables. If the merge should occur, a merge thread can be assigned to execute the merge, and execution of the merge by the merge thread can be commenced if at least one merge token representing system resources usable for merge operations is available.

Abstract: The invention relates to a method for producing a decor material comprising a carrier material and a decor layer composed of sand particles which is formed thereon, wherein the method comprises the following steps: providing a container (1) which has a viewing wall section (3) and a container volume (2) to be filled, in such a way that the container volume (2) to be filled can be at least partially seen from outside through the viewing wall section (3), at least partially filling the container volume (2) of the container (1) with a quantity of sand, exposing a surface region of the filled quantity of sand, adhering sand particles of the filled quantity of sand to a carrier material by arranging flat on the exposed surface region the carrier material which is provided with an adhesive medium, and separating the carrier material with the adhering sand particles from the surface region. The invention also relates to a decor material.

Abstract: Imidazopyridine derivatives ad pharmacologically acceptable salts having antagonistic properties towards angiotensin II can be used for the treatment of hypertension, aldosteronism and cardiac insufficiency.

Abstract: Cyclic sulphones of formula (I) are disclosed, in which: R.sup.1 and R.sup.2 each independently of one another stand for H, A, CF.sub.3, CH.sub.2 F, CHF.sub.2, C.sub.2 F.sub.5, Hal, OH, OA, NH.sub.2, NHA, NA.sub.2, NO.sub.2 or CN; X stands for CR.sup.4 R.sup.5, C.dbd.Z, O, S, NH, NA or NR.sup.3 ; Y stands for CR.sup.6 R.sup.7, C.dbd.Z, O, NH, NA, or NR.sup.3 ; Z stands for O, S, NH, NA, NOH, NOA, CH.sub.2, CHA or CA.sub.2 ; R.sup.4, R.sup.5, R.sup.6 and R.sup.7 each independently of one another stand for H, A, R.sup.3, Hal, OH, OA, SH, SA, NH.sub.2, NHA or NA.sub.2, or alternatively, R.sup.5 and R.sup.6 or R.sup.7 and R.sup.8 can together represent a bond, only one such bond being present in each molecule; R.sup.4 and R.sup.5 together can also stand for O--(CH.sub.2).sub.2 --O or O--(CH.sub.2).sub.3 --O; R.sup.8 and R.sup.9 each independently of one another stand for H or A; A stands for alkyl with 1-6 C atoms; Hal stands for F, Cl, Br or I; and R.sup.

Abstract: Heterocyclyloxybenzoylguanidines of the formula I ##STR1## in which R.sup.1, R.sup.2 and Het have the given meanings, and also the pharmaceutically acceptable salts thereof, exhibit antiarrhythmic properties and act as inhibitors of the cellular Na.sup.+ /H.sup.+ antiporter.

Abstract: Ortho-substituted benzoic acid derivatives of the formula I ##STR1## in which R.sup.1, R.sup.2 and R.sup.3 have the given meanings, and Q is guanidyl, and also their physiologically harmless salts, exhibit antiarrhythmic properties and act as inhibitors of the cellular Na.sup.+ /H.sup.+ antiporter. In addition, the compounds of the formula I, in which R.sup.1 to R.sup.3 and also Q have the given meanings, are suitable for use as valuable intermediates for the preparation of medicaments, in particular of inhibitors of the cellular Na.sup.+ /H.sup.+ antiporter.

Abstract: Alkylbenzoylguanidines of the formula I ##STR1## in which A, R.sup.1, R.sup.2 and R.sup.3 have the given meanings, and their physiologically harmless salts exhibit antiarrhythmic properties and act as inhibitor of the cellular Na.sup.+ /H.sup.+ antiporter.