首页> 外国专利> 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

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

机译:利用分层位图结构提供快速可靠的机制来表示关系数据库中大型删除数据集的方法和系统

摘要

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.
机译:一种方法和系统利用分层位图结构来表示删除的数据集。分层位图结构中的每个级别可能具有逐渐增大的大小,并且表示与其父级别相比更细的数据块粒度。在一个方面中的方法可以包括:分配大小等于处理器上的寄存器的第一级位图,第一级位图中的每个位表示数据库中的多个数据块;以及分配与所述多个位相对应的一个或多个指针。在第一级位图中的比特位中,所述一个或多个指针被分配为指向在删除数据块之后但在清理对应于该数据块的索引之前生成的子位图。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号