Abstract: In accordance with embodiments, there are provided mechanisms and methods for synchronizing entities. These mechanisms and methods for synchronizing entities can enable improved data synchronization, improved data management, etc.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting controlling keywords. In one aspect, a method includes determining that two or more targeting keywords for a same content item source are matched by one or more terms in a content item request, where a first targeting keyword matches the one or more terms with a more specific type of match than the second targeting keyword. If the bid associated with the second targeting keyword does not exceed the bid associated with the first targeting keyword, the first targeting keyword and the second targeting keyword are ranked based on selection scores. The targeting keywords are ranked based at least in part on the quality scores when the bid associated with the second targeting keyword does exceed the bid associated with the first targeting keyword.

Abstract: An approach is presented for determining a value of an association between first and second ontologies, S1 and S2. A first bridge of S1 with S2 is generated. A schema S? is created from sub-schema S extracted from the first bridge by removing common concepts and relationships to the common concepts, and for each common concept to which first and second concepts have immediate links in S, by creating a new immediate link in S? between the first and second concepts. Based on an intrinsic value of S? and a strength of the bridge of S1 with S, a value of the first bridge is determined. Similarly, a value of a second bridge of S2 with S1 is determined. A value of the association between S1 and S2 is determined based on a sum of the values of the first and second bridges.

Abstract: A method, system and computer program product for ensuring that archival data deleted in a source table is already stored in a target table. An external data source sets a flag in the first table to identify the row in the source table to be deleted. An application sets a flag in a second table for each row of the source table that is marked to be deleted according to the first table. The application performs uncommitted read operations on the source table for each row corresponding to the distinct primary key values stored in the first table. The application inserts the data read into the corresponding rows of the target table. The application deletes the rows in the source table indicated to be deleted by the second table. In this manner, the archival data deleted from the source table is ensured to already be stored in the target table.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for identifying entities using search results. One of the methods includes the actions of determining that a first search query includes a respective text reference to each of one or more predetermined attributes, wherein each attribute is associated with a first entity type; for each of a plurality of entities of the first entity type, generating a combined search query that includes the first search query and a name of the entity; obtaining search results for each of the plurality of entities using the combined search query for each respective entity; and using the obtained search results to generate combined search results to include in a response to the first search query.

Abstract: The present invention is directed to methods and systems for implementing email recipient templates. The method including extracting a first set of email addresses from a first email message and extracting a second set of email addresses from a second email message. The first and second set of email addresses are included in one or more of the to, cc, or bcc fields of the email messages. The method further including storing, in a storage database, the first set of email addresses in a first recipient template and storing the second set of email addresses in a second recipient template. The first recipient template and the second recipient template each have an associated unique identifier. Further, the method includes receiving a request for a new email message in an email editor user interface and querying the storage database for recipient templates. The query is filtered by the associated unique identifiers.

Abstract: A log management system for analyzing and managing a log acquired in a computer is provided. The system generates log groups each formed of log records with reference to the log. The system identifies active periods, in each of which a display area is active, in the log groups, and compares a start-to-end period from a start time to an end time of a reference log group selected from the log groups with active periods of subject log groups other than the reference operation log group individually to identify one or more subject log groups having an active period included in the start-to-end period. The system individually determines whether to include the identified one or more subject log groups in the same first cluster as the reference log group, based on an active period length of each of the identified one or more subject log groups within the start-to-end period.

Abstract: Systems, apparatus, and methods for implementing enterprise level social and business information networking are provided. Users can receive relevant information about a database system and its users at an appropriate time. Users can then use this relevant information to reduce errors and limit redundant efforts. For example, an update of a record in the database can be identified, and a story created automatically about the update and sent to the users that are following the record. Which updates have stories created and which stories are to be sent to which users can be configured. Other events besides updating of records can also be tracked. For example, actions of a user that result in an event can be tracked, where such tracking can also be configurable. Subscriptions to follow an object can be automatic, and access checks can be used to ensure that unauthorized users do not see certain data.

Abstract: A method to sequentially deduplicate data, wherein the method receives a plurality of computer files, wherein each of the plurality of computer files comprises a label comprising a file name, a file type, a version number, and file size, and stores that plurality of computer files in a deduplication queue. The method then identifies a subset of the plurality of computer files, wherein each file of the subset comprises the same file name but a different version number, and wherein the subset comprises a maximum count of version numbers, and wherein the subset comprises a portion of the plurality of computer files. The method deduplicates the subset using a hash algorithm, and removes the subset from said deduplication queue. During the deduplicating, the method receives new computer files comprising the same file name, stores those new computer files to the deduplication queue, but does not add those new computer files to the subset.

