Abstract: Methods and systems are provided for selectively storing event data. In one described method, an event associated with an article is captured. The captured event can comprise event data. The method further comprises evaluating the event for satisfaction of a criterion. If the event satisfies the criterion, it is indexed.

Abstract: A processor receives a string of binary data that represents an initial phrase that includes multiple words and is associated with a specific category. The processor removes one or more letters from an end of a word in the initial phrase to form an initial truncated version of the phrase. The processor runs a TF-IDF algorithm on the initial truncated version of the phrase, and lemmatizes subsequent truncated versions of the initial phrase by recursively removing remaining letters from the end of the word. The processor runs the TF-IDF algorithm on subsequent truncated versions of the initial truncated version of the initial phrase until a highest TF-IDF value is identified. The processor defines a breadth of a lemma for a lexeme based on the specific category of the phrase, and assigns the specific truncated version having the highest TF-IDF value to the specific category.

Abstract: A write instruction which affects original data is received via a virtual file system; the original data is read-only on a remote device. The original data is received from the remote device and the write instruction is applied to the original data in order to obtain changed data. The changed data is stored in a buffer in the virtual file system. The changed data is copied from the buffer to a differencing file, where deletion of the changed data from the buffer is independent of completion of copying from the buffer to the differencing file.

Abstract: Targeting information (also referred to as ad “serving constraints”) or candidate targeting information for an advertisement is identified. Targeting information may be identified by extracting topics or concepts from, and/or generating topics or concepts based on, ad information, such as information from a Web page to which an ad is linked (or some other Web page of interest to the ad or advertiser). The topics or concepts may be relevant queries associated with the Web page of interest, clusters, etc.

Abstract: A distributed replicated database system having a plurality of federated database systems and methods of updating and reading database records from the distributed replicated database system are disclosed. Each federated database system contains a complete copy of a database. Moreover, each federated database system comprises at least one server divided into at least one logical partition. A logical partition contains records of the database and all logical partitions in a federated database system cumulatively stores all records in the database. A data structure is maintained which indicates whether the records in a given logical partition are up-to-date. When an update or insert request is received, the data structure is modified to indicate that all logical partitions storing a copy of the record to be updated, or partitions into which the new record is to be inserted, are not up-to-date.

Abstract: System, method and program product for forming a search query. A user enters search terms. Icons that correspond to the respective search terms are automatically determined and displayed. The icons are not the search results. An indication is received from a user whether the icons represent a context intended by the search terms. If the user indicates that the icons represent the context intended by the search terms, a search that corresponds to the icons is conducted. The search query can be structured or unstructured. If the user indicates that one of the icons does not represent a corresponding search term entered by the user (for example, if the search term is a homonym), then the context of the corresponding search term is determined as well as another icon corresponding to the context of the corresponding search term entered by the user. A hierarchical relationship between the icons can be determined and displayed.

Abstract: A method comprises the steps of: transmitting a map request from a client computer to a server; receiving in the client computer data representing a map from a map server; receiving, in the client computer, dynamic, location-based data from a content provider separately from the data representing the map; generating within the client computer a rendering of the dynamic, location-based data overlaid on the map; and displaying the rendering on the client computer.

Abstract: A method, system and computer program product for confirming the sensitivity of a data object in a managed object heap software runtime environment based on a determination that the object is accessible only via other objects known to be sensitive.

Abstract: In one embodiment, a method comprises creating and storing, in a revisioning database, one or more data objects; wherein a first plurality of the data objects is associated with a base realm representing data shared across all users of the database; wherein a second plurality of the data objects is associated with one or more child realms, wherein each of the child realms represents data local to a project, wherein each of the users is associated with one or more of the child realms; wherein the revisioning database associates each data object to a realm identifier value and to a version identifier value for a plurality of versions of the data object, wherein each of the versions represents a change to the data object by any of a plurality of users; receiving a request from a first user to view a third plurality of data objects in the revisioning database; selecting, based on the base realm, the particular realm, the version identifier value for the data objects in the third plurality, and one or more rules a

Abstract: Performing data backup for a client includes receiving, at a host other than the client, volume information including data indicating a physical data storage location of at least a part of a volume comprising one or more stored objects associated with the client; and determining at the host, based at least in part on the volume information, a stored object information for a stored object included in the volume, the stored object information including data associated with a physical data storage location of the stored object.

Abstract: Disclosed are methods, apparatus, systems, and computer-readable storage media for identifying topical influence in an online social network. In some implementations, an entity associated with a feed item is identified. A topic associated with the entity or with the feed item is also identified. The entity can be determined to be a topical influencer regarding the topic in the online social network based on one or more factors, such as a factor indicating dissemination of information associated with the identified topic to other entities. A display device can be configured to display information indicating the determination that the entity is a topical influencer of the identified topic.

