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: An apparatus configured for database access control. The apparatus includes a memory and a processor coupled to the memory, wherein the processor is configured to execute instructions, The instructions include receiving a statement requesting access for a user to data files stored in a non-transitory memory medium; parsing the statement into one or more arguments, wherein each argument ends with a logical operator; computing a skip count for each of the arguments; evaluating the statement using the skip counts to determine whether the access should be granted to the user; retrieving the data files from the non-transitory memory medium; and sending the data files to the user, if the access is granted.

Abstract: A system for web-rendering data-dense geographical regions that correspond to heterogenous sourced data and formats for highly scalable parallel simulations, comprising a multi-dimensional time-series database enabling single-query support over all simulations via individual simulation swimlanes.

Abstract: Systems and methods for supporting both batch processing and streaming data applications, to load and process data incrementally, while providing a near-constantly materialized dataset based on raw blockchain data, are described. For example, the system may receive first on-chain data in a first format via a first input stream, wherein the first on-chain data originates from a blockchain node of a blockchain network. The system may transform the first on-chain data to a second format for storage in a second dataset, wherein the second format comprises an unbounded table.

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: This disclosure describes one or more implementations of a data verification system that provides accurate validations of user trait data for data providers. For example, in various implementations, the data verification system generates and utilizes data verification models and approaches to determine the probability that user trait data obtained by data providers is accurate and correct. In this manner, the data verification system can independently evaluate the accuracy of both individual user records as well as collective segments of user records for data providers.

Abstract: Example methods, apparatus, and articles of manufacture to capture and compress telematics data are disclosed herein. An example computer-implemented method, executed by a processor, to represent telematics data includes identifying, with the processor, a physical intersection of roads, identifying, with the processor, virtual lines crossing the roads, assigning, with the processor, ordinals to the virtual lines, representing, with the processor, a physical traversal through the physical intersection captured in first telematics data by a pair of the ordinals, and storing the pair of the ordinals in second compressed telematics data.

Abstract: Disclosed is a method for determining a content associated with a voice signal, which is performed by a computing device. The method may include converting a voice signal and generating text information. The method may include determining a plurality of target word candidates. The method may include determining a target word among the plurality of target word candidates based on a comparison between the plurality of target word candidates and the generated text information. The method may also include determining a content associated with the target word.

Abstract: The present application generally relates to search engines, and more specifically to systems and methods for a search tool for code snippets. Embodiment described herein provide a customized code search system that generates code search results from customized data sources, extract code snippets from the code search results, and presents the code snippets via a user interface. In one embodiment, the search system adopts a machine learning module to generate and highlight search results from different data sources that include code examples, e.g., in a programming language. To improve search efficiency, in response to a code search query, the search system may extract code snippets from search results from relevant sources in a user interface element, such as user selectable panels.

Abstract: A method and system for recommending content to a user whose interest(s) has not been identified is disclosed. A base user profile may be created for association with the user. The base user profile may be created by generating a list of ranked interests of a set of representative users. The list of ranked interests may be generated based on activity information obtained for the set of representative users. Content may be recommended to the user based on the base user profile.

Abstract: A computer-implemented method of providing targeted content to a user includes generating a query index from a data corpus, the query index including a plurality of market segment-based queries, wherein each market segment-based query of the plurality of queries is configured to provide targeted content on a browser user interface of a user determined to be within a corresponding market segment.

Abstract: Systems and methods for a unified approach that is compatible with all blockchains, protocols, etc. The systems and methods use a bifurcated indexing system with a dynamically selected application service. The systems and methods bifurcate the indexing process into a storage layer and a compute layer.

Abstract: Embodiments of the present disclosure relate to method, device and computer program product for data backup. The method comprises: in response to receiving from a backup server a data stream to be backed up, dividing the data stream into a plurality of data segments; distributing the plurality of data segments to at least one computing node; in response to receiving an index of a corresponding data segment from a first computing node of the at least one computing node, looking up the index in a global index cache, the index being generated by the first computing node to uniquely identify the data segment, the global index cache storing indexes of data in a backup storage device; in response to the missing index in the global index cache, adding the index into the global index cache; and sending to the first computing node an indication to store the data segment in the backup storage device.

Abstract: Techniques are described herein for routing queries to particular nodes of a multi-node database system based on the query. A database table is partitioned into a plurality of affinity groups. Each affinity group is assigned a particular node as the master node of the affinity group. A mapping is sent to a query router indicating the master node for each affinity group of the plurality of affinity groups. The query router determines, for a particular query, a target node to which to send the particular query based on the mapping and the particular query.

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.

Abstract: Systems and methods are provided for collecting and sharing digital experience information. A system for collecting and distributing digital experience information may comprise a digital experience application that may be configured to host a plurality of micro-applications, a first micro-application being able to be configured to detect application events and application states; a connector that may be configured to receive information corresponding to detected application events and application states and belonging to a category; an event backbone that may be configured to route the information received by the connector based on the category; a database that may be configured to store the received information; wherein the event backbone may be further configured to send information to the connector from the event backbone and the database based on one or more criteria; and wherein a second micro-application may be configured to receive information belonging to the category from the connector.

Abstract: Systems, apparatuses, methods, and computer program products are provided for managing geographically distributed data storage in a group-based communication system and for servicing deletion requests related thereto. In some embodiments, an apparatus physically located in a first geographic area defined by a first geographic boundary is provided. In embodiments, upon determining that an entity identifier associated with a message is associated with a geographic data storage policy, the apparatus is configured to transmit a geographic data residency message package comprising message data of the message to a geographic data residency server physically located within a second geographic area defined by a second geographic boundary. The second geographic area is associated with the geographic data storage policy. In some embodiments, the apparatus is configured to update the message data of the message with residency token data received from the geographic data residency server.

Abstract: A storage system determines a change in storage system geometry that affects at least one previously formed resiliency group of storage system resources. The storage system forms at least one resiliency group of storage system resources in accordance with rules that emphasize stability of formation of resiliency groups. The storage system accesses data stripes across storage system resources of resiliency groups.

Abstract: Consistent queries to replicated data may be performed according to global clock values. Time values for updates performed at a data set may be identified according to a global clock. The updates may be replicated to a replicated portion of a data set. Queries directed to the replicated portion of the data set may be performed in response to determining that the time values for updates indicate that the replicated portion of the data set is consistent with a time value identified for the query according to the global clock.

Abstract: A computer-implemented method that includes receiving an ingestion request to ingest data to a database comprising physical shards and detecting that the ingestion request is directed to a first hotspot shard. The first hotspot shard has a contention level over a threshold value. The method also detects context characteristics within the data and generates a first virtual shard based on a first virtual shard key selected from the detected context characteristics. The first virtual shard virtually duplicates at least a portion of the first hotspot shard. The method also includes ingesting the data to the first virtual shard.