Information processing system achieving connection distribution for load balancing of distributed database, information processing device,

    公开(公告)号:GB2499547A

    公开(公告)日:2013-08-21

    申请号:GB201309532

    申请日:2011-09-08

    Applicant: IBM

    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.

    SYSTEM FOR ENHANCING ACCESS EFFICIENCY TO DATA BASE AND ITS METHOD

    公开(公告)号:CA2657657A1

    公开(公告)日:2007-06-07

    申请号:CA2657657

    申请日:2006-11-30

    Applicant: IBM

    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.

    Method of synchronizing data between databases, and computer system therefor, and computer program
    5.
    发明专利
    Method of synchronizing data between databases, and computer system therefor, and computer program 有权
    数据库之间数据同步的方法及其计算机系统和计算机程序

    公开(公告)号:JP2010257426A

    公开(公告)日:2010-11-11

    申请号:JP2009110017

    申请日:2009-04-28

    CPC classification number: G06F17/30581

    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 translation: 要解决的问题:提供一种允许需要数据最新的检索处理的方法,并且防止系统的整体性能降低或降低。 解决方案:在第一数据库和第二数据库之间同步数据的方法,每个数据库和第二数据库保存包括在第一数据库中的数据的一部分包括:响应于从第一数据库向第二数据库发出检索请求提取差分数据 在第一数据库中的第一数据集和第二数据库中的第二数据集之间作为检索请求的检索对象,其中检索请求包括当前检索请求和未来检索请求,其中未来检索请求被配置为 当前检索要求后发放; 以及通过将所述差分数据应用于所述第二数据库来更新所述第二数据集,其中所述更新的第二数据集是所述当前或未来检索请求的检索对象。 版权所有(C)2011,JPO&INPIT

    Device for processing inquiry to database, processing method, program, and recording medium
    6.
    发明专利
    Device for processing inquiry to database, processing method, program, and recording medium 有权
    用于处理查询数据库的设备,处理方法,程序和记录介质

    公开(公告)号:JP2010079627A

    公开(公告)日:2010-04-08

    申请号:JP2008247554

    申请日:2008-09-26

    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 translation: 要解决的问题:提供一种设备和方法,通过该设备和方法,减少对数据库的查询的平均负载,并且存储器使用容量急剧下降,同时通过增加批量更新的数量来增加批处理更新的效果 更新一次闪存的请求。 解决方案:该设备具有:累积部分32,用于累积数据库的更新请求; 更新部33,用于对累积的更新请求进行批处理,更新数据库; 以及处理部34,用于查询数据库和生成查询结果的输出。 该设备还具有:提取部分35,其响应于询问的输入而从累积部分32获取更新请求,并且基于查询内容提取影响查询结果的更新请求; 以及内容改变部分36,用于通过使用由提取部分35提取的更新请求来改变查询内容,并向处理部分34生成对改变的内容的查询的输入。版权所有:(C)2010,JPO&INPIT

    Compiler device, compiler program, and storage medium

    公开(公告)号:JP2004259007A

    公开(公告)日:2004-09-16

    申请号:JP2003049414

    申请日:2003-02-26

    CPC classification number: G06F8/443

    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

    Method, program and system for generating hash codes to identify objects
    9.
    发明专利
    Method, program and system for generating hash codes to identify objects 有权
    用于生成哈希码识别对象的方法,程序和系统

    公开(公告)号:JP2013161186A

    公开(公告)日:2013-08-19

    申请号:JP2012021187

    申请日:2012-02-02

    CPC classification number: G06F12/0276 G06F9/4428 G06F12/0253 G06F17/30097

    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 translation: 要解决的问题:增加对象哈希码的变化,以减少对象哈希码之间的冲突,并使对象哈希码被添加到固定对象。解决方案:每个堆区域中提供每堆种子,其中 放置对象以生成对象散列码,并且至少将对象地址和每堆种子组合以生成对象散列码。 此外,在GC期间确定是否可以将对象散列码添加到处于“01”状态的对象。 如果可以添加,则对象哈希码进行计算并添加到对象中,状态变为“10”。 如果不能添加,则对象散列码进行计算,放置在堆外部并与对象相关联,状态更改为“11”,表示固定对象。

    DEVICE AND METHOD FOR COMPILATION
    10.
    发明专利

    公开(公告)号:JP2001075814A

    公开(公告)日:2001-03-23

    申请号:JP23253399

    申请日:1999-08-19

    Applicant: IBM

    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.

Patent Agency Ranking