公开(公告)号：WO2008074830A3

公开(公告)日：2008-09-18

申请号：PCT/EP2007064213

申请日：2007-12-19

Applicant: IBM ,  IBM UK ,  FACTOR MICHAEL ,  FIENBLIT SHACHAR ,  LADEN GUY ,  LORENZ DEAN HAR EL ,  PINTER SHLOMIT SARAH ,  TA-SHMA PAULA KIM

Inventor： FACTOR MICHAEL ,  FIENBLIT SHACHAR ,  LADEN GUY ,  LORENZ DEAN HAR EL ,  PINTER SHLOMIT SARAH ,  TA-SHMA PAULA KIM

IPC: G06F12/08

CPC classification number: G06F12/0804 ,  G06F9/3857 ,  G06F11/2094 ,  G06F12/0866 ,  G06F12/0893 ,  G06F12/126

Abstract: A method for managing data, the method includes: providing a write-back cache unit coupled to at least one storage unit; receiving a request to write a new data version to a certain cache data allocation unit; determining, in response to a data storage policy, whether to overwrite a cached data version being cached in the certain cache data allocation unit or to perform a destage of the cached data version to a first storage unit before writing the new data version to the certain cache allocation unit; receiving a request to read a data version that corresponds to a certain point in time and scanning a first data structure representative of write operations and a second data structure representative of revert operations to determine a location of the requested data version.

Abstract translation: 一种用于管理数据的方法，所述方法包括：提供耦合到至少一个存储单元的回写式高速缓存单元; 接收将新数据版本写入到特定高速缓存数据分配单元的请求; 响应于数据存储策略，确定是否重写正被高速缓存在所述特定高速缓存数据分配单元中的高速缓存的数据版本，或者在将所述新数据版本写入到所述确定的高速缓存数据分配单元之前执行高速缓存的数据版本的离台到第一存储单元 缓存分配单元; 接收读取对应于某个时间点的数据版本的请求，并且扫描表示写入操作的第一数据结构和表示恢复操作的第二数据结构以确定所请求的数据版本的位置。

公开(公告)号：DE602007003747D1

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

申请号：DE602007003747

申请日：2007-09-04

Applicant: IBM

Inventor： FACTOR MICHAEL ,  FIENBLIT SHACHAR ,  LADEN GUY ,  TA-SHMA PAULA KIM

IPC: G06F17/30

Abstract: A method and computer readable product for managing data, the method includes: providing a first data structure representative of insert or update operations to entries identified by keys and providing a second data structure representative of branch creation operations wherein the second data structure stores branch identifiers and branch timing information; receiving a request to lookup a version of data at a read timestamp; scanning the first and the second data structures to locate that version of data; and receiving a request to create a branch that starts by a version of data at a requested timestamp and updating the second data structure accordingly.

公开(公告)号：AT451654T

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

申请号：AT07820026

申请日：2007-09-04

Applicant: IBM

Inventor： FACTOR MICHAEL ,  FIENBLIT SHACHAR ,  LADEN GUY ,  TA-SHMA PAULA KIM

IPC: G06F17/30

Abstract: A method and computer readable product for managing data, the method includes: providing a first data structure representative of insert or update operations to entries identified by keys and providing a second data structure representative of branch creation operations wherein the second data structure stores branch identifiers and branch timing information; receiving a request to lookup a version of data at a read timestamp; scanning the first and the second data structures to locate that version of data; and receiving a request to create a branch that starts by a version of data at a requested timestamp and updating the second data structure accordingly.