Abstract: The present disclosure provides a blockchain sharding method, system, and server based on locally repairable system codes. The blockchain sharding system includes k original shards and n?k encoding shards. In each round of consensus, each original shard and m corresponding encoding shards form a local verification group (m<<n?k), and each encoding shard and t original shards participating in generation of the encoding shard form local recovery groups (t<<k). The local verification group is responsible for verifying whether a to-be-verified transaction is legitimate. When a single shard in the verification group is corrupted, the remaining m shards can reach a consistent verification result. According to the principle that the minority is subordinate to the majority, the verification group can still correctly verify the legitimacy of the transaction.

Abstract: A computer-implemented method for storing data using a distributed ledger maintained across a network of computer nodes having a mesh-based architecture, the method comprising: receiving, at a first node in a network, data output by one or more data sources; updating the distributed ledger with a record of the received data, wherein the distributed ledger is implemented in the form of a distributed acyclic graph (DAG) and updating the ledger comprises adding a transaction to the DAG; and communicating the transaction to the other nodes in the network, using the mesh-based architecture.

Abstract: Provided herein are systems and methods for providing a secure and efficient way to manage a data exchange's availability and manage the visibility of data listings of the data exchange. For example, the method may comprise specifying, by an exchange admin of the data exchange, a set of regions where the data exchange is available, each of the set of regions comprising one or more remote deployments. The method may further comprise specifying by a data provider, one or more of the set of regions where a data listing owned by the data provider is visible. Upon receiving a request to access the data listing from a remote deployment of the one or more regions, the data provider may determine whether to reject or fulfill the request. In response to determining that the request should be fulfilled, replicating data of the data listing to the remote deployment.

Abstract: A node in a blockchain network may receive an endorsed operation for a blockchain network, apply the operation; include a list comprising the operation in a subsequent block, and commit the subsequent block to a ledger of the blockchain network.

Abstract: Systems, computer program products, and methods are described herein for identification and recordation of base components of a resource within a virtual medium. The present invention is configured to electronically receive, from a user input device, a request to generate a non-fungible token (NFT) for a first portion of a resource; in response, retrieve information associated with the first portion of the resource; initiate an NFT engine on the first portion of the resource; generate, using the NFT engine, an NFT for the first portion of the resource, wherein the NFT comprises at least the information associated with the first portion of the resource; record the NFT in a distributed ledger; and transmit control signals configured to cause the user input device to display a notification indicating that the NFT has been generated and recorded in the distributed ledger.

Abstract: A processor may endorse the group of transactions received from one or more clients. The processor may provide a read-set and a write-set for each transaction of the group of transactions. The processor may order the group of transactions at an ordering service. The ordering service may have a group of orderers and may order the group of transactions. The order of the transactions may be based on the read-set and the write-set of each transaction. The processor may commit the group of transactions to the blockchain.

Abstract: A computer implemented method for managing datasets for a histogram. The method uses a number of processor units to determine a first span for first bins containing first datapoints in a first dataset in the datasets. The first span is determined based a distribution of the first datapoints in the first dataset and a desired number of bins. The number of processor units adjusts a second span for second bins containing second datapoints in a second dataset in the datasets to form an adjusted span that matches the first span for the first bins. The number of processor units merges the first datapoints in the first bins having the first span with the second datapoints in the second bins having the adjusted span to form a merged dataset for the histogram.

Abstract: A data hierarchy including individual data nodes may be used to represent a wide variety of data collections. Requests to change or add nodes in the data hierarchy may be received from many different sources over time. Instead of considering these change requests individually, an interface allows a plurality of change requests to be consolidated together into a single consolidated request. The consolidated request may be displayed in an interface such that changes from each of the original requests may be displayed together in an interface so that a cumulative effect of each of the change requests may be considered before the data changes are committed to the underlying data structure. The consolidated request may maintain links and update underlying data objects representing each of the original requests to provide a record of actions related to the consolidated request.

Abstract: A plurality of ledger nodes within a blockchain infrastructure is continuously updated via a set of conduit nodes. The set of conduit nodes share a secure provision ledger. The secure provision ledger includes a set of updates for the blockchain infrastructure. Each conduit node within the set propagates the set of updates to a subset of the plurality of ledger nodes.

Abstract: This application relates to apparatus and methods for automatically associating customer data to a corresponding customer. A computing device may receive linking data identifying a plurality of links, where each like associates at least two nodes that each represent customer data. The computing device may partition the linking data into multiple partitions, and cause a union find algorithm to be executed for each partition in parallel to associate each node with a parent ID. The computing device may iteratively execute a global shuffle algorithm to place all same nodes in a same partition, and may assign a same parent ID to the same nodes. The computing device may iteratively execute a path compression algorithm across all partitions to generate a graph output that associates all child nodes of a same parent node with the same parent ID.

Abstract: Methods, systems and products for enabling one or more nodes of an electronic ledger platform to carry out operations with respect to one or more records in the electronic ledger platform. The operations include receiving an indication to exchange a first token of a first type with a second token of a second type, the indication being authorized by a first entity, the first token associated with ownership information and comprising activity information, the ownership information indicating that the first token is owned by the first entity and the activity information indicating a first activity, and wherein the ownership of the first token is transferable to other entities over the electronic ledger platform based on the ownership information associated with the first token; generating the second token, in response to the receiving of the indication, the second token associated with the ownership information and comprising admission information.

