公开(公告)号：JP2010079627A

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

申请号：JP2008247554

申请日：2008-09-26

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： TAKEUCHI MIKIO ,  KOYANAGI MITSUO ,  OZAWA YOSUKE

IPC: G06F12/00

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

公开(公告)号：JP2007072975A

公开(公告)日：2007-03-22

申请号：JP2005262155

申请日：2005-09-09

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： NEYAMA AKIRA ,  YAMAMOTO MANABU ,  OZAWA YOSUKE

IPC: G06F3/06 ,  G06F12/00 ,  G06F13/10

CPC classification number: G06F3/0659 ,  G06F3/0613 ,  G06F3/0676 ,  G06F11/1666

Abstract: PROBLEM TO BE SOLVED: To provide a data write apparatus capable of changing dynamically write systems of the transaction data to a disk between a write through system and a write behind system.
SOLUTION: The apparatus is provided with a memory having a queue management table for managing a disk write queue and a memory write queue for storing the transaction data. Also, the apparatus has a means for registering the memory write queue to the queue management table with a load exceeding a specified threshold as a condition and deleting the memory write queue from the queue management table with the load lowering the threshold as a condition. The apparatus has a write means for receiving the transaction data stored in the disk write queue to write them to the disk and a write means for receiving the transaction data stored in the memory write queue to write them to a redundancy memory.
COPYRIGHT: (C)2007,JPO&INPIT

Abstract translation: 要解决的问题：提供一种数据写入装置，其能够在写入系统和写入后面的系统之间动态地将交易数据的写入系统改变到盘。 解决方案：设备具有一个具有用于管理磁盘写入队列的队列管理表和用于存储交易数据的存储器写入队列的存储器。 此外，该装置具有将存储器写入队列登记到具有超过规定阈值的负载的队列管理表作为条件的装置，并且以负载降低阈值作为条件从队列管理表中删除存储器写入队列。 该装置具有用于接收存储在磁盘写入队列中的事务数据以将其写入磁盘的写入装置和用于接收存储在存储器写入队列中的事务数据以写入冗余存储器的写入装置。 版权所有（C）2007，JPO＆INPIT

公开(公告)号：JP2012078927A

公开(公告)日：2012-04-19

申请号：JP2010221450

申请日：2010-09-30

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： ENOKI MIKI ,  OZAWA YOSUKE ,  HORII HIROSHI

IPC: G06F12/00 ,  G06F12/08 ,  G06F12/12

CPC classification number: G06F17/30902 ,  G06F12/0891

Abstract: PROBLEM TO BE SOLVED: To efficiently create an index for invalidation for accessing a cache of a database within a limited memory space.SOLUTION: In order to maintain a cache hit rate for an index for invalidation within a limited size, a field for a count is provided in a table of indices for invalidation for each of hash-divided regions, the count is made increment in response to data update, and the count is made decrement in response to data reference. Rows of indices for invalidation are merged in response to the field for the count being larger than a predetermined threshold value, and a division of the rows of indices for invalidation is started in order from a row having a minimum count value as many as the number of rows which are made empty by merging. Therefore, the size of the index for invalidation is kept valid, and the cache hit rate is improved for reference access.

Abstract translation: 要解决的问题：为了有效地创建用于访问受限存储器空间内的数据库的高速缓存的无效索引。

解决方案：为了在有限大小内保持无效索引的缓存命中率，在每个哈希分割区域的无效索引表中提供计数字段，计数增量 响应于数据更新，并且响应于数据引用使计数减少。 响应于计数的字段大于预定阈值而合并无效索引的行，并且从具有最小计数值的行的数量开始按顺序排列无效索引行的划分数， 通过合并制成空的行。 因此，无效索引的大小保持有效，缓存命中率提高了参考访问。 版权所有（C）2012，JPO＆INPIT

公开(公告)号：JP2010128752A

公开(公告)日：2010-06-10

申请号：JP2008302250

申请日：2008-11-27

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： KOYANAGI MITSUO ,  OZAWA YOSUKE ,  ENOKI MIKI

IPC: G06F12/00

Abstract: PROBLEM TO BE SOLVED: To provide a database system, a server, an update method, and a program for efficiently executing a plurality of update requests to a database. SOLUTION: The server is connected to a database 90 and one or more other servers and includes a data storage part 50 for storing at least part of data obtained by dividing the database 90, a log storage part 62 for storing an update log by an update request concerning the data received from an application 30, a transmission part 88 for copying the update log and transmitting it to the other servers in response to the update request, a replica storage part 82 for storing a replica 110 of the update log by copying received from the other servers, and an execution part 64 for executing a batch update for the database 90 according to the sum of the update log 100 and the replica 110 stored in the log storage part 62 and the replica storage part 82 respectively. COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供一种数据库系统，服务器，更新方法和用于向数据库有效执行多个更新请求的程序。 解决方案：服务器连接到数据库90和一个或多个其他服务器，并且包括用于存储通过划分数据库90获得的数据的至少一部分的数据存储部分50，用于存储更新日志的日志存储部分62 通过关于从应用程序30接收到的数据的更新请求，用于复制更新日志并且响应于更新请求将其发送到其他服务器的发送部分88，用于存储更新日志的副本110的副本存储部分82 通过从其他服务器接收到的复制，以及执行部分64，用于分别根据存储在日志存储部分62和副本存储部分82中的更新日志100和副本110的和来执行数据库90的批量更新。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2006185211A

公开(公告)日：2006-07-13

申请号：JP2004378560

申请日：2004-12-28

Applicant: IBM

Inventor： MIYASHITA TAKASHI ,  HORII HIROSHI ,  OZAWA YOSUKE ,  TAKEUCHI MIKIO

