Abstract: Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

Abstract: Various embodiments of the teachings herein include a network topology construction method. The method may include: acquiring a MAC address table of each port on each switch in a target network; determining a first connection relationship in the target network according to the MAC addresses of terminal devices in the target network included in each acquired MAC address table; determining at least one first port according to the first connection relationship in the target network; determining a second connection relationship in the target network according to the MAC addresses included in the MAC address table of each of the first ports in the target network; and determining a network topology of the target network according to the first connection relationship and the second connection relationship in the target network.

Abstract: Improved techniques are disclosed for processing transactions or requests in a data processing system. For example, a method for processing requests in a system including a plurality of nodes includes the following steps. At least two nodes of the plurality of nodes receive a plurality of requests. The two nodes exchange information to determine an order for processing requests. The two nodes process the requests in accordance with the order. The order may include a total order or a partial order.

Abstract: Transaction consistency query support is available for replicated data from recovery log to external data stores. An external data store is populated with records using entries of a change data table. The change data table has entries for each transaction that has committed and is to be replicated, and each of the entries stores information for each log entry in a recovery log from a database management system. Each log entry identifies a transactional change of data and a transaction completion indicator of one of commit and abort. In response to receiving a query about a transaction of the transactions, a set of records are retrieved from the external data store for the transaction. From the set of records, records whose sequence identifier values are larger than a maximum transaction commit sequence identifier are removed. From the set of records, remaining records having transaction consistency are returned.

Abstract: Transaction consistency query support is available for replicated data from recovery log to external data stores. An external data store is populated with records using entries of a change data table. The change data table has entries for each transaction that has committed and is to be replicated, and each of the entries stores information for each log entry in a recovery log from a database management system. Each log entry identifies a transactional change of data and a transaction completion indicator of one of commit and abort. In response to receiving a query about a transaction of the transactions, a set of records are retrieved from the external data store for the transaction. From the set of records, records whose sequence identifier values are larger than a maximum transaction commit sequence identifier are removed. From the set of records, remaining records having transaction consistency are returned.

Abstract: A method for transparently moving a block of memory with respect to an application using the block of memory, includes inserting, by a compiler, in an application that includes a memory allocation call, instructions for transparently moving a block of memory with respect to an application using the block of memory. The instructions include obtaining a first pointer returned by a memory allocator, where the first pointer points to an internal data structure, the internal data structure includes a read-write lock and a second pointer, and the second pointer points to an actual memory block. The instructions further include acquiring a read lock on a read-write lock in the internal data structure, before the first pointer is used by the application, obtaining the second pointer to the actual memory block, and dereferencing the second pointer to access the actual memory block for the application data.

Abstract: A system, computer program product, and method are provided to de-duplicate one or more memory pages in parallel. Multiple de-duplication processes operate in parallel, with each de-duplication process operatively coupled to at least two data structures, and further leveraging transactional memory to mitigate access conflicts.

Abstract: Systems, methods, and computer-readable media for generating group-based sequential point-of-interest (POI) recommendations are disclosed. A primitive graph or sparse transition matrix is constructed that represents relationships between users, between POIs, and between users and POIs. A loss data prediction algorithm is executed on the primitive graph to obtain a filled graph, which may be a filled user-POI bipartite graph. A group sequential recommendation engine then performs an iterative sequential recommendation process that involves performing, at each iteration, various manipulations on the filled graph to obtain first a homogenous node type graph and then a minimum spanning tree. A next POI to recommend in a sequence of POIs is then determined from the minimum spanning tree. The iterative process continues until stopping criteria is met.

Abstract: A computer-implemented method, a computer system, and a computer program product for trajectory similarity search is provided. The present invention may include, in response to receiving, by one or more processors, a search request for at least one trajectory similar to a query trajectory, determining, by one or more processors, a respective similarity between a query trajectory and a plurality of trajectories by calculating, in a synchronized way, a spatial distance measure and a time difference measure between the query trajectory and the plurality of trajectories. The present invention may further include, identifying, by one or more processors, the at least one trajectory from the plurality of trajectories based on the respective similarity between the query trajectory and the plurality of trajectories.

Abstract: Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

Abstract: Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

Abstract: Systems, methods, and products for database system transaction management are provided herein. One aspect provides for annotating via a computing device at least one data object residing on the computing device utilizing at least one transaction tag, the at least one transaction tag being configured to indicate a status of an associated data object; processing at least one database transaction utilizing a transactional memory process, wherein access to the at least one data object is determined based on the status of the at least one data object; and updating the status of the at least one data object responsive to an attempted access of the at least one data object by the at least one database transaction. Other embodiments and aspects are also described herein.