Abstract: Embodiments include systems and methods for performing rules based scheduling and migration of databases based on complexity and weight. Information about source databases from a source system can be stored, the stored information including storage capacity information and downtime information for the source databases. Each of the source databases can be classified to one of a plurality of predetermined migration complexities based on the storage capacity information and downtime information. Scheduling weights can be assigned to each class of complexity. A migration schedule can be generated that defines periods of time for migrating data from the source databases, where a rules based scheduling engine generates the migration schedule based on the classified source databases and the assigned scheduling weights, the rules defining a weight criteria for the periods of time. Data can be migrated from the source databases to target databases according to the migration schedule.

Abstract: Example implementations relate to partial file system instances. In an example, a subset of objects of a source file system instance on a source system are replicated to a target system to form a partial file system instance on the target system comprised of the subset of objects. Each of the objects of the source file system instance is identified by a signature based on content of each of the objects and the objects exhibit a hierarchical relationship to a root object in the file system instance. An unmaterialized object is dynamically added to the partial file system instance by replicating the corresponding object from the source file system instance. The target system is asynchronously updated from the source file system instance based on a comparison of the partial file system instance to the source file system instance.

Abstract: Systems and methods include reception of an object instance representing a date dimension member and comprising a key value, a user interface representation of the date dimension member, key values of ancestor date dimension members, and user interface representations of the one or more ancestor date dimension members, display of the user interface representation and the user interface representations of the ancestor date dimension members, reception of a request to cast the date dimension member to a higher granularity, and, in response to the request, generation of a second object instance representing a second date dimension member comprising key values of a second one or more of the ancestor date dimension members and user interface representations of the second one or more of the ancestor date dimension members, and display of the user interface representations of the second one or more of the ancestor date dimension members.

Abstract: Example implementations relate to metadata operations in a storage system. An example includes generating, by a storage controller of a deduplication storage system, a candidate list of container indexes for matching operations of a received data segment, each container index in the candidate list having an associated match cost; identifying, by the storage controller, a journal group associated with a first container index listed in the candidate list; reducing, by the storage controller, a match cost associated with the first container index in response to a determination that the identified journal group is in a modified state; and performing, by the storage controller, the matching operations of the received data segment based at least on the reduced match cost of the first container index.

Abstract: A system and method for technology analysis utilizing high-performance, scalable, multitenant, dynamically specifiable, knowledge graph information storage and utilization. The system uses an in-memory associative array for high-performance graph storage and access, with a non-volatile distributed database for scalable backup storage, a scalable, distributed graph service for graph creation, an indexing search engine to increase searching performance, and a graph crawler for graph traversal. One or more of these components may be in the form of a cloud-based service, and in some embodiments the cloud-based services may be containerized to allow for multitenant co-existence with no possibility of data leakage or cross-over. The system uses a cyber-physical graph to represent an enterprise's cyber-physical system and can provide graph analysis, graph security, and graph fusion related tasks to identify potential operational risks.

Abstract: A centralized database management system performs data synchronization with lower bandwidth consumption and higher efficiency. The system manages data synchronization and data reconciliation across multiple databases managed by multiple DBMS across different client servers. The system generates and sends instructions that encode each data table into an invertible bloom filter and identifies differences between the two databases by performing a subtraction operation on the two invertible bloom filters. The system may generate a third invertible bloom filter comprising information associated with differences between the two data tables. The system may send instructions to the source and the destination databases, where a first and a second invertible bloom filters are encoded for the source and the destination databases, respectively. The system may decode the third invertible bloom filter, identify the different elements, and generate instructions to the source and/or the destination database.

Abstract: A method of processing data for a blockchain, wherein a blockchain network has a bottom blockchain network and an upper blockchain network, the bottom blockchain network has a plurality of bottom blockchain nodes, the upper blockchain network has a plurality of upper blockchain nodes, and the method is applied to the upper blockchain nodes, and the method includes: transmitting block data in a current node belonging to an upper blockchain of the upper blockchain network to a bottom blockchain node, so that each bottom blockchain node stores the block data into a bottom blockchain of the bottom blockchain network by using a consensus verification. The present disclosure also proposes a device of processing data for a blockchain, a blockchain system, a computer device and a computer readable medium.

Abstract: A computer device obtains a block proposal message and obtains a first block from the block proposal message. In accordance with a determination that a current consensus node of the computer device has a second block in a locked state and a block height of the first block is the same as a block height of the second block, the computer device deletes the block proposal message and obtains block voting information of the second block in a first consensus stage. The locked state is a state of a block that has passed the first consensus stage and has not passed a second consensus stage. The computer device obtains block submission voting information of the second block in the second consensus stage according to the block voting information, and determines a consensus result corresponding to the second block according to the block submission voting information.

Abstract: In an approach for dynamically selecting the application algorithm to be used for each change in a target database system, a processor provides at least two application algorithms for applying changes to a table in a target database system. A processor determines, for each application algorithm of the at least two application algorithms, a performance behavior of each application algorithm for sizes of changes that are applied to the table by the respective application algorithm. A processor receives a data change request for applying a change to the table. A processor determines a size of the change to the table. A processor selects one of the at least two application algorithms that provides a best performance for the size based on the performance behavior of each application algorithm. A processor applies the change to the table using the selected application algorithm that provides the best performance for the size.