Salesforce Com, Inc.

Salesforce, Inc.

Dmytro Kudriavtsev

Arun Kumar Jagota

Azeem Feroz

Venkata Muralidhar Tejomurtula

Ajitesh Jain

Dmytro Kashyn

Kaushal Bansal

Shouzhong Shi

Parth Vijay Vaishnav

Dai Duong Doan

Danil Dvinov

Chenghung Ker

Prabhjot Singh

Pawan Nachnani

Kavitha Elangovan

Oleksandr Khimich

A method for configuring the operation of the software of a data as a service (DAAS) system during run time is described. The configuring includes receiving a match query from a customer relationship management system that transmitted the match query responsive to a user using an interface to trigger an update of records in the customer relationship management system that were previously imported from the DAAS system, querying for records in the dataset that match records in the customer relationship management system previously imported from the DAAS system, the querying configured at run time according to metadata that identifies, for records in the dataset, a field to match on and a match threshold, and producing a match query result that includes records in the dataset to be imported to update records that were previously imported from the DAAS system.

Metadata driven dataset management

A method for configuring the operation of the software of a data as a service (DAAS) system during run time is described. The configuring includes at least one of configuring ingestion of a vendor dataset to produce an ingested dataset and which analysis operations to perform on the vendor dataset to produce an analyzed dataset, and the configuring also includes at least one of how to search the vendor dataset based on a search query from a customer to allow the customer to locate a new record from the vendor dataset and how to match records in the vendor dataset with a match query from the customer to provide an updated record to the customer.

A system tokenizes values stored in a field by multiple records. The system creates a trie from the tokenized values, each branch in the trie labeled with one of the tokenized values, each node storing a count indicating the number of the multiple records associated with a tokenized value sequence beginning from a root of the trie. The system tokenizes a value stored in the field by a prospective record. Beginning from the root of the trie, the system identifies each node corresponding to a token value sequence for the prospective record's tokenized value. Beginning from the most recently identified node for the prospective record's token value sequence, the system identifies each extending node which stores a count that satisfies a threshold, each identified extending node corresponding to another token value sequence. The system uses the other token value sequence to identify one of the multiple records that matches the prospective record.

Trie-based normalization of field values for matching

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

System creates three tries based on values stored in first three fields by records. System associates node in third trie with record, based on value stored in third field by record. System associates node with first dispersion measure, based on values stored in first field by records associated with node, and with second dispersion measure, based on values stored in second field by records associated with node. System identifies branch sequence in third trie as key for prospective record, based on value stored in third field by prospective record. System uses key to identify a subset of records that match prospective record. If a count of the subset exceeds threshold, the system identifies other branch sequence in first trie or second trie as other key for prospective record, based on first dispersion measure and second dispersion measure. System uses the key and the other key to identify at least one record that matches prospective record.

Augmenting match indices

A system identifies a first number of distinct values stored in a first field by a dataset of records. The system identifies a second number of distinct values stored in a second field by the dataset of records. The system creates a trie from values stored in a field by multiple records, the field corresponding to the first field or the second field, based on comparing the first number to the second number. The system associates a node in the trie with one of the multiple records, based on a value stored in the field by the record. The system identifies a branch sequence in the trie as a key for a prospective record, based on a prospective value stored in a corresponding field by the prospective record. The system uses the key for the prospective record to identify one of the multiple records that matches the prospective record.

Match index creation

A method for linking records from different datasets based on record similarities is described. The method includes ingesting a first dataset, including a first set of records with a first set of fields, wherein the first dataset is associated with a first vendor and a first type of data, and a second dataset, including a second set of records with a second set of fields, wherein the second dataset is associated with a second vendor and a second type of data; determining that a first record from the first set of records is similar to a second record from the second set of records based on similarities between fields in the first and second set of fields; and linking the first and second records in response to determining that the similarity, wherein the first and second vendors are different and/or the first and second types of data are different.

Linking records between datasets to augment query results

The system tokenizes values stored by records' fields, creates trie from tokenized values, each branch labeled with tokenized value, each node storing count indicating number of records associated with tokenized value sequence beginning from trie root. The system tokenizes value stored by record field, identifies nodes, beginning from trie root, corresponding to token value sequence associated with tokenized value, until node is identified that stores count that is less than node threshold. The system identifies branch sequence comprising each identified node as record's key, and associates key with node storing count less than node threshold, and record with key. The system tokenizes prospective value stored by prospective record's field, identifies nodes, beginning from trie root, corresponding to another token value sequence associated with tokenized prospective value, until another node is identified that stores another count that is less than node threshold. The system identifies other node's key as prospective record's key, identifies existing record that matches prospective record by using prospective record's key.

Optimized match keys for fields with prefix structure

Integrating third-party vendors' APIs is described. A system identifies a current call from a client computing system to an API associated with a third-party vendor, the current call including a configuration file for calling the API. The system determines whether a previous call was made to the API. The system determines whether part of the configuration file in the current call matches a corresponding part of a configuration file in the previous call, in response to a determination that a previous call was made to the API. The system uses a previously parsed configuration set, associated with the part of the configuration file in the current call, to configure a request in the current call and/or a response to the current call, in response to a determination that the configuration file in the current call matches the configuration file in the previous call.

Integrating third-party vendors' APIs

Managing authorization tokens for calling third-party vendors is described. A system identifies a current call from a client computing system to an API associated with a third-party vendor, the call including a configuration file for calling the API. The system determines, in response to a determination that a previous call was made to the API, whether a previous call was made to the API and whether a part of the configuration file in the current call matches a corresponding configuration file in the previous call. The system enables the API to authorize the current call by sending a copy of a previous authorization token to the client computing system, in response to a determination that the part of the configuration file in the current call matches the corresponding part of the configuration file in the previous call, the previous authorization being previously received from the API for the previous call.

Managing authorization tokens for calling third-party vendors

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.

Growing community of inventors

Belmont, CA, United States of America

Dmytro Kudriavtsev