Abstract: A computer-implemented method for creating selective snapshots may include (1) determining that a snapshot has been taken of a volume of data that includes at least one file, (2) identifying a first attempted modification to a first block of the file, (3) determining, based on a block map of the file, that the first block falls within a scope of the snapshot, (4) copying the first block before the first attempted modification for use in the snapshot, (5) identifying a second attempted modification to a second block of the file, (6) determining, based on the block map of the file, that the second block does not fall within the scope of the snapshot, and (7) allowing the second attempted modification without first copying the second block for use in the snapshot. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A computer-implemented method for managing comment data generated when interacting with a page module is disclosed. At least one comment data being expressed by a user when interacting with the page module is detected and analyzed identify a context for the comment data. If the comment data is identified to be associate with a context, tagging the comment data with a context association, and if the comment data is not associated with a context then maintaining the comment data associated only with the page module. The comment data is then populated in the other page modules that were identified to have a context association with the comment data. The populating enables display presentation of the comment data made at the page module at the one or more page modules having the context association.

Abstract: A method may include receiving, from a first user device associated with a user profile, a first request for a media file and streaming the media file over a network to the first user device in a first format appropriate for the first device. The method may also include stopping the streaming of the media file and associating a stop time with the stopping, wherein the stop time indicates a position in the media file and receiving, from a second user device different from the first user device, a second request for the media file, the second user device being associated with the user profile. The method may also include streaming, starting at the stop time, the media file over the network to the second user device in a second format appropriate for the second device and different than the first format.

Abstract: A first plurality of log segments are generated in a data storage application. The log segments are sequentially positioned within a log area and at least one of the log segments contains log hole information identifying a portion of log to skip during replay of the log. Thereafter, a portion of log segments are replayed up to a specified position while skipping at least one portion of the log prior to the specified position that is identified by the at least one log hole. Related apparatus, systems, techniques and articles are also described.

Abstract: A system is configured to monitor traffic being transmitted among a group of nodes; detect a configuration statement being transported from a first node to a second node, where the configuration statement identifies a first configuration to be implemented on the second node; create a record, associated with the configuration statement, that identifies a manner in which a second configuration, that existed on the second node before receiving the configuration statement, is to be changed to the first configuration, where the record includes terms obtained from the configuration statement; generate tags, associated with the record, based on the terms or a first identifier associated with the second node; and associate the tags with the record, where associating the tags with the record allows a search to be performed, using a search query based on the tags, to obtain a configuration history that includes the record or another record.

Abstract: A system and method for providing orientation into subject areas of digital information for augmented communities is provided. Topics are provided for subject areas. Each subject area is associated with an augmented community and each topic is hierarchically organized under a fine-grained topic category. Evergreen indexes are maintained and includes topic models that are each matched to topics associated with each augmented community. Interrelatedness of the evergreen indexes is determined by identifying the topics found in the topic hierarchy for each evergreen index that are shared. A social network including neighbors made up of each augmented community associated with each interrelated evergreen index is formed. A user interest is determined and each of the plurality of topic models for the evergreen indexes is evaluated against the digital information. Access to the digital information via the identified best matched evergreen index and the identified other evergreen index is provided.

Abstract: A computer-implemented method for copying database files may include (1) identifying a request to copy a database file to a target location, and in response to identifying the request to copy the database file to the target location, (2) identifying a preallocated but unused portion of the database file, (3) transmitting a used portion of the database file to the target location, and (4) transmitting a metadata representation of the unused portion of the database file to the target location, the metadata representation being smaller than the unused portion. Various other methods and systems are also disclosed.

Abstract: Improvements to apparatus, methods, and computer program products are disclosed to improve the efficiency of pinning objects in a heap memory that is subject to a garbage collection system.

Abstract: The present invention is directed towards systems and methods for providing search assistance technologies based on a user's search self-efficacy and search frustration. The method according to one embodiment of the present invention comprises receiving a search query from a user. The method then calculates the user's search self-efficacy and calculates the user's frustration with the current information task. The method then identifies a plurality of search assistance technologies based on the user's search self-efficacy and frustration. Finally, the method provides a search engine results page comprising a plurality of search results and the identified plurality of search assistance technologies.

Abstract: A computer system and methods. The computer system includes a host that hosts applications and includes storage volumes. The host identifies an application and associated first files to be protected. The first files are stored on a first volume. The host performs a file-by-file backup of the first files to a first backup medium. The host identifies a second volume to be protected and performs a volume image backup of the second volume to a second backup medium. The host identifies second files that are associated with the identified application and stored on the second volume and stores metadata in a third backup medium including application-specific references to data objects that correspond to the second files. Third files not associated with the identified application are stored on the first volume and not included in the file-by-file backup. The second files are not included in the file-by-file backup.