Abstract: A method for transparently moving a block of memory with respect to an application using the block of memory, includes inserting, by a compiler, in an application that includes a memory allocation call, instructions for transparently moving a block of memory with respect to an application using the block of memory. The instructions include obtaining a first pointer returned by a memory allocator, where the first pointer points to an internal data structure, the internal data structure includes a read-write lock and a second pointer, and the second pointer points to an actual memory block. The instructions further include acquiring a read lock on a read-write lock in the internal data structure, before the first pointer is used by the application, obtaining the second pointer to the actual memory block, and dereferencing the second pointer to access the actual memory block for the application data.

Abstract: Techniques for maintaining high availability servers are disclosed. For example, a method comprises the following steps. One or more client requests are provided to a first server for execution therein. The one or more client requests are also provided to a second server for storage therein. In response to the first server failing, the second server is configured to execute at least one client request of the one or more client requests provided to the first server and the second server that is not properly executed by the first server.

Abstract: A computer-implemented method protects stack memory by moving contents of stack memory to an accumulation general purpose register. One or more processors identify an authorized function and a malicious function in a computer program, in which the malicious function is able to execute a call that provides the malicious function with access to stack memory that is used by the authorized function. The processor(s) move data from the stack memory to a protected kernel register before the call is executed, and store results of execution of the authorized function in a first register that is accessible only to the authorized function. The processor(s) then clear the stack memory, and move the results of execution of the authorized function from the first register to an accumulation general purpose register that is also accessible only to the authorized function.

Abstract: Implementations of the present disclosure relate to methods, systems, and computer program products for graph data processing. In one implementation, a computer-implemented method is disclosed. In the method, an adjacency graph of a source graph may be determined by traversing the source graph based on a deep first search rule. Subgraphs may be extracted from the determined adjacency graph based on a predefined shape. Respective subgraph nodes may be built based on nodes in the respective subgraphs. Then the adjacency graph may be updated based on the respective subgraph nodes. In other implementations, a computer-implemented system and a computer program product for graph data processing are disclosed.

Abstract: A computer-implemented method protects stack memory by moving contents of stack memory to an accumulation general purpose register. One or more processors identify an authorized function and a malicious function in a computer program, in which the malicious function is able to execute a call that provides the malicious function with access to stack memory that is used by the authorized function. The processor(s) move data from the stack memory to a protected kernel register before the call is executed, and store results of execution of the authorized function in a first register that is accessible only to the authorized function. The processor(s) then clear the stack memory, and move the results of execution of the authorized function from the first register to an accumulation general purpose register that is also accessible only to the authorized function.

Abstract: Systems, methods, and computer-readable media for generating group-based sequential point-of-interest (POI) recommendations are disclosed. A primitive graph or sparse transition matrix is constructed that represents relationships between users, between POIs, and between users and POIs. A loss data prediction algorithm is executed on the primitive graph to obtain a filled graph, which may be a filled user-POI bipartite graph. A group sequential recommendation engine then performs an iterative sequential recommendation process that involves performing, at each iteration, various manipulations on the filled graph to obtain first a homogenous node type graph and then a minimum spanning tree. A next POI to recommend in a sequence of POIs is then determined from the minimum spanning tree. The iterative process continues until stopping criteria is met.

Abstract: A computer-implemented method protects stack memory from a malicious function. One or more processors identify a first function and a second function in a computer program, where the first function is an authorized function and the second function is a malicious function. The processor(s) determine that the second function is able to execute a call that provides the second function with access to a stack memory that is used by the first function. The processor(s) move data from the stack memory to a protected kernel register, which is accessible only to the first function, before the call is executed.

Abstract: A system, method, and computer readable storage medium for accessing a data file shared by all computing nodes participating in a system based on a blockchain protocol. The data file includes transactions and blocks. The transactions are data to be stored in the blockchain and the blocks are records that confirm when and in what sequence certain transaction became journaled as part of the blockchain. A request is received to include a plurality of transactions each with additional data as a new block on the blockchain. Criteria that includes a settable period of time or a settable number of transactions received is used to determine how many transactions go into a new block. A directed acyclic graph (DAG) is accessed that is constructed based on inter-dependencies among the transactions. The transactions for the new block are divided into a set of two or more independent tasks that can be executed in parallel based on the DAG. The independent tasks that can be managed independently are executed.