Abstract: Systems and methods of providing content for display on a computing device via a computer network using a location feature index are provided. A data processing system can receive a request for content from the computing device, and can determine a geographic location of the computing device associated with the request for content. The data processing system can identify a keyword indicating a non-geographic semantic feature of the determined geographic location. The identification can be based on the determined geographic location and from a location feature index that maps geographic areas to keywords that indicate non-geographic semantic features of the geographic areas. The data processing system can select, based on the keyword, a candidate content item for display on the computing device.

Abstract: Methods, systems, and computer programs are presented for analyzing profiles and building profile models that can be used to personalize search results for a member on a social network. In example embodiments, a system aggregates data about members on the social network including member profile data, customer relation data, and member communication data. The system further extracts attribute values from the aggregated data and maps the attribute values onto attribute vectors on a social data map. Based on the mapping, the system determines a model member profile for the member. The system further generates candidate attribute vectors for search results from a search for the member and determines a similarity score between the model member profile and each candidate attribute vector. The system further ranks the search results based on the similarity score and presents a ranked display of the search results to the user.

Abstract: Provided is a process including obtaining a corpus having a plurality of time-stamped documents; detecting topics in the unstructured natural language text; determining temporal-metrics of the topics based on time-stamps of documents to which the topics pertain; and predicting based on the temporal-metrics, whether a given topic among the plurality of topics will appear in future time-stamped documents.

Abstract: Disclosed herein is a system and method for generating an enhanced index for documents contained in a knowledge base. Documents or configuration snapshots are tokenized and then passed through a number of filters. The filters modify the token stream to generate an enhanced token stream for the document by removing words from the stream and adding domain level knowledge to the tokens in the stream. The token stream is then added to the index for the document so that searches can be completed against the knowledge base when searches are generated from configuration snapshots or from inputted search queries.

Abstract: The disclosed techniques include generation of a single index table when backing up data in a first backup format to a backup storage system that uses a second backup format. Using the single index table, a query for a data item can be answered by searching the single index table. The single index table avoids having to search through multiple index tables, each corresponding to a different backup format that may be used for backing up the searched data item.

Abstract: Embodiments include pre-processing work items to be processed by computerized processing elements. Aspects include accessing a performance index, which relates to (dynamic) processing performances of work items as processed by the computerized processing elements. Aspects also include determining a time interval (during which the receiver may group queued work items into a block), according to the accessed performance index. Aspects further includes setting a timer to the determined time interval, to allow the receiver to group work items being queued until that time interval has elapsed, according to the timer set. As a result, a block of grouped work items will be obtained, which can then be passed to a scheduler for subsequent processing by computerized processing elements.

Abstract: Methods, systems, and apparatus include computer programs encoded on a computer-readable storage medium, including a method for providing content. A query is received. Search results are identified that are responsive to the query. A content item is identified for presentation along with the search results. It is determined, based on one or more criteria, when the content item is to be augmented. When it is determined that the content item is to be augmented and after identifying the search results, the content item is augmented based at least in part on an entry in the search result. An augmented content item is created. The augmented content item is provided.

Abstract: The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object.

Abstract: Traversal hooks are based on an event-oriented programming model and provide an expressive mechanism to extend a graph traversal operator with domain-specific coding. A traversal operator can visit (i.e., traversal events) vertices and edges of a graph in an ordered manner. Related apparatus, systems, techniques and articles are also described.

Abstract: Methods and systems are described for shared data sets with user-specific changes in an on-line services environment. In one embodiment, a method includes, receiving a request for data stored in a shared database from a user, identifying the requesting user, retrieving the requested data from the shared database, determining whether there are user-specific changes for the retrieved data, changing the retrieved data using the user-specific changes, and supplying the requested data to the user.

Abstract: A system, computer program product, and computer-executable method of optimizing replication between a first Content Addressable Storage (CAS) system and a second CAS system, the system, computer program product, and computer-executable method including analyzing the first CAS system and the second CAS system to determine an amount of differences between the first CAS system and the second CAS system, upon determining that the amount of differences are below a threshold amount, sending a set of replication information to the second CAS system, wherein the set of information includes a first address and a first hash for a portion of data stored on the first CAS system, analyzing, at the second CAS system, the set of replication information to determine whether to request that the first CAS system send data associated with the set of replication information; upon a negative determination, sending the data associated with the set of replication information.

