Abstract: Mechanisms are provided for conducting a natural language dialogue between the automatic dialogue system and a user of a client computing device. An automatic dialogue system receives natural language text corresponding to a user input from the user via the client computing device, the natural language text having an ambiguous portion of natural language text. The automatic dialogue system analyzes user profile information corresponding to the user to identify an anomaly in the user profile information and predicts a user intent associated with the anomaly. The automatic dialogue system disambiguates the ambiguous portion of the natural language text based on the predicted user intent and generates a response to the user input based on the disambiguated natural language text which is output to the client computing device to thereby conduct the natural language dialogue.

Abstract: Mechanisms are provided for customizing responses to future questions based on identified anomalies in user profile information. An automated dialogue system monitors information associated with a plurality of entities, where the information includes quantities for variable values associated with the entities. The automated dialogue system, in response to determining that a quantity of a variable value associated with an entity in the plurality of entities has changed by an amount equal to or exceeding a corresponding threshold value, generates response information associated with a quantity of the variable value and an entity to respond to at least one future question. In addition, the automated dialogue system stores the responsive information in association with the entity for later retrieval in response to initiation of a dialogue session with the automated dialogue system. Time thresholds may be established for determining when to stop using the responsive information for responding to questions.

Abstract: Mechanisms are provided for conducting a natural language dialog between the automatic dialog system and a user of a client computing device. An automatic dialog system receives natural language text corresponding to a user input from the user via the client computing device, the natural language text having an ambiguous portion of natural language text. The automatic dialog system analyzes user profile information corresponding to the user to identify an anomaly in the user profile information and predicts a user intent associated with the anomaly. The automatic dialog system disambiguates the ambiguous portion of the natural language text based on the predicted user intent and generates a response to the user input based on the disambiguated natural language text which is output to the client computing device to thereby conduct the natural language dialog.

Abstract: Methods and apparatus are provided for incremental frequent subgraph mining on dynamic graphs. An exemplary subgraph mining method comprises maintaining a set of embeddings comprising matching embeddings of a given subgraph in an input graph; maintaining a first fringe set of subgraphs comprising subgraphs substantially on a fringe of frequent subgraphs in the input graph that satisfy a predefined support threshold; maintaining a second fringe set of subgraphs comprising subgraphs substantially on a fringe of infrequent subgraphs in the input graph that do not satisfy the predefined support threshold; for an edge addition, checking a support of the subgraphs in the second fringe set based on the set of the embeddings and searching for new embeddings created by the edge addition; and for an edge deletion, removing obsolete embeddings that comprise the deleted edge from the first fringe set based on the set of embeddings.

Abstract: Mechanisms are provided for conducting a natural language dialogue between the automatic dialogue system and a user of a client computing device. An automatic dialogue system receives natural language text corresponding to a user input from the user via the client computing device, the natural language text having an ambiguous portion of natural language text. The automatic dialogue system analyzes user profile information corresponding to the user to identify an anomaly in the user profile information and predicts a user intent associated with the anomaly. The automatic dialogue system disambiguates the ambiguous portion of the natural language text based on the predicted user intent and generates a response to the user input based on the disambiguated natural language text which is output to the client computing device to thereby conduct the natural language dialogue.

Abstract: Mechanisms are provided for customizing responses to future questions based on identified anomalies in user profile information. An automated dialogue system monitors information associated with a plurality of entities, where the information includes quantities for variable values associated with the entities. The automated dialogue system, in response to determining that a quantity of a variable value associated with an entity in the plurality of entities has changed by an amount equal to or exceeding a corresponding threshold value, generates response information associated with a quantity of the variable value and an entity to respond to at least one future question. In addition, the automated dialogue system stores the responsive information in association with the entity for later retrieval in response to initiation of a dialogue session with the automated dialogue system. Time thresholds may be established for determining when to stop using the responsive information for responding to questions.

Abstract: A method, apparatus and computer program product for establishing a logical connection between an indirect utterance and a transaction is described. An indirect utterance is received from a user as an input to a conversational system. The indirect utterance is parsed to a first logical form. A first set of predicates and terms is mapped from the first logical form to a first subgraph in a knowledge graph. A second set of predicates and terms is mapped from a second logical form belonging to a transaction to a second subgraph of the knowledge graph. A best path in the knowledge graph between the first subgraph and the second subgraph is searched for while transforming the first logical form using the node and edge labels along the best path to generate an intermediate logical form. A system action is performed for a transaction if a graph structure of the intermediate logical form matches the graph structure of the logical form of the transaction above a threshold.

Abstract: A method, apparatus and computer program product for responding to an indirect utterance in a dialogue between a user and a conversational system is described. An indirect utterance is received. A parse structure of the indirect utterance is generated. The indirect utterance is an utterance which does not match a user goal expressed as elements of a knowledge graph. The parse structure is connected through the knowledge graph to a user goal to issue a request which is not stated in the indirect utterance. A system response is performed, where the system response is a dialogue system response based on a combination of the parse structure and the connected user goal.

