Systems and methods for throttling requests submitted to a database are designed to maximize the rate at which information can be obtained from the database. In the throttling methods, the time required for the database to perform a certain operation is monitored. If the time required to perform the operation exceeds a threshold time period, a request limit is imposed on the database, the request limit limiting the number of data read and/or write requests that can be submitted to the database per unit of time.

Embodiments of the present disclosure describe systems, methods, and computer program products for redacting sensitive data within a database. An example method can include receiving a data query referencing unredacted data of a database, responsive to the data query, executing, by a processing device, a redaction operation to identify sensitive data within the unredacted data of the database, and returning a redacted data set in which the sensitive data is replaced or removed to the data query.

Exemplary embodiments may perform feasibility analysis to determine whether it is possible to generate a lookup table that conforms to an error tolerance given a specification of a function or a set of data points that the lookup table attempts to approximate, an indication of breakpoint positions, and a specification of a data type for table values. Where it is determined that it is feasible to generate the lookup table, the lookup table may be automatically programmatically generated. Suggestions of how to modify the breakpoint positions and/or error tolerance may be provided. In addition, a visualization of approximation error and error tolerance, such as a visualization showing a feasibility margin, may be output. New data points may be processed to update table values for an already generated lookup table.

Exemplary embodiments may perform feasibility analysis to determine whether it is possible to generate a lookup table that conforms to an error tolerance given a specification of a function or a set of data points that the lookup table attempts to approximate, an indication of breakpoint positions, and a specification of a data type for table values. Where it is determined that it is feasible to generate the lookup table, the lookup table may be automatically programmatically generated. Suggestions of how to modify the breakpoint positions and/or error tolerance may be provided. In addition, a visualization of approximation error and error tolerance, such as a visualization showing a feasibility margin, may be output. New data points may be processed to update table values for an already generated lookup table.

Embodiments of the invention relate to a method for managing subscriptions. The method includes initiating execution of a first subscription, in response to the initiating, obtaining a first subscription barrier associated with a first subscription, making, using the first subscription barrier, a first determination to block execution of a first query request associated with the first subscription, and in response to the first determination, ceasing execution of the first subscription.

A user device has a plurality of modules which support an application such as gaming application. The user device has a stream processing module which is able to stream process events which are generated, for example when the application is run. The events which are generated by the modules are passed to an event module which distributes the events to other of the modules.

Systems and methods for determining a query for a data store are described. A natural language text may be analyzed using heuristic processing and one or more machine learning models. Query parameters may be determined from the heuristic processing and machine learning and combined to form a query in a query language. In the heuristic processing, parsing rules may be used to remove conditional terms to generate a base question. The base question may be input to the one or more machine learning model to generate a base query which may be combined with query parameters related to the conditional terms.

Distributed pseudo-random subset generation includes obtaining a data-query indicating a first table having a first column including unique values, a second table having a second column including unique values, a join clause joining the first table and the second table on the first column and the second column, and a limit value, pseudo-random filtering the first table to obtain left intermediate data and left filtering criteria, pseudo-random filtering the second table to obtain right intermediate data and right filtering criteria, obtaining intermediate results data by full outer joining the left intermediate data and the right intermediate data, obtaining results data by filtering the intermediate results data using most-restrictive filtering criteria among the left filtering criteria and the right filtering criteria, and outputting the results data, wherein outputting the results data includes limiting the cardinality of rows of the results data to be at most the limit value.

Systems and methods for processing natural language inputs to determine user intents using an insights repository are provided. An insights repository system is configured to build an insights repository as a data structure representing a plurality of entities and relationships among those various entities. The insights repository system may receive information from various sources via an event stream, and may process the information using event rules. Based on the application of the event rules, the system may configure an insights repository data structure representing various entities, relationships between various entities, and the strengths of relationships between various entities. After the insights repository is created, consumers may execute queries against the insights repository. Furthermore, the insights repository system may automatically query the insights repository to generate insight information to be published to an insight feed to which consumer systems may subscribe to receive automatic updates.

A computer system receives a data stream with a plurality of packets. In response to receiving the data stream with the plurality of packets, the computer system distributes individual packets of the plurality of packets to the inputs of each of a plurality of processing nodes. Each respective processing node has a local queue storing a respective number of packets to be processed by the respective processing node. Distributing a respective packet of the plurality of packets to the inputs of each of the plurality of processing nodes includes delaying sending the respective packet to each of the plurality of processing nodes by a delay time that is a non-linear function of an average number of packets in the local queues of the respective processing nodes.