Abstract: In one embodiment, a method receives a query for analyzing data in a database. The query includes a first level calculation that is performed before a second level calculation. When an operator associated with the first level calculation is present in the query, the method performs: calculating the first level calculation by removing group by information for a reference characteristic for the first level calculation to determine a first level calculation result and calculating the second level calculation using the first level calculation result using the group by information for the reference characteristic to determine a second level calculation result, wherein the group by in the second level calculation combines groups of rows in a database table of the database that have the same content in their specified columns.

Abstract: Methods, systems, apparatus, and machine-readable media facilitate a system for data extraction using object relationship templates. In an enterprise cloud computing environment, a system for data extraction using object relationship templates is implemented to dynamically generate data extraction flows from one or more enterprise data sources quickly and accurately in response to changing business needs. Object relationship templates representing all of a portion of a data extraction flow are created and stored for reuse either alone or in combination with other data extraction flows and other templates to create new data extraction flows. Corresponding methods, systems, apparatus, and machine-readable media for data extraction using object relationship templates can be implemented in servers supporting the enterprise cloud computing environment.

Abstract: A method, system, and computer program product are disclosed for merging search results. In one embodiment, the method comprises identifying a query, splitting the query into sub-queries, and calculating information content for each of the sub-queries. This method also comprises executing each of the sub-queries to obtain a plurality of search results, and combining the search results based on the information content calculated for the sub-queries. In an embodiment, the execution of each of the sub-queries includes identifying a multitude of search results for at least one of the sub-queries; and the combining includes grouping said multitude of search results into a plurality of clusters, and computing a relevance score for each of said clusters. In the embodiment the combining further includes merging the clusters based on the relevance scores computed for the clusters as well as the information content calculated for the sub-queries.

Abstract: A method for accessing a plurality of contents by using at least one piece of information representing at least one content selected by the user, called a reference content. The method includes the following acts implemented by a processor: rendering a plurality of pieces of metadata of said reference content, receiving a query for a selection, in said plurality, of at least one piece of metadata, called a sought piece of metadata, determining at least one resultant content, having an intensity level of said at least one sought piece of metadata, and rendering at least one piece of information representing said at least one resultant content.

Abstract: Systems and methods for processing user requests for creating a new account in a CRM system. When a user requests to create a new account in the CRM system, an unverified account may be created in the CRM and a DCR may be sent to the MDM for verification. Users may interact with the unverified account while waiting for verification result from the MDM.

Abstract: Techniques and constructs that improve annotating target columns of a target database by performing automated annotation of the target columns using sources. The techniques include calculating a similarity score between a target column and columns extracted from a table that is included in a source. The similarity score is calculated based at least in part on a similarity between a value in the target column of the target database and a column value of the extracted column from the table and on a similarity between an identity of the target column of the target database and column identities of the extracted columns from the table. In some examples, the techniques calculate similarity scores for one or more extracted columns and annotate the target column based on the similarity scores.

Abstract: An online system receives advertisement requests from one or more advertisers and determines whether an advertisement request includes malicious content before presenting content from the advertisement request to a user. To determine whether the advertisement request includes malicious content, the online system identifies text in the advertisement request, identifies words in the text, and identifies characters in each word. The online system identifies a most common type of character in each word and generates a score for each word based on its constituent characters. For example, a word's score is based on the combination of characters in the word, such as a conditional probability of a word including a type of character given that the word includes a given number of the most common type of character. The scores are analyzed to determine if text in the advertisement request includes malicious content.

Abstract: An example method of loading data from a database includes receiving, at a cache node, a current query and a data chain that includes a sequence of ordered queries. The method also includes determining whether a hash of the current query matches a hash of an expected query in the data chain. The method further includes retrieving a result set of the current query from a local cache in response to determining that the hash of the current query matches the hash of the expected query. The method also includes sending the result set of the current query to a client.

Abstract: A write request is transmitted from a client to a metadata server (“MDS”), wherein the write request comprises an object identifier associated with a data object. An object store location is received for an object store from the MDS. A metadata request is transmitted to the object store using the object store location, wherein the metadata request includes the object identifier. A metadata response is received from the object store. Determine the metadata response contains an object designator. A count associated with a mapping between the object identifier and the object designator is incremeneted, wherein the mapping resides on an object version manager shared with a second MDS.