Abstract: One or more techniques and/or computing devices are provided for data synchronization. For example, an in-flight log may be maintained to track storage operations that are received by a first storage node, but have not been committed to both first storage of the first storage node and second storage of a second storage node that has a replication relationship, such as a disaster recovery relationship, with the first storage node. A dirty region log may be maintained to track regions within the first storage that have been modified by storage operations that have not been replicated to the second storage. Accordingly, a catchup synchronization phase (e.g., asynchronous replication by a resync scanner) may be performed to replicate storage operations (e.g., replicate data within dirty regions of the first storage that were modified by such storage operations) to the second storage until the first storage and the second storage are synchronized.

Abstract: A system for generating a database of labeled foreign canonical titles includes an interface and a processor. The interface is to receive a title in a second language. The processor is to 1) store a set of n-grams in a first language in a first database; 2) sanitize the title into a sanitize title in the second language; 3) translate the sanitized title into a translated title in the first language; 4) break the translated title into n-grams; 5) determine labels for the n-grams using the first database; and 6) determine label to associate with the title.

Abstract: Disclosed are methods and apparatus for providing digital audio data including an introduction to and/or summary of a set of content items is provided. In one embodiment, a set of content items may be identified for presentation to a user. One or more personas associated with the user may be identified. Digital audio data pertaining to the set of content items may be obtained based, at least in part on the personas associated with the user. The digital audio data pertaining to the set of content items may be provided.

Abstract: A method, computer program product, and computing system for determining, at the computing device, one or more dependencies associated with a plurality of managed objects and a plurality of backend objects. A plurality of consistency groups with one or more managed objects of the plurality of managed objects and one or more backend objects of the plurality of backend objects may be generated based upon, at least in part, the one or more dependencies associated with the plurality of managed objects and the plurality of backend objects. The one or more backend objects of the plurality of consistency groups may be fetched. The one or more managed objects of the plurality of consistency groups may be updated based upon, at least in part, the one or more fetched backend objects.

Abstract: Techniques for decoupling the commit and replay of file system metadata updates in a clustered file system (CFS) are provided. In one embodiment, a CFS layer of a computer system can receive a file I/O operation from a client application, where the file I/O operation involves an update to a file system metadata resource maintained on persistent storage. In response, a journaling component of the CFS layer can execute a commit phase for committing the update to a journal on the persistent storage. The CFS layer can then return an acknowledgment to the client application indicating that the file I/O operation is complete, where the acknowledgement is returned prior to completion of a replay phase configured to propagate the update from the journal to one or more locations on the persistent storage where the file system metadata resource is actually stored.

Abstract: Described embodiments provide systems and methods for operating a storage system wherein an online consistent system checkpoint is generated. The checkpoint contains a point in time image of a system and is used for providing recovery of the system to a known good state. In one embodiment the checkpoint includes volume configuration data, logical volume space, a plurality of layers of metadata, and physical data storage.

Abstract: A snapshot of selected objects in a source repository is created in response to the user-initiated replication. The snapshot is designated as a snapshot replication job. Unsynchronized objects in a target destination are detected by comparing a state of the selected objects in the snapshot with a current state of the target destination at the time of execution of the snapshot replication job. An object identification (ID) and a state ID are sent to the target destination and used to locate and compare the selected object with a current state of the selected object in the target destination.

Abstract: Inferring membership in a group may include receiving one or more queries from a user, where the one or more queries have a feature that is independent of a subject matter of the one or more queries and that distinguishes the one or more queries from other queries received from the use. Inferring membership may include identifying the feature; and, in response to identifying the feature, making an inference that the user is a member of a group based on the subject matter of the one or more queries, where the group has one or more characteristics associated therewith. Inferring membership may further include attributing the one or more characteristics to the user based on the inference; and selecting the user for distribution of electronic content based on the one or more characteristics.

Abstract: A method for pairing web pages with keywords may include obtaining a keyword paired with a public web page, the public web page configured to be published at a public address; determining a mapping between the public address of the public web page and an internal address of an internal web page that corresponds to the public web page, the internal address pointing to the internal web page used in a content management system that generates the internal web page and the public web page; creating a keyword-page pairing entry that includes the keyword and the mapping between the public address and the internal address, the keyword-page pairing entry indicating the keyword is paired with the internal web page; and sending the keyword-page pairing entry to the content management system.

Abstract: Described is a data integration technique and system for providing data in response to a request. The data integration system may overcome the limits of a fixed scheduling system by implementing a service dependency graph (SDG). In particular, the data integration system may represent the SDG as a directed acyclic graph (DAG). Accordingly, the system may leverage the nature of DAGs in order to derive an efficient topological ordering for calling one or more services. Thus, the data integration system may retrieve and compile data in an efficient and scalable manner.

Abstract: In one example, a request for storage of an extended attribute (EA) of a file system object is received. A storage location for the EA is determined from a plurality of storage locations, based on one or more characteristics of the EA, the plurality of storage locations including an inode, a first storage file accessible by a first B+ tree, and a second storage file accessible by a second B+ tree. The EA is accordingly stored in the determined storage location.

