Abstract:
The present invention achieves load balancing among physical nodes in a distributed database environment. The information processing system (100) of the present invention includes: a plurality of database servers (122) which are characterized in being a plurality of database servers (122) which are distributed in being deployed upon a plurality of physical nodes (124), wherein among the plurality of database servers (122), two or more servers which are each mutually responsible for different data are deployed upon the same physical node, and one or more servers which are responsible for the same data as any of the two or more servers are each deployed upon one or more other physical nodes; and distribution units (140 and 170), which monitor the loads related to each of the physical nodes, move a connection with a client from a database server upon a physical node which has a load which is larger than a target to a database server upon a physical node which has a load which is smaller than the target in order to distribute the connections so as to balance the loads thereof.
Abstract:
Die vorliegende Erfindung führt einen Lastausgleich zwischen physischen Knoten in einer verteilten Datenbankumgebung durch. Ein Informationsverarbeitungssystem 100 der vorliegenden Erfindung enthält eine Vielzahl von Datenbank-Servern 122, die auf einer Vielzahl von physischen Knoten verteilt bereitgestellt sind, wobei zwei oder mehr Server aus der Vielzahl von Datenbank-Servern, die für voneinander verschiedene Daten zuständig sind, auf ein und demselben physischen Knoten bereitgestellt sind und ein oder mehrere Server, die für dieselben Daten zuständig sind wie einer der beiden oder mehr Server, auf einem oder mehreren anderen physischen Knoten bereitgestellt sind; und einen Verteilungsbereich (140, 170) zum Verteilen von Verbindungen durch Überwachen der Arbeitslast auf jedem der physischen Knoten und Verlagern einer Verbindung mit einem Client von einem Datenbank-Server auf einem physischen Knoten mit einer Arbeitslast, die einen Zielwert übersteigt, zu einem Datenbank-Server auf einem physischen Knoten mit einer Arbeitslast, die geringer als der Zielwert ist, sodass die Verbindungen so verteilt sind, dass sie die Arbeitslast ausgleichen.
Abstract:
[PROBLEMS] Access efficiency to data base is enhanced. [MEANS FOR SOLVING PROBLEMS] A data base stores a value corresponding to each one of a plurali ty of keys. A system of the present invention executes a plurality of transa ctions on the data base, acquires a referred value of a key from the data ba se which is referred to each transaction in response to its execution, and r ecords the same. In compliance with requests committed in a plurality of tra nsactions, a reply is then requested for a result table judged and arranged for result of each transaction to show whether the values of the keys stored in the database remain unchanged by other transactions and maintain the ref erred values as they are. Further, it is judged whether each transaction is successful based on the result table in reply and a transaction judged to be successful is only committed.
Abstract:
PROBLEM TO BE SOLVED: To provide a method of allowing retrieval processing requiring up-to-dateness of data, and preventing overall performance of a system from being decreased or reduced. SOLUTION: Methods of synchronizing data between a first database and a second database each holding a portion of data included in the first database includes: extracting in response to issuing a retrieval request to the second database, from the first database, differential data between a first data set in the first database and a second data set in the second database as a retrieval target of the retrieval request, where the retrieval request includes a current retrieval request and a future retrieval request, where the future retrieval request is configured for issuance after the current retrieval request; and updating the second data set by applying the differential data to the second database, where the updated second data set is the retrieval target of the current or future retrieval request. COPYRIGHT: (C)2011,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a device and a method by which average loads on an inquiry to a database are reduced, and a memory use capacity is decreased drastically, while an effect of batch update is enhanced by increasing the number of update requests to be flashed at a time. SOLUTION: This device is provided with: an accumulation part 32 for accumulating update requests of a database; an update part 33 for performing batch processing of the accumulated update requests and updating the database; and a processing part 34 for inquiring the database and for generating the output of an inquiry result. The device is further provided with: an extraction part 35 which acquires the update request from the accumulation part 32 in response to an input of the inquiry and extracts an update request which influences the inquiry result on the basis of the inquiry content; and a content change part 36 for changing the inquiry content by using the update request extracted by the extraction part 35 and generating the input of the inquiry of the changed content to the processing part 34. COPYRIGHT: (C)2010,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To optimize a program for handling character strings. SOLUTION: This compiler device for optimizing the program for handling character strings comprises an addition instruction detection part for detecting an addition instruction for adding a character string to a character string variable storing a character string in the program; a storage code generation part for generating, in stead of each of a plurality of addition instructions for adding a character string to the same character string variable, which is detected by the addition instruction detection part, a storage code for storing data of an additional character string to be added according to the addition instruction concerned; and an addition code generation part for generating, in a position to be executed prior to an instruction referring to the character string variable in the program, an additional code for adding each of a plurality of additional character strings to the character string variable. COPYRIGHT: (C)2004,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To generate an efficient program executing previous evaluation of an argument according to whether it is necessary on a called side. SOLUTION: This conversion device is provided with a code analysis part 110 performing text analysis and syntax analysis of a source code, an optimization part 120 transforming the execution program, and an output code generation part 130 converting the transformed execution program into a machine language code. The optimization part 120 detects a procedure on a calling side and that on the called side during procedure calling in the execution program as to the execution program analyzed by the code analysis part 110, protects evaluation of the argument described in the procedure on the calling side with a predetermined evaluation condition, and transforms the execution program so that evaluation is carried out when the the argument is referred. COPYRIGHT: (C)2004,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To increase variation in object hash codes in order to reduce conflicts between object hash codes, and enable object hash codes to be added to pinned objects.SOLUTION: A per-heap seed is provided in each heap area in which an object is placed in order to generate an object hash code, and at least an object address and the per-heap seed are combined to generate the object hash code. Further, it is determined whether an object hash code can be added to an object in a "01" state during GC. If it can be added, the object hash code is calculated and added to the object, and the state is changed to "10". If it cannot be added, the object hash code is calculated, placed outside the heap, and associated with the object, and the state is changed to "11", which represents a pinned object.
Abstract:
PROBLEM TO BE SOLVED: To effectively optimize an object code in the range satisfying limitation caused by the number of physical registers of a processor. SOLUTION: This compiler device performs code generation from a program represented by a DAG(directed acyclic graph) while evaluating the number of used registers and the number of execution cycles and optimizes a code to be generated. That is, the compiler calculates the number of cycles with which each operation can be executed on the DAG and the number of the currently available registers, performs code generation while preceding an operator on an execution path that takes the most time in the DAG in a part where the number of registers is sufficient, and performs code generation while preceding such an operator as to reduce the number of used registers when the number of registers is not sufficient.