Abstract: Systems and methods for novel uses and/or improvements to blockchains and blockchain technology. As one example, systems and methods are described herein for self-validating digital records that may be transferred in real-time through a cross-network registry. For example, in a conventional system, minting a token (e.g., a digital record) involves writing a self-executing program that defines the transfer rules of the digital record. Once the self-executing program is written, it is deployed on a blockchain, and the digital record is minted by publishing it to a blockchain.

Abstract: Methods, systems, and computer-readable media for global column indexing in a graph database are disclosed. A plurality of data elements of a graph database are stored. The triples comprise identifiers, column names, and values. The column names are globally scoped in the graph database and are associated with data types. Indices corresponding to the column names are created. A particular one of the indices comprises one or more of the values associated with the corresponding column name. A query is performed on the graph database using one or more of the indices corresponding to one of more of the column names associated with the query.

Abstract: Methods, non-transitory computer-readable media, and query verification apparatuses are disclosed that receive a result vector, an index to the result vector, a range proof, and an inner product proof from a prover device after providing a query vector to the prover device. The prover device hosts a vector database with rows and columns. Second and third commitments to a distance vector and a random linear combination vector, respectively, are generated based on a first commitment to the rows. The range proof is checked using the second commitment and the inner product proof is checked using the third commitment and a generator used to generate the first commitment and identified based on the index. The result vector is returned after confirming that it is one of the rows and each of the rows is as far from the query vector as the result vector based on the check of the proofs.

Abstract: An automated method and apparatus are provided for comparing a source database and a target database that are intended to be kept in synchronization with each other. An application processes database changes that are posted to the source database and replicated to the target database. The source database and the target database are made up of blocks of data. Blocks of data from the source database having database changes are collected. These blocks of data are replicated to the target database. Blocks of data from the target database that correspond to the blocks of data from the source database having database changes are read. Representations of the blocks of data from the source database having database changes are compared to representations of blocks of data from the target database that correspond to the blocks of data from the source database having database changes.

Abstract: The subject technology receives, at a first execution node, a first transaction, the first transaction to be executed on linearizable storage. The subject technology determines whether the first execution node corresponds to a rank indicating a leader worker. The subject technology, in response to the first execution node corresponding to the rank indicating the leader worker, performs, by the first execution node, an initialization process for executing the first transaction. The subject technology broadcasts a first read timestamp associated with the first transaction to a set of execution nodes, the set of execution nodes being different than the first execution node. The subject technology executes, by the first execution node, at least a first operation from the first transaction.

Abstract: The present disclosure provides techniques for detecting and correcting outliers in categories of transactions. One example method includes receiving electronic transaction data indicative of one or more current transactions, wherein the one or more current transactions are associated with a user of a software application, identifying, for each transaction of the one or more transactions, a category using a first machine learning model, computing a distribution for each category of a plurality of categories of the user, identifying, a particular category of the user as an anomalous category, based on the distribution for the particular category of the user and corresponding distributions for the particular category of other users, and updating a category assigned to one or more transactions such that a delta between a value relating to the anomalous category of the user and corresponding values relating to the particular category of the other users is reduced.

Abstract: Change data capture is performed asynchronously for direct transfer to a stream processor. When updates to a database as part of database transactions are performed, a transaction log is generated that describes the database transactions. The transaction log may be evaluated to determine indications of changes included in the database transactions. The indications of the changes may be stored in memory according to the database transactions that include the indications of the changes. When a database transaction is determined to be committed to the database, the change indications may be sent directly from the memory to the stream processor.

Abstract: An automated method and system are provided for comparing a source database and a target database that are intended to be kept in synchronization with each other. An application processes transactions that are posted to the source database and replicated to the target database. Before images of changes made to records or rows of the source database resulting from transactions posted to the source database into a first change log are collected. The before images of changes made to records or rows of the source database are replicated to the target database. Current images of records or rows of the target database that correspond to the before images of changes made to records or rows of the source database are read. Representations of the before images of changes made to records or rows of the source database are compared with representations of the current images of records or rows of the target database that correspond to the before images of changes made to records or rows of the source database.

Abstract: A distribution server restructures content and information published to a topic tree for more efficient and meaningful presentation to a subscribing client. To do so, the distribution server receives a request to create a topic view from a client and creates the topic view in response. The topic view includes a set of selected topics and a topic view mapping. The topic view mapping maps the topic paths for the set of selected topics to a set of reference topics at a set of reference paths. In other words, the topic view restructures the content and information by creating new branches in the topic tree. Whenever a selected topic receives an update from a publisher, the distribution server publishes the update as restructured content and information to the reference topics at the reference paths. A client subscribed to the reference path receives the update in a restructured manner.

