Salesforce Com, Inc.

Salesforce, Inc.

Salesforee.com, Inc.

Danil Dvinov

Parth Vijay Vaishnav

Chenghung Ker

Dai Duong Doan

Arun Kumar Jagota

Dmytro Kudriavtsev

Andrew C Smith

Susan S Levine

David Hacker

Michael Dandy

Craig David Weissman

Alexandre Hersans

Daniel Tafner McGarry

Swaroop Shere

Gaurav Salkar

Systems and methods for updating values of roll-up summary fields (RSFs) associated with a data model are described. A server computing system receives data associated with roll-up summary fields (RSF) of objects of a data model. The data is in in a serialized format. The computer system deserializes the data to determine values of the RSFs at nodes of a graph associated with the data model. The computer system updates a value of a RSF at a first node of the graph. The computer system updates a value of one or more RSFs at one or more remaining nodes of the graph based on said updating the value of the RSF at the first node. The computer system serializes the values of the RSFs at all of the nodes of the graph to generate serialized data subsequent to said updating the value of the one or more RSFs at the one or more remaining nodes of the graph.

Scalable roll-up summary field calculation using graphs

Disclosed are some implementations of systems, apparatus, methods and computer program products for performing data ingestion. A request received from a client device is processed, where the request has a payload including a plurality of data items pertaining to a data object. An identifier associated with the data object is generated. Information including the data items is obtained from the request. The information including the data items is stored in association with the identifier in a first data store, where the first data store is not a relational database. The data items and identifier are obtained from the first data store and stored in a second data store, where the second data store is a relational database. A query including the identifier is processed to obtain the identifier from the query. It is determined whether the identifier obtained from the query is in the first data store. One or more of the data items associated with the identifier are retrieved from the first data store according to a result of determining whether the identifier obtained from the query is in the first data store.

Large scale data ingestion

Provided herein are system, methods and computer program products for identifying duplicate records stored in a database system, comprising: generating a plurality of encrypted match indexes for each of a plurality of records stored in the database system, each of the plurality of encrypted match indexes encrypts a value of each encryption enabled field of a respective one of the plurality of records defined by at least one match rule, creating a cluster of records comprising at least one set containing at least two records of the plurality of records, the at least two records having respective encrypted match indexes corresponding to the at least one match rule, causing identification of duplicate records in the at least one set according to detection of records of the at least one set having respective match indexes matching the at least one match rule, and outputting an indication of the identified duplicate records.

Bulk duplication detection supporting data encryption

Disclosed embodiments are related to Application Programming Interface (API) technologies, and in particular, to Order APIs that are used to make modifications and cancelations to existing order objects. The Order APIs can be used to retrieve the current state of an order object, retrieve the summarized state of an order object as of a specified date, and retrieve a potential state of an order object along with specified changes. The Order APIs are also used to process order changes including changes to the quantity of an existing order object and applying line item changes to an existing order object. Other embodiments may be described and/or claimed.

Change order application programming interfaces

Methods for splitting a plurality of records into subsets for parallel processing by separate threads are disclosed. In one embodiment, a plurality of records are added to a database. The adding includes tracking, for each unique value found in the plurality of records within a selected one of the sequence of fields, a statistic based on the values found in the plurality of records within a next one of the sequence of fields. Then a plurality of queries are generated, each includes a row value constructor (RVC) with a logical operation, a specific one of the unique values found within the selected one of the sequence of fields, and, for that specific value, the tracked statistic. Then a plurality of threads are caused to execute that each submit one of the queries and operate on a subset of the plurality of records responsive to execution of that query.

Using row value constructor (RVC) based queries to group records of a database for multi-thread execution

Some embodiments of the present invention include a method for determining duplicate records in multiple objects and may include combining records associated with a first object with records associated with a second object to generate a third object, wherein the first object is related to the second object; performing de-duplication on the third object to generate a combined group of duplicate sets; and from the combined group of duplicate sets, identifying at least one duplicate set associated with both the first object and the second object based on the duplicate set having at least one record associated with the first object and at least one record associated with the second object.

Cross objects de-duplication

