Emc Corporation

Salesforce, Inc.

Salesforce Com, Inc.

Ilan Ginzburg

Bruno Roustant

Pierre Salagnac

Marc Brette

Feng Guo

Pierre-Yves Chevalier

Francois Lopitaux

Son Thanh Chang

Shreenidhi Ramarao

Cyrille Roy

Ghislain Brun

Julien Pilourdault

Yonik Seeley

Jean-Baptiste Charlety

John Martin Buisson, Jr

Jeffrey Allan Miller, Jr

Christopher Anderson

Andrew Throgmorton

System and methods are described for a server computing node including a processing device and a memory device. The processing device executes instructions stored in the memory device to receive a request to update a data object in a shared storage of a distributed computing system; get a current version identifier (ID) of the data object; get the data object identified by the current version ID from the shared storage; update the data object; write the updated data object to shared storage using a unique new version ID; and cause the conditional update of the current version ID of the data object to the new version ID.

Protecting writes to shared storage in a distributed search system

A service, responsive to a request, determines a scope that includes a specific tenant and a specific component. The service is extensible through addition of different components to manage different data sources used by different services that contribute to a set of one or more multi-tenant cloud services. The service also determines, for the specific component, parameters usable to identify the specific tenant and a specific storage path. Each of the components, responsive to being called to perform a backup or restore with a current set of parameters, is to be implemented to cause data, which belongs to a currently identified tenant, to be copied between the respective one of the data sources and a backup store according to a currently identified storage path. The service also calls the specific component to perform the backup or restore with the parameters.

Backup and/or restore as a service

Techniques are disclosed relating to servicing search requests based on index information stored in a storage shared between multiple search servers. In some embodiments, a first search server maintains a local cache including index information usable to service received search requests and synchronizes the local cache with the shared storage. The synchronizing includes retrieving, from the shared storage, metadata indicative of the index information in the shared storage and determining, based on the metadata, whether the index information in the local cache differs from the shared storage. In response to determining that the index information in the local cache differs from the index information in the shared storage, the first search server updates the index information in the local cache with the index information in the shared storage. The first search server may then provide one or more search results determined using the updated index information.

Centralized storage for search servers

A database system may generate a new case associated with a customer support query. The database system may initiate a search for other cases related to the new case and identify articles linked to the related cases. The database system may identify more relevant articles by finding the related cases that use a similar vocabulary for describing similar customer problems. The database system then identifies the articles used for resolving the prior problems. Thus, the database system may bridge the gap between vocabularies used by customers to describe problems and vocabularies used in articles to describe solutions to those problems.

Identifying relevant material for cases

A management console application provides a dashboard which centralizes data from and access to one or more other applications. In a specific implementation, the dashboard displays resource utilization and tracking data generated by a first application, an application execution map generated by a second application that identifies the resources on which a third application is executing, or both.

Method and system for providing usage metrics to manage utilzation of cloud computing resources

An application execution map displays computing nodes, links, or both. The nodes represent machines which are participating in the execution of an application. The links represent communication links between the nodes. The map can be used to identify where the application is executing. In order to gather the map information, there can be monitoring agents implemented as monitoring programs installed at the nodes, network sniffers, application instrumentation, or combinations of these.

Methods and systems for building an application execution map

Phrase matching processes for matching phrases comprising a plurality of keywords in document text construct hit lists of the keywords in a document text, and operate on the keywords in either phrase order or without regard to the order of occurrence of the keywords in the phrase. The processes form sorted sets of all keywords, and compare occurrences of the keywords in the sorted sets to a predefined proximity constraint. For unordered phrases, the proximity constraint defines a maximum span between keywords in the highest and lowest positions in the sorted set as MaxSpan=p(k&#x2212;1), where p is a proximity and k is the number of keywords in the phrase. For ordered phrases, the distances between successive phrase keywords in phrase order must be less than or equal to the proximity p.

Phrase matching for document classification

The invention is a system and method for teaching and using a computer to apply a genetic algorithm in order to generate rules for classifying data objects, such as documents. By permitting periodic human intervention during and/or after the initial training stage, the invention improves upon existing methods that merely automate data classification. Using an initial 'training set' of data objects, the system develops a set of rules to apply on future data objects. To improve efficacy over time, rules may be periodically amended by a user during the initial training stage or after rules have been generated. In this fashion, classification rules may evolve, thereby improving the accuracy and speed of the classification process. Classification rules are also presented in a human-readable format, thereby improving the transparency of the classification process and facilitating the interaction between the system and the administrator.

Growing community of inventors

Saint Pancrasse, France

Ilan Ginzburg