Abstract: Provided are a blockchain data processing method and apparatus, a device, and a readable storage medium. By storing a data type information table in a relational database in advance, the data type information table is used for storing storage information of all the data types, and the storage information includes a table corresponding to the data type, a mapping relationship between the service field of the Value of the data type and a table field in the corresponding table, and a data format of the Value of the data type. A data type of the Value is determined when the Key-Value data needs to be stored; and a target table corresponding to the data type of the Value is determined and the Key-Value data is written into the target table according to the data type information table.

Abstract: The present disclosure involves systems, software, and computer implemented methods for data confidentiality-preserving machine learning on remote datasets. An example method includes receiving connection information for connecting to a remote customer database and storing the connection information in a machine learning runtime. Workload schedule information for allowable time windows for machine learning pipeline execution on remote customer data of the customer is received from the customer. A determination is made that an execution queue includes a machine learning pipeline during an allowed time window. The connection information is used to connect to the remote customer database during the allowed time window. Execution is triggered by the machine learning runtime of the machine learning pipeline on the remote customer database. Aggregate evaluation data corresponding to the execution of the machine learning pipeline on the remote customer database is received and provided to a user.

Abstract: Transaction processing systems in accordance with aspects of the invention may process a variety of transactions. Transaction processing systems may include a transaction processing device and a distributed processing system. The transaction processing device obtains transaction requests from a variety of client devices and process the transaction requests. The distributed processing system may also obtain the transaction requests and maintain a transaction history of the transaction requests obtained and/or processed by the transaction processing device. Both the distributed processing system and the transaction processing device may send a transaction succeeded event based on the transaction being processed successfully. The transaction processing device and distributed ledger may also maintain an indication of if a particular transaction has been processed.

Abstract: A building system includes one or more storage devices having instructions stored thereon that, when executed by one or more processors, cause the one or more processors to receive an unstructured user question from a user device of a user and query a graph database based on the unstructured user question to extract context associated with the unstructured user question from contextual information of a building stored by the graph database, wherein the graph database stores the contextual information of the building through nodes and edges between the nodes, wherein the nodes represent equipment, spaces, people, and events associated building and the edges represent relationships between the equipment, spaces, people, and events. The instructions further cause the one or more processors to retrieve data from one or more data sources based on the context and compose a presentation based on the retrieved data.

Abstract: Systems and methods for processing structured queries over clusters are provided herein. An example system includes a plurality of clusters, wherein a local cluster is configured to receive, from a client, a structured query language (SQL) structured query, determine, based on the SQL structured query, a list of remote clusters of the plurality of clusters, process the SQL structured query to generate a local query executable by a local search engine of the local cluster and remote queries executable by remote search engines of the remote clusters, send the remote queries to the remote clusters to obtain remote results, execute the local query to obtain local results, combine the remote results and the local results to obtain an aggregated result, and return the aggregated result to the client.

Abstract: A method may include in response to a user request for a playlist, identifying, by a processing device, a plurality of media items from the playlist, for each of the plurality of media items, determining whether a respective media item is available for a playback on a user device, in response to a determination that the respective media item is not available for the playback on the user device, causing the use device to advance to a next media item on the playlist without user interaction, and in response to a determination that the respective media item is available for the playback on the user device, causing the user device to play the respective media item.

Abstract: A protocol for implementing ACID transactions that provides snapshot isolation in a distributed setting that does not require synchronized clocks is described. The protocol ensures at commit time that transactions touching common objects do not commit out of order. The protocol can be used in the context of a distributed data lake built on an object store in which clients can transactionally add or remove objects from logical tables.

Abstract: A method for storing or transmitting information may include determining at least one subdivision of at least one logical hierarchical data space. The at least one logical hierarchical data space may have a plurality of subdivisions. The method may further include creating at least one data block. The method may further include writing the at least one tuple to the at least one data block. The at least one tuple may be associated with the subdivision of the at least one logical hierarchical data space. The method may further include associating the at least one data block with the at least one subdivision of the at least one logical hierarchical data space.

Abstract: At least a portion of data of a tree data structure is serialized into a first set of flat data. At least a portion of a structure of the tree data structure is serialized to reproduce at least the portion of the structure in a second set of flat data. It is determined to access a desired data of the tree data structure from an archive. The second set of flat data is read to reconstitute at least the portion of a structure of the tree data structure. The reconstituted structure of the tree data structure is used to determine a data offset associated with the first set of flat data, wherein the data offset corresponds to the desired data. The desired data is accessed using the data offset associated with the first set of flat data.

Abstract: A work assistance system includes a storage storing work data for each of a plurality of devices, the work data indicating work performed to maintain the plurality of devices, a setter configured to set at least one attribute among a plurality of prescribed attributes with respect to the work data stored in the storage, an extractor configured to interpret the attribute set in the work data and to extract work data in which a specific attribute is set, and a provider configured to provide the work data extracted by the extractor.

Abstract: In some embodiments, systems, methods, and apparatuses are provided herein useful for managing a plurality of concurrent and nearly concurrent data requests within a computer system. The systems have a main data storage for storing source data, and a high speed, and/or remote data storage for storing computed data. In some embodiments, a combination of data filters and distributed mutex processes are used to eliminate or limit duplicate reads and writes into the high speed data storage units by ensuring only a single service module gets a lock to do the read and update of the cache; and makes it possible for keys to expire and be removed from the data filter. The systems and methods herein have various applications including retail sales environments where the requested data is related to product sales, product availability and the like.

