Abstract: A trouble information search method includes, storing information on a circuit component, information on a use state of the circuit component, and trouble information on the circuit component, receiving input of information on a circuit component and information on a use state of the circuit component, identifying information on a trouble that has occurred with a circuit component having detailed information similar to detailed information on the circuit component and a circuit component for use in a state similar to a use state of the circuit component, and outputting information on the identified trouble.

Abstract: Systems, methods, and devices for incrementally refreshing a materialized view are disclosed. A method includes generating a materialized view based on a source table. The method includes merging the source table and the materialized view to generate a merged table to identify whether an update has been executed on the source table that is not reflected in the materialized view. The method includes, in response to detecting an update made to the source table that is not reflected in the materialized view, applying the update to the materialized view.

Abstract: Described is a system and method that provides a data protection risk assessment for the overall functioning of a backup and recovery system. Accordingly, the system may provide a single overall risk assessment score that provide an operator with an “at-a-glance” overview of the entire system. Moreover, the system may account for changes that occur over time based on leveraging statistical methods to automatically generate assessment scores for various components (e.g. application, server, network, load, etc.). In order to determine a risk assessment score, the system may utilize a predictive model based on historical data. Accordingly, residual values for newly observed data may be determined using the predictive model and the system may identify potentially anomalous or high risk indicators.

Abstract: A computer-implemented method for determining a crowdsourced association between a first user identifier, and a second user identifier for a user of a service accessible over a network. Service data are searched to identify users of the service having a potential association with the first user identifier. Users of the service are invited in turn to select one of the identified users in relation to the first user identifier. A tier of linkage is determined, from at least two defined tiers, between a user making the selection and the selected user. A vote is recorded, of the determined tier, for the selection. A threshold is assigned to votes according to the tier of linkage so that if the votes of at least one of the defined tiers achieves its assigned threshold, it may be determined whether the first user identifier is associated with the respective second user identifier.

Abstract: Techniques for analyzing an execution of a query statement based on a random archive are disclosed. A plurality of query statements that are executed during a particular time period are identified. A random sampling function is executed to randomly select a set of query statements from the plurality of query statements. Execution plans and/or performance metrics associated with each execution of the randomly-selected query statements are stored into a random archive. Responsive to determining that a performance metric for a current execution of a particular query statement does not satisfy a performance criteria, information associated with the particular query statement from the random archive is analyzed. A model plan characteristic associated with an execution of the particular query statement stored in the random archive is determined. An execution plan associated with the model plan characteristic is determined for another execution of the particular query statement.

Abstract: Aspects described herein may relate to methods, systems, and apparatuses that partitions searchable content and distributes the segments across a plurality of processing nodes, which in turn further sub-partitions the partitions for processing by local search actor in order to increase the speed with which a search request from a user is processed. Processing nodes available to receive partitioned searchable content are registered with an external storage device. The external storage device also maintains a global results collector that compiles results from the partitions of searchable content. Respective local collector actors receive compiled results from local search actors for a processing node and the compiled results are sent to the global results collector for compiling for the plurality of processing nodes. Results of the user search request are then provided to the user.

Abstract: According to an aspect, searching, recommending, and exploring documents through conceptual associations includes a method for receiving a plurality of documents and extracting concepts from each of the documents. A degree of relation between each of the documents and concepts in a knowledge base is calculated. The method also includes, in response to receiving a query, determining one or more concepts from the query. For each of the concepts, a list of documents having a highest degree of relation to the concept is retrieved. The method also includes outputting a list that is responsive to the one or more retrieved lists.

Abstract: Various embodiments describe a segmentation application that uses a predictive model to segment content from instruction manuals. In an example, the segmentation application receives training data including training labels and steps available from instruction manuals. The segmentation application trains a predictive model based on the training data and a loss function. The training includes generating, by the predictive model, a prediction of whether the sub-step is the start of the step and minimizing the loss function based on comparison of the prediction to the training label. Upon completion of the training, the segmentation application identifies electronic sources and a start indicator indicating a start of a specific step. The segmentation application provides, in response to a query about an object from a client device, a step generated from the start indicator.

Abstract: Through a first processing thread, a first database is accessed via a first API to retrieve a list of event objects of the first database. Through a second processing thread, for each of the event objects, participant identifiers (IDs) are determined from the event object. For each of the participant IDs, a domain ID is extracted from the participant ID. A list of one or more entity objects are identified based on the domain ID, where the entity objects are stored in a second database such as a task database storing and managing many tasks. At least one attribute of at least one of the entity objects is modified based of the participant ID and the domain ID, which generates a modified entity object. Through a third processing thread, any event objects that have been modified are transmitted to the second database via a second API over the network.

Abstract: Technologies are described for facilitating transaction processing in a distributed database environment. A database client sends database operations to a slave node, which mediates execution of the transaction. A connection between the database client and the slave node is associated with an identifier, and the transaction has an identifier. The database client sends a commit request to a master node over a network connection between the master node and the database client. The commit request includes the transaction identifier. The commit request can also include an indication of database nodes executing operations in the transaction.