Some embodiments of the present invention include a method for identifying duplicate records from a group of records in a database system. The method includes generating a cluster of records from a group of records based on one or more keys; splitting the cluster of records into multiple subsets of records with each subset of records having fewer number of records than the cluster of records, wherein the splitting the cluster of records into multiple subsets of records is based on a number of records in the cluster of records exceeding a threshold; causing duplicate sets of records in each of the subsets of records to be identified, wherein a duplicate set of records includes one or more records, and wherein when a duplicate set of records includes two or more records, the two or more records are duplicates of one another; merging all of the duplicate sets of records identified from the multiple subsets of records forming a first group of duplicate sets of records; and forming a representative set of records based on selecting a representative record from each of the duplicate sets in the first group of duplicate sets of records.

Optimized subset processing for de-duplication

Some embodiments of the present invention include a method for performing data assessment. The method includes receiving, by a first server computing system, a request to assess first data stored in a storage device associated with a second server computing system, the request including one or more rules indicating how the first data is to be assessed; performing, by the first server computing system, an assessment of the first data based on the one or more rules and based on a data source associated with the first server computing system, the data source including data provided by one or more data providers, the assessment of the first data including assessing outdated information and missing information based on the data source; and providing, by the first server computing system, an assessment result from the assessment of the first data and an option to engage in an enrichment of the first data based on the assessment result and the data source.

Methods and systems for performing data assessment

Some embodiments of the present invention include a method for merging nodes in hierarchies and include receiving, by a database system, a request to merge a first node in a first hierarchy of a plurality of nodes into a second node, the first node in the first hierarchy having child nodes; determining, by the database system, whether the merge request violates each of a plurality of constraints, the plurality of constraints comprising circular dependency of nodes, deleted node and ordering of nodes; and re-parenting, by the database system, in response to a determination that the merge request does not violate each of the plurality of constraints, the child nodes of the first node in the first hierarchy of nodes to the second node in response to the merging of the first node into the second node.

Merging along object hierarchies

A computing system may create a database schema representing tables for data assessment, organization identification (ID), rule ID, data source ID, and data assessment ID. The data assessment table may include a first field representing an organization ID, a second field representing a rule ID, a third field representing a data source ID, wherein the fields correspond to a records in the organization ID table, rule ID table and data source ID table, respectively. The data assessment table may also include a fourth field representing a match status indicating whether a record in data assessment ID table matches a record of a data source associated with the third field, a fifth field representing a data assessment record ID and corresponding to a record in data assessment record ID table, and a sixth field configured as a column family and representing a field of the business object.

Database schema for efficient data assessment

Some embodiments of the present invention include a method for identifying match candidates in a database object and may include generating, by a database system, a match key associated with a lookup field of a database object. The method may further include activating, by the database system, a matching rule associated with the match key, and receiving, by the database system, a request to search for duplicate candidates in the database object. The request may include an input entity. The duplicate candidates in the database object may be identified by using the input entity and the matching rule.

Matching objects using match rules and lookup key

Some embodiments of the present invention include a method for controlling requests to be transmitted to a server computing system. The method generating, by a first requester, a request to be transmitted to a first server computing system, the first requester being part of a first group of requesters, each of the requesters in the first group of requesters is configured to access an indicator to determine whether the first server computing system is ready to receive its request, the indicator being set or reset at least based on a response received from the first server computing system, the indicator stored in a memory device associated with a second server computing system; and based on the indicator indicating that the first server computing system is not ready, delaying from transmitting, by the first requester, the request to the first server computing system.

Methods and systems for protecting computing resources

Some embodiments of the present invention include a system and method for removing duplicate records from a group of records in a database system. The method includes generating a first cluster of records from the group of records, generating a second cluster of records from the group of records, identifying sets of duplicate records in the first cluster of records, and identifying sets of duplicate records in the second cluster of records. The method also includes merging at least two sets of duplicate records associated with both the first cluster and the second cluster of records to form a merged set of duplicate records. The merging is performed based on the at least two sets of duplicate records having a common record. Duplicate records in the group of records may then be removed by removing duplicate records from the merged set of duplicate records.

Bulk deduplication detection

Matching objects using keys based on match rules is described. A system generates a match rule key based on a match rule, wherein the match rule specifies whether two objects match. The system creates candidate keys by applying the match rule key to data objects. The system creates a probe key by applying the match rule key to a probe object. The system determines whether the probe key matches a candidate key. The system determines whether the probe object matches a candidate object based on applying the match rule to the probe object and the candidate object if the probe key matches the candidate key corresponding to the candidate object. The system identifies the probe object and the candidate object as matching based on the match rule if the probe object matches the candidate object.

Growing community of inventors

Oakland, CA, United States of America

Danil Dvinov