The subject technology receives a first transaction, the first transaction to be executed on linearizable storage. The subject technology assigns, prior to performing a read operation, a first read version to the first transaction, the first read version indicating a first version of the linearizable storage, the first read version corresponding to a particular timestamp of a current time. The subject technology performs the read operation from the first transaction on a table in a database. The subject technology determines a first commit version identifier corresponding to first data resulting from the read operation. The subject technology proceeds to perform a particular write operation from the first transaction. The subject technology determines that the first commit version identifier fails to match a second commit version identifier corresponding to a second transaction. The subject technology aborts the particular write operation from the first transaction.

One embodiment provides a system for facilitating efficient communication of a collection of interests. During operation, the system receives, by an intermediate node, a first packet which has a name and a first nonce, wherein the first packet indicates a set of member interests, wherein a member interest has a name. In response to not obtaining a matching entry in a pending interest table based on the name for the first packet, the system creates a new entry in the pending interest table, wherein an entry includes a second nonce, a reference count, and a set of arrival nonces and corresponding arrival interfaces. The system sets the new entry's second nonce to a new nonce, and sets the new entry's reference count to a number of member interests indicated in the first packet. The system forwards the first packet, wherein the first nonce is replaced with the new nonce.

A distributed database compaction system can perform compaction for transactional queries in an asynchronous matter without affecting completion of the queries. The compaction system can implement asynchronous transformation of key pairs in the database, and older keys can be periodically purged using a scheduled compactor. Subsequent queries use the compacted stored keys to perform efficient queries with direct reads of committed transactions and more efficient access to key values stores of the distributed database.

The present disclosure is directed to a scalable, extensible, fault-tolerant system for stateful joining of two or more streams that are not fully synchronized, event ordering is not guaranteed, and certain events arrive a bit late. The system can ensure to combine the events or link the data in near real-time with low latency to mitigate impacts on downstream applications, such as ML models for determining suspicious behavior. Apart from combining events, the system can ensure to propagate the needed entities to other product streams or help in entity resolution. If any of the needed data is yet to arrive, a user can configure a few parameters to achieve desired eventual and attribute consistency. The architecture is designed to be agnostic of stream processing framework and can work well with both streaming and batch paths.

This disclosure describes systems and methods for using an estimator to produce values for dependent variables of streaming objects based on values of independent variables of the objects. The systems and methods may include continuously tuning the estimator based on any objects received with pre-populated values for the dependent variables.

Systems and methods are described for processing ingested data in an asynchronous manner as the data is being ingested to detect potential anomalies. For example, one or more streaming data processors can convert data as the data is ingested into a comparable data structure, determine whether the comparable data structure should be assigned to an existing data pattern or a new data pattern, and optionally update a characteristic of the data pattern to which the comparable data structure is assigned. The streaming data processor(s) can perform these operations automatically in real-time or in periodic batches. Once one or more comparable data structures have been assigned to one or more data patterns, the streaming data processor(s) can analyze the comparable data structures assigned to a particular data pattern to determine whether any of the comparable data structures appear to be anomalous.

Automated reconfiguration of real time data stream processing may be implemented. A processing function that describes one or more operations to be performed with respect to one or more data streams may be executed at one or more processing nodes. Performance metrics describing the performance of the processing function at the processing nodes may be collected and monitored. A reconfiguration event may be detected for the processing function. A different execution configuration for the processing function may be determined and initiated in response to detecting the reconfiguration event.

At least some aspects of the present disclosure feature systems and methods for obfuscating data. The method includes the steps of receiving an input data stream including a sequence of n-grams, mapping at least some of the sequence of n-grams to corresponding dictionary terms using a dictionary, and disposing the corresponding tokens to an output data stream.

Computerized systems and methods facilitate searches by identifying instances in which search input is an ambiguous query and resolving the ambiguous query. The search system identifies ambiguous queries by querying a common data store prior to querying a patient database. More particularly, when the search system receives search input entered into a search tool, the search system queries the common name data store before querying the patient database to determine if the search input matches a common name and is an ambiguous query. If so, the search system may provide a notification to the user to indicate the search input is an ambiguous query with a common name and prompt the user to enter additional search criteria. In some instances, the search system may prevent a search from being performed on the patient database if the search input matches a common name until additional search criteria is entered.

A method for configuring a computing infrastructure is disclosed. The method comprises representing at least a portion of the computing infrastructure as a graph representation of computing infrastructure elements including a computing infrastructure node and a computing infrastructure edge, detecting a change in the graph representation of computing infrastructure elements, and determining whether the change affects a graph representation query pattern. In the event the change affects the graph representation query pattern, the change is notified to a query agent associated with the graph representation query pattern.