Abstract: According to one embodiment, a file system (FS) of a storage system is partitioned into a plurality of FS partitions, where each FS partition stores segments of data files. In response to a request for writing a file to the storage system, the file is stored in a first of the FS partitions that is selected based on a time attribute of the file, such that files having similar time attributes are stored in an identical FS partition.

Abstract: In an approach to determine a product rating a computer receives a user request for a product rating. The computer retrieves from on-line sources, product information on the product and analyzes the product information to determine a first product rating. The analysis includes at least a sentiment, and a trend of the sentiment. The approach includes a computer identifying products similar to the product and retrieving from on-line sources product information on similar products. A computer extracts comments on the product from the similar product information and determines an adjustment to the first product rating based on an analysis of the comments and references to the product in the similar product information. The adjustment to the first product rating includes using a sentiment, a trend of the sentiment over time, and a frequency of comments and references to the product over time in the retrieved plurality of similar product information.

Abstract: Techniques for determining user information needs and selecting data based on user information needs are described herein. The present disclosure describes extracting topics of interests to users from multiple sources including search log data and social network website, and assigns a budget to each topic to stipulate the quota of data to be selected for each topic. The present disclosure also describes calculating similarities between gathered data and the topics, and selecting top related data with each topic subject to limit of the budget. A search engine may use the techniques described here to select data for its index.

Abstract: A method for linking a plurality of virtualized application packages for execution on a computer system is described. A runtime executable of a primary virtualized application package is launched. A secondary virtualized application package to be merged with the primary virtualized application package is identified. In one embodiment, application settings and file data for the first and second virtualized application packages are merged into a single data structure. An execution layer is created by starting execution of one of the application files associated with the primary virtualized application package. Requests from the execution layer to the operating system for configuration settings and contents of application files of either the primary virtualized application package or secondary virtualized application package and providing requested configuration settings are satisfied using configuration settings and file information from both the primary and secondary virtualized application packages.

Abstract: A system, method, and computer program product are provided for identifying a social network user identifier based on a user message. In use, a message is received from a user. Additionally, content is extracted from the message. Further, a search is performed using at least a portion of the content. Moreover, an identifier of the user provided by a social network is identified, based on the search.

Abstract: The invention relates to a computerized method for processing a graph containing a set of nodes processing a graph containing a set of nodes, wherein forest of trees is provided corresponding to a directed acyclic graph containing a set of nodes, each of said nodes having a type chosen from a set of types; a depth for each node in said forest of trees is determined; in a breadth-first traversal manner, the depth and type of each node in said forest of trees is compared to a predefined matrix, said matrix defining for each depth and type combination one of the following actions to be carried out: no action, creating a new sub-tree, triggering exception handling.

Abstract: Computer implemented methods for constructing dynamic relationships between data for presentation on a display are provided. The data is obtained from one or more data sources and managed as a plurality of nodes. The nodes increase or decrease in number over time. One method includes setting a point of view from one of the nodes of the plurality of nodes, and the setting of the point of view acting to order certain ones of the plurality of nodes to produce a representation from the point of view. The method generates visual data that illustrates the representation of the plurality of nodes from the set point of view and provides the visual data for rendering on a display of a device. Certain ones of the nodes contain unique identity data for individuals, and the nodes are associated with other nodes based on relationships between the individuals.

Abstract: In a computer system, an ontology is derived from an original data source, such as from an relational database. At any time, a user can relate useful information to an ontology node, for example, by entering a document annotation into the ontology. Later, the user can retrieve the information through the annotation and view the document together with the ontology. An ontology update scheme keeps the document annotation available even if changes in the original data would remove the corresponding portions of the ontology. In the ontology, the scheme moves the annotations from a first ontology node to a second ontology node, by following a pre-defined change pattern.

Abstract: Computer implemented methods for constructing dynamic relationships between data for presentation on a display are provided. The data is obtained from one or more data sources and managed as a plurality of nodes. The nodes increase or decrease in number over time. One method includes setting a point of view from one of the nodes of the plurality of nodes, and the setting of the point of view acting to order certain ones of the plurality of nodes to produce a representation from the point of view. The method generates visual data that illustrates the representation of the plurality of nodes from the set point of view and provides the visual data for rendering on a display of a device. Certain ones of the nodes contain unique identity data for individuals, and the nodes are associated with other nodes based on relationships between the individuals.

Abstract: Systems, methods, and computer media for identifying related strings for search query rewriting are provided. Session data for a user search query session in an accessed click log data is identified. It is determined whether a first additional search query in the session data is related to a first user search query based on at least one of: dwell time; a number of search result links clicked on; and similarity between web page titles or uniform resource locators (URLs). When related, the first additional search query is incorporated into a list of strings related to the first user search query. One or more supplemental strings that are related to the first user search query are also identified. The identified supplemental strings are also included in the list of strings related to the first user search query.

