Invention Application
US20080208802A1 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
Abstract:
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.
Information query
Patent Agency Ranking
0/0