Abstract: Optimization of job execution includes generating a hash tree for an initial dataset, executing a data processing job against the initial dataset, the job including a set of calculations against data of the records of the initial dataset, generating, based on a modification to the initial dataset to produce a modified dataset, a hash tree for the modified dataset, comparing the hash tree for the initial dataset to the hash tree for the modified dataset, and identifying one or more blocks of the modified dataset that are updated compared to the initial dataset, and re-executing the job against the modified dataset. The re-executing performs only those calculations that use data of the records of the one or more blocks that are updated compared to the initial dataset, and does not perform other calculations that do not use data of the records of the one or more blocks.

Abstract: Data retrieval can be managed in a data grid. For example, a computing device can receive a write command from a second node in the data grid, the write command being for storing a second version of data. In response to the write command, the computing device can use a database to determine that a first version of the data is to be locally served by a first node in the data grid. The computing device can then transmit a communication that causes the first node to switch from (i) locally serving the data, to (ii) obtaining and serving the second version of the data from a remote node, such as the second node. The computing device can then update the database to indicate that the second version of the data is to be locally served by the second node.

Abstract: Optimization of procedures for enterprise applications can take both declarative query statements and imperative logic into account in a unified optimization technique. An input procedure can implement complex analytical queries and also include iterative control flow logic such as loops. Alternative query execution plans for the procedure can be enumerated by moving queries out of and into loop boundaries via hoist and sink operations. Program correctness can be preserved via excluding some operations via dependency graphs. Sink subgraphs can also be used. Query inlining can also be supported, resulting in synergies that produce superior execution plans. The computing execution resource demand of the respective alternatives can be considered to arrive at an optimal query execution plan that can then be used to actually implement execution of the procedure. Execution performance can thus be greatly improved by performing counterintuitive optimizations.

Abstract: In accordance with an embodiment, described herein are systems and methods that enable client-side calculation with data provided at a multidimensional or other database server. Data provided at the server in accordance with a server-side model, can be transformed/prepared into a grid, for use with a client-side application, for example a client spreadsheet application. During preparation of the grid, one or more portions of the grid that are identified as client-side dynamic parameters, can be represented as dynamic formulas that are modifiable within the client-side application; while parameters of the server-side model that are outside of the grid can be represented as constant values. The grid provided to the client can be used to perform client-side calculations that allow for rapid calculations in response to changes in the client-side model, without introducing a round-trip performance lag between the client-side and server-side.

Abstract: In a method for evaluating a performance of a recommender system, a session of M content items consumed by a user can be identified. The session can be defined such that, for each of a first (M-1) content items in the session, a delay time between a completion of consumption of one of the first (M-1) content items and a commencement of consumption of a directly next content item in the session is less than a predetermined duration of time. Content items in a content item-base can be ranked, based on the first (M-1) content items, according to a likelihood of each content item in the content item-base to be consumed next. A session metric can be generated for each content item in the content item-base. The recommender system can be trained based on the session metric for the Mth content item.

Abstract: A system for querying web pages to validate entity names is disclosed. The disclosed system receives a request for validating an entity name. The system identifies a search web link based on the information in the request. The system converts the request to a format appropriate for a search web page corresponding to the search web link. Then, the system sends the formatted request to the search web page via the search web link. The system receives a result web page and extracts a set of result entity names. The system then computes a hash value for the entity name in the request and each of the result entity names. Next, the system compares the hash value computed for the entity name in the request with hash values computed for each of the result entity names and determines a matching score for each of the result entity names based on the comparison of the hash values.

Abstract: A user can manage personal contact information in a contacts application across multiple writable service provider accounts with only a minimum of user action required. An update function of the contacts application gives the user the ability to easily copy one or more contact records brought up in the contacts application to writable service provider accounts selectively chosen by the user.

Abstract: A system and method can support recovery of persisted data from persistent storage of a distributed data grid, and provide persistent store versioning and integrity. A coordinator in the distributed data grid can receive a plurality of identifiers from one or more members of the distributed data grid, wherein each said identifier is associated with a persisted partition in a persistent storage for the distributed data grid. Then, the coordinator can select an identifier for each partition, wherein each selected identifier is associated with a most recent valid version of a partition. Furthermore, the coordinator can determine an active member in the distributed data grid that is responsible for recovering said partition from a persisted partition associated with the selected identifier.

Abstract: A method, system, and computer program product for dynamically building a database query by combining a static query clause with a user-specified filter. A method commences upon receiving a user-specified query filter from a user interface, then reformatting the user-specified query filter from a first query filter representation (e.g., clicks or text from the user interface) into a second query filter representation (e.g., into XML or into a database connectivity format, or into an SQL format, or into any native format). Subsequent steps combine the second query filter representation with a predefined database query (e.g., from an enterprise application) to form a dynamically-generated database language query. The filter is specified at a user interface, and the predefined database query is specified by an application.

Abstract: A method may include generating a first hash value that is representative of a current configuration of a database storing a plurality of data records. A change in the configuration of the database may be detected based on the first hash value and a second hash value representative of a previous configuration of the database. The configuration of the database may include a plurality of database tables available for storing the plurality of data records. In response to detecting the change in the configuration of the database, the database may be updated by at least transforming the plurality of data records in accordance with the current configuration of the database. Related methods and articles of manufacture, including computer program products, are also disclosed.