Salesforce Com, Inc.

Salesforce, Inc.

Shan-Cheng Ho

Percy Dara Mehta

Yogesh Patel

Shaahin Mehdinezhad Rushan

Mattia Padovani

Johannes Kienzle

Birva Joshi

Clinton Tran

Jayanth Parayil Kumarji

Kshama Lalit Thacker

Mahalaxmi Sanathkumar

Zhidong Ke

Shreedhar Sundaram

Utsavi Benani

Kevin Terusaki

Praveen Innamuri

Priya Sethuraman

Scott Walter Bishel

Mugdha Choudhari

Wing Hing Ku

Aaron Zhang

Robert Stephen Logan

Gabriel Such Tobias

Lucas Ung

A method and system are provided for assigning a particular record into a chunk of a partition within a non-relational database system. When a number of records in a particular candidate chunk is greater than a particular threshold number, an application performs an auto-balancing operation to split the particular candidate chunk such that records originally assigned to the particular candidate chunk are divided among the particular candidate chunk and a new chunk. Some of the number of records that were originally part of the particular candidate chunk are assigned to a new chunk and the other remaining ones of the number of records that were originally part of the particular candidate chunk remain assigned to the particular candidate chunk.

Database systems and applications for assigning records to chunks of a partition in a non-relational database system with auto-balancing

The techniques may include maintaining a thread of events for a plurality of users, where each element of the thread corresponds to an event/activity and includes at least a next field that includes a first subset of the plurality of users and a previous field that includes a second subset of the plurality of users. These techniques may allow new events to be quickly added and prior elements may be updated to reflect the addition. Further, the thread elements may allow the thread to be quickly traversed to identify queried information such that the information may be displayed to a user.

User specific event threading

A method of syncing data across multiple systems includes: receiving a plurality of calendar events from a plurality of independent calendar systems that use different calendar system specific schemas; aggregating the calendar events at a unifying communication system; converting the calendar events from a calendar system specific schema to a unifying communication system specific schema; storing the plurality of calendar events in the unifying communication system specific schema; converting a calendar event received from a non-master calendar system to the master calendar system specific schema; and sending the converted calendar event to the master calendar system; wherein copies of the received calendar events that are formatted according to the calendar system specific schema of the master calendar system are stored with the master calendar system, and copies of the calendar events that are formatted according to the unifying communication system specific schema are stored with the unifying communication system.

System and method for augmenting synced data across multiple systems to facilitate data cleansing

A method and system of data deduplication for data streams in a multi-tenant system. The method receives, at a data accuracy manager, an event from an activity tracking component, determine whether the event is recorded in a probabilistic model that tracks previously received events from the activity tracking component, where the probabilistic model can accurately identify the event has not been previously received with a possible false positive response where the event has been previously received, determines whether information for the event is stored in a metric storage, where the metric storage is a database of metrics derived from the previously received events, and discards the event in response to determining that the event is recorded in the probabilistic model and in the metric storage.

Mechanism for stream processing efficiency using probabilistic model to reduce data redundancy

A method enables data aggregation in a multi-tenant system. The method includes receiving, at a data aggregation manager, an event from an activity tracking component, generating, by the data aggregation manager, a first hash value based on a first identifier in the event, generating, by the data aggregation manager, a second hash value based on a second identifier in the event, and storing event message information to an entry of a metric storage database in a partition according the first hash value and the second hash value.

Multidimensional partition of data to calculate aggregation at scale

A method and system manage synchronization of data streams in a multi-tenant system. The method includes tracking by a flow control mechanism a recent flow rate of at least one data stream, determining by the flow control mechanism whether the flow rate of the at least one data stream varies from at least one related data stream, and adjusting by the flow control mechanism a throughput of the at least one data stream to correlate with the at least one related data stream, in response to determining that the at least one data stream has varied from the at least one related data stream.

Mechanism to synchronize, control, and merge data streams of disparate flow characteristics

Described is a method and system for verifying the end-to-end distribution of messages within an on-demand services platform. To provide the ability to monitor and trace such messages, the system may include a specialized and queryable datastore (or database) that allows the system to track the distribution and acknowledgement of messages throughout the services platform. Accordingly, a specialized verification process may be initiated to query the database to verify the receipt of a message has been acknowledged by various components within the system. In addition, the verification process may automatically retry the distribution the messages to ensure particular downstream components have received the message. Accordingly, the system alleviates the need to manual re-crawl various message source to ensure the end-to-end distribution of such messages.

Monitoring and verification system for end-to-end distribution of messages

A computer-implemented method is disclosed. The method includes determining whether a level of resource utilization of an organization having a first index and a first cluster requires that the organization is assigned to a second cluster, if the level of resource utilization requires that the organization is assigned to the second cluster, creating a second index for the organization in the second cluster, adding a consul entry in a consul that points to the second index, and upon completion of a data migration operation, changing an entry of the cluster routing controller for the organization, from the first index to the second index. A connection is established using the consul entry.

Methods and systems for organization extensibility and cluster scalability

Techniques are disclosed for generating metrics for a stream of interaction data. In some embodiments, a computing system receives a stream of interaction data that is based on user interactions with one or more computing systems, where the stream of interaction data includes information for multiple interaction characteristics including an interaction category. In response to receiving additional interaction information in the stream of interaction data, the computing system may generate cumulative metric values for one or more interaction categories. Generating cumulative metric values may include: sharding the additional interaction information based on multiple characteristics including interaction category, storing the sharded information in a non-relational database, determining respective metric values for shards modified by the storing, storing the respective metric values and shard information for each of the modified shards in a relational database, querying the relational database using one or more interaction categories corresponding to the modified shards, and determining the cumulative metric values based on the results of the querying.

Metric determination for an interaction data stream using multiple databases

Methods, systems, and devices for asynchronous deletion at a non-relational database are described. The non-relational database may store a set of data object associations. The non-relational database may receive a read request indicating a first data object identifier. Based on the first data object identifier indicated in the read request, the non-relational database may identify a second data object identifier according to a first data object association of the stored set of data object associations that is indexed in the non-relational database with the first data object identifier. The non-relational database may determine that a last data entry that is indexed in the non-relational database with the identified second data object identifier and is associated with the first data object identifier has been deleted from the non-relational database. The non-relational database may delete the first data object association from the non-relational database.

Growing community of inventors

Sunnyvale, CA, United States of America

Shan-Cheng Ho