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.

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.

Abstract: A method, system, and recording medium for knowledge graph augmentation using data based on a statistical analysis of attributes in the data, including mapping classes, attributes, and instances of the classes of the data, indexing semantically similar input data elements based on the mapped data using at least one of a label-based analysis, a content-based analysis, and an attribute-based clustering, and ranking the semantically similar input data elements to create a ranked list.

Abstract: Embodiments include method, systems and computer program products for predicting adverse drug events on a computational system. Aspects include receiving known drug data from drug databases and one or more of a candidate drug, a drug pair, and a candidate drug-patient pair. Aspects also include calculating an adverse event prediction rating representing a confidence level of an adverse drug event for the candidate drug, a drug pair, and a candidate drug-patient pair, the rating being based on the known drug data. Aspects also include associating adverse event features with the candidate drug, drug pair, or a candidate drug-patient pair, including a nature, cause, mechanism, or severity of the adverse drug event. Aspects also include calculating and outputting an adverse event prediction rating.

Abstract: Embodiments include method, systems and computer program products for predicting adverse drug events on a computational system. Aspects include receiving known drug data from drug databases and one or more of a candidate drug, a drug pair, and a candidate drug-patient pair. Aspects also include calculating an adverse event prediction rating representing a confidence level of an adverse drug event for the candidate drug, a drug pair, and a candidate drug-patient pair, the rating being based on the known drug data. Aspects also include associating adverse event features with the candidate drug, drug pair, or a candidate drug-patient pair, including a nature, cause, mechanism, or severity of the adverse drug event. Aspects also include calculating and outputting an adverse event prediction rating.

Abstract: An input graph is decomposed into a graph topology component and a graph properties component. A matrix representation is generated for each of the graph topology component and the graph properties component. Each of the graph topology matrix representation and graph properties matrix representation are partitioned into one or more sub-matrices. A forward pass comprising one or more vectorized operations is performed over the one or more sub-matrices. An output matrix is generated in response to the performing step.

Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.

Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.

Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.

Abstract: Conventionally, in addition to indexing, a synopsis of a base table of a database is used to skip and compress data. However, scanning of the entire synopsis for all queries is required, which takes a long time when the synopsis gets significantly big in a large data warehouse. A method for efficient data skipping and compression through vertical partitioning of data is provided to eliminate the cost of synopsis storage overhead while enabling the synopsis search functionality.

Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.

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 method includes setting, by an update processor, a write latch in a first data structure associated with an object. The first data structure is copied to a storage structure. A history tuple sequence number (TSN) of the first data structure is set to point to a TSN of the copied first data structure. The version identifier is set to point to a transaction identification for the object. Data portions are updated for the first data structure. The version identifier is read from the first data structure. It is determined whether the version identifier of the first data structure is visible for a transaction including isolation requirements. If version identifier of the first data structure is visible, the first data structure is accessed and it is determined whether the version identifier of the first data structure changed since starting the transaction.

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.

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.

Abstract: A method includes scanning multiple incoming database transaction requests. Each transaction includes one or more operations. Operations are clustered into a set of combined operations based on type of operation constraints. Log records are prepared and written for re-performing operations upon system failures, and for undoing operations upon an operation or a transaction failing to be processed fully. Each set of combined operations are performed within a thread. Each update operation is marked for a transaction within which the update operation belongs. Recoverable update operations belonging to a plurality of transactions are performed within a single logical thread of execution.

Abstract: A method includes logically organizing, by an object hierarchy processor, data objects in a first hierarchy. A portion of the data objects in the first hierarchy logically includes groupings of other data objects. The object hierarchy processor physically organizes the data objects across two or more types of memory in a second hierarchy. Another portion of the data objects in the second hierarchy physically includes groupings of other data objects. Groupings of the data objects in the second hierarchy are dynamically moved across the two or more types of memory. Levels of access of the data objects are tracked using a data structure that maps groupings of the data objects in the first hierarchy onto metadata information including combined access frequencies of the data objects, and current number of accessors to the data objects, in each grouping of the data objects.

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: Managing a multi-version data record database is provided. A mapping is maintained between a logical record identifier and committed and uncommitted physical record identifiers corresponding to data records using an indirection mapping table. Entries are updated within an index to point to the logical record identifier instead of the committed and uncommitted physical record identifiers. The committed physical record identifier corresponding to a data record is read from the indirection mapping table to access a committed version of the data record while a writer is modifying the data record to prevent the writer from blocking a reader. An uncommitted physical record identifier corresponding to the data record is written in the indirection mapping table to insert a new uncommitted version of the data record within a data table while the reader is reading the committed version of the particular data record to prevent the reader from blocking the writer.