Matrixx Software, Inc.

Sybase, Inc.

Ian Marshall

David S Labuda

Norin Saxe

Shane Beasley

Aleksey Sanin

Mark Tsimelzon

Robert B Hagmann

Ming-Wen Sung Hwang

Deepak Bisht

A database system includes an interface and a processor. The interface is configured to receive a transaction request comprising one or more transaction blocks in an order. The processor is configured to evaluate each transaction block of the one or more transaction blocks in the order by: determining in the order whether a condition expression of a transaction block of the one or more transaction blocks is true; and in response to the condition expression of the transaction block being true, adding in the order one or more associated action sets of the transaction block to a transaction context; and in response to each of the transaction blocks being evaluated, cause the transaction context to be executed as an atomic transaction.

Transaction block processing for conditional commit databases

A system for determining a quota comprises an input interface and a processor. The input interface is configured to receiving a current workload. The processor is configured to: determine whether the current workload less than or equal to target workload; and in response to the current workload being less than or equal to target workload: indicate no modification to input values; set output values to input values; and provide the output values.

Adaptive quota management system

A system for determining a quota comprises an input interface and a processor. The input interface is configured to receive an input quota value. The processor is configured to: determining total reservations for shared balances; determining whether the total reservations exceed ideal value maximum shared reservation amount; and in the event that the total reservations do not exceed an ideal value maximum shared reservation amount: indicating no modification to input quota value; setting output quota value to input quota value; and providing the output quota value.

A system for determining a quota comprises an input interface, a candidate quota determiner, one or more quota modification determiners, and an output interface. The input interface is for receiving a quota request for an activity and receiving an estimation or an actual measurement of one or more operating parameters. A candidate quota determiner is for determining a candidate quota amount based at least in part on candidate quota parameters. The one or more quota modification determiners are for determining one or more quota modifications based on the estimation or the actual measurement of the one or more operating parameters. The output interface for providing a final quota amount based at least in part on the candidate quota amount and the one or more quota modifications.

A system and method to synchronize the processing of messages in areas of an execution graph affected by primitives with potential for substantial delay is provided. A continuous processing system identifies primitives with potential for substantial delay. For each potentially-delayed primitive that is not in a loop, the continuous processing system creates a 'timezone' downstream of such primitive. The output(s) of the potentially-delayed primitive is an input to the timezone. The continuous processing system then identifies all other inputs to the timezone and places a synchronizer across such inputs. In cases where the potentially-delayed primitive is within a loop, the timezone includes such primitive, as well all primitives downstream of such primitive.

System and method for synchronizing message processing in a continuous processing system

The present invention provides a method for obtaining predicable and repeatable output results in a continuous processing system. The method involves processing messages and primitives in accordance with the following rules: (1) Messages are processed in accordance with timestamps, where messages are divided up into 'time slices'; (2) message order within a data stream is preserved among messages with the same time stamp; (3) subject to rule #, for each time slice, a primitive is executed when either the messages within such time slice show up in the input stream for such primitive or the state of the window immediately preceding such primitive changes due to messages within such time slice; and (4) for each time slice, primitives that are dependent on one or more upstream primitives are not executed until such upstream primitives have finished executing messages in such time slice that are queued for processing. If such rules are insufficient to determine the order in which primitives are processed, a deterministic 'tie-breaking' rule is then applied.

Method for obtaining repeatable and predictable output results in a continuous processing system

The present invention provides a system and method for measuring latency in a continuous processing system. The invention involves generating 'tracer' messages that are specifically designed for measuring latency. A tracer message is configured to pass through and be outputted by each primitive in the tracer message's path regardless of the function of the primitive and without changing the state of the primitive. Tracer messages are not filtered by filter primitives or delayed by time-delay primitives. Tracer messages are detected and discarded within loops. These rules provide for predictable behavior of tracer messages, thereby making them reliable indicators of latency and liveness in the continuous processing system. A tracer message is inserted into the continuous processing system at a desired start point for measuring latency. At a desired end point for measuring latency, latency is measured by calculating the amount of time the tracer message took to travel from the start point to the end point.

Growing community of inventors

Sunnyvale, CA, United States of America

Ian Marshall