Abstract: Mechanisms are provided for processing sources of content in a corpus of information associated with a domain. The mechanisms ingest a plurality of sources of content in the corpus of information associated with the domain and determine at least one temporal category for the domain based on identification of frequently occurring references to at least one of temporal terms or time spans specified in the plurality of sources of content in the corpus of information associated with the domain. The mechanisms store the at least one temporal category for the domain in association with the domain and process queries applied to the plurality of sources of content in the corpus of information associated with the domain based on the stored at least one temporal category for the domain.

Abstract: Systems and methods are provided for providing an ordered list of search results in response to a query. Consistent with certain embodiments, computer-implemented systems and methods may identify content items corresponding to a query. First relevance scores may be determined for the identified content items based on their relevance to the query. Second relevance scores may be determined by modifying at least one of the first relevance scores using a boost value. The boost value may be set to a default boost value when the query does not include an override boost value. The boost value may be set to the override boost value, when the query includes an override boost value. An ordered list of the identified content items may be generated based on the second relevance scores. The ordered list may be displayed on a display device.

Abstract: Implementations of the disclosed subject matter provide techniques for recommending a song to a user based on the user's application usage information. A method may include receiving an indication of playback of a first song, by a first user, in a media application operating on a first device. It may be determined that a first content item is active on the first device during playback of the first song. An association may be stored of the first content item with the first song. Next, an indication may be received that the first content item is active on the first device. As a result, a second song associated with the first content item, based on the association of the first content item with the first song, may be recommended to the first user.

Abstract: A system that recommends literary works to a user based on identified trends of how text in the literary works liked and/or disliked by the user are written and/or structured is provided. For example, the system may analyze the text of a literary work to identify one or more metrics. Based on the identified metrics, the system can generate an analytical summary called a fingerprint for the literary work. The ratings assigned to literary works by the user may be used in conjunction with the generated fingerprints to generate positive and/or negative models for the user. The positive model captures aspects of literary works that the user likes and the negative model captures aspects of literary works that the user dislikes. The system can then compare some or all of the generated fingerprints in a literary works fingerprint database with the positive and/or negative models to select literary works to recommend to the user.

Abstract: Systems and methods for undo mechanism are provided. Computer systems can have many different software elements, including application elements and file management elements. System elements can be used for user input, providing output, and manipulating data or files. In the course of using a computer system, the user may wish to return to a previous system state by undoing one or more events. In one aspect, an undo operation can be performed across multiple elements in the system (e.g., cross-application undo functionality). In another aspect, past information displayed on a display can be “recorded” so that it can later be rewound as part of a media player metaphor, and events associated with the rewound/displayed information can be undone. The media player and rewind metaphors assist users in recalling past events and/or finding actions to undo.

Abstract: Deduplicated data is packed in a self-contained deduplicated repository having unique data blocks with each being referenced by a globally unique identifier (GUID). The self-contained deduplicated repository has information regarding both deduplicated data files and the unique data blocks of each of the deduplicated data files and a master GUID list containing a location of each of the unique data blocks.

Abstract: Deduplicated data is packed in a self-contained deduplicated repository having unique data blocks with each being referenced by a globally unique identifier (GUID). The self-contained deduplicated repository has information regarding both deduplicated data files and the unique data blocks of each of the deduplicated data files and a master GUID list containing a location of each of the unique data blocks.

Abstract: A database system optimizes database queries that comprise subqueries. The database system factors out computation from two or more subqueries to a reusable subquery. The reusable subquery returns a result set. The subqueries are rewritten to use the result set and the database query modified to use the rewritten subqueries. The modified database query performs efficiently since the result set is computed only once for each subquery that uses the reusable query. The database system also composes nested subqueries that compute aggregate values. The database system identifies an inner subquery nested within an outer subquery, each subquery computing an aggregate value. The database system determines a new aggregate function corresponding to a composition of aggregate functions of the inner and the outer queries. The database system determines a composed query using the inner query with the outer query. The composed query uses the new aggregate function.

Abstract: Recommending and graphically displaying viewed video data sensitive to the viewing pattern of a user. Responsive to viewing a plurality of video frames of a video file, a navigation profile is captured to document the viewing pattern of the video frames. Specifically, attributes of the video frames are documented such as the frequency of plays of the video frames. Where multiple navigation profiles are captured, the navigation profiles are stored, aggregated, and represented graphically on a display. Additional video may be recommended based on the aggregated data.

Abstract: Embodiments relate to the implementation of configurable rules that automatically monitor large volumes of data stored in a database. Certain embodiments may leverage the high processing power available to the database engine of an in memory database, in order to perform analysis of large data volumes for compliance and other purposes. Particular embodiments may utilize ABAP Database Connectivity (ADBC) to a HANA in memory database available from SAP AG, in order to implement and execute configurable rules in connection with governance, risk, and compliance (GRC) of large volumes of data stored therein. In various embodiments, an analysis engine in the application layer may rely upon the in memory database engine to execute at least some logic of the configurable rules.

