Abstract: The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources and operators are tries, and in input trie for a higher-order set operation can be the output of a lower-order set operation which is evaluated on demand. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.

Abstract: The invention describes a method for determining a storage location of a database object of a specific version, wherein indexes for each version of the database object are stored in a trie having a root node corresponding to the specific version, the method comprising: determining a trie corresponding to the specific version by accessing the root node of the trie corresponding to the specific version; determining an object identifier of the database object by traversing the trie corresponding to the specific version using a secondary key related to the database object as search key; determining the storage location of the database object by traversing the trie corresponding to the specific version using the determined object identifier as search key.

Abstract: The invention describes a method for determining a storage location of a database object of a specific version, wherein indexes for each version of the database object are stored in a trie having a root node corresponding to the specific version, the method comprising: determining a trie corresponding to the specific version by accessing the root node of the trie corresponding to the specific version; determining an object identifier of the database object by traversing the trie corresponding to the specific version using a secondary key related to the database object as search key; determining the storage location of the database object by traversing the trie corresponding to the specific version using the determined object identifier as search key.

Abstract: The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources are tries. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. An intersection operation performed in this way can be used for efficient range queries, in particular when two or more data items are involved in the query. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.

Abstract: The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources are tries. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. An intersection operation performed in this way can be used for efficient range queries, in particular when two or more data items are involved in the query. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.

Abstract: The invention describes a method for determining a storage location of a database object of a specific version, wherein indexes for each version of the database object are stored in a trie having a root node corresponding to the specific version, the method comprising: determining a trie corresponding to the specific version by accessing the root node of the trie corresponding to the specific version; determining an object identifier of the database object by traversing the trie corresponding to the specific version using a secondary key related to the database object as search key; determining the storage location of the database object by traversing the trie corresponding to the specific version using the determined object identifier as search key.

Abstract: The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising Result operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources and operators are tries, and in input trie for a higher-order set operation can be the output of a lower-order set operation which is evaluated on demand. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.

Abstract: Embodiments herein include medical systems, devices, and methods for assessing the health status of a patient. In an embodiment, a method includes evaluating the presence of volatile organic compounds in a breath or gas sample of the patient with a plurality of graphene sensors to generate volatile organic compound data, wherein the plurality of graphene sensors include sensors that are specific for different volatile organic compounds. The method can further include collecting data regarding the patient's sympathetic nervous activity. The method can further include combining the volatile organic compound data with the collected data regarding the patient's sympathetic nervous activity to form a combined data set. The method can further include matching the combined data set against one or more data patterns to find the best match, the best match indicating the health status of the patient. Other embodiments are also included herein.

Abstract: A disinfection device with a pressure vessel which has an interior space for receiving a medium, and with at least one radiating device which is arranged such that it emits radiation into the interior space of the pressure vessel, wherein one or several surfaces of the interior space of the pressure vessel are formed at least partially as a reflection surface for the radiation. A particularly reliable sterilization of medical or dental compressed air in the pressure vessel is made possible. One or several disinfection devices according to the invention can be provided in a compressor system for providing compressed air for dental applications, in a dental treatment device with a compressed air device and/or in a connection device with one or several tube sections for guiding compressed air for dental applications.

Abstract: The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources are tries. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. An intersection operation performed in this way can be used for efficient range queries, in particular when two or more data items are involved in the query. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.

Abstract: The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources are tries. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. An intersection operation performed in this way can be used for efficient range queries, in particular when two or more data items are involved in the query. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.

Abstract: Embodiments herein include medical systems, devices, and methods for assessing the health status of a patient. In an embodiment, a method includes evaluating the presence of volatile organic compounds in a breath or gas sample of the patient with a plurality of graphene sensors to generate volatile organic compound data, wherein the plurality of graphene sensors include sensors that are specific for different volatile organic compounds. The method can further include collecting data regarding the patient's sympathetic nervous activity. The method can further include combining the volatile organic compound data with the collected data regarding the patient's sympathetic nervous activity to form a combined data set. The method can further include matching the combined data set against one or more data patterns to find the best match, the best match indicating the health status of the patient. Other embodiments are also included herein.

Abstract: The invention relates to a phase contrast x-ray tomography device, comprising an electron gun (44) having a downstream deflector coil (52). The x-ray beam (56) is guided by the deflector coil (54) on a circular path over a target (58), which is marginally tilted towards a plane positioned vertically on the device axis. The x-ray beam (62) generated at focal spot F of the electron beam (56) crosses an object (70) and arrives at a detector line (68) via a phase grating (64) and an amplitude grating (66).

Abstract: The invention relates to a phase contrast x-ray tomography device, comprising an electron gun (44) having a downstream deflector coil (52). The x-ray beam (56) is guided by the deflector coil (54) on a circular path over a target (58), which is marginally tilted towards a plane positioned vertically on the device axis.

Abstract: The method for the manufacture of wall connector pieces is based on a thin-walled tubular blank which is first reduced in diameter at least one, preferably both ends in order to increase the wall thickness. In this way, a basis is provided for further shaping, for example, the manufacture of a connector piece (4) or a closed end (5).

Abstract: Devices and methods for manufacturing fittings (2) with different ends (3, 4) are disclosed, such fittings permitting different measures of connection. For example, one fitting (2) is a threaded end connector with its one end (4) being potentially configured as a compression fitting and its other end (3) as a thread-bearing end. An intermediate section (5) having preferably a polygonal cross-section is provided between the two ends (3, 4). Starting with a pipe piece (1), the manufacture takes place in a few process-safe method steps.

Abstract: The method for the manufacture of wall connector pieces is based on a thin-walled tubular blank which is first reduced in diameter at least one, preferably both ends in order to increase the wall thickness. In this way, a basis is provided for further shaping, for example, the manufacture of a connector piece (4) or a closed end (5).

Abstract: The invention relates to a sensor device for a packaging machine in which at least one conveyor of a packaging machine which displaces at least one material to be packed and to be detected, to various stations of the packaging machine. According to the invention, at least one x-ray source and one detector are provided for irradiating the material which is to be detected and which is arranged between the x-ray source and the detector.

Abstract: In a method for producing a coupling on a pipe, preferably consisting of copper or steel or Cu—, Ni—, Fe— alloys, by way of a preferably graduated or one-stage expansion of the pipe end to create a much larger difference in diameter, an expansion tool is introduced axially into the end of the pipe. Once the expansion tool has been introduced into the pipe end, the region of the pipe end that is to be or has been expanded is completely or partially compressed, by a force acting axially on the pipe end, so that the external diameter of the pipe end that is to be processed is delimited by one or more shaping jaws that completely or partially surround the pipe end. The invention also relates to a device for producing a coupling on a pipe end according to the method.

Abstract: A sensor for detecting particles in a gas flow, in particular soot particles in an exhaust gas flow, includes at least two measuring electrodes, which are positioned on a substrate made of an insulating material. To protect the measuring electrodes, they are covered by a protective layer.