A securities trading apparatus includes a memory; and a processor coupled to the memory, the processor configured to: extract transactions from trading transactions stored in the memory, the extracted transactions being one of order transactions or insert transactions, each of the order transactions being a buy order transaction or a sell order transaction; and generate a single trading transaction from the extracted transactions.

A method for file system reorganization in the presence of inline compression includes obtaining a virtual block pointer for an original compressed segment to be reorganized, the original compressed segment comprising compressed allocation units of data stored in a storage system, wherein the virtual block pointer comprises an extent list identifying the compressed allocation units in the original compressed segment and a pointer to where the original compressed segment is stored; copying only the referenced compressed allocation units in the original compressed segment to a new compressed segment in a substantially contiguous manner; updating the extent list to identify the referenced compressed allocation units in the new compressed segment, and the pointer to where the new compressed segment is stored; and freeing the original compressed segment.

The disclosed systems and methods are directed for detecting and resolving write-write conflicts among a plurality of transactions received from master nodes of a multi-writer database system. The method includes receiving a plurality of REDO logs and storing the plurality of REDO logs in a buffer, each REDO log associated with the one of the plurality of transactions, selecting one REDO log of the plurality of REDO logs; persisting the transaction associated with the one REDO log in a local storage when a write-write conflict is detected between the one REDO log and at least one other REDO log of the plurality of REDO logs prior to committing the transaction associated with the one REDO log; and transmitting a status of the transaction associated with the one REDO log to a global transaction manager (GTM).

Techniques are disclosed relating to providing and using probabilistic data structures to at least reduce requests between database nodes. In various embodiments, a first database node processes a database transaction that involves writing a set of database records to an in-memory cache of the first database node. As part of processing the database transaction, the first database node may insert, in a set of probabilistic data structures, a set of database keys that correspond to the set of database records. The first database node may send, to a second database node, the set of probabilistic data structures to enable the second database node to determine whether to request, from the first database node, a database record associated with a database key.

Methods and systems for dynamically provisioning storage on a blockchain are provided. In one embodiment, a method is provided that includes receiving a request that includes a data unit for storage. The data unit may be buffered in a data stack that stores one or more data units. The data unit may be stored in the data stack until (i) a predetermined amount of time has passed and/or (ii) a size of the data stack exceeds a predetermined threshold. The data units stored in the data stack may then be encrypted and included in one or more storage transactions. The storage transactions may also include encryption keys used to encrypt the data units. The storage transactions may then be transmitted to nodes for storage on a blockchain.

A database platform can track changes using a stream that records changes made by database transactions. Streams on views can be implemented by applying a stream to source data, and applying the view to the streamed data. Users of the database platform can query the stream on the view to review recent changes to the view, such as changes made since the last database transaction.

Embodiments of the present disclosure provide a method, a computer program product and apparatus for processing transactions in a synchronized replication system, wherein the method comprises, at a source site in the synchronized replication system: serializing commits of transactions in the synchronized replication system so that only one of the transactions can be committed at the same time; in response to initiating the commit of the one transaction, generating a log for each of transactions that are ongoing in the synchronized replication system, so as to record impact of all operations of a respective transaction on the synchronized replication system; marking transactions for which the logs have been generated; and completing commits of the marked transactions.

In general, the invention relates to a method for performing backup operations. The method includes generating a backup on backup storage system, locking the backup for a retention span, generating a backup archive log image using archive log files for the backup, and locking the backup archive log image for a second retention span.

Techniques for efficiently storing client data blocks on a distributed-computing system are provided. The system includes a fast performance tier and a large capacity tier. The capacity tier stores the client data blocks in erasure encoded data stripes. The performance tier stores logical map data including an address map indicating a correspondence between logical addresses associated with a first layer of the system and physical addresses associated with a second layer. A method includes receiving a request to include additional client data blocks in the client blocks. The request indicates logical addresses for additional blocks. Corresponding physical addresses for additional block are determined. Each additional block is stored at the physical address. Additional logical map data is stored in the performance tier. Storing the additional logical map data includes updating the address map to indicate the correspondence between the logical addresses and the physical addresses for the additional blocks.

A method for applying agency and regulation modeling in a multi-tenant architecture system includes accessing merchant's representation in an identity manager. The merchant is managed via a full representation by an original identity manager. The method includes performing a first service for the merchant via the representation, and determining, based on results of the first service and on policies of the first service provider, that performance of a second service is required for completion of the first service. The second service is provided by a second service provider onboarded into the first service provider, where the second service amends policy requirements of the first service provider. The method includes accessing a first subservice of the second service using the representation to generate second results for use at a second subservice of the second service, the second subservice configured to use transaction resources of the first representation.