Abstract: Systems, methods, and computer-readable media for event sourcing datastores are provided. Events are sent to an event sourcing datastore (ESDS) from an external service, and the events are appended to an event log. The ESDS maintains the event log in one table and the events are automatically aggregated via streaming. The ESDS is linearly scalable, and enforces uniqueness, consistency, and user-defined constraints when appending events to the event log. The aggregate state is computed asynchronously and transparently cached, which provides increased read throughput and reduced latency. Other embodiments may be described and/or claimed.

Abstract: Systems, methods, and computer-readable media for temporary reservation schemes, are provided. In embodiments, temporary reservations are inserted into non-relational datastore, and update records indicating changes to the non-relational datastore are streamed to processing nodes. The processing nodes store the update records in local expiration windows. The expiration windows are periodically polled for expired temporary reservations, which are then removed from the non-relational datastore. Other embodiments may be described and/or claimed.

Abstract: A method is implemented by a computing device to identify available ones of a plurality of items of an inventory, where each of the plurality of items has a hold status identifying the item as being currently available or already on hold. The method includes selecting available ones of the plurality of items based on a first bitset and a plurality of second bitsets and asynchronously updating the first bitset and the plurality of second bitsets to reflect a synchronously updated version of the hold status of the plurality of items resulting from one or more of the plurality of items being successfully placed on hold and/or released from being placed on hold.

Abstract: Some embodiments of the present invention include updating an existing version of a source code stored in a local source repository using differences between a most current version of a source code stored in a central source repository and the existing version of the source code stored in the local source repository, the most current version of the source code associated with an application; updating an existing version of a binary code stored in a local binary repository to a most current version using differences between a most current version of a binary code stored in a central binary repository and the existing version of the binary code stored in the local binary repository; updating the most current version of the binary code stored in the local binary repository using binary code of one or more modified source code modules to generate a first binary code; and enabling testing of the application using the first binary code.

Abstract: Some embodiments of the present invention include receiving, by a server computing system, a first request from a client computing system for a first source code stored in a first central source repository and a second source code stored in a second central source repository; generating, by the server computing system, a combined source code using the first source code and the second source code, said generating being based on at least one dependency between a source code module in the first source code and a source code module in the second source code; and responding, by the server computing system, to the first request by transmitting one or more source code modules in the combined source code to the client computing system.