Abstract: A mechanism is provided for preparing a high-quality data repository. Data and related metadata from a set of data sources are ingested thereby forming a set of unprepared data. The set of unprepared data is transformed based on a set of functions into a set of transformed data. A set of semantic text descriptions that detail the transformation of the set of unprepared data to the set of transformed data is generated using a first set of semantic associations, a second set of semantic associations, and a set of semantic transformation associations. The set of transformed data is tested against one or more governance policies that tracks data lineage to ultimately show that prepared data is in compliance. Responsive to the set of transformed data adhering to the one or more governance policies, a high-quality data repository is automatically built using the transformed data.

Abstract: Provided are a computer program product, system, and method for creating a restore copy from a copy of a full copy of source data in a repository that is at a different point-in-time than a restore point-in-time of a restore request. A repository has a full copy of source data as of a full copy point-in-time and for each of a plurality of point-in-time copies at different point-in-times of the source data, change information indicating changed data in the source data that changed between the point-in-time of the point-in-time copy and a subsequent point-in-time, and changed point-in-time data comprising data in the source data as of the point-in-time of the point-in-time copy indicated in the change information as changed. A point-in-time copy of the full copy is created in response to a restore request and returned as a restore copy to the restore request.

Abstract: The method includes compiling data into mutual information columns, determining mutual information for each pairing of the mutual information columns and creating a matrix using the mutual information, the matrix including a first set of data columns, wherein each of the first set of data columns represents at least one feature of the data. The method further includes computing eigenvalues and eigenvectors of the matrix, ordering the eigenvalues using an absolute value of the eigenvalues, iteratively selecting at least one second set of data columns by successively removing data columns from the first set of data columns based on the ordered eigenvalues, and controlling an operation of an electronic device based on the at least one second set of data.

Abstract: A system and method are described to create and use an Integrated Object Environment (IOE) running in a graph database environment. Uses include storing, revealing and maintaining value and risk of information assets, such as the topology of an analytical infrastructure in query-driven, graph database. A graphical user interface is described to permit importation, viewing, modification and querying in the IOE.

Abstract: Provided are a computer program product, system, and method for using a repository having a full copy of source data and point-in-time information from point-in-time copies of the source data to restore the source data at different points-in-time. The source data is copied to a full copy in the repository. Point-in-time copies are initiated at different point-in-times of the source data. In response to completing each of the point-in-time copies, transmitting to the repository change information indicating changed data in the source data that changed between the point-in-time and the subsequent point-in-time and changed point-in-time data comprising data in the source data as of the point-in-time of the point-in-time copy. In response to a restore request having a restore time, applying the changed point-in-time data from at least one of the point-in-time copies to the data of the full copy to restore the full copy to the restore time.

Abstract: A computer-implemented method, computer program product, and computing system is provided for scoping searches within a website. In an implementation, a method may receiving a search request. The method may also include identifying a location of a search scoping feature within a website hierarchy. The method may further include setting a search scope relative to the search request based on, at least in part, the location of the search scoping feature.

Abstract: A search space can be reduced using a pruned ontology that comprises entities from an initial ontology. A document corpus having a plurality of documents is received for processing. An ontology pruner determines a set of entities in the plurality of documents. For each entity in the set of entities, the ontology pruner determines a link for the entity in the initial ontology. The ontology pruner determines a score for the entity based on information obtained through the link for the entity in the initial ontology. The ontology pruner omits the entity from the pruned ontology if the score is below a predetermined or configurable threshold value.

Abstract: Methods, computer systems, and computer program products are provided for generating one or more condition sets from one or more documents. The method includes recognizing one or more paragraphs in each document having one or more listing and nested paragraphs and generating one or more paragraph trees wherein each node in the paragraph tree corresponds to a paragraph text in the document. The method further includes extracting one or more conditions as a logical formula from each paragraph text comprising a condition expression; and obtaining one or more condition sets written by a set of logical formulas from the one or more extracted conditions, according to a set of child nodes belonging to each common parent node in each of the paragraph trees; generating one condition set used for quality inspection, for each of the one or more condition sets written by the set of logical formulas.

Abstract: Disclosed herein are systems and methods for intelligent metadata management and data lineage tracing. In exemplary embodiments of the present disclosure, a data element can be traced throughout multiple applications, platforms, and technologies present in an enterprise to determine how and where the specific data element is utilized. The data element is traced via a hierarchical key that defines it using metadata. In this way, metadata is interpreted and used to trace data lineage from one end of an enterprise to another.

Abstract: Disclosed aspects relate to analytics engine selection management. A set of reference data may be ingested by a first analytics engine to compile a first set of characteristic data. The set of reference data may be ingested by a second analytics engine to compile a second set of characteristic data. The first set of characteristic data may be compiled for the first analytics engine. The second set of characteristic data may be compiled for the second analytics engine. A set of distinct attributes related to the first and second analytics engines may be determined based on the first and second sets of characteristic data. An analytics engine selection operation may be executed.

