Abstract: Disclosed is a method for the recovery of filtering agents and rolling oil from a mixture containing used rolling oil and filtering agents coated with used rolling oil in which the mixture containing rolling oil and filtering agents is subjected to vacuum distillation under agitation in a reactor equipped with an agitator and vapour precipitator. The vacuum during distillation is regulated with an inert gas flow, the rolling oil is condensed and collected, and a rolling oil which can be reused for rolling and a powder filtering agent which can be reused are obtained.

Abstract: In some aspects, search functionality is provided in an observability pipeline system. In some implementations, a method of searching remotely-stored data includes receiving a search query at a computer node residing at a node geolocation, the search query representing a request to search data stored at a storage geolocation; identifying compute geolocations each including computing resources, each of the compute geolocations being distinct from the node geolocation and the storage geolocation; obtaining latency data including latency values for the compute geolocations; selecting one of the compute geolocations based on the latency data; by operation of a coordinator agent on the computer node, initiating a dynamic computing resource at the selected compute geolocation, and receiving search results identified by the dynamic computing resource.

Abstract: In some aspects, search functionality is provided in an observability pipeline system. In some implementations, a search method includes receiving a search query from a leader role in an observability pipeline system. The search query represents a request to search event data at a computer resource. An observability pipeline process is configured to perform a search according to the search query, and search results are obtained based on applying the observability pipeline process to the event data. The search results include events from the event data. Provenance information is obtained for each of the events. The provenance information for each event includes an identification of the computer resource and a link to the computer resource. Augmented search results are generated by associating the provenance information with the respective events, and the augmented search results are communicated to the leader role.

Abstract: In some aspects, an interactive graphical user interface displays search data for an observability pipeline system. In some aspects, a method includes obtaining search results including events identified based on searching data generated by an observability pipeline system. The method includes identifying time bins based on the search results; generating first histogram data based on the time bins and the events; and generating second histogram data based on the time bins and the events. The method includes generating a graphical user interface including a first histogram representing the first histogram data and including a first set of bins, and a second histogram representing the second histogram data and including a second set of bins. The method includes updating the graphical user interface to include a visual indication of a selected bin in the first histogram and a visual indication of a corresponding bin in the second histogram.

Abstract: In some aspects, search functionality is provided in an observability pipeline system. In some implementations, a search query is received at a computer node from a leader role of an observability pipeline system. The search query represents a request to search event data at the computer node and includes a first search operator that specifies a system state context criterion and a second search operator that specifies an event criterion. An observability pipeline process is configured according to the search query. Search results are generated based on applying the observability pipeline process at the computer node. A current system state of the computer node that matches the system state context criterion specified by the first search operator is determined; and a subset of event data on the computer node that matches the event criterion specified by the second search operator is identified. The search results including the subset of event data are sent to the leader role.

Abstract: A method, system and computer program product are provided. A first index scan of records of a database table is performed. A first index used by the first index scan is specified in a DBMS query statement as being ordered by one or more field values of one or more fields of the first index. A second scan of the database table is performed to determine whether each respective record of the second scan is qualified based on one or more fields of the each respective record of the second scan and a predicate. A lookup data structure is built indicating whether each of the respective records of the second scan is qualified. The lookup data structure is used to determine whether a record of the first index scan is qualified when the lookup data structure becomes available.

Abstract: A system and method for creating a self-describing dictionary for expanding compressed data objects stored in a database of a database management system includes creating a dictionary associated with a data object that is customized to the data object, generating a custom expansion procedure for expanding the data object that is tailored to the dictionary, at a same time as creating the dictionary, and embedding the custom expansion procedure into the dictionary.

Abstract: A mechanism is provided for generating statistical information for query optimization in a data processing system. The mechanism comprises a first database engine maintaining a current first dataset currently being stored, a second database engine maintaining a second dataset. The second dataset is generated from previous first datasets or from the previous first datasets and current first dataset, the previous first datasets being datasets that were previously maintained by the first database engine. The first database engine receives a database query for accessing the first dataset, the database query involving one or more attributes of the first data set. The first database engine generates a query execution plan for the database query on the first dataset using collected statistical information on at least the second dataset. The first database engine processes the database query according to the query execution plan.

Abstract: A mechanism is provided for generating statistical information for query optimization in a data processing system. The mechanism comprises a first database engine maintaining a current first dataset currently being stored, a second database engine maintaining a second dataset. The second dataset is generated from previous first datasets or from the previous first datasets and current first dataset, the previous first datasets being datasets that were previously maintained by the first database engine. The first database engine receives a database query for accessing the first dataset, the database query involving one or more attributes of the first data set. The first database engine generates a query execution plan for the database query on the first dataset using collected statistical information on at least the second dataset. The first database engine processes the database query according to the query execution plan.

Abstract: A distributed database system (or federated database system) where a catalogue is used to store metadata descriptive of data containers for the constituent database system(s) and/or accelerator system(s) of the federated database. In response to the generation of the trigger signal corresponding to a database definition language (DDL) statement, the accelerator system updates metadata in the catalogue.

