Abstract: Embodiments regard maintaining data consistency between transactional and non-transactional data stores. Embodiments may include receiving a request to archive a set of data stored in a first data store, recording a high water mark in the first data store for the set of data, and archiving the set of data. Archiving the set of data may include copying the set of data into a second data store and inserting a high water mark for the set of data in the first data store and the second data store. Embodiments may further include updating a reference high water mark upon successful completion of operations for the archiving of the data, the reference high water mark representing completion of a last successful archive operation, and, upon receiving a query for requested data contained in the first or second data store, determining whether to allow viewing of the requested data based at least in part on a current value of the reference high water mark.

Abstract: A cohort service is configured to address the technical problem of providing recommendations to a member of an online connection network system in a manner that alleviates potentially excessive cognitive load associated with presenting recommended entities indiscriminately as a scrollable list. The cohort service is configured to visually surface recommended relevant entities already grouped as cohorts. A cohort is a grouping of entities based on one or more common attributes, such as, e.g., same school, same company, etc. The cohort service is designed to group recommendation results into cohorts at the server side, which increases the liquidity and the relevance of the recommended entities so that the already grouped recommendations can be sent to the client computer system for presentation to a viewer.

Abstract: Systems and methods for content management are disclosed. A content management system may include a data sourcing and data streaming engine configured to aggregate content data from data sources, a trend detection and monitoring engine configured to match data sources with content management metadata and to provide relevance scoring of the content data, and a trend recommendation and visualization engine configured to present to a user (e.g., content reviewer or subject matter expert), through a graphical user interface, an output comprising a relevance score and relevant trend, topic, and/or data source information, and to receive from the user through the graphical user interface input and/or activity. The data sourcing and data streaming engine, the trend detection and monitoring engine, and/or the trend recommendation and visualization engine may be updated with the input and/or activity for processing subsequent content data.

Abstract: A method, system, and computer program product for graph-based searching for one or more data streams is disclosed. A computer-implemented method comprises extracting a plurality of tuples from one or more data streams. The method further comprises generating a graph for the plurality of tuples in which a node represents a tuple of the plurality of tuples and an edge represents a correlation between the node and another node, and the edge is generated based at least partly on one or more predetermined queries for the one or more data streams. The method further comprises traversing the graph based on the one or more predetermined queries. Accordingly, embodiments of the present disclosure can improve the search speed by use of the graph-based searching for one or more data streams.

Abstract: Systems and methods for intelligently pre-fetching data for input controls are disclosed. In particular, the disclosed systems and methods predict whether an input control is likely to be edited and only pre-fetches data for the input controls that have a high likelihood of being edited. This way, the presently disclosed systems and methods not only reduce latency in displaying recommended data results for input controls that are likely to be edited but also reduces the number of calls made to the backend server to retrieve the data as the data is not retrieved for all rendered input controls, but only the ones that are likely to be edited.

Abstract: Techniques related to a domain-specific language for transformations are disclosed. A server computer may process a table definition composed in a domain-specific language. The table definition may include a sequence of one or more transformations to be performed on one or more source tables to generate a target table. The sequence may include a customized transformation. A source dataset may be provided as input to an implementation of the customized transformation. An output dataset may be generated as a result of executing the implementation. An intermediate table may be generated based on performing at least one transformation on a particular source table. A supplemental portion for the intermediate table may be generated based on performing the at least one transformation on an appended portion of the particular source table. The target table may be generated based on combining the supplemental portion with the intermediate table.

Abstract: Method, device, and system for peer-to-peer data replication are provided. The method includes: generating a first commit redo record attached with a CSN when a first write operation happens on a first physical entity in a master node, wherein the master node is preset with the first physical entity and a second physical entity and is connected to a first subscriber node and a second subscriber node; pushing, the first commit redo record to a first subscriber node corresponding to the first physical entity based on mapping relationships between the physical entities and the subscriber nodes, wherein the first commit redo record is used for replicating data of the first write operation from the master node to the first subscriber node, and then to the second subscriber node through pushing, by the first subscriber node, the received first commit redo record to the second subscriber node.

Abstract: The amount and variety of data being generated is becoming too extreme for many computing systems to process, and is even more difficult for information systems to provide relevant data to users. A distributed computing system is provided that includes server machines that form a data enablement platform. The platform includes: a plurality of data collectors that stream data over a message bus to a streaming analytics and machine learning engine; a data lake and a massive indexing repository for respectively storing and indexing data; a behavioral analytics and machine learning module; and multiple application programming interfaces (APIs) to interact with the data lake and the massive indexing repository, and to interact with multiple applications. The multiple applications are command cards, and each command card includes a directive module, a memory module, search bots, and behavior bots that operate at least within the data enablement platform.

Abstract: Disclosed are systems and methods preventing data loss of confidential data in a computer system. The described technique includes searching text data for one or more keywords, and then calculating a density of keywords in the text data based on the one or more keywords that match the text data. The technique classifies the text data as containing confidential data based on whether the density of keywords exceeds a threshold value. If so, the described systems may block the use of the text data containing confidential data in a variety of ways.

