Abstract: Embodiments of the invention relate to executing graph path queries. A database stores data entities and attributes in node tables and stores links between nodes in an edge table. Edges form a path between a source node and a target node. A source node set is generated and joined with the edge table to produce a first intermediate set. Similarly, a target node set is generated and joined with the edge table to produce a second intermediate set. A result path is generated through a joining of the first and second intermediate paths and application of a length condition.

Abstract: The illustrative systems and methods use a special-purpose volume-replicating server(s) to offload client computing devices operating in a production environment. The production environment may remain relatively undisturbed while production data is replicated to a geographically distinct destination. Replication is based in part on hardware-based snapshots generated by a storage array that houses production data. The illustrative volume-replicating server efficiently moves data from snapshots on a source storage array to a destination storage array by transferring only changed blocks for each successive snapshot, i.e., transferring incremental block-level changes. Periodic restore jobs may be executed by destination clients to keep current with their corresponding source production clients. Accordingly, after the source data center goes offline, production data may be speedily restored at the destination data center after experiencing only minimal downtime of production resources.

Abstract: Embodiments relate to executing graph path queries. A database stores data entities and attributes in node tables and stores links between nodes in an edge table. Edges form a path between a source node and a target node. A source node set is generated and joined with the edge table to produce a first intermediate set. Similarly, a target node set is generated and joined with the edge table to produce a second intermediate set. A result path is generated through a joining of the first and second intermediate paths and application of a length condition.

Abstract: Techniques described herein enable searching for multimedia content and for downloading or scheduling the recording of the multimedia content. The multimedia content may have been previously stored on one or more databases. The client device may download or schedule the recording of multimedia content in one step, for example, in one touch. When desired multimedia content is not available, the multimedia content is added to the client device's wish list. When the client device's does not have a wish list, the client device's wish list may be created on the spot. During the scheduling of the recording, a tag associated with the multimedia content is checked to determine whether the multimedia content is live or delayed. When the tag indicates the multimedia content is live or delayed, the client device prompts with a suggestion to add extra time to the end of the recording of the multimedia content.

Abstract: Certain example embodiments relate to techniques generating a database of virtual families for real-time generation of part numbers for configurable products. For instance, certain example embodiments may include receiving a search request for part numbers and determining virtual families including entities matching the search request. The number of matching products matching the search request and the part numbers may be determined based on the virtual families and the independent groups stored in the virtual families that match the search request. The part numbers may be determined based on allowed characters, number and/or symbols for the part number positions defined in the independent groups of the virtual families including the entities matching the one or more configurable properties of the user input search request. Facet counts for the configurable product may also be determined based on the results of the user input search request.

Abstract: Systems, methods, and computer-readable storage media are described for processing data change request. In one exemplary embodiment, a computer-implemented method receives one or more requests in a software production environment for one or more data changes to data from a requestor. The method executes the request(s) in a rollback mode. The method generates a snapshot of the executed request(s). The method also transmits the snapshot to an approver. In response to an approval of the snapshot from the approver, the method also executes the request(s) in a commit mode.

Abstract: An example operation may include one or more of storing, via a master chain, partition information that links together storage across a plurality of blockchains, receiving a request to execute a blockchain transaction from a client, determining whether the blockchain transaction is associated with data stored on one blockchain or data stored separately on different blockchains based on the partition information stored on the master chain, and, in response to a determination that the blockchain transaction is associated with data stored separately on different blockchains, identifying, via the master chain, a location of each blockchain from among the different blockchains and transmitting the locations to a system configured to perform the blockchain transaction.

Abstract: A catalogue system automatically detects changes to configuration file at a service application. Based on the changes to the configuration file(s), the catalogue system stores mapping data that identifies a resource item type that can be processed by the service application and one or more user actions that are available for processing resource items of the resource item type. The techniques thus provide for dynamic interaction with service applications.

Abstract: The present disclosure relates clustering similar data records together in a hierarchical clustering scheme. Each tier in a cluster corresponds to a minimal match score, which reflects a degree of confidence. In this respect, a higher confidence may lead to smaller sized clusters while a lower confidence may lead to larger sized clusters. Ordinal classification may be used to generate hierarchical clusters. In some embodiments, hierarchical clustering with conflict resolution is used to resolve user-defined hard conflicts in each tier of the clustering results.

Abstract: In data processing device incorporating a processor and memory in communication with the processor, the memory includes executable instructions that, when executed by the processor, cause the data processing device to perform: receiving an attribute metric of a first node with respect to a plurality of second nodes; generating, based on the received attribute metric, a pool of the second nodes that have been in a relationship with the first node; ranking, based on the received attribute metric, the second nodes in the generated pool; dynamically grouping the second nodes to sequentially create one or more level groups; and displaying, on a display, the level groups in a visually differentiated manner reflecting a relative attribute metric of each level group. The device thus presents a display of level groups that is neither cluttered nor sparse.

