Abstract: Various disclosed embodiments pertain to a distributed audit trail system for use in a connected system including: a master unit to control a first aspect of the connected system and to create a blockchain light client and a distributed hash table (DHT); a first node to control a second aspect of the connected system; a second node to control a third aspect of the connected system; and one or more remote servers to form a blockchain full node, where the master unit, the first node, and the second node electronically communicate with each other through the DHT in order to form a combined audit trail, where the master unit creates a meta-hash of the software version of the software in the master unit, the first node, and the second node, system identification data, system sensor data, and system hardware configuration.

Abstract: Systems and methods for implementing record locking for transactions using a probabilistic data structure are described. This probabilistic structure enables adding of data records without growth of the data structure. The data structure includes a hash table for each of multiple hash functions, where entries in the respective hash tables store a transaction time and locking state. To lock a record, each hash function is applied to a record key to provide an index into a respective hash table and a minimum of the values stored in the hash tables is retrieved. If the retrieved value is less than a transaction time for a transaction attempting to lock the record, locking is permitted and the transaction time is recorded to each of the hash tables. To commit the transaction, the probabilistic data structure is atomically updated as part of the commit operation.

Abstract: An example of communicating transaction data between a first service and a second service includes receiving transactions of first service, and processing the received transactions and storing the results in a database of the first service. For at least some of the received transactions, corresponding transaction messages are produced for processing by the second service, and tracking that each of the transaction messages is provided to a message queue. The transaction messages are received from the message queue and are processed using the second service, and the results are stored in a database of the second service. When there are duplicate transaction messages received from the message queue, the database of the second service only stores the results of one of the duplicate transaction messages.

Abstract: Hash collision in a highly scaled configuration cannot be prevented. However, the impact of the hash collision may be reduced based on a priority. Currently, there are no priorities assigned to virtual ports (VP) in a VXLAN environment. Thus, any VP may be impacted by not being added to a hash table that facilitates network data traffic processing. The probability of not being added to a hash table for network VPs is higher given that they tend to be programmed at a later stage than access VP. With priority-based hash table programming embodiments, hash table programming is better controlled, and the impact to higher priority VPs is reduced.

Abstract: Systems and methods are provided for accessing a database of records to identify a set of records represented by one or more nodes in a graph model. A connection between a first node and a second node in the one or more nodes is monitored to determine an association between a first record, represented by the first node, and a second record, represented by the second node. The set of records may be partitioned into a plurality of groups. For at least a first group, including a first set of records, it may be determined whether two or more records in the first group are related. In response to determining that the two or more records in the first group are related, a first group identifier may be assigned to the two or more records.

Abstract: Techniques are disclosed relating to multi-tenant database systems with underlying key/value storage. In some embodiments, a computing system generates first logical table information for a first portion of a multi-tenant dataset corresponding to a first tenant and second logical table information for a second portion of the dataset corresponding to a second tenant. The system may store the first and second logical tables using non-relational key/value data structures in one or more storage elements, including: storing entries from the first logical table across a first set of multiple key/value store buckets and storing entries from the second logical table across a second set of multiple key/value store buckets. Disclosed techniques may reduce performance issues due to hotspots while allowing efficient data access for a given tenant by limiting the number of buckets per tenant, relative to traditional techniques.

Abstract: Disclosed is a method and device for preventing blockchain forking. The method includes: selecting s consecutive blocks Bn to Bn+s; generating a key pair for block Bn by a node An that creates the block Bn; holding the node An active in the blockchain's continuously generating blocks Bn+1 to Bn+s until the block Bn+s of s consecutive blocks becomes tamper-proof; in response to that, signing on the block Bn+s with the private key PK?n; in response to the blockchain's subsequently generating a block Bm(m>n+s), placing the signature in Bm; making nodes creating each of the s blocks Bn to Bn+s all execute afore-mentioned steps, thereby forming multiple backlinks associated with the blockchain's block size. The number of backlinks is used for determining blockchain forking by a newly-added node creating a new block.

Abstract: A system and method for verifying users are disclosed. The method includes receiving, by a server computer, from a first authorizing entity computer, an indication of a first hash of information about the user. The first authorizing entity computer has previously verified the user and stored the first hash in a first database. The server computer stores a location of the first hash in a location database. Then the server computer receives from a second authorizing entity computer a verification request message including a second hash of information about the user and retrieves the first hash from the first database using the location. The server computer compares the first hash to the second hash to determine if the hashes match. After determining that the hashes match, the server computer sends a verification response message to the second authorizing entity computer, indicating that the user was previously verified.

Abstract: Techniques are provided for replay of metadata and data operations. During initial execution of operations, identifiers of objects modified by the execution of each operation are identified and stored in association with the operations. When the operations are to be replayed (e.g., executed again, such as part of a replication operation or as part of flushing content from a cache to persistent storage), the identifiers are evaluated to determine which operations are independent with respect to one another and which operations are dependent with respect to one another. In this way, independent operations are executed in parallel and dependent operations are executed serially with respect to the operations from the dependent operations depend.

Abstract: A data deduplication process is performed in a storage system which includes storage nodes, and storage control nodes which can access data directly from each storage node. A first storage control node sends a message to a second storage control node to initiate a deduplication process with respect to a given data block and an original data block owned by the second storage control node. The second storage control node increments a reference counter associated with the original data block, and sends a message to the first storage control which includes metadata. The first storage control node uses the metadata to read the original data block from a given storage node, performs a data compare process to determine whether the given data block matches the original data block, and creates a reference to the original data block, if the given data block matches the original data block.