Abstract: The invention is a method, an apparatus and a computer program for the automatic processing of data identifiers (20, 22), wherein data (12) associated with data identifiers (20, 22) is transmitted to a cloud platform (16) and to an analysis unit (32) there having at least one functional unit (45-50), wherein each functional unit (45-50) performs an analysis of the data (12) and/or associated data identifier (20, 22) and outputs a confidence value as an analysis result, wherein the or each confidence value is mapped to an overall confidence value (60), wherein the overall confidence value encodes a correlation between two data identifiers (20, 22), wherein data identifiers (20, 22) determined as correlated are combined under a higher-order variable name (66), and wherein the higher-order variable name (66) can be used for a database query, which supplies data relating to all data identifiers (20, 22) combined under the variable name (66), wherein data identifiers (20, 22) having an overall confidence value (60

Abstract: In one implementation, a method includes receiving data characterizing a hierarchical dataset associated with hierarchical industrial assets. The hierarchical dataset can include a plurality of node data that can include a plurality of asset data and a plurality of edge data. An edge datum of the plurality of edge data is indicative of a relation between a pair of node data of the plurality of node data. Each node datum of the plurality of node data represents an asset in the hierarchical industrial asset and each edge datum of the plurality of edge data represents an edge in the hierarchical industrial asset. The method further includes receiving data characterizing a partition identifier associated with the hierarchical dataset can be received. The method also includes assigning, based on the partition identifier, a partition of a database to the hierarchical dataset. The method further includes storing the hierarchical dataset in the assigned partition.

Abstract: Data is replicated on a backup node, where the granularity of the replication can be less than a full volume. A data consistency group comprising a subset of data for a volume is defined for a primary node. A set of differences for the data consistency group is sent to a backup node. The backup node creates change logs in response to receiving the set of differences. In response to receiving a request to access a file having data in the data consistency group, the backup node creates a clone of the file. The backup node determines whether an update to a data block of the file exists in the change logs. In response to determining that the update to the data block exists in the change logs, the backup node updates a copy of the data block for the cloned file with data in the change logs.

Abstract: Each node of the binary tree contains an integer key value. When a new node is inserted into the binary tree, if the new node has a key value not equal to the key value of a node in the binary tree, there are necessarily a smaller key value A and a greater key value B, a binary boundary value C is calculated using the key values A and B; the relation between the new node and the node in the binary tree and the route for the new node to be inserted are determined based on the binary boundary value C. If A?0, there must be an odd integer N and an integer power F of 2 for the key values A and B to satisfy (N?1)×F<A?N×F and N×F?B<(N+1)×F, then the binary boundary value C=N×F; and if A=0, then the binary boundary value C is equal to 0.

Abstract: A method and computer program for optimizing computation and data retrieval of join operations from a multi-node log-structure database system. The database system has one or more data tables each having a plurality of columns. A join index is created for one or more join key columns, with optionally one or more secondary columns, of one of the data tables. The join index is partitioned across at least one computing node, and each join index partition reproduces the log structure storage of the data table. The join index is maintained in a series of incremental operations by replicating the creation or deletion of data segments from the log structure storage of the data table to the join index partitions.

Abstract: A building system includes one or more storage devices having instructions stored thereon that, when executed by one or more processors, cause the one or more processors to receive an unstructured user question from a user device of a user and query a graph database based on the unstructured user question to extract context associated with the unstructured user question from contextual information of a building stored by the graph database, wherein the graph database stores the contextual information of the building through nodes and edges between the nodes, wherein the nodes represent equipment, spaces, people, and events associated building and the edges represent relationships between the equipment, spaces, people, and events. The instructions further cause the one or more processors to retrieve data from one or more data sources based on the context and compose a presentation based on the retrieved data.

Abstract: A system for performing recursive online searches is configured to: (a) determine that a summary profile of a target entity includes at least one unpopulated field; (b) search at least one of a set of data sources to obtain one or more attributes for populating the at least one unpopulated field, the one or more attributes being information extracted from one or more peripheral entities associated with the target entity; (c) calculate, for each of the one or more attributes, a respective confidence score based at least in part on a set of factors, the set of factors including an activity level of the target entity; and (d) based on a respective confidence score being above a threshold, populate a respective unpopulated field with a respective one of the one or more attributes.

Abstract: A B+ tree access method, apparatus, and a medium include: when a B+ tree creation instruction is acquired, determining whether there is an idle underlying tree file mapped to a Dynamic Random Access Memory (DRAM); if YES, storing underlying data of a B+ tree in the underlying tree file; if NO, creating a new target underlying tree file, and mapping the target underlying tree file to the DRAM, so as to store the underlying data of the B+ tree in the target underlying tree file; and when a number of layers of the B+ tree is greater than or equal to a preset threshold, storing, in a preset storage area, data of a layer numbered to be greater than or equal to the preset threshold in the B+ tree. Based on a data structure of the B+ tree, data needs to be accessed from the underlying data whenever read.

Abstract: A partition merging method includes obtaining, by a first database server, first metadata of a first partition based on an identifier of a current file of the first partition, obtaining second metadata of a second partition based on an identifier of a current file of the second partition, and generating third metadata of a third partition based on the first metadata and the second metadata.