Abstract: A method for providing updates for pieces of content in a deck may include creating, by a processor, a deck. The deck may include a plurality of pieces of content. The method may also include leveraging, by the processor, a part of existing content, existing before creation of the deck, for at least one of the plurality of pieces of content in the deck. The at least one of the plurality of pieces of content in the deck, that leverages the part of existing content, is leveraged content and the part of the existing content is referenced content. The method may additionally include configuring, by the processor, the leveraged content for following the referenced content or ancillary content of the referenced content to obtain updates or notifications of updates to the referenced content or ancillary content.

Abstract: An event processing system for processing events in an event stream is disclosed. The system can execute instructions to receive a continuous data stream related to an application, convert geometry of the continuous data stream into a relation, track a plurality of moving objects in the continuous data stream, determine a relationship between at least a first object and a second object (e.g., a first moving object and a second moving object in the plurality of moving objects) based at least on the geometry of a continuous data stream and the relation. and perform an action based at least one the determined relationship.

Abstract: Techniques for controlling the synchronization of data records between servers and client devices include use of configuration data for each client device to control the times at which the current version of server data records is sent to each client device. The configuration data also controls the times at which modified versions of local data records on the client device are sent to the server. The configuration data additionally indicates one or more control actions that are performed if the data record version associated with user input modifying a data record does not match the current version of the server data record. Control actions may include preventing modification of data records, providing notifications to client devices, and providing the current version of server data records to client devices. In some cases, control actions may include permitting certain types of modifications while preventing other types of modifications.

Abstract: Techniques herein are for fast processing of path-finding queries in large graph databases. A computer system receives a graph search request to find a set of result paths between one or more source vertices of a graph and one or more target vertices of the graph. The graph comprises vertices connected by edges. During a first pass, the computer system performs one or more breadth-first searches to identify a subset of edges of the graph. The one or more breadth-first searches originate at the one or more source vertices. After the first pass and during a second pass, the computer system performs one or more depth-first searches to identify the set of result paths. The one or more depth-first searches originate at the one or more target vertices. The one or more depth-first searches traverse at most the subset of edges of the graph.

Abstract: Systems, methods, and computer program products of distributing sorted sets to multiple nodes of a distributed in-memory database system are described. The distributed in-memory database system is a database system based on key-value pairs. The system receives data records including user data and scores for sorting. The system maps the user data to keys in the key-value pairs. The system maps the scores to the values in the key-value pairs. The system then distributes the mapped key-value pairs to the nodes. The distributed in-memory database system is indexed on the values.

Abstract: A technique restores a file system of a storage input/output (I/O) stack to a deterministic point-in-time state in the event of failure (loss) of non-volatile random access memory (NVRAM) of a node. The technique enables restoration of the file system to a safepoint stored on storage devices, such solid state drives (SSD), of the node with minimum data and metadata loss. The safepoint is a point-in-time during execution of I/O requests (e.g., write operations) at which data and related metadata of the write operations prior to the point-in-time are safely persisted on SSD such that the metadata relating to an image of the file system on SSD (on-disk) is consistent and complete. Upon reboot after NVRAM loss, the technique identifies (i) the most recent safepoint, as well as (ii) the inflight writes that were persistently stored on disk after the most recent safepoint. The data and metadata of those inflight writes are then deleted to place the on-disk file system to its state at the most recent safepoint.

Abstract: A method for encoding documents includes building or otherwise providing a condensed dictionary including identifiers for block headers identified in text blocks extracted from a collection of training documents. For at least one test document a set of text content blocks is identified. For each of the text content blocks in the set, a block header is identified. Each block header in the training and test documents includes a sequence includes no more than a predetermined maximum number of characters. An encoding of the test document is generated, based on the identifiers of the block headers identified in the test document that are in the condensed dictionary.

Abstract: A method for synchronizing data among heterogeneous data sources is disclosed. The method may comprise obtaining a synchronization task and a corresponding operation classification, determining one or more Reader plugins and Writer plugins based on the corresponding operation classification, segmenting the synchronization task based on the one or more Reader plugins and Writer plugins to generate a Task queue, and using a corresponding number of the Reader plugins and the Writer plugins based on the Task queue to implement the synchronization task. The one or more Reader plugins may be configured to read data from a source and to send to the one or more Writer plugins, and the one or more Writer plugins may be configured to write the data to a destination.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating configuration files. One of the methods includes presenting a plurality of configuration types to a user, each configuration type associated with a schema. The methods include the actions of receiving a selection of a configuration type. The method includes presenting a user interface to the user, the user interface including a plurality of fields, at least some of the fields corresponding attributes of the schema. The method includes receiving a plurality of values. The method includes generating a configuration file based on the plurality of values and the schema.

Abstract: A method for managing user information streams associated with recommendation systems based on cognitively counter-matched mined content is provided. The method may include determining and extracting first concepts from mined content. The method may further include determining second concepts associated with the determined and extracted, wherein the second concepts comprise one or more different interpretations of the first concepts. The method may further include determining relationships between the second concepts by analyzing the second concepts using data mining analysis techniques. The method may further include, based on the determined one or more relationships between the sub-concepts, counter-matching the plurality of mined content associated with each second concept. The method may also include providing alternative content to the information streams based on the counter-matched plurality of mined content.

