发明授权
- 专利标题： Method and system for utilizing a hierarchical bitmap structure to provide a fast and reliable mechanism to represent large deleted data sets in relational databases
- 专利标题（中）： 利用分层位图结构提供快速可靠的机制来表示关系数据库中的大型删除数据集的方法和系统
-
申请号： US11679076申请日： 2007-02-26
-
公开(公告)号： US07685181B2公开(公告)日： 2010-03-23
- 发明人: Bishwaranjan Bhattacharjee , Timothy Ray Malkemus , Sean W. McKeough , Jo-anne Mona Louise Kirton , Sherman Lau
- 申请人： Bishwaranjan Bhattacharjee , Timothy Ray Malkemus , Sean W. McKeough , Jo-anne Mona Louise Kirton , Sherman Lau
- 申请人地址： US NY Armonk
- 专利权人： International Business Machines Corporation
- 当前专利权人： International Business Machines Corporation
- 当前专利权人地址： US NY Armonk
- 代理机构： Scully, Scott, Murphy & Presser, P.C.
- 代理商 Preston Young, Esq.
- 主分类号： G06F17/30
- IPC分类号： G06F17/30 ; G06F17/00 ; G06F13/28 ; G06F13/00
摘要：
A method and system utilizes a hierarchical bitmap structure to represent deleted data sets. Each level in the hierarchical bitmap structure may have progressively larger size and represent finer granularity of number of data blocks than its parent level. A method in one aspect may comprise allocating a first level bitmap having size equal to a register on a processor, each bit in the first level bitmap representing a plurality of blocks of data in a database, and allocating one or more pointers corresponding to said plurality of bits in the first level bitmap, said one or more pointers being allocated to point to a sub bitmap generated after a data block is deleted but before the index corresponding to the data block is cleaned.