Abstract: The present invention provides a method for generating customizable and encapsulated media files, said method comprising: determining at least one media unit for encapsulation, each media unit comprising a basic media content. For each of said determined media unit, defining multiple data layers, each layer being associated with a different data type, wherein said defining of said layers comprises: defining media objects of each media unit, defining properties of each defined media object, defining customization rules for said determined at least one media unit, defining dynamic motion rules for at least one of said defined media objects and creating an encapsulated media file containing the at least one media unit and data layers thereof, said encapsulated media file being configured for de-capsulation thereof for playing content thereof, according to the defined layers thereof.

Abstract: A method, system and computer program product for generating answers to questions. In one embodiment, the method comprises receiving a query, conducting a search through one or more data sources to identify candidate answers to the query, and providing each of the candidate answers with a preliminary score. The method further comprises filtering out any of the candidate answers with a preliminary score that does not satisfy a defined condition. The candidate answers having preliminary scores that satisfy this condition form a subset of the candidate answers. Each of the candidate answers in this subset is processed to produce further scores. A ranking function is applied to these further scores to determine a ranking for each of the candidate answers in the subset; and after this ranking function is applied, one or more of the candidate answers are selected as one or more final answers to the query.

Abstract: Disclosed herein are systems and methods for point-based relation splitting in geospatial-function-implied interval joins. In an embodiment, a data platform receives a query that applies a geospatial-function predicate to first and second geography data objects from first and second relations. The second relation is divided into point and non-point subsets based on the second data geography object. The data platform routes the point subset along a first path that includes a one-sided interval join that applies, to the first relation and the point subset, an interval-join predicate implied by the geospatial-function predicate. The data platform routes the non-point subset along a second path that does not include the one-sided interval join. The data platform obtains query results at least in part with a filter that applies the geospatial-function predicate to outputs of the one-sided interval join and the second path, and outputs the query results.

Abstract: Aspects of the present invention disclose a method, computer program product, and system for analyzing change stream data. The method includes identifying, by one or more computer processors, a list of changes in a replication stream. The method further includes determining, by one or more computer processors, if one or more changes in the list of changes matches a criteria for a hint. The method further includes in response to determining that one or more of the changes in the list of changes matches the criteria for a hint, inserting, by one or more computer processors, the hint into the list of changes prior to a first change of the one or more changes that triggers a match in criteria.

Abstract: Systems and methods for synchronizing database operations with a distributed blockchain are disclosed. The database operations are performed on a database that is shared between multiple users including a first user. Exemplary implementations may: receive database information reflecting one or more database operations performed by the first user on a first version of the database; verify whether the one or more database operations are allowed to be performed by the first user; record on the distributed blockchain, responsive to the verification being affirmative, a message that describes or refers to a description of one or more modifications to the database; effectuate transmissions of notifications to the first version of the database; subsequent to the transmissions, propagate or revert the one or more database operations, based on the verification result.

Abstract: Embodiments are directed to managing data in a file system. An object from the file system that has parent objects may be provided. A snapshot in a current epoch may be generated such that the first snapshot may be based on the object and descendants of the object. A coverage set may be provided for the object that references the snapshot and also references each other snapshot that includes the parent objects. Read-only access to a version of the object may be provided based on a correspondence of the version and a snapshot referenced by the coverage set of the object. A coverage engine compares the update to a coverage update epoch (cue) associated with the parent objects. The coverage engine updates coverage sets of the parent objects based on grandparents of the object.

Abstract: Systems and methods for dynamically creating collaborative teams and managing collaborative work of a team are generally disclosed herein. One example embodiment includes the dynamic creation of a collaborative team by creating an association between team members via a managing module. The managing module may be capable of managing, among other things, team members on a team, tasks and goals of each member of the team, as well as documentation associated with the team. In some embodiments, the managing module may use a chat or messaging protocol to manage collaborative modifications to documents of the team.

Abstract: Provided are a system, method and computer program product for redistribution of data in an online shared nothing database, said shared nothing database comprising a plurality of original partitions and at least one new partition.

Abstract: Systems and methods for determining whether two tree persons in a genealogical database correspond to the same real-life individual. Embodiments include obtaining, from a tree database, a first tree person from a first genealogical tree and a second tree person from a second genealogical tree. Embodiments also include identifying a plurality of familial categories. Embodiments further include, for each familial category of the plurality of familial categories, extracting a first quantity of features for each of the tree persons in the familial category, generating a first similarity score for each possible pairing of tree persons, identifying a representative pairing based on a maximum first similarity score, and extracting a second quantity of features for each of the tree persons in the representative pairing. Embodiments may also include generating a second similarity score based on the second quantity of features.