Abstract: Performing string analysis based on three-valued logic by including expressing a property of a string in a computer software application as a three-valued logic shape predicate, performing a three-valued logic shape analysis using the shape predicate to reach a fixpoint solution, and evaluating the fixpoint solution to determine a three-valued logic value of the property.

Abstract: A method begins by a processing module determining to retrieve a dispersed error encoded file from a dispersed storage network wherein the dispersed error encoded file is stored as a plurality of sets of encoded data slices. The method continues with the processing module determining whether a neighboring device has a desire to retrieve the dispersed error encoded file and when the neighboring device has a desire to retrieve the dispersed error encoded file, coordinating retrieving of the dispersed error encoded file such that, collectively, the device and the neighboring device receive at least a decode threshold number of encoded data slices of a first set of encoded data slices and at least the decode threshold number of encoded data slices of a second set of encoded data slices.

Abstract: A reliable caching mechanism is provided for client-side caching of data that captures user interaction with a remote service, where users interact with the remote service through a computing device. Such instrumentation items are cached in a client-side offline queue. Within the client-side queue, the gathered instrumentation items survive between user sessions with the remote service. Because the client-side does not lose the instrumentation items that were gathered in a session when the session ends, those instrumentation items do not all need to be transferred to the server-side at or prior to the termination of the session in which the instrumentation items are collected. Instead, the instrumentation items may be sent to the server-side at times that will have less impact on the user experience, such as when the computing device is otherwise idle.

Abstract: The current position of each node in a hierarchical structure is held, and the past position of each node in the hierarchical structure is held. The current position is displayed in correspondence with the past position in a first user interface. The past position is displayed in correspondence with the current position in a second user interface. When the past position displayed in the first user interface is designated, the second user interface displays the designated past position. When a current position displayed in the second user interface is designated, the first user interface displays the designated current position.

Abstract: A method, non-transitory computer readable medium and apparatus for optimizing a web service by adaptively using compression are disclosed. For example, the method receives a request for a data file, determines whether the data file should be compressed based upon a previous request for the data file, compresses the data file if it is determined that the data file should be compressed, and sends the data file in a compressed format.

Abstract: A method of assisting with the construction of a tree of clusters of electronic documents, the documents being defined by predetermined attributes. The method includes, for a given cluster of documents and a given level of the tree, the following steps: a) obtaining (E300) constraints defined between at least two documents of said cluster and storing those constraints; b) constructing (E310) subclusters as a function of the constraints obtained and the attributes of the documents of said cluster; c) creating (E320) a tree level corresponding to the subclusters created; and d) selecting (E340) a created subcluster and iterating the steps a), b), c) and d) for the selected subcluster until said tree is obtained. A device for implementing the method is also disclosed.

Abstract: A distributed database system is provided in which a commit coordinator ensures that transactions spanning multiple database instances are committed or rolled back consistently. The commit coordinator utilizes an extended two-phase-commit process. The extension of the two-phase-commit process enables, that if within the distributed database cohorts store redundant data for a productive operation, only one of the cohorts out of a redundancy group are required. By this, the distributed database is prepared to continue operation even during shutdown or failure of single cohorts. Related apparatus, systems, techniques and articles are also described.

Abstract: A method and system for dividing a tree structure of a structured document based on a tree structure defined by a schema of the structured document. The method includes the following steps: calculating an index value of size of a subtree having each element as a root for at least part of at least one element included in the tree structure defined by the schema, and deciding on a division pattern using the index value, where the division pattern is used to divide the tree structure of the structured document to which the schema is applied so that the size of the subtree, after being divided, meets a predetermined standard.

Abstract: Systems and methods are described that calculate the interestingness of a set of one or more records in a database, either absolutely (i.e., compared to an overall collection of records) or relative to some other set of records. In one embodiment, the measure is a relative entropy value that has been normalized. Various applications of the measure are described in the context of an information retrieval system. These applications include, for example, guiding query interpretation, guiding view selection and summarization, intelligent ranges, event detection, concept triggers and interpreting user actions, hierarchy discovery, and adaptive data mining.

Abstract: Subject matter described herein is related to determining a document score, which suggests a relevance of a document (e.g., webpage) to a search query. For example, a search query is received that is comprised of one or more terms, which represent a subject. An equivalent subject is identified that is semantically similar to the subject. The document score is determined by accounting for both a subject frequency and an equivalent-subject frequency.