Abstract: Linking within and among documents may include detecting at least one of intra-document and inter-document links present in a document; determining a document management project-specific document ID for the document; configuring a link resolution database with an entry for each detected link, each entry comprising link status, link direction, link type, source document link location information associated with the position of the link, and destination document link location information associated with a target viewing location in the destination document; and presenting the source document content in a user interface that overlays link annotations in a link annotation presentation layer over the presented source document content while associating the link annotations with a location of a link in the source document.

Abstract: A method embodiment serves to manage entity names for virtualized entities in a computing system comprising two or more computing nodes that host virtual machines and other virtual entities. The method commences upon receiving a request for identifiers. The request includes an identifier key that is used by a name generator. The name generator implements a deterministic algorithm that will always return the same outputs given the same inputs. The name generator generates a user- or program-specified number of virtualized entity identifiers based on the identifier key. The generated virtualized entity identifiers and corresponding identifier keys are stored in an identifier mapping table that is accessible by the two or more computing nodes. The identifier mapping table describes relationships between the virtualized entity identifiers and corresponding identifier keys. The virtualized entity identifiers are used to create respective virtualized entities.

Abstract: A method for providing user-customized information is disclosed. The method for providing user-customized information can provide information suitable for a user's situation by: obtaining information on a location where a terminal is located, and information on the time when the location information was obtained; obtaining situation information of a user of the terminal predicted on the basis of the location information and the time information; and requesting, to a server, situation-adaptive information corresponding to the user's situation on the basis of the obtained situation information of the user, pre-stored profile information of the user, and state information of the terminal at a time when the location information is obtained so as to obtain the situation-adaptive information from the server.

Abstract: A full-text index can be created for each mailbox of an EDB to facilitate the performance of complex queries to quickly search for email data. In this way, relevant email data can be identified and retrieved quickly and efficiently from the full-text index rather than from the EDB. To create such indexes, each email in a mailbox can be retrieved and processed to convert the email from its native format into textual name/value pairs which can then be submitted for indexing. This use of name/value pairs to index each email enables the emails across all mailboxes to be efficiently queried using any possible combination of values.

Abstract: A method of generating search query suggestions for a search query received in a search application. The method is executable by a processor communicatively coupled to the search application. The method includes receiving a search query and an indication of a current cursor position with respect thereto. The search query is a received search query and includes at least one received search query term. Responsive to the current cursor position being one of a plurality of predefined cursor positions, one of a plurality of suggest algorithms corresponding to one of a plurality of predefined suggest actions associated with the current cursor position is executed to define a suggested search query. Each one of the plurality of predefined cursor positions has associated therewith at least one of the plurality of predefined suggest actions. Each one of the plurality of predefined suggest actions corresponds to one of the plurality of suggest algorithms.

Abstract: An embodiment of the present invention is directed to a backup validation engine. The backup validation engine comprises: a plurality of data sources comprising a central asset repository; a central repository of backups data; a central repository of network attached storage, a central application portfolio repository; and central repository of tape backup data; an interface user interface; and a data mapping processor, coupled to the plurality of data sources and interactive user interface, programmed to: access data from each of the plurality of data sources; map data from the plurality of data sources; identify performance issues comprising: duplicate host policies, hosts back-up, missing backup of hosts, duplicate NAS policies, NAS volume backup, and missing NAS backup; generate a backup validation plan to address one or more performance issues; and automatically initiate the backup validation plan.

Abstract: This disclosure describes techniques performing data object renaming operations. This disclosure describes techniques for performing data object renaming operations in a manner that may reduce file system corruption and data loss. The techniques described herein may include selectively journaling particular types of renaming operations. Selectively journaling particular types of renaming operations may mitigate potential data loss and file system corruption.

Abstract: Systems and methods for very fast grouping of “similar” SQL queries according to user-supplied similarity criteria. The user-supplied similarity criteria include a threshold quantifying the degree of similarity between SQL queries and common artifacts included in the queries. A similarity-characterizing data structure allows for the very fast grouping of “similar” SQL queries. Because the computation is distributed among multiple compute nodes, a small cluster of compute nodes takes a short time to compute the similarity-characterizing data on a workload of tens of millions of queries. The user can supply the similarity criteria through a UI or a command line tool. Furthermore, the user can adjust the degree of similarity by supplying new similarity criteria. Accordingly, the system can display in real time or near real time, updated SQL groupings corresponding to the newly supplied similarity criteria using the originally computed similarity-characterizing data structure.

Abstract: An information processing method is disclosed which includes the steps of: (a) calculating levels of similarity between a standard form vector as a comparison basis vector and each of a plurality of item characteristic vectors of the standard form which are characteristic of a plurality of items, the standard form vector being made up of N components individually representative of N attributes of each of the plurality of items, N being an integer of at least 1, step (a) further determining as the items to be recommended to a user a plurality of items corresponding to the item characteristic vectors of which the level of similarity satisfies a first condition; (b) determining one of the N attributes of the plurality of recommended items determined in step (a) as a common recommendation reason common to the plurality of recommended items when the determined attribute satisfies a second condition; and (c) controlling presentation to the user of either the plurality of recommended items determined in step (a) or