IPC: G06F9/44 ,  G06F11/28

Abstract: PROBLEM TO BE SOLVED: To allow execution of a black box test for even a system wherein correspondence of input/output is not uniquely determined, by allowing analysis of a causal relation (dependency relation) of a program in state units of objects to analyze a causal relation of input and output in the test. SOLUTION: This program analysis system includes a causal relation extraction part 10 and a text execution part 20. The causal relation extraction part 10 executes a target program step by step and acquires change histories of fields of objects and information of fields of objects causing the changes, in each step and extracts causal relations in state units of each object, and the text execution part 20 takes a prescribed object as a verification target and analyzes a causal relation to the object being the verification target, on the basis of inter-object causal relations extracted by the causal relation extraction part 10 and executes a test on the basis of an assertion of the test, which is set between the object being the verification target and an object being a cause. COPYRIGHT: (C)2006,JPO&NCIPI

公开(公告)号：JP2010092222A

公开(公告)日：2010-04-22

申请号：JP2008260892

申请日：2008-10-07

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： HORII HIROSHI ,  OZAWA YOSUKE ,  KAWACHIYA KIYOKUNI

IPC: G06F12/00

Abstract: PROBLEM TO BE SOLVED: To provide a cache configuration for effectively using a cache in Map-Reduce processing on the basis of an update frequency.
SOLUTION: A method for constructing a cache mechanism in a Map-Reduce processing system performing distributed processing for a plurality of items of data includes: a step of classifying the plurality of items of data to be processed into a plurality of groups on the basis of each update frequency of the data; a step of calculating a group update frequency that is each update frequency of the plurality of groups on the basis of data update frequency that is the update frequency of the data each constituting the plurality of groups; a step of generating a partial result of a Map-Reduce processing stage for the groups of which the group update frequency is not larger than a threshold among the plurality of groups; and a step of caching the generated partial result.
COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供基于更新频率在Map-Reduce处理中有效地使用高速缓存的高速缓存配置。 解决方案：一种在对多个数据项执行分布式处理的Map-Reduce处理系统中构建高速缓存机制的方法包括：将要处理的多个数据项目分类为多个组的步骤， 数据的每个更新频率的基础; 基于作为构成所述多个组的数据的更新频率的数据更新频率来计算作为所述多个组的每个更新频率的组更新频率的步骤; 生成所述组更新频率不大于所述组中的阈值的组的映射减少处理级的部分结果的步骤; 以及缓存生成的部分结果的步骤。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2010009489A

公开(公告)日：2010-01-14

申请号：JP2008170857

申请日：2008-06-30

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： KOYANAGI MITSUO ,  OZAWA YOSUKE ,  TAKEUCHI MIKIO ,  ABE MARI

IPC: G06F17/30 ,  G06Q10/00 ,  G06Q10/06 ,  G06Q50/00

Abstract: PROBLEM TO BE SOLVED: To provide a data processor, a workflow system, a data processing method, and a computer program, can function a materialized view as a self-maintainable view, without increasing a storage capacity, when retrieving or updating information as to a progress situation of process instance in a prescribed condition, using the materialized view including information as to an inquiry result to a database defined in advance. SOLUTION: A flow description code for constructing a workflow is obtained to be analyzed statically. Selection condition information as to an attribute of a selection condition for the process instance in each node is generated and stored in response to a static analytical result. The node not having the possibility of providing the selection condition is extracted based on the stored selection condition information, to delete information as to the inquiry result corresponding to the extracted node and a node transited after the node, from the materialized view. COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：为了提供数据处理器，工作流系统，数据处理方法和计算机程序，在检索或更新时可以将实体化视图作为自维护视图而不增加存储容量 关于在规定条件下的流程实例的进度情况的信息，使用包括关于预先定义的数据库的查询结果的信息的物化视图。

解决方案：获得用于构建工作流的流程描述代码进行静态分析。 根据静态分析结果生成并存储关于每个节点中的处理实例的选择条件的属性的选择条件信息。 基于存储的选择条件信息提取不具有提供选择条件的可能性的节点，从物化视图删除与提取的节点相对应的查询结果和节点之后转移的节点的信息。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2009266147A

公开(公告)日：2009-11-12

申请号：JP2008118099

申请日：2008-04-30

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： OZAWA YOSUKE ,  KOYANAGI MITSUO ,  FUKUDA MARI ,  OSAKI HIROYASU

IPC: G06F12/00

CPC classification number: G06F17/30383

Abstract: PROBLEM TO BE SOLVED: To provide a method for managing views having virtual tables of databases. SOLUTION: The method includes steps of: selecting a discard candidate instance from a discard candidate list table in accordance with an LRU algorithm if it is determined that there is less free space for adding an instance; determining whether a revision wait flag is on for the discard candidate instance; if it is determined that the revision wait flag is on, deleting the discard candidate instance from the discard candidate list table; if it is determined that the revision wait flag is not on, deleting the discard candidate instance from the instance pool and adding the instance to the instance pool; and adding the requested instance to the instance pool if it is determined that there is enough storage area. COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于管理具有数据库虚拟表的视图的方法。 解决方案：所述方法包括以下步骤：如果确定存在用于添加实例的可用空间较小，则根据LRU算法从丢弃候选列表表中选择丢弃候选实例; 确定丢弃候选实例的修订等待标志是否打开; 如果确定修订等待标志已经打开，则从丢弃候选列表表中删除丢弃候选实例; 如果确定修订等待标志不在，则从实例池中删除丢弃的候选实例，并将实例添加到实例池; 并且如果确定存在足够的存储区域，则将所请求的实例添加到实例池。 版权所有（C）2010，JPO＆INPIT