Abstract: Systems and techniques for protocol buffer trie packing and streaming updates are described herein. Data entities are identified in a received update query. An index value is assigned to each unique data entity to generate an index of unique data entities. A frequency of occurrence value is determined for each unique data. entity. The index of unique data entities is sorted by data entity type in descending order by the frequency of occurrence value of each unique data entity. A trie is generated with a root node assigned as a first unique data entity from the index of unique data entities that has a frequency of occurrence value with the largest numerical value. An update payload is created for the trie by conversion of the trie into a protocol buffer format through serialization of the trie into a binary string.

Abstract: The present disclosure discloses a method, a related apparatus and storage medium for distributed transaction processing. The method includes: obtaining, by a distributed transaction processing device, a distributed transaction processing request; writing, by the distributed transaction processing device, a commit log corresponding to the distributed transaction processing request to a second object database set in the target database cluster, the commit log comprising a commit indication result; obtaining, by the distributed transaction processing device after the distributed transaction processing device resumes distributed transaction processing, the commit log from the second object database set; and performing, by the distributed transaction processing device when the commit indication result in the commit log instructs to commit the processing operation on the account data in the N accounts, the processing operation on the account data in the N accounts.

Abstract: Database log writing is based on log pipeline contention. A determination is made as to whether contention in writing data to a log pipeline, which is used in writing data from memory to storage, is at a prespecified level. Based on determining that the contention in writing the data to the log pipeline is at the prespecified level, a split operation is automatically performed to create a new log pipeline.

Abstract: A program product comprising a non-transitory processor readable medium having software stored thereon. The software, when executed by one or more processing devices, is configured to merge a first distributed ledger with a second distributed ledger to form a merged ledger. The first ledger consists of a first beginning subset of blocks followed by a first end subset of blocks. The second ledger consists of a second beginning subset of blocks followed by a second end subset of blocks. The first beginning subset of blocks is identical to the second beginning subset of blocks and the first end subset of blocks is different than the second end subset of blocks. The merged ledger includes the first beginning subset of blocks followed by blocks corresponding to the first end subset of blocks and the second end subset of blocks.

Abstract: A method comprising retrieving a plurality of invalid user first commands and a plurality of user responses stored in a memory, wherein each of plurality of invalid user verbal commands are commands to a smart hub requesting a first smart device perform an action, wherein each of the plurality of invalid commands includes at least a first name for the first smart device, wherein the first name is not a valid name for the first smart device. Determining a trend within the retrieved plurality of invalid user verbal commands and a plurality of user responses, wherein the trend identifies the first name as being used a plurality of times and identifies the first smart device the user was referring to when the user used the first name. Automatically updating a namespace database to include the first name as an alias for a setup name for the first smart device.

Abstract: A method and system for streaming data from portable storage devices. Specifically, the disclosed method and system implement iterative data streaming from a portable storage device for remote storage operations, while requiring zero over-provisioning storage space for buffering incoming write operations to the portable storage device.

Abstract: A performance measurement indexing system indexes a data store containing data entries indicative of message processing by an application. The application includes a plurality of checkpoints, and the data store contains data logged upon each message traversing the checkpoints in the application. The performance measurement indexing system determines which data entries relate to messages that satisfy a delay condition, and limits queries run on the data store to those data entries, thereby increasing the speed and efficiency with which queries can be serviced.

Abstract: An automated method and system are provided for comparing a source database and a target database that are intended to be kept in synchronization with each other. An application processes transactions that are posted to the source database and replicated to the target database. Before images of changes made to the source database resulting from transactions posted to the source database are collected into a first change log and then replicated to the target database. Before images of changes made to the target database resulting from replication are collected into a second change log. Representations of the before images of changes in the first change log are compared with representations of the before images of changes in the second change log that correspond to the same respective changes that were made to the source database and replicated to the target database.

Abstract: In one aspect, a method includes forming, at a database platform, a file stage in a user account on the database platform, the user account being associated with a client, forming, at the database platform, a hidden stage directory table and a data pipeline for the file stage, and binding the data pipeline to the file stage. The method also includes receiving a notification of an event of the file stage. The method also includes identifying the data pipeline corresponding to the file stage. The method also includes updating the hidden stage directory table of the identified data pipeline.

Abstract: A system or persistent table may be generated storing changelog information of a primary base table. The system table may then be used to create streams of relevant information. In some examples, the streams may read from the system table for information past a retention period of the primary table while reading from the primary table information in the retention period.

Abstract: A method includes identifying a search term and obtaining historical data indicative of a number of times a game was selected from search results corresponding to search queries using the search term and indicative of a number of times the selected game was played by one or more users for at least a threshold amount of time. The method further includes generating a score based on the historical data. The score is associated with the search term and the selected game.