Abstract: A method and system of a data join includes capture of metadata information associated with one of semi-structured data and unstructured data. A flattened structure for one of the semi-structured data and the unstructured data is defined, and an entity is extracted from the unstructured data. Further, one of the semi-structured data and an entity extracted unstructured data are flattened based on the flattened structure, and flattened semi-structured data and flattened entity extracted unstructured data with relational data are joined.

Abstract: An embodiment of the invention pertains to processing messages received from a set of devices. A mapping of message fields to fact table columns is stored in a mapping table of a relational database. The method comprises, for each received message, determining all fields of the received message. If it is determined that the mapping table does not assign a fact table column to each of the determined fields of the message, a new mapping between message fields to respective fact table is automatically stored in the mapping table. A mapping is identified in the mapping table that assigns each of the determined fields of the message to a respective one of the columns of the fact table. The field values of the message are stored in the fact table in accordance with the identified mapping.

Abstract: Embodiments for semantic hierarchical grouping of short text fragments by a processor. Sub-terms are extracted from a plurality of input text fragments according to a lexical sub-term hierarchy. Each of the sub-terms in the lexical sub-term hierarchy are matched with concepts based on an ontology of concepts representing a domain knowledge. The input text fragments are automatically grouped into a hierarchy of concepts based on the matching and a semantical relationship between each concept and matching sub-term.

Abstract: Systems and methods implementing a path resolver facilitating client access to a distributed file system. An example method may comprise: receiving, by a processing device, file identifier comprising a symbolic link; producing, by a user space process being executed by the processing device, a modified file identifier, by replacing a pre-defined sequence of characters within the file identifier by a path to a mount point of a distributed file system; and identifying, in view of the modified file identifier, a data structure comprising information about a file identified by the file identifier.

Abstract: Implementations of the present disclosure include actions of receiving search results that are responsive to the search query, the search results being respectively representative of resources, processing one or more triggering rules based on at least one of the search query and the search results, determining, based on processing the one or more triggering rules, that a set of data records is to be displayed in a search results page with the search results, the set of data records including data records that are specific to the user, determining a display prominence of at least one data record in the set of data records, the display prominence indicating a prominence of the at least one data record when displayed in the search results page, and providing the search results and the set of data records for display, the at least one data record being displayed based on the display prominence.

Abstract: Implementations directed to reducing data flow between an AP, and a RPA platform include receiving, by a platform-specific adapter, a set of data records, providing a data change tuple including an identifier, and a hash value, providing a sub-set of data records from the second set of data records based on comparing hash values of data change tuples to a set of stored hash values, the sub-set of data records including fewer data records than the second set of data records, and each data record in the sub-set of data records including a change indicator, determining, by the platform-specific adapter, a tag for each data record in the sub-set of data records based on a respective change indicator, and transmitting a set of messages to the AP, the set of messages communicating tagged data records of the first set of data records, and the sub-set of data records.

Abstract: Embodiments are described for determining a customer value of a deduplication service. Customer data deduplication ratios are measured over a predetermined period of time in response to one or more events for a storage device. For each event, a deduplication ratio of customer data is stored in association with the storage device, customer ID, and configuration of the storage device. An event is an expiration of the predetermined period of time, or receiving notice of a configuration change of how the storage device is utilized by a customer. A configuration change can be adding or removing a virtual desktop, or adding or deleting one or more types of application data to/from the storage device. The storage deduplication statistics, configuration information are processed and sent to a storage service, with a storage device ID, and customer ID. A customer receives an analysis and statement of account from the storage service.

Abstract: A client application of a content management system provides instructions for synchronizing content items and placeholder items using a local file journal and updated file journal. The client application compares entries in the updated file journal to entries in the local file journal to determine modifications to make to content items or placeholder items stored in a shared content storage directory on the client device. Based on the result of the comparison, the client application replaces placeholder items with content items or replaces content items with placeholder items.

Abstract: The technology disclosed relates to assigning field level security to fields extracted from primary sources on a batch basis and compiled into analytical, read-only databases, for ultra-fast, ad-hoc data exploration and faceted navigation on integrated, heterogeneous data sets. The method includes assigning field level security to the extracted fields by combining user selectable inheritance of field level security from source fields that yield the extracted fields, with pinning of inheritance of field level security for the extracted fields to reference fields in the database sources wherein the reference fields are distinct from the extracted fields.

Abstract: A computerized, bandwidth-reduced system that will reconcile two ordered sets of values such that a series of changes made to the one are reflected in the other by creating defined REMOVE SERIES, SWAP SERIES, INSERT SERIES and CHANGE SERIES for one set of ordered values, transferring the REMOVE SERIES, SWAP SERIES, INSERT SERIES and CHANGE SERIES and using the REMOVE SERIES, SWAP SERIES, INSERT SERIES and CHANGE SERIES to reconcile another ordered set of values.