Abstract: A user terminal for communicating with a computer server is operated on behalf of a first user (a second user terminal is operated on behalf of a second user). The user terminal transmits to the computer server pre-trade information including an order and receives first offset information that indicates a first price offset value, which is different from a second price offset value sent to the second user terminal. The terminals receive a single message from the server that indicates a market price but does not include the first price offset value or the second price offset value. The user terminal modifies the market price using the first price offset value to obtain a first actual price different from a second actual price corresponding to a modification of the market price based on the second price offset value.

Abstract: A computer system is provided for retrospectively processing a data structure that includes a plurality of entries. The computer system determines if certain data transactions requests that have been recorded in the data structure could have been executed differently (e.g., by being processed at an earlier point in time). For a given entry in the data structure, the system determines if data transaction request could have at least partly succeeded against a prior recorded state of at least one of two ordered lists of pending data transaction requests. Another entry is then found that caused the initial entry to fail in execution and a time delta is stored between the timestamp of the another entry and the timestamp of the initial entry.

Abstract: A computer is provided that includes a search engine. The search engine is configured to receive a search request and conduct a search against a database. Each record within the database includes or is associated with a display criteria or profile that specifies when data from that record can be included into a response to a search.

Abstract: Methods, apparatus, and systems for processing data transactions use a sequencer communicating with a plurality of data processors and provide improved performance and lower latency.

Abstract: The described technology relates to electronic continuous trading systems, and matching data records representing inventories with variant characteristics such as, variant length, variant data types, etc. Example implementations provide for generating instrument descriptors that include unitary-valued attributes and set-valued attributes, and the use of both types of attributes in trade decision making.

Abstract: Example embodiments of a data processing method, system, and non-transitory computer-readable medium are described.

Abstract: The described technology relates to systems and techniques for providing efficient and easy-to-use user-customizable extract templates for running queries against databases. The user-customizable extract templates enable customization of the same predefined query according to the requirements and privileges of respective users. In particular, embodiments enable customization of queries by users themselves, reducing or altogether eliminating having developers to modify the query or associated extract templates while still allowing the data owners or administrators to control access to the data.

Abstract: The described technology relates to a publish-subscribe message framework in which an application, decomposed to a plurality of processing stages, is run by executing respective processing stages of the application asynchronously and simultaneously with each other. Communications between the respective processing stages may exclusively be in accordance with the publish-subscribe execution model. The described publish-subscribe framework provides for processing stages to be executed in a multi-process and/or multi-threaded manner while also enabling the distribution of the processing stages to respective processing resources in a multi-processor/multi-core processing environment. An example electronic exchange application and a corresponding example exchange gateway application are described.

Abstract: An asynchronous distributed computing system with a plurality of computing nodes is provided. One of the computing nodes includes a sequencer service that receives updates from the plurality of computing nodes. The sequencer service maintains or annotates messages added to the global state of the system. Updates to the global state are published to the plurality of computing nodes. Monitoring services on the other computing nodes write the updates into a locally maintained copy of the global state that exists in shared memory on each one of the nodes. Client computer processes on the nodes may then subscribe to have updates “delivered” to the respective client computer processes.

Abstract: A cloud computer system is provided that includes a plurality of computer devices and a database. The plurality of computer devices execute a plurality of virtual machines, with one of the virtual machines serving as a controller node and the remainder serving as worker instances. The controller node is programmed to accept a request to initiate a distributed process that includes a plurality of data jobs, determine a number of worker instances to create across the plurality of computer devices, and cause the number of worker instances to be created on the plurality of computer devices. The worker instances are programmed to create a unique message queue for the corresponding worker instance, and store a reference for the unique message queue that was created for the corresponding worker to the database. The controller node retrieves the reference to the unique message queues and posts jobs to the message queues for execution by the worker instances.

Abstract: A computer system includes a memory that stores two lists of electronic data transaction requests. Stored and received data transaction requests are associated with a size value and a counter-size requirement value. When data transaction requests are received they are added to one of the two lists and list to which the data transaction request is added is set to a working side. A working order is selected from the working side and a first sum of size values of data transaction requests is calculated from the working side. A second sum of size values is calculated from the non-working side from data transaction requests that have a counter-size requirement value that is less than the first sum. If the counter-size requirement value is less than or equal to the second sum, the electronic data requests from the respective lists are matched.

