Abstract: A computer which updates the computer's own database in use of a transaction log: acquires the transaction log; processes records in the acquired transaction log, and with respect to a record related to an update instruction, executes the update instruction represented by the record when an object of the update instruction is read onto a memory of the computer; and executes the update instruction put on standby with respect to the object either until the object of the update instruction put on standby is read onto the memory and becomes a processing object, or when the update instruction put on standby has been read onto the memory and become a processing object.

Abstract: Provided is a computer system including a plurality of CPUs 11a and 11b each having one or a plurality of processing unit-side ports, and at least one memory 12 having two or more memory device-side ports. The memory 12 is shared by a predetermined two or more processing units among the plurality of processing units, by connecting the processing unit-side ports and the memory device-side ports one-to-one logically.

Abstract: In an information processing system that determines a replication target server as a replication target of session information by using a predetermined algorithm, a load balancer that determines an allocation target server for communication includes: an allocation target determination unit that determines the allocation target server as an allocation target of the communication from among a plurality of servers; and a communication allocation unit that allocates the communication to the determined allocation target server.

Abstract: In the tree structure, a migrating node forms a connection with a parent node of a migration destination, the migrating node transmits a migration request to a root node, and the root node distributes a reply to the migration request according to the tree structure, upon receiving the reply, the parent node of the migration destination transmits a message, which is received later than the reply, to the migrating node via the formed connection, the migrating node stores in a queue messages which are received later than the reply received via the formed connection, upon receiving a reply distributed according to the tree structure, the migrating node reconstructs the distributed message, based on a message which is received earlier than the reply received from the parent node before migration and a message which is received later than the reply stored in the queue.

Abstract: An information processing system having a load balancer includes: a server identification unit that identifies an owner to whom a communication has been allocated by the load balancer, from among the plurality of servers; a replication target server determination unit that determines at least one of the plurality of servers as a replication target server which is a target of replication of session information for identifying the communication; a replication unit that replicates to the replication target server the session information to be stored in the replication target server; and a notification unit that notifies the replication target server of information with which the owner is able to be identified.

Abstract: From a lower-level master node to a higher-level master node, a shadow copy expanded in its own memory, a heap tuple map, and a shadow index are sent as a write set, and the higher-level master node, upon reception of the write set, verifies whether an update has already been executed and sends a record of this update as a transaction log to the lower-level master node, enabling efficient database updating without a discrepancy, from the lower-level master node to the higher-level master node, as well as from the higher-level master node to the subordinate lower-level master node.

Abstract: A lower-level master node sends, to a higher-level master node, a table-based write set as a bundle of combinations of a shadow copy of the database and a heap tuple map expanded in a memory, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log including a table number, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.

Abstract: An application server includes: an obtaining unit that obtains first content from a content management server; a retrieval unit that retrieves an command for application server that is embedded in the first content and not executed by a client terminal; a command generation unit that generates a command for client terminal in accordance with the command for application server; a content generation unit that generates second content in which the command for application server is replaced by the generated command for client terminal; and a transmission unit that transmits the second content in response to a request from the client terminal.

Abstract: A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap_tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.

Abstract: A first server comprises: an information request reception unit that receives a request transmitted by a user terminal; an instruction code generating unit that generates a predetermined tag of causing the user terminal to connect to a second server for which a common session ID is to be used, and to receive the common session ID from the second server; an information generating unit that generates a web page that includes the predetermined tag, as a web page that is transmitted to the user terminal in response to the request; and an information transmission unit that transmits, to the user terminal, the common session ID and the generated web page including the predetermined tag.

Abstract: A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.

Abstract: A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.

Abstract: The present invention realize a method of managing a database capable of hierarchically building master nodes, and efficiently performing the update of the master nodes. A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heaptuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.

Abstract: A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap_tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.

Abstract: A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.

Abstract: The present invention realize a method of managing a database capable of hierarchically building master nodes, and efficiently performing the update of the master nodes. A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heaptuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.

Abstract: Key information is held in a load balancer, an encoded server identification information which is encoded with the key information is included in an HTTP request received by the load balancer, the encoded server identification information is included in a response message from the real server to the client terminal and in a subsequent HTTP request, and access to the real server identified by decoding the server identification information using the key information is achieved when the load balancer receives the subsequent HTTP request, whereby a HTTP request can be made to the determined real server, while guaranteeing security even if access is made via a different load balancer.

Abstract: A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.

Abstract: A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.

Abstract: A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control.