Abstract: Computers and methods are provided for receiving a search request sent by a computer associated with a user. A set of documents comprising a plurality of documents that satisfy the search request is identified. At least some documents in the plurality of documents have previously been annotated by at least one user of a plurality of users. A response to the search request is sent. The response includes a ranked set of links to at least some of the plurality of documents that satisfy the search request. At least some of the links are to documents that have previously been annotated by at least one user of the plurality of users. The response is associated with instructions to display one or more corresponding annotations for at least some of the links to documents that have previously been annotated by at least one user of the plurality of users. The response is further associated with instructions to display a filter selector including one or more filter options to reduce the identified set of documents.

Abstract: Node sequence data, such as website visitation records, are filtered, analyzed, and summarized in reports. An administrator can designate particular target paths of interest in terms of a checkpoint node sequence. Node sequences are filtered based on the checkpoint node sequence, without regard to any additional or tangential nodes appearing in the sequences. In addition, node sequences can be specified in terms of specific nodes of interest along with wild cards. Reports depict the relative frequency of occurrence of node sequences using visual indicators such as line thickness and/or color.

Abstract: Entity resolution in a database comprises receiving imported data comprising imported data entities each having properties each having values; receiving first user input that selects the imported data entities for resolution to existing data entities in a database; receiving second user input that specifies matching criteria for matching the imported data entities to the existing data entities, wherein each of the matching criteria comprises a matching technique; matching the imported data entities to the existing data entities using the matching criteria, resulting in creating and storing matched entity information, wherein the matched entity information is organized in matched entity data sets associated with subsets of the matching criteria that were matched; consolidating the imported data entities into the existing data entities; storing the first user input and second user input as a named criteria set for use in subsequent entity resolution operations.

Abstract: A method of querying a social network associated with a user may include receiving, by a computing device, a query that includes an indication of a product, and an identifier associated with the user. The method may include executing, by the computing device, the query across the social network by sending the query to one or more agent applications associated with one or more members of the social network, and receiving a notification from one or more of the agent applications if a profile for a member of the social network indicates that the member is associated with the product, and a privacy policy associated with the member permits the agent to send the notification.

Abstract: Systems and methods for storing and retrieving data are disclosed where creation of new partitions in a database is driven by write requests. The requests can arrive at pseudo random moments of time. Each partition in the database is associated with a time interval. Different time intervals do not need to be consecutive. Whenever a write request is obtained, the system determines whether the write request is received within a latest partition time interval defined by start and end times. If yes, the data is written into a database partition corresponding to that interval. If not, a new partition is created having associated time interval with its own start and end times defining a new partition time interval. The process is repeated as new data is streaming in.

Abstract: A computer determines a degree of information duplication between at least two files included in an original pre-fetch list. The computer generates a re-ordered pre-fetch list by re-ordering the files included in the original pre-fetch list. The re-ordering is based, at least in part, on the degree of information duplication between the two files included in the original pre-fetch list. The files included in the original pre-fetch list are re-ordered by grouping files containing higher degrees of duplicate information closer together in the re-ordered pre-fetch list.

Abstract: A system and method is provided for query processing comprises: creating an index of a database and ordering a set of index candidates from the index into a list based on a set of heuristic rules. A query defining a query path is then reduced into a list of single path expressions. Each index candidate is matched against the list of single path expressions according to the ordering of the index candidates. The matched candidate nodes are also verified to insure that they satisfy the query path.

Abstract: Described is maintaining cached hash values for files in association with state data for each file that represents the state of that file's contents at the time of hashing. For example, in a journaling file system, the state data may comprise the update sequence number of the file in the journal and a journal identifier for that journal instance. A request for a hash value for a file is processed by determining whether a cached hash value is maintained for that file. If so, and the associated maintained state data matches current state data for the file, the file contents are unchanged since the last hash computation, whereby the cached hash value is returned in response to the request. Otherwise, a new hash value is computed for the file and returned, and cached for future use. Multiple types of hashes may be cached for a given file.

Abstract: Systems, methods, and computer-program products are described for determining current location information which includes determining whether an object is moving by comparing the current location information with previous location information. Future location information is calculated and a point of interest is filtered using the future location information. A media asset is then matched to the filtered point of interest and a current score is determined for the matched media asset. Determining a current score includes determining a window in which the matched media asset is geographically relevant to the future location information, and updating the matched media asset score when the future location information changes. An ordered playlist is dynamically generated according to the future location information by repeatedly prioritizing and sequencing matched media assets according to the current score for each matched media asset, and matched media assets are played or displayed in the ordered playlist.