Abstract: The present invention relates to a method and system for facilitating access to recorded data. The system comprises an interface and a processing device. The interface is arranged to receive data and the processing device is arranged to separate the received data in data subsets, compress each data subset and assign an identifier to each compressed data subset, thereby creating data units each comprising a compressed data subset and an associated identifier, the processing device further being arranged to establish an index on the basis of the assigned identifiers.

Abstract: A computer system that interfaces with a blockchain is provided. The computer system receives match data for a match between a first data transaction request that is associated with a first identifier and a second data transaction request that is associated with a second identifier. Based on the match data, first and second blockchain transactions are generated. The first blockchain transaction is from a first identifier to an intermediary identifier and the second blockchain transaction is from the intermediary identifier to the second identifier. The first and second blockchain transactions are submitted to the blockchain. A further blockchain transaction is generated and submitted to the blockchain that includes a programmatic structure with a timer condition.

Abstract: A computer system is provided that stores reference data records and event data records that each correspond to one of the reference data records. Tokens are generated from the reference data records and sorted into subsets. Each reference data record that has a given token is included in the corresponding subset. A correlation value is calculated between members (e.g., the reference data records) of the subsets. The correlation values are calculated by determining a common time, calculating a reference value, calculating a percentage difference from the reference value, and then determining a correlation value (e.g., a correlation coefficient) using the percentage difference.

Abstract: Elastic message tracking apparatus and methods are provided that opportunistically improve on the latency of a message processing system and increase the accuracy of a consolidated message stream generated from message streams received from multiple message sources. The elastic message tracking apparatus and methods reduce that latency in situations where the actual latency of all the message streams is lower than a predetermined latency value.

Abstract: The present technology relates to distributed computerized exchange systems for trading of financial instruments. In particular it relates to a passive matching engine and an active matching engine that cooperates in handling data messages such that less bandwidth is used and so that improvement in latency can be achieved.

Abstract: A computer-implemented monitoring system receives an input data stream of electronic data messages and processes the input data stream using a current set of computer instructions to determine a monitoring status. In response to receiving information for modifying the current set of computer instructions, the system dynamically modifies the current set of computer instructions using the received information by injecting one or more modifying computer instructions into the current set of computer instructions resulting in a modified current set of computer instructions. The modified current set of computer instructions are executed to generate a new monitoring status for output.

Abstract: A computer system is provided that includes a matching engine and a freezing process. The matching engine freezes one side of a two-sided data structure when an order is determined to matchable. The freezing process starts a timer based on the matching determination. Orders that are handled by the matching engine while the side is frozen are added to a queue. When the timer ends, the orders in the queue are processed against those orders that are now resting within the data structure.

Abstract: The described technology relates to a publish-subscribe message framework in which an application, decomposed to a plurality of processing stages, is run by executing respective processing stages of the application asynchronously and simultaneously with each other. Communications between the respective processing stages may exclusively be in accordance with the publish-subscribe execution model. The described publish-sub scribe framework provides for processing stages to be executed in a multi-process and/or multi-threaded manner while also enabling the distribution of the processing stages to respective processing resources in a multi-processor/multi-core processing environment. An example electronic exchange application and a corresponding example exchange gateway application are described.

Abstract: A cloud computer system is provided that includes a plurality of computer devices and a database. The plurality of computer devices execute a plurality of virtual machines, with one of the virtual machines serving as a controller node and the remainder serving as worker instances. The controller node is programmed to accept a request to initiate a distributed process that includes a plurality of data jobs, determine a number of worker instances to create across the plurality of computer devices, and cause the number of worker instances to be created on the plurality of computer devices. The worker instances are programmed to create a unique message queue for the corresponding worker instance, and store a reference for the unique message queue that was created for the corresponding worker to the database. The controller node retrieves the reference to the unique message queues and posts jobs to the message queues for execution by the worker instances.