Abstract: Techniques are disclosed for implementing a unified partitioning scheme within distributed database systems to allow a table to be horizontally partitioned and those partitions stored on and serviced by a storage group. A storage group is a subset of storage manager (SM) nodes, and each SM node is configured to persist database data in durable storage. The distributed database system assigns each storage group to a subset of SM nodes. The distributed database system can address each storage group using a symbolic mapping that allows transactions to identify a particular storage group, and to direct read and write operations to a subset of SM nodes servicing that storage group. An administrator can update this mapping on-the-fly to cause the distributed database system to dynamically adjust an implemented partitioning scheme without necessarily interrupting on-going database operations.

Abstract: A method of searching tree-structured data can be provided by identifying all labels associated with nodes in a plurality of trees including the tree-structured data, determining which of the labels is included in a percentage of the plurality of trees that exceeds a frequent threshold value to provide frequent labels, defining frequent candidate sub-trees for searching within the plurality of trees using combinations of only the frequent labels, and then searching for the frequent candidate sub-trees in the plurality of trees including the tree-structured data using a plurality of pruning kernels instantiated on a non-deterministic finite state machine to provide a less than exact count of the frequent candidate sub-trees in the plurality of trees.

Abstract: A method and system for provenance-based data backups. Specifically, the method and system disclosed herein entail generating and, subsequently, using data provenance to filter which collections of data, produced through the data mining of big data, should be replicated and stored in backup storage.

Abstract: A selective PEG algorithm, creating a sparse matrix while maintaining row weight/column weight at arbitrary multi-levels, and in the process, inactivating an arbitrary edge so that a minimum loop formed between arbitrary nodes is enlarged or performing constrained interleaving, so that encoding efficiency in the case where a matrix space is narrow is improved.

Abstract: Example embodiments relate to providing real-time monitoring and analysis of query execution. In example embodiments, a query plan is obtained for a database query that is scheduled for execution in a database. A query tree is then generated based on the query plan, where the query tree includes operator nodes that are associated corresponding operators in the query plan. At this stage, performance metrics are collected from the database during the execution of the database query. Next, the query tree is displayed with the performance metrics, where a related portion of the performance metrics are displayed in each of the operator nodes.

Abstract: A framework for memory optimization of database indexes, and in particular for aging full-text index data, is described herein. In one embodiment, if, while a database table is aged, there are index tables associated with the database table, the associated index tables are automatically aged. This way, the system memory footprint will be reduced, leading to reduced cost as less system memory is required to perform remaining operations, and leading to increased performance as more system memory is available for other operations.

Abstract: A method for providing computer-related support to an end user is described. The method includes receiving, from a mobile device, an image of a user-readable message that is displayed by a computing device. The method also includes identifying one or more solutions using text extracted from the image of the user-readable message. The method further includes sending the one or more solutions to the mobile device for display on the mobile device.

Abstract: The present disclosure provides a search method and device based on artificial intelligence and an electronic device. The search method based on artificial intelligence includes: obtaining a query; performing a word segmentation on the query to obtain a term sequence containing a plurality of terms; performing a structured analysis on the term sequence to generate a semantic pattern; performing a knowledge-based analysis on the term sequence based on the semantic pattern to generate a semantic analysis result; determining an understanding result corresponding to the query based on the semantic pattern and the semantic analysis result; and performing a search based on the understanding result corresponding to the query.

Abstract: A method, computer program product, and system for providing cross-lingual search results that retain cultural context include a processor(s) monitoring (with user permission) computing activities performed by the user, via a client. The processor(s) analyzes the computing activities to identify data comprising elements relevant to the user and relationships between the elements and the user. The processor(s) generates a data structure comprising the data. The processor(s) generates a search interface for obtaining entries in a first language to perform a query; the entries are search parameters embedded with a portion of the elements. The processor(s) obtains an entry in the first language. The processor(s) extracts the portion of the elements from the entry (cultural context for the entry). The processor(s) determines target languages for data responsive to the query. The processor(s) translates the search parameters and the cultural context into the target languages and executes searches on databases.

Abstract: An illustrative embodiment of a computer-implemented method for correlating artifacts between a versioned domain and an un-versioned domain, generates metadata having attributes of both of the versioned domain and the un-versioned domains, for an artifact in a set of artifacts; creates an instance using a specific version of a versioned artifact definition, wherein the instance comprises a first part directly created from the versioned artifact definition and a second part created from an un-versioned artifact definition; specifies linkages between a respective representation of the artifact in the versioned domain and the un-versioned domain; provides a set of facades through which a selected one of author, execute and update instances of the artifact is performed using either the versioned domain or the un-versioned domain; and correlates all versions of the artifact definition to a single un-versioned definition.

Abstract: Methods and systems for generating a database index and searching the database index are described herein. In one aspect this may include receiving an item of database data, wherein the item of database data comprises a sequence of data elements. Groups of data elements may be identified within the received item of database data. If any one or more of the identified groups of data elements have not been previously identified within the item of database data and/or previous items database data then the one or more identified group may be stored as index entries in a database index. Information describing the sequence of the groups of neighbouring data elements may be recorded within the database index as they are located within the item of database data. The database index may be searched based on a received search term comprising a sequence of data elements.