Abstract: A data migrating system and method are provided in which a Burst Buffer Network Aggregator (BBNA) process is configured either on the File Servers or on the File System's dedicated I/O nodes to coalesce data fragments stored in participating Burst Buffer nodes under the direction of a primary BB node appointed by a data generating entity prior to transfer of the full data stripe into the File System. The “write” request in the form of a full data stripe is distributed into a plurality of data fragments among participating BB nodes along with corresponding metadata.

Abstract: A system and method for performing sorting. The method includes partitioning a plurality of keys needing sorting into a first plurality of bins, wherein the bins are sequentially sorted. The plurality of keys is capable of being sorted into a sequence of keys using a corresponding ordering system. The method includes coalescing a first pair of consecutive bins, such that when coalesced the first pair of bins falls below a threshold. The method also includes ordering keys in the first coalesced pair to generate a first sub-sequence of keys in the sequence of keys.

Abstract: According to one embodiment of the present invention, a method automatically generates one or more Extract, Transform and Load (ETL) jobs. Input data in a source format and output data in a target format is received. The input data and output data is analyzed to determine properties and relationships thereof. One or more mapping models are automatically generated using the properties and relationships, wherein the mapping models describe the mapping and transformation of the input data to the output data. One or more ETL jobs are generated using the mapping models. Embodiments further include a system and program product apparatus for automatically generating one or more ETL jobs.

Abstract: A target domain name is classified using hash strides including domain name components. The hash strides are fed into a set of bloom filters programmed to identify pre-determined domain name categories. A programmable mapping table is provided for selecting one of many probable classifications.

Abstract: According to one embodiment of the present invention, a method automatically generates one or more Extract, Transform and Load (ETL) jobs. Input data in a source format and output data in a target format is received. The input data and output data is analyzed to determine properties and relationships thereof. One or more mapping models are automatically generated using the properties and relationships, wherein the mapping models describe the mapping and transformation of the input data to the output data. One or more ETL jobs are generated using the mapping models. Embodiments further include a system and program product apparatus for automatically generating one or more ETL jobs.

Abstract: A database system optimizes database queries that comprise subqueries. The database system factors out computation from two or more subqueries to a reusable subquery. The reusable subquery returns a result set. The subqueries are rewritten to use the result set and the database query modified to use the rewritten subqueries. The modified database query performs efficiently since the result set is computed only once for each subquery that uses the reusable query. The database system also composes nested subqueries that compute aggregate values. The database system identifies an inner subquery nested within an outer subquery, each subquery computing an aggregate value. The database system determines a new aggregate function corresponding to a composition of aggregate functions of the inner and the outer queries. The database system determines a composed query using the inner query with the outer query. The composed query uses the new aggregate function.

Abstract: Approaches are described for security and access control for computing resources. Various embodiments utilize metadata, e.g., tags that can be applied to one or more computing resources (e.g., virtual machines, host computing devices, applications, databases, etc.) to control access to these and/or other computing resources. In various embodiments, the tags and access control policies described herein can be utilized in a multitenant shared resource environment.

Abstract: A target domain name is classified using hash strides including domain name components. The hash strides are fed into a set of bloom filters programmed to identify pre-determined domain name categories. A programmable mapping table is provided for selecting one of many probable classifications.

Abstract: An approach for discovery of relevant data in massive datasets. Compare datasets including compare key fields, compare data fields and a core dataset including target data field(s) and core field(s) are received. The compare datasets are categorized into direct and indirect related dataset pools based on the target data field(s) correlation strength with matching compare and core fields. The direct related dataset pool and the core dataset are transformed into reduction datasets based on statistical measure of values of target data fields, shared key fields and compare data fields. Target correlations of the reduction datasets are creating based on a reduction compare and target data fields. Statistical relationship strength of core dataset and the direct related dataset pool are created based on a statistical mean of target correlations and a relevancy data store is created.

Abstract: One embodiment of the present invention provides a computing system, which identifies, for graph clustering, first and second sets of vertices in a graph. A respective vertex in the first set of vertices is an exemplar. A respective vertex in the second set of vertices is not an exemplar and not associated with a vertex identifier. The system assigns a vertex identifier of a first vertex in the first set to a second vertex in the second set based on type and strength of relationship between the vertices. The vertices represent elements in a data set. The vertex identifiers of the first and second vertices do not change before convergence. The system allocates the first vertex and the second vertex to a first vertex cluster associated with the vertex identifier, and detects convergence based on modularity associated with vertex clusters representing information of interest in the data set.