Abstract: Disclosed are systems and methods restoring a computing system. The described method includes receiving a delta disk that was generated based on a backup of a computing device executing a protected application. The delta disk comprises one or more configurations for executing the protected application on a different device than the computing device. In response to a request to perform recovery of the computing device, a recovery virtual machine (VM) is created having a base virtual disk emulated from the backup. The recovery VM is modified by attaching the delta disk having the one or more configurations for executing the protected application. Execution of the protected application on the recovery VM is resumed.

Abstract: A non-transitory computer-readable storage medium storing a program that causes a computer to execute a processing, the processing including identifying, by a plurality of processes, at least one candidate for a record separation point from text data in each of a plurality of divided files, detecting, from the text data in the plurality of divided files, a text region indicating one data value based on a detection result of predetermined format code, determining that the at least one candidate that is not included in the text region is a record separation point, and transmitting a plurality of partial texts corresponding to the pieces of record data to one or more processes that transforms the plurality of partial text into a record format data, each of the plurality of partial texts being extracted from the plurality of divided files based on the determined record separation point.

Abstract: A method, a computer system, and a computer program product for selecting electronic documents based on an expertness level for a target keyword. The method includes identifying a Lowest Common Ancestor (LCA) for each pair of categories to which documents in a document set belong based on a graph having edges which define relationships between nodes representing respective ones of the categories, the document set being associated with a target keyword, obtaining a degree of dispersion of the categories based on respective distances between the categories of each pair and the corresponding LCA, determining an expertness level for the target keyword based on the degree of dispersion, and in response to receiving a search query including the target keyword, selecting one or more documents from a database based on the expertness level for the target keyword.

Abstract: A computer implemented method for incorporating multiple objectives in a ranked list of search results includes receiving a search query from a client device, accessing a set of stored listings for goods or services and probabilities of serving the listings, defining a serving vector as a probability distribution over the set of listings, providing a serving vector as input to a multi-objective function, decomposing the multi-objective function into one or more objective functions, generating a ranked list of the listings based at least in part on the serving vector that maximizes the decomposed multi-objective function, and providing the listings to the client device according to the order of the ranked list. Each objective function addresses a different goal in an overall diversity optimization.

Abstract: A dialogue management system applies hierarchical classifiers and other natural language processing to dialogue input, and determines whether performance of an action is likely to occur. The dialogue management system may process dialogue input to assess a dialogue participant's current position in various hierarchies or other classification schemes associated with performance of a desired action. The system may then present results of the assessment to another dialogue participant or provide the results to another system. In some embodiments, the dialogue management system may automatically generate responses or questions designed to engage a dialogue participant and cause the participant to progress through the levels of a hierarchy toward performance of a desired action.

Abstract: Various embodiments provide for associating a collection of media items with a graphical element. For instance, a system can: generate corpus data from a set of features of a collection of media content items; determine a set of candidate graphical elements for the collection of media content items based on the corpus data and further based on a set of first mappings associating at least one graphical element and at least one n-gram; determine a set of prediction scores corresponding to the set of candidate graphical elements based on the set of features; determine a ranking for the set of candidate graphical elements based on the set of prediction stores; select a set of predicted graphical elements, from the set of candidate graphical elements, based on the ranking; and provide the set of predicted graphical elements in association with the collection of media content items.

Abstract: Provided are techniques for supporting a join operation against multiple NoSQL databases. A search request with a field and a value for the field is received, wherein the search request is to be issued against a plurality of database divisions formed from NoSQL databases. A simple database search is performed against a structured index to generate a first result set. An extended database search is performed against a linear database division index to generate a second result set by: identifying a relationship for the field that identifies related fields and identifying documents for the field and the related fields using a linear database division index. The first result set and the second result set are merged to form a merged result set of documents. The documents from the merged result set are displayed in response to the search request.

Abstract: Various systems are provided for optimizing the searching of a graph for a portion that matches a pattern is provided. A Graph Search Optimization System (“GSOS”) provides various techniques for reducing the computational expense when searching for patterns within a graph. The GSOS provides techniques that include an edge-count directed (“ECD”) system, a derived constraint (“DC”) system, and a sorted property (“SP”) system. The ECD system matches a pattern in a direction based on the number of edges for that direction. The DC system derives a single-element constraint from a multi-element constraints to avoid having to check multiple elements. The SP system processes edges of a graph in a sorted order based on the value of a property of the edges.

Abstract: Systems, methods, and non-transitory computer readable media are provided for mapping device identifiers. Service event information of a first set of devices and a second set of devices may be obtained. The service event information may identify sets of device identifiers, sets of timestamps associated with the sets of devices, and sets of addresses associated with the sets of devices. A timestamp and an address of a device of the first set of devices may be identified and a time window may be determined based on the timestamp. Device identifiers of the second set of devices may be identified based on a comparison of the address with addresses of the second set of addresses that are associated with timestamps within the time window.

Abstract: [Object] To utilize various devices more effectively by organizing such devices. [Solution] Provided is an information processing apparatus including: a device log acquisition unit configured to acquire a device log including information indicating a state caused by behavior of a user related to each of devices from each of the devices; and a correlation determination unit configured to determine a correlation between certain devices included in the devices on the basis of the device logs and a preset condition of the states.