Abstract: In a high insert throughput in a database system, the database management system (DBMS) caches, asynchronously from data insert transactions, a list of storage location identifiers for storage locations in a table space in the database system. When a request for an insert transaction with an insert size is received from an agent, the DBMS identifies a storage location on the list with an amount of free space meeting the insert size. The DBMS removes the storage location identifier from the list and returns the storage location identifier for the storage location. When the insert transaction completes, the DBMS determines a remaining free space at the storage location and adds the storage location identifier to the list according to the remaining free space. By removing storage location identifiers from the list, another agent cannot receive the same storage location identifier for a parallel task. Thus, space contention is avoided.

Abstract: In a high insert throughput in a database system, the database management system (DBMS) caches, asynchronously from data insert transactions, a list of storage location identifiers for storage locations in a table space in the database system. When a request for an insert transaction with an insert size is received from an agent, the DBMS identifies a storage location on the list with an amount of free space meeting the insert size. The DBMS removes the storage location identifier from the list and returns the storage location identifier for the storage location. When the insert transaction completes, the DBMS determines a remaining free space at the storage location and adds the storage location identifier to the list according to the remaining free space. By removing storage location identifiers from the list, another agent cannot receive the same storage location identifier for a parallel task. Thus, space contention is avoided.

Abstract: A method, system and computer program product are provided. A first index scan of records of a database table is performed. A first index used by the first index scan is specified in a DBMS query statement as being ordered by one or more field values of one or more fields of the first index. A second scan of the database table is performed to determine whether each respective record of the second scan is qualified based on one or more fields of the each respective record of the second scan and a predicate. A lookup data structure is built indicating whether each of the respective records of the second scan is qualified. The lookup data structure is used to determine whether a record of the first index scan is qualified when the lookup data structure becomes available.

Abstract: A system and method for creating a self-describing dictionary for expanding compressed data objects stored in a database of a database management system includes creating a dictionary associated with a data object that is customized to the data object, generating a custom expansion procedure for expanding the data object that is tailored to the dictionary, at a same time as creating the dictionary, and embedding the custom expansion procedure into the dictionary.

Abstract: Generating data structures for computer memory. Provisional data structures are generated that respectively have (i) a significand with an initial value of zero and (ii) an exponent that is included in a range of exponents. A test data structure from a provisional data structure by modifying a significand of the first provisional data structure using a significand of a floating-point number such that the significand of the first provisional data structure has a non-zero value. Modifying at least one provisional data structure based on a content of the test data structure. Generating a new data structure that represents the contents of a plurality of provisional-data structures. The plurality of provisional data structures includes at least one provisional data structure that was modified to include the significands of at least two floating-point numbers. The new data structure represents a value that is expressible by a limited number of memory bits.

Abstract: A method, system and computer program product are provided. A first index scan of records of a database table is performed. A first index used by the first index scan is specified in a DBMS query statement as being ordered by one or more field values of one or more fields of the first index. A second scan of the database table is performed to determine whether each respective record of the second scan is qualified based on one or more fields of the each respective record of the second scan and a predicate. A lookup data structure is built indicating whether each of the respective records of the second scan is qualified. The lookup data structure is used to determine whether a record of the first index scan is qualified when the lookup data structure becomes available.

Abstract: A method, system and computer program product are provided. A first index scan of records of a database table is performed. A first index used by the first index scan is specified in a DBMS query statement as being ordered by one or more field values of one or more fields of the first index. A second scan of the database table is performed to determine whether each respective record of the second scan is qualified based on one or more fields of the each respective record of the second scan and a predicate. A lookup data structure is built indicating whether each of the respective records of the second scan is qualified. The lookup data structure is used to determine whether a record of the first index scan is qualified when the lookup data structure becomes available.

Abstract: A distributed database system (or federated database system) where a catalog is used to store metadata descriptive of data containers for the constituent database system(s) and/or accelerator system(s) of the federated database. In response to the generation of the trigger signal corresponding to a database definition language (DDL) statement, the accelerator system updates metadata in the catalog.

Abstract: A distributed database system (or federated database system) where a catalogue is used to store metadata descriptive of data containers for the constituent database system(s) and/or accelerator system(s) of the federated database. In response to the generation of the trigger signal corresponding to a database definition language (DDL) statement, the accelerator system updates metadata in the catalogue.

Abstract: Generating data structures for computer memory. Provisional data structures are generated that respectively have (i) a significand with an initial value of zero and (ii) an exponent that is included in a range of exponents. A test data structure from a provisional data structure by modifying a significand of the first provisional data structure using a significand of a floating-point number such that the significand of the first provisional data structure has a non-zero value. Modifying at least one provisional data structure based on a content of the test data structure. Generating a new data structure that represents the contents of a plurality of provisional-data structures. The plurality of provisional data structures includes at least one provisional data structure that was modified to include the significands of at least two floating-point numbers. The new data structure represents a value that is expressible by a limited number of memory bits.