Abstract: Methods and a system are provided. A method includes maintaining an in-page log for records in each of a plurality of data pages of a multi-version database. The method further includes adding record update information to the in-page log when a corresponding one of the records is deleted or updated. The method also includes consulting the in-page log for a recently updated one of the records or a recently deleted one of the records to determine a record status thereof. The method additionally includes spilling, by a processor-based overflow manager, to overflow pages when the in-page log is full. The data pages include any of row-oriented data pages and column-oriented data pages.

Abstract: A method for searching the top-K simple shortest paths between a specified source node and a specified target node in a graph, with graph data partitioned and distributed across a plurality of computing servers, the method including a parallel path search initialized from either one or both of the source and target nodes and traversing the graph by building likely path sequences for a match. Each computing server determines and forwards a path sequence as discovery progresses until the top-K paths are discovered.

Abstract: Methods and a system are provided. A method includes maintaining an in-page log for records in each of a plurality of data pages of a multi-version database. The method further includes adding record update information to the in-page log when a corresponding one of the records is deleted or updated. The method also includes consulting the in-page log for a recently updated one of the records or a recently deleted one of the records to determine a record status thereof. The method additionally includes spilling, by a processor-based overflow manager, to overflow pages when the in-page log is full. The data pages include any of row-oriented data pages and column-oriented data pages.

Abstract: A method, information processing system, and computer program storage product optimize the placement of database objects on a multiplicity of storage devices. A set of database objects are placed on a first storage device in a multiplicity of storage devices. Each storage device comprises differing characteristics. A query workload is run on the set of database objects that have been placed on the first storage device. Profiling information associated with the query workload that is running is collected. A subset of database objects is selected from the set of the database objects to be stored on a second storage device. The subset of database objects is stored on the second storage device and all remaining database objects in the set of database objects on the first storage device.

Abstract: A method includes the following steps. One or more records are accessed from a database memory bypassing a database access mechanism of a database system. Data representing access frequency of the one or more records are collected. The collected access frequency data for the one or more records are maintained. The access frequency data for the one or more records are aggregated until the access frequency reaches a threshold value. The aggregated access frequency data are asynchronously reported for the one or more records to the database system.

Abstract: A policy violation detection computer-implemented method, system, and computer program product, includes extracting a policy activity from a policy, the policy activity including an actor in the policy, an object of the policy, an action of the policy, and policy scope metadata, capturing a transaction by a user including metadata of the transaction, translating the transaction by the user into an actor in the transaction, an action of the transaction, and an object of the transaction, and alerting the user of a policy violation by navigating a knowledge graph is-a hierarchy to relate the actor in the transaction to the actor in the policy, the object of the transaction to an object of the policy, and the action of the transaction to an action of the policy activity.

Abstract: Staging data record changes from a faster storage medium to a slower storage medium using data query rewriting is provided. In response to receiving a data query corresponding to a particular data record, it is determined whether the data query is one of a transactional data query or an analytical data query. In response to determining that the data query is a transactional data query, the transactional data query is rewritten to apply transactional delta changes to the particular data record on a storage-class memory of a computer. In response to determining that the data query is an analytical data query, the analytical data query is rewritten to select and reconcile each data record corresponding to the particular data record stored on the storage-class memory with the particular data record stored on a persistent data storage device of the computer.

Abstract: Staging data record changes from a faster storage medium to a slower storage medium using data query rewriting is provided. In response to receiving a data query corresponding to a particular data record, it is determined whether the data query is one of a transactional data query or an analytical data query. In response to determining that the data query is a transactional data query, the transactional data query is rewritten to apply transactional delta changes to the particular data record on a storage-class memory of a computer. In response to determining that the data query is an analytical data query, the analytical data query is rewritten to select and reconcile each data record corresponding to the particular data record stored on the storage-class memory with the particular data record stored on a persistent data storage device of the computer.

Abstract: Methods and apparatus are provided for incremental frequent subgraph mining on dynamic graphs are provided. An exemplary subgraph mining method comprises maintaining a set of embeddings comprising matching embeddings of a given subgraph in an input graph; maintaining a first fringe set of subgraphs comprising subgraphs substantially on a fringe of frequent subgraphs in the input graph that satisfy a predefined support threshold; maintaining a second fringe set of subgraphs comprising subgraphs substantially on a fringe of infrequent subgraphs in the input graph that do not satisfy the predefined support threshold; for an edge addition, checking a support of the subgraphs in the second fringe set based on the set of the embeddings and searching for new embeddings created by the edge addition; and for an edge deletion, removing obsolete embeddings that comprise the deleted edge from the first fringe set based on the set of embeddings.

Abstract: In an approach for supporting queries for hash-based data structures, a processor creates an ordered set of seeds, wherein the ordered set of seeds are a subset of values in a key domain. A processor links each hashed key of a plurality of hashed keys to at least another hashed key of the plurality of hashed keys using the ordered set of seeds, wherein the ordered set of seeds allows retrieval access to data located in the hash-based data structure.

Abstract: A concurrent transaction validate phase with the transaction operations read, compute, and write allows for a rendezvous-based optimistic concurrency control process.

Abstract: A method includes the following steps. Runtime statistics related to data transaction processing in a concurrent system are collected. A given request to access shared data in the concurrent system is receive. Based on the collected runtime statistics, the number of reattempts the given request can make to access the shared data prior to access control being switched from a hardware transactional memory to a locking mechanism is adaptively determined.