Abstract: A method for attracting users to a web page is disclosed. A list of keywords relevant to the web page is defined at an operator interface. Each keyword of the list of keywords is independently submitted to a search engine. A result page is received for each keyword. A plurality of information elements is extracted from each result page. A score is calculated for each keyword based on the plurality of information elements extracted from each result page. At least one most attractive keyword is selected from the list of keywords, the selection being based on at least one best score among the scores for the keywords of the list. The at least one most attractive keyword is output on the operator interface as a recommendation for updating the web page to include the at least one most attractive keyword. A server implementing the method is also disclosed.

Abstract: A computed-implemented method is provided for generating object storage datasets from file datasets. The computed-implemented method includes analyzing entries of a file system to identify a file and checking the file against at least one policy. In response to identifying a match between the file and the at least one policy, details of a container are updated. A symbolic link to the file is created to allow access of the file by an object-based client. Updating the details of the container includes updating a database such that the database identifies at least one of the created symbolic link and the details of the container.

Abstract: A method, computer program product, and a system where a processor(s), subject to obtaining permission, monitors browsing activity of an application browsing sources, including analyzing the sources to identify keywords and calculate densities of the keywords in content accessed at the sources. The processor(s) retains the keywords and the densities of the keywords in the content accessed at the sources in an historical record. The processor(s) downloads a resource of data and metadata from a source. The processor(s) updates the metadata of the resource based on keywords and densities of the keywords in the resource and source. The processor(s) determines a destination for the downloaded resource, based on selecting the destination comprising a highest percentage of attributes matching the updated metadata.

Abstract: Technologies are described for facilitating transaction processing within a database environment having a coordinator node, a first worker node, and at least a second worker node. The first worker node sends a request from to the coordinator node for at least a first synchronization token maintained by the coordinator node. The first worker node receives the at least a first synchronization token from the coordinator node. The first worker node assigns the at least a first synchronization token to a snapshot as a snapshot ID value. The snapshot is executed at the first worker node. The first worker node forwards the snapshot ID value to the at least a second worker node.

Abstract: Disclosed are methods and systems that help to visualize large groups of documents in a virtual reality or augmented reality environment comprising a three-dimensional (3D) space. An example method involves a computing device: determining a group of elements based at least in part on the one or more input parameters; determining one or more attributes based at least in part on the one or more parameters, the group of elements, or both; determining, for each element from the group, a respective location in a 3D space, based on one or more of the attributes; displaying a 3D graphical environment representing the 3D space, wherein each element from the group is represented in the 3D graphical environment by a graphic object at its respectively determined location in the 3D space; and enabling user interaction with the graphic objects in the 3D graphical environment.

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: In an example embodiment, a solution is used to provide container volume replication via a container storage replication log and volume buffer synchronization, which is built on top of a container cloud platform whose container metadata and replication runtime configuration are all managed by a storage manager (a service orchestrated by its job scheduler and service orchestrator). This container volume replication ensures the data security for a long-running service in the container. In the case of any disaster, the in-memory database and application data inside of the container can be recovered via volume replication. This provides container volume replication for long-running containerized applications whose states keep changing.

Abstract: A computer-implemented method for managing data objects stored in a data repository and displaying elements associated with data objects on a graphical user interface is presented. The method includes using reusable logic to provide at least one displayed input element associated with a first data object stored in the data repository. In response to user input associated with the displayed input element, the method includes generating a second data object stored in the data repository, and linking the second data object with one or more related data objects in the data repository automatically based on the data object associated with the displayed element.

Abstract: In certain instances, a data management application (software application) that manages moving data files, and the like, from a primary high-speed storage system. An end-user can configure the data management application for particular files via management policies. Based on the management policies, after a file is migrated from the primary storage system to a targeted secondary storage system, a breadcrumb pointing to a webpage for the migrated file is left behind in the primary storage system. The webpage can be used to manage the migrated file, such as moving the migrated file back to the primary storage system.

Abstract: In an example, an indication of a plurality of different entities in a social networking service is received, including at least two entities having a different entity type. Then a plurality of user profiles in the social networking service are accessed. A machine-learned model is then used to calculate, based on co-occurrence counts reflecting a number of user profiles in the plurality of user profiles in which corresponding nodes co-occurred, a similarity score between a first node and second node by computing distance between the first node and the second node in a d-dimensional space on which a plurality of entities are mapped, the similarity score generated using a generalized linear mixed model having a global coefficient vector applied to global function pertaining to the co-occurrence counts and a first random effects coefficient vector applied to a random effects per-country function.

Abstract: The present disclosure relates generally to a data integration system that integrate an object based data integration tool, such a GUI-based data integration tools, with version control systems using a relational database repository for persistence. Examples of distributed version control systems include Git, Mercurial, and Bazaar, and examples of centralized version control systems include Subversion, CVS etc. in centralized or distributed environments.