Abstract: A plurality of log processes are synchronized. Each is independently performed in parallel with one another, into a single set of log files. A line buffering mechanism of an operating system (OS) of the computing environment forecloses interleaving of the log processes. Log management operations are concurrently performed by a single process protected by a file-system lock of the OS. The log management operations include at least one of a log compression, log retention, and log rotation operation.

Abstract: The present disclosure generally relates to accessing data, and more particularly, to systems and methods for improving the efficiency and quality of real-time extracting, transforming, and/or loading data using customer information control system (CICS) interval control element (ICE) chain processing.

Abstract: A context icon-oriented user interface for indicating search criteria allows a user to select a first icon associated with an individual for which information associated with a second icon, and potentially select further icons that are retrieved and presented to the user. A context determines the universe of first icons that are presented for selection by the user, and a stickiness level between the user and individuals in the universe of first icons may further reduce the universe of first icons based on various factors, including prior interaction with the user. Search results based on a combination of icons are then returned to the user, allowing the user to visually request searches without recalling keywords used to define the search query.

Abstract: A system and method are provided that detect spam business listing data. In one aspect, a plurality of clusters containing previously captured spam business data is formed. The attributes of new incoming business data may be compared to the attributes of the clustered spam business data. If the incoming business data is associated with any one of the plurality of clusters, the incoming business data may be deemed spam.

Abstract: System and methods manage concurrent ETL processes accessing a database. Exemplary embodiments include a method for concurrency management for ETL processes in a database having database tables and communicatively coupled to a computer, the method including establishing a session lock for the database, determining that a current ETL process is accessing the database at a current time, associating a current expiration time with the session lock, the expiration time being stored in a lock table in the database, sending the session lock to the current ETL process and performing ETL-level locking for the current ETL process.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for using resource load times in ranking search results. In one aspect, a method includes receiving a search query from a particular user device; receiving, for each of a plurality of resources responsive to the search query, a respective first score; accessing load time data that specifies, for each of the plurality of resources, a load time measure for the resource; and adjusting the first score for each of the plurality of resources based on the load time measure for the resource to generate a second score for each of the plurality of resources.

Abstract: A method for efficiently querying multiple points in an indexed quadtree is disclosed. The elevation along a path containing points covered by nodes in a quadtree is desired. Index nodes covering the nodes with elevation data are retrieved. Based on the data in the index nodes, the highest resolution data is retrieved while limiting database lookups below a specified limit.

Abstract: Embodiments of the present invention provide a method and system for high-speed database searching with concurrent updating, without the use of database locks or access controls, for large database systems. Specifically, a plurality of search queries may be received over a network, the database may be searched, and a plurality of search replies may be sent over the network. While searching the database, new information received over the network may be incorporated into the database by creating a new element based on the new information and writing a pointer to the new element to the database using a single uninterruptible operation.

Abstract: Techniques to manage retention policy tags are described. A system may comprise a tagging component operative to tag a message with an expiration tag to form an expiration tagged message, the expiration tag having expiration information used to expire the expiration tagged message in accordance with a retention policy. The system may further comprise a presentation component communicatively coupled to the tagging component, the presentation component operative to present a view of the expiration tagged message with an expiration field having the expiration information for the expiration tagged message.

Abstract: Systems and methods for selecting data elements, such as population members, from a data source include translating the data source into a reverse schema. The reverse schema includes one or more data objects, each data object having a reverse access identifier and at least one unique identifier from the data source corresponding to the reverse access identifier. In some embodiments, access to data elements is provided using the reverse schema translation. A user may select a filter represented by a reverse access identifier in order to exclude those data elements associated with that reverse access identifier. In response, information associated with non-excluded data elements, such as population size, is provided for display.

Abstract: A computer-implemented method for migrating an object from a deduplication store to an external domain in an external media is described. A deduplication store (dstore) deduplication map (dmap) is retrieved from a dstore for an object stored in the dstore. A determination is made as to whether an external dmap exists in the external domain for an object referenced in the dstore dmap. If the external dmap exists, a determination is made as to whether data referenced in the dstore dmap exist in the external dmap. If the referenced data do not exist, the referenced data is extracted from the dstore to the external domain. If the external dmap does not exist, the object and the associated dmap are extracted from the dstore to the external domain.