Salesforce Com, Inc.

Salesforce, Inc.

Yingwu Zhao

Hal Scott Hildebrand

Alex S Warshavsky

Samarpan Jain

Soumen Bandyopadhyay

Alexey Syomichev

Lawrence Eugenio McAlpin

Jay Hurst

Igor Pesenson

David William Spragg

Emin Eliot Gerba

In an event-based data management system, an event having an associated identifier is received. A mapping operation is performed using the identifier to map the event to a selected one of a plurality of topic partitions. Queues for each of the plurality of topic partitions are managed. The queues for each of the plurality of topic partitions are managed independently of each other. The event is allocated to the selected topic partition based on the mapping operation. The event is placed into the queue for the selected topic partition. A batch of events is sent from the queue for the selected topic partition in response to one or more thresholds being reached.

Techniques and architectures for non-blocking parallel batching

A method for enabling event consumption is described. Upon receipt of a request for events associated with a first initial topic, a determination that the request includes a request for historical events is performed. Responsive to determining that one or more rules apply to the request for historical events, a determination of a first path from the first initial topic to a first aggregate topic is performed based on the one or more rules. The first path is different from a second path from the first initial topic to a second aggregate topic that is defined according to a current multiplexed framework definition. The current multiplexed framework definition is used for storing new events associated with the first initial topic in a second multiplexed event recordation system at a time that follows the time of receipt of the request. A first set of historical events is retrieved based on the first path.

Method and apparatus for a mechanism for event replay when a reroute of recordation of the event occurred in a multiplexed event recordation system

The technology disclosed relates to accelerating replay access to numerous streams via a channel aggregation hierarchy, muxing events from input buffers that receive event streams, into a physically aggregated stream in memory. A subscriber accesses events from the streams via the channel hierarchy; demuxing the physical aggregated stream and caching the events from the physical aggregated stream into event cache memory; caching references to selected events, which belong to active channels that have subscribers, in a caching structure including channel cache lists of the references, the caching structure including stream level channel cache lists, intermediate level channel cache lists, and, if the physical aggregate channel has subscribers, a physical aggregate channel cache list; and receiving a replay access request that specifies a channel and that specifies a starting point for the replay, and responsively delivering events from the event cache memory using a cache list corresponding to the specified channel.

Optimal strategy for data replay in a complex multiplexing network

A method and apparatus for a mechanism of disaster recovery and instance refresh in an event recordation system are described. A first request for events associated with a first topic is received. A first set of events associated with the first topic are retrieved from a primary event recordation system. Each event from the first set of events includes a first commit identifier indicating the order with which each event is stored in the primary event recordation system. For each event from the first set of events a first replay identifier is determined based on the first commit identifier and a first value of a low commit identifier. The first replay identifier is exposed to event consumers for identifying the event. In response to the first request each event from the first set of events is transmitted with the replay identifier.

Method and apparatus for a mechanism of disaster recovery and instance refresh in an event recordation system

A processor can cause a first communication, to a user device, of a first item based on an eventing system being in a first mode, a configuration to cause the eventing system to cause, without a request from the user device, a communication of an item to the user device in response to an entry of the item into a memory. After the first communication, the processor can cause the eventing system to be in a second mode, a configuration to cause the eventing system to refrain from communications of items to the user device. The processor can receive, from the user device, a signal to cause the eventing system to switch from the second mode to the first mode. After receiving the signal, a second item can be entered into the information memory. The processor can cause a second communication, to the user device, of the second item.

Hybrid eventing system

The technology disclosed relates to discovering a previously unknown attribute of stream processing systems according to which client offsets or client subscription queries for a streaming data store rapidly converge to a dynamic tip of a data stream that includes the most recent messages or events. In particular, it relates to grouping clients into bins to reduce a number of queries to the streaming data store by several orders of magnitude when servicing tens, hundreds, thousands or millions of clients. The bin count is further reduced by coalescing bins that have overlapping offsets. It also relates to establishing separate caches only for the current tips of data streams and serving the bins from the caches instead of the backend data store using group queries. Further, the caches are periodically updated to include the most recent messages or events appended to the dynamic tips of the data streams.

Growing community of inventors

Lafayette, CA, United States of America

Yingwu Zhao