Abstract: In one aspect, performance optimization for data persistency in asynchronous replication setups includes creating at a source site of a data replication system, a snapshot (snapshot N) of input/output (IO) requests as part of a replication cycle, computing a delta of snapshot N and a previously created snapshot (snapshot N?1), and transmitting the delta to a target site of the data replication storage system. An aspect further includes storing, at the target site, snapshot N?1 during transmission of the delta, and caching the delta to a non-persistent storage device. Upon determining an occurrence of a loss event at the target site, a further aspect includes transmitting, by the target site, a request to retransmit the delta, retransmitting, by the source site, the delta to the target site, caching the delta to the non-persistent storage device until successful transmission of the delta, and committing the transmitted delta to permanent storage.

Abstract: A method of pre-allocating resources for database provisioning in a private cloud may include determining characteristics of a plurality of databases in a customer's database system. The method may also include grouping the characteristics of the plurality of databases to generate a plurality of database templates that are descriptive of the plurality of databases. The method may additionally include causing resources to be pre-allocated in the private cloud based on at least some of the plurality of database templates. The method may further include receiving a selection of a database template from the plurality of database templates as part of a provisioning request. The method may also include causing a database described at least in part by the database template to be provisioned in the private cloud.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for adjusting search results based on device specific utilities. In one aspect, a method includes determining whether a set of search results are ineligible for an adjustment operation based a query being a navigational query. For each query for which the search results are determined to be eligible for an adjustment operation based on a determination that the query is not a navigational query, the search results are adjusted so that the search results referencing resources in a first proper subset are boosted relative to the search results referencing resources in a second proper subset.

Abstract: Systems and methods are provided for receiving, at a server computer, a plurality of content messages from a plurality of content sources, each content message comprising media content and associated with a predetermined media collection, for each of the plurality of content messages received, analyzing each of the plurality of content messages to determine a quality score for each of the plurality of content messages, and storing each of the plurality of content messages in a database along with the quality score for each of the plurality of content messages.

Abstract: Techniques are described that exclude use of “stop-fingerprints” from media database formation and search query to an automatic content recognition (ACR) systems based on media content fingerprints updated by stop-fingerprint analysis. A classification process is presented which takes in fingerprints from reference media files as an input and produces a modified set of fingerprints as an output by applying a novel stop-fingerprint classification algorithm. Architecture for the distributed stop-fingerprint generation is presented. Various cases, as stop-fingerprints generation for the entire reference database, stop-fingerprints generation for the individual reference fingerprint files, and temporal fingerprint classification obtained through intermediate steps of the temporal fingerprint classification algorithm are presented. A hash-based signature classification algorithm is also described.

Abstract: Techniques are described that exclude use of “stop-fingerprints” from media database formation and search query to an automatic content recognition (ACR) systems based on media content fingerprints updated by stop-fingerprint analysis. A classification process is presented which takes in fingerprints from reference media files as an input and produces a modified set of fingerprints as an output by applying a novel stop-fingerprint classification algorithm. Architecture for the distributed stop-fingerprint generation is presented. Various cases, as stop-fingerprints generation for the entire reference database, stop-fingerprints generation for the individual reference fingerprint files, and temporal fingerprint classification obtained through intermediate steps of the temporal fingerprint classification algorithm are presented. A hash-based signature classification algorithm is also described.

Abstract: Systems and methods for securing sensitive data are presented. The system includes a database that stores multiple data storage schemes, each of which denotes at least one location for storing at least a portion of the sensitive data within a data block object. The system further includes a security controller module comprising a processor and software instructions. When executed by the processor, the processor (a) instantiates a data block object for storing the sensitive data and (b) selects a data storage scheme. Then the processor stores the sensitive data within the data block object according to the data storage scheme. The processor also can provide access to the data block object. After allowing an access, the processor automatically selects another data storage scheme, and morphs the data block object by storing the sensitive data within the data block object according to the newly selected data storage scheme.

Abstract: A management unit existence determination system includes: a query transmitter configured to transmit a first query, in which management unit information indicating a management unit is included, and at least one second query, in which a part of the management unit information is changed is included, which are queries for confirming an existence of the management unit of a file management system, to a determination target apparatus; a receiver configured to receive a response to the first query and a response to the second query from the determination target apparatus; and a determiner configured to determine whether the management unit exists by comparing the response to the first query with the response to the second query received by the receiver.

Abstract: The present disclosure is directed towards systems and methods for efficiently identifying periodic trends of user-defined annotations among users of a social networking system. For example, systems and methods described herein involve grouping a set of digital content items into subsets of digital content items and performing one or more iterations of a clustering algorithm on the grouped set of digital content items to identify one or more temporal clusters of the user-defined annotation. Additionally, the systems and methods described herein involve performing one or more additional iterations of the clustering algorithm on one or more reduced sets of digital content items to identify one or more additional temporal clusters of the user-defined annotation. Further, the systems and methods involve determining that the user-defined annotation is periodic based on a time period between identified temporal clusters.

Abstract: An example method of controlling access to data stored in a plurality of autonomous data sources includes receiving a federated query including a plurality of source queries. The method also includes receiving a request to submit a source query to a target data source. The method further includes determining whether the request matches at least one rule stored in a rules database. A rule that includes a given query matches a request that includes the given query. The method also includes when it is determined that the request does not match a rule stored in the rules database, sending a communication to cause (i) the source query to be submitted to the data source, and (ii) an initial result of the source query to be masked. The initial result of the source query has the same structure as the masked result of the source query.