Abstract: A building system of a building including one or more memory devices having instructions thereon, that, when executed by one or more processors, cause the one or more processors to retrieve projection rules for generating a building graph projection. The instructions cause the one or more processors to retrieve a plurality of entities representing elements of the building and a plurality of relationships between the plurality of entities representing relationships between the plurality of entities, construct the building graph projection including a plurality of nodes and a plurality of edges based on the plurality of entities, the plurality of relationships, and the projection rules, and perform one or more operations based on the building graph projection.

Abstract: A system analyzes user activity data generated by computing devices associated with a plurality of users in a messaging system to extract a random user from the plurality of users. Based on determining that user activity data associated with the random user comprises a consistent pattern, a cluster associated with the consistent pattern is generated and the random user is added to the cluster. Then user activity data for the other users in the plurality of users is analyzed to determine whether user activity data for each of the other users comprises a similar pattern as the generated cluster. Each user that is determined to be associated with user activity data comprising a similar pattern as the consistent pattern of the generated cluster is added to the generated cluster and user activity data associated with each user added to the generated cluster is removed from the user activity data.

Abstract: In implementations, a schema generation utility is configured to allow a user to abstract and generate a schema, such as a JSON schema, from a base schema instance according to schema configuration data, other data inputs, and schema configuration models. In an implementation, a user provides parameters, configuration objects, etc. for a desired final output schema. The schema generation utility may be configured to receive and parse the base schema instance into a plurality of configurable data objects, also referred to as “schema chunks,” that are extracted from the base schema instance. A set of schema chunks may be assembled into a desired output schema based on, at least in part, configuration data and assembly data contained in the schema chunks. In other implementations, input parameters may include error tolerance thresholds processed by the schema generator to discern between errors that lead to schema failure and benign errors.

Abstract: A database with virtual partitioning. A computer system used to implement the database receives a request for a database operation to be performed on data stored in a portion of the database, where the data has a group of logical partitions (e.g., tenants of a multi-tenant database), and where the portion of the database is not further physically partitioned. The computer system identifies a virtual partitioning scheme for the database operation, the virtual partitioning scheme defining sub-groups of the group of logical partitions. The computer system then performs the database operation for the sub-groups defined by the virtual partitioning scheme. Multiple virtual partitioning schemes can be active at the same time, and virtual partitioning schemes can be created dynamically in some instances.

Abstract: A method of maintaining a probabilistic filter includes, in response to receiving a key K1 for adding to the probabilistic filter, generating a fingerprint F1 based on applying a fingerprint hash function HF to the key K1, identifying an initial bucket Bi1 by selecting between at least a first bucket B1 determined based on a first bucket hash function H1 of the key K1 and a second bucket B2 determined based on a second bucket hash function H2 of the key K1, and inserting the fingerprint F1 into the initial bucket Bi1; and resizing the probabilistic filter. Resizing the probabilistic filter includes incrementing a resize counter value, determining a bucket B? for the fingerprint F1 based on a value of the fingerprint F1 and the resize counter value, and inserting the fingerprint F1 into the bucket B? in the probabilistic filter.

Abstract: Associating comments with tags in a managed historian system in accordance with a flexible, platform-independent data structure. A worker role instance automatically associates received comments with a process tag at a particular time in response to receiving the comments. The worker role instance stores the comments in the flexible, platform-independent data structure such that the comment is provided in association with the tag at the particular time in response to a display or search request for the tag.

Abstract: An automation device for process automation, with a server containing one or more process automation variables, wherein the server is configured to receive read and/or write requests from a client in communication with the automation device for at least one variable. The automation device adapted to: specify the time period between two read requests for the same read request variable and/or between two write requests for the same write request variable; specify a sampling time for the read or write request variable as a function of the specified time period; and enable read access to the read request variable in the address space of the server at the respective sampling time, independently of future read requests and/or to prepare write access to the write request variable in the address space of the server at the respective sampling time, independent of the previous write request.

Abstract: A computing device includes a processor and a machine-readable storage storing instructions. The instructions are executable by the processor to: receive a bit vector representing input data to be tokenized; divide the bit vector into two vector portions; and perform a plurality of rounds of a Feistel network on the two vector portions, each round including converting one vector portion using a table-based hash function that combines multiple tokens retrieved from at least one token table.

Abstract: A hashing apparatus includes a memory and circuitry. The memory stores (i) multiple hash tables storing associative entries, each including at least one entry key and a respective value, the hash tables are associated with respective different hash functions, and an associative entry is accessible by applying the relevant hash function to a key matching an entry key in the associative entry, and (ii) an affinity table that stores table-selectors for selecting hash tables with which to start a key lookup. The circuitry receives a key, reads from the affinity table, by applying an affinity function to the key, a table-selector that selects a hash table, accesses in the selected hash table an associative entry by applying the hash function associated with the selected hash table to the key, and in response to detecting that the key matches an entry key in the associative entry, outputs the respective value.

Abstract: An approach is provided for optimizing a database buffer pool. Based on statistics about read and write operations in a range of pages, the range of pages is determined to be a candidate for a hot read range for which locks and latches are avoided in processing operations in the hot read range. Using an on-time trigger or pre-trigger process, the hot read range is created from the range of pages by marking start and end points in the range of pages. Write operation(s) are determined to be included in the hot read range by marking an object control block. The write operation(s) are added to a write pending list. The read operations in the hot read range are performed without a latch or lock. The write operation(s) are merged from the write pending list to the range of pages and the write operation(s) are performed.