-
公开(公告)号：US08255398B2
公开(公告)日：2012-08-28
申请号：US12241458
申请日：2008-09-30
Applicant: Bishwaranjan Bhattacharjee , Sherman Lau , Lipyeow Lim , Timothy R. Malkemus , Cathy McArthur , George A. Mihaila , Reza Sherkat , Zoltan G. Toth
Inventor： Bishwaranjan Bhattacharjee , Sherman Lau , Lipyeow Lim , Timothy R. Malkemus , Cathy McArthur , George A. Mihaila , Reza Sherkat , Zoltan G. Toth
CPC classification number: G06F17/30631 , H03M7/30
Abstract: A method, information processing system, and computer program storage product to compress sorted values. At least a first prefix and a second prefix in a plurality of prefixes are compared. Each prefix comprises at least a portion of a plurality of sorted values. A respective prefix comprises a set of consecutive characters including at least a first character of a respective sorted value. The respective sorted value further comprising a respective suffix comprising consecutive characters of the respective sorted value that are after the respective prefix. At least a respective first character of the first prefix and a respective first character of the second prefix are determined to be substantially identical. The first prefix is merged with the second prefix into a single prefix comprising the first character. A set of suffixes associated with the first prefix is updated to reflect an association with the second prefix.
Abstract translation: 一种方法，信息处理系统和计算机程序存储产品来压缩排序值。 比较多个前缀中的至少第一前缀和第二前缀。 每个前缀包括多个排序值的至少一部分。 相应的前缀包括一组包括相应排序值的至少第一个字符的连续字符。 相应的排序值还包括相应的后缀，该后缀包括在相应前缀之后的相应排序值的连续字符。 至少第一前缀的相应第一字符和第二前缀的相应第一个字符被确定为基本相同。 第一前缀与第二前缀合并成包括第一个字符的单个前缀。 与第一前缀相关联的一组后缀被更新以反映与第二前缀的关联。
-
公开(公告)号：US20100082545A1
公开(公告)日：2010-04-01
申请号：US12241458
申请日：2008-09-30
Applicant: BISHWARANJAN BHATTACHARJEE , Sherman Lau , Lipyeow Lim , Timothy R. Malkemus , Cathy Mcarthur , George A. Mihaila , Reza Sherkat , Zoltan G. Toth
Inventor： BISHWARANJAN BHATTACHARJEE , Sherman Lau , Lipyeow Lim , Timothy R. Malkemus , Cathy Mcarthur , George A. Mihaila , Reza Sherkat , Zoltan G. Toth
IPC: G06F7/00
CPC classification number: G06F17/30631 , H03M7/30
Abstract: A method, information processing system, and computer program storage product for compressing sorted values is disclosed. At least a first prefix and a second prefix in a plurality of prefixes are compared. Each prefix comprises at least a portion of a plurality of sorted values. A respective prefix comprises a set of consecutive characters including at least a first character of a respective sorted value. The respective sorted value further comprising a respective suffix comprising consecutive characters of the respective sorted value that are after the respective prefix. At least a respective first character of the first prefix and a respective first character of the second prefix are determined to be substantially identical. The first prefix is merged with the second prefix into a single prefix comprising the first character. A set of suffixes associated with the first prefix is updated to reflect an association with the second prefix.
Abstract translation: 公开了一种用于压缩排序值的方法，信息处理系统和计算机程序存储产品。 比较多个前缀中的至少第一前缀和第二前缀。 每个前缀包括多个排序值的至少一部分。 相应的前缀包括一组包括相应排序值的至少第一个字符的连续字符。 相应的排序值还包括相应的后缀，该后缀包括在相应前缀之后的相应排序值的连续字符。 至少第一前缀的相应第一字符和第二前缀的相应第一个字符被确定为基本相同。 第一前缀与第二前缀合并成包括第一个字符的单个前缀。 与第一前缀相关联的一组后缀被更新以反映与第二前缀的关联。
-
公开(公告)号：US20220253363A1
公开(公告)日：2022-08-11
申请号：US17174024
申请日：2021-02-11
Applicant: Huaxin ZHANG , Ping CHEN , Yuk Kuen CHAN , Sherman LAU
Inventor： Huaxin ZHANG , Ping CHEN , Yuk Kuen CHAN , Sherman LAU
Abstract: Generating, by a first primary site that is included in a group of primary sites of a distributed database system, a commit action redo log message for a commit action performed by the first primary site for a first database transaction, the commit action redo log message including a transaction ID for the first database transaction and a transaction order indicator that represents an order of database transactions in a group of database transactions performed at one or more primary sites of the group of primary sites; and sending, by the first primary site, the commit action redo log message, for a corresponding first standby site that backs up the first primary site.
-
4.发明申请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 有权利用分层比特质结构提供快速可靠的机制来表示相关数据库中的大量删除数据集的方法和系统公开(公告)号：US20080208802A1
公开(公告)日：2008-08-28
申请号：US11679076
申请日：2007-02-26
Applicant: Bishwaranjan Bhattacharjee , Timothy Ray Malkemus , Sean W. McKeough , Jo-anne Mona Louise Kirton , Sherman Lau
Inventor： Bishwaranjan Bhattacharjee , Timothy Ray Malkemus , Sean W. McKeough , Jo-anne Mona Louise Kirton , Sherman Lau
IPC: G06F17/30
CPC classification number: G06F17/30327
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.
Abstract translation: 一种方法和系统利用分层位图结构来表示删除的数据集。 分级位图结构中的每个级别可以具有逐渐更大的大小并且表示比其父级别更多的数据块的粒度。 一方面的方法可以包括：分配具有等于处理器上的寄存器的大小的第一级位图，第一级位图中的每一位表示数据库中的多个数据块，并且分配与所述多个对应的一个或多个指针 所述一个或多个指针被分配以指向在数据块被删除之后但在与数据块相对应的索引被清除之前生成的子位图。
-
公开(公告)号：US20220405178A1
公开(公告)日：2022-12-22
申请号：US17890934
申请日：2022-08-18
Applicant: Huaxin ZHANG , Ping CHEN , Yuk Kuen CHAN , Sherman LAU
Inventor： Huaxin ZHANG , Ping CHEN , Yuk Kuen CHAN , Sherman LAU
Abstract: Generating, by a first primary site that is included in a group of primary sites of a distributed database system, a commit action redo log message for a commit action performed by the first primary site for a first database transaction, the commit action redo log message including a transaction ID for the first database transaction and a transaction order indicator that represents an order of database transactions in a group of database transactions performed at one or more primary sites of the group of primary sites; and sending, by the first primary site, the commit action redo log message, for a corresponding first standby site that backs up the first primary site.
-
Patent Agency Ranking
公开(公告)号：US11436110B2
公开(公告)日：2022-09-06
申请号：US17174024
申请日：2021-02-11
Applicant: Huaxin Zhang , Ping Chen , Yuk Kuen Chan , Sherman Lau
Inventor： Huaxin Zhang , Ping Chen , Yuk Kuen Chan , Sherman Lau
Abstract: Generating, by a first primary site that is included in a group of primary sites of a distributed database system, a commit action redo log message for a commit action performed by the first primary site for a first database transaction, the commit action redo log message including a transaction ID for the first database transaction and a transaction order indicator that represents an order of database transactions in a group of database transactions performed at one or more primary sites of the group of primary sites; and sending, by the first primary site, the commit action redo log message, for a corresponding first standby site that backs up the first primary site.
-
公开(公告)号：US20240037118A1
公开(公告)日：2024-02-01
申请号：US17877649
申请日：2022-07-29
Applicant: Ronen GROSMAN , Sherman LAU , Tian Chen GU , Kristian Robert LEJAO
Inventor： Ronen GROSMAN , Sherman LAU , Tian Chen GU , Kristian Robert LEJAO
CPC classification number: G06F16/27 , G06F16/2246 , G06F16/2365
Abstract: Methods, systems, and computer-readable media are described in which WAL records are replayed serially at the database sub-object level, thereby enabling parallelism for processes affecting a single database object without interfering with the consistency required to maintain ROS capability. WAL records are replayed serially at the B-Tree branch level, instead of existing approaches which serialize WAL record replay at the object or block level. Described examples may thereby enable multi-block operations (e.g., SPLIT) within the same B-Tree branch to be replayed in the correct sequence, thereby maintaining consistent reads during ROS. Multi-level dispatching at the object and sub-object levels may be used to minimize delays caused by operations affecting multiple branches of a database object.
-
公开(公告)号：USD957238S1
公开(公告)日：2022-07-12
申请号：US29788088
申请日：2021-03-12
Applicant: Sherman Lau
Designer： Sherman Lau
-
9.发明授权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 有权利用分层位图结构提供快速可靠的机制来表示关系数据库中的大型删除数据集的方法和系统公开(公告)号：US07685181B2
公开(公告)日：2010-03-23
申请号：US11679076
申请日：2007-02-26
Applicant: Bishwaranjan Bhattacharjee , Timothy Ray Malkemus , Sean W. McKeough , Jo-anne Mona Louise Kirton , Sherman Lau
Inventor： Bishwaranjan Bhattacharjee , Timothy Ray Malkemus , Sean W. McKeough , Jo-anne Mona Louise Kirton , Sherman Lau
CPC classification number: G06F17/30327
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.
Abstract translation: 一种方法和系统利用分层位图结构来表示删除的数据集。 分级位图结构中的每个级别可以具有逐渐更大的大小并且表示比其父级别更多的数据块的粒度。 一方面的方法可以包括：分配具有等于处理器上的寄存器的大小的第一级位图，第一级位图中的每一位表示数据库中的多个数据块，并且分配与所述多个对应的一个或多个指针 所述一个或多个指针被分配以指向在数据块被删除之后但在与数据块相对应的索引被清除之前生成的子位图。
-
公开(公告)号：US12032592B2
公开(公告)日：2024-07-09
申请号：US17877649
申请日：2022-07-29
Applicant: Ronen Grosman , Sherman Lau , Tian Chen Gu , Kristian Robert Lejao
Inventor： Ronen Grosman , Sherman Lau , Tian Chen Gu , Kristian Robert Lejao
CPC classification number: G06F16/27 , G06F16/2246 , G06F16/2365
Abstract: Methods, systems, and computer-readable media are described in which WAL records are replayed serially at the database sub-object level, thereby enabling parallelism for processes affecting a single database object without interfering with the consistency required to maintain ROS capability. WAL records are replayed serially at the B-Tree branch level, instead of existing approaches which serialize WAL record replay at the object or block level. Described examples may thereby enable multi-block operations (e.g., SPLIT) within the same B-Tree branch to be replayed in the correct sequence, thereby maintaining consistent reads during ROS. Multi-level dispatching at the object and sub-object levels may be used to minimize delays caused by operations affecting multiple branches of a database object.
-
-
-
-
-
-
-
-
-
Search Results
10
records
(took 0.013 seconds)