Abstract: Managing file distribution in an online file sharing system implemented by at least one server includes inviting a first entity to access a shared file hosted by the online file sharing system, and allowing the first entity to reshare the shared file through the online file sharing system with at least a second entity only to an extent permitted by a resharing policy stored by the online file sharing system.

Abstract: A method includes creating a bulk order. The bulk order includes a plurality of action sets. Each action set represents a set of changes to a plurality of assets, and the bulk order represents, for a plurality of accounts, a plurality of services and assets. The method also includes validating the bulk order. The validating includes verifying a validity of a user name, which includes a validity of an association between the user name and the account and a validity of an association between the user name and the service. The validating also includes verifying the action set obeys a constraint of the product. The method also includes submitting the bulk order for execution of the set of changes. The submitting includes preparing the action set, executing the set of changes and changing a status of the bulk orders header to indicate a completion of the bulk order.

Abstract: A data store stores display content indexed to a word segment. The display content comprises a time stamp and a screen shot captured in response to entering the word segment using an input. A process module searches the data store for the word segment, presents the display content indexed to the word segment, and replays an action for the display content.

Abstract: A system to automatically generate query language in software is described. The system receives a request for data that is persistently stored in a database. The system selects a predefined query template from a number of query templates based on the request. The system utilizes the query template to receive content from at least one different source, the first source being a prototype data object. The system generates a query statement based on the query template that includes the content. Finally the system queries the database using the query statement to retrieve the requested data.

Abstract: Methods and computer-readable media for associating words or groups of words distilled from content, such as reported speech or an attitude report, of a document to form semantic relationships collectively used to generate a semantic representation of the content are provided. Semantic representations may include elements identified or parsed from a text portion of the content, the elements of which may be associated with other elements that share a semantic relationship, such as an agent, location, or topic relationship. Relationships may also be developed by associating one element that is in relation to, or is about, another element, thereby allowing for rapid and effective comparison of associations found in a semantic representation with associations derived from queries. The semantic relationships may be determined based on semantic information, such as potential meanings and grammatical functions of each element within the text portion of the content.

Abstract: One particular embodiment clusters a plurality of documents using one or more clustering algorithms to obtain one or more first sets of clusters, wherein: each first set of clusters results from clustering the documents using one of the clustering algorithms; and with respect to each first set of clusters, each of the documents belongs to one of the clusters from the first set of clusters; accesses a search query; identifies a search result in response to the search query, wherein the search result comprises two or more of the documents; and clusters the search result to obtain a second set of clusters, wherein each document of the search result belongs to one of the clusters from the second set of clusters.

Abstract: Described herein is a system and method for managing environment metadata of a server system during a backup session between the server system and a storage system. In some embodiments, during the backup session, the server system sends a sequence of blocks or files comprising backup data and environment metadata to the storage system. The backup data may comprise data on the server that is typically sent to the storage system during a backup session, such as client or application data. The environment metadata may include information describing the server system, such as information describing hardware or software components of the server system or server metrics of the server system. In these embodiments, operations for processing environment metadata may be included with the operations for processing backup data during the backup session.

Abstract: In an approach to determine a product rating a computer receives a user request for a product rating. The computer retrieves from on-line sources, product information on the product and analyzes the product information to determine a first product rating. The analysis includes at least a sentiment, and a trend of the sentiment. The approach includes a computer identifying products similar to the product and retrieving from on-line sources product information on similar products. A computer extracts comments on the product from the similar product information and determines an adjustment to the first product rating based on an analysis of the comments and references to the product in the similar product information. The adjustment to the first product rating includes using a sentiment, a trend of the sentiment over time, and a frequency of comments and references to the product over time in the retrieved plurality of similar product information.

Abstract: Data replication with delta compression is disclosed. A primary system and a replica system are determined to both have an identical first data segment that is similar to a second data segment. The second data segment is encoded, wherein the encoding refers to the first data segment.

Abstract: Nodes of a tree are dynamically generated. A user may specify that a node should have a separate child node for each unique value that occurs in a particular column of a relational table. A user may specify that a node should have a separate child node for each range of values in a user-specified set of ranges. Child nodes of a particular node may be dynamically determined and displayed by querying one or more relational tables for records that satisfy all of the criteria that are implied by that particular node and that particular node's parents. As a result of the foregoing techniques, users are not forced to create a tree node-by-node; instead, users can specify criteria based on which a whole level of nodes should be created, and a whole level of nodes may be added to a tree based on those criteria.