利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

11 条记录 (耗时 0.011 秒)

    Cache-conscious concurrency control scheme for database systems
    1.
    发明授权
    Cache-conscious concurrency control scheme for database systems 有权
    数据库系统的缓存意识并发控制方案

    公开(公告)号：US09454560B2

    公开(公告)日：2016-09-27

    申请号：US11934986

    申请日：2007-11-05

    申请人： Sang K. Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

    发明人： Sang K. Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30356 ,  G06F17/30351 ,  Y10S707/99933

    摘要： An optimistic, latch-free index traversal (“OLFIT”) concurrency control scheme is disclosed for an index structure for managing a database system. In each node of an index tree, the OLFIT scheme maintains a latch, a version number, and a link to the next node at the same level of the index tree. Index traversal involves consistent node read operations starting from the root. To ensure the consistency of node read operations without latching, every node update operation first obtains a latch and increments the version number after update of the node contents. Every node read operation begins with reading the version number into a register and ends with verifying if the current version number is consistent with the register-stored version number. If they are the same, the read operation is consistent. Otherwise, the node read is retried until the verification succeeds. The concurrency control scheme of the present invention is applicable to many index structures such as the B+-tree and the CSB+-tree.

    摘要翻译： 公开了一种用于管理数据库系统的索引结构的乐观，无锁定索引遍历（“OLFIT”）并发控制方案。 在索引树的每个节点中，OLFIT方案维护锁存器，版本号和到索引树的同一级别的下一个节点的链接。 索引遍历涉及从根开始的一致的节点读取操作。 为了确保节点读取操作的一致性，无需锁存，每个节点更新操作首先获取锁存器，并在更新节点内容后增加版本号。 每个节点读取操作都从读取寄存器中的版本号开始，并结束验证当前版本号是否与寄存器存储的版本号一致。 如果它们相同，则读取操作是一致的。 否则，重新尝试节点读取，直到验证成功。 本发明的并发控制方案适用于诸如B +树和CSB +树的许多索引结构。

    Accelerated transactions with precommit-time early lock release
    2.
    发明授权
    Accelerated transactions with precommit-time early lock release 有权
    加速交易与预报时间早期锁定释放

    公开(公告)号：US09336262B2

    公开(公告)日：2016-05-10

    申请号：US12898617

    申请日：2010-10-05

    申请人： Juchang Lee ,  Frank Renkes ,  Sangyong Hwang

    发明人： Juchang Lee ,  Frank Renkes ,  Sangyong Hwang

    IPC分类号： G06F17/00 ,  G06F17/30

    CPC分类号： G06F17/30377 ,  G06F17/30351 ,  G06F17/30362 ,  G06F17/30445

    摘要： A system, method and computer product for accelerating parallel database transactions. One or more data processors execute a first transaction on a database. The first transaction includes a transactional lock associated with each of one or more records to update the one or more records during the first transaction, and a pre-commit command to request acknowledgement of committing the updating of the one or more records during the first transaction. The one or more data processors execute a second transaction on the database in parallel with the first transaction. The second transaction includes a transactional lock associated with each of one or more records to update the one or more records during the second transaction, and a pre-commit command to request acknowledgement of committing the updating of the one or more records during the second transaction. The transactional locks of the first and second transactions are released before flushing log records associated with the first and second transactions.

    摘要翻译： 一种用于加速并行数据库事务的系统，方法和计算机产品。 一个或多个数据处理器在数据库上执行第一个事务。 第一事务包括与一个或多个记录中的每一个相关联的事务锁，以在第一事务期间更新一个或多个记录;以及预提交命令，用于在第一个事务期间请求确认提交一个或多个记录的更新 。 一个或多个数据处理器与第一事务并行地执行数据库上的第二事务。 第二事务包括与一个或多个记录中的每一个相关联的事务锁，以在第二事务期间更新一个或多个记录;以及预提交命令，用于在第二次事务期间请求确认提交一个或多个记录的更新 。 在刷新与第一和第二事务相关联的日志记录之前，释放第一和第二事务的事务锁。

    Unique Value Calculation in Partitioned Table
    3.
    发明申请
    Unique Value Calculation in Partitioned Table 有权
    分区表中的独特值计算

    公开(公告)号：US20140351254A1

    公开(公告)日：2014-11-27

    申请号：US14453401

    申请日：2014-08-06

    申请人： Lars Fricke ,  Sangyong Hwang

    发明人： Lars Fricke ,  Sangyong Hwang

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30595 ,  G06F17/30315 ,  G06F17/30424 ,  G06F17/30442 ,  G06F17/30445 ,  G06F17/30469 ,  G06F17/30498 ,  G06F17/30545 ,  G06F17/30584 ,  G06F17/30657 ,  G06F17/30864

    摘要： An estimation algorithm can generate a uniqueness metric representative of data in a database table column that is split across a plurality of data partitions. The column can be classified as categorical if the uniqueness metric is below a threshold and as non-categorical if the uniqueness metric is above the threshold. A first estimation factor can be assigned to the column if the column is classified as categorical or a larger second estimation factor can be assigned if the column is non-categorical. A cost estimate for system resources required to perform a database operation on the database table can be calculated. The cost estimate can include an estimated total number of distinct values in the column across all of the plurality of data partitions determined using the assigned first estimation factor or second estimation factor and a number of rows in the table as inputs to an estimation function.

    摘要翻译： 估计算法可以生成表示跨越多个数据分区的数据库表列中的数据的唯一性度量。 如果唯一性度量低于阈值，则该列可以分类为分类，如果唯一性度量高于阈值，则可以将其列为非分类。 如果列被分类为分类，则可以将第一估计因子分配给列，或者如果列是非分类的，则可以分配更大的第二估计因子。 可以计算对数据库表执行数据库操作所需的系统资源的成本估计。 成本估计可以包括使用所分配的第一估计因子或第二估计因子确定的所有多个数据分区中的列中的不同值的估计总数，以及作为估计函数的输入的表中的行数。

    Accelerated Transactions With Precommit-Time Early Lock Release
    4.
    发明申请
    Accelerated Transactions With Precommit-Time Early Lock Release 有权
    加速交易与预提早时锁定释放

    公开(公告)号：US20120084273A1

    公开(公告)日：2012-04-05

    申请号：US12898617

    申请日：2010-10-05

    申请人： Juchang Lee ,  Frank Renkes ,  Sangyong Hwang

    发明人： Juchang Lee ,  Frank Renkes ,  Sangyong Hwang

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30377 ,  G06F17/30351 ,  G06F17/30362 ,  G06F17/30445

    摘要： A system, method and computer product for accelerating parallel database transactions. One or more data processors execute a first transaction on a database. The first transaction includes a transactional lock associated with each of one or more records to update the one or more records during the first transaction, and a pre-commit command to request acknowledgement of committing the updating of the one or more records during the first transaction. The one or more data processors execute a second transaction on the database in parallel with the first transaction. The second transaction includes a transactional lock associated with each of one or more records to update the one or more records during the second transaction, and a pre-commit command to request acknowledgement of committing the updating of the one or more records during the second transaction. The transactional locks of the first and second transactions are released before flushing log records associated with the first and second transactions.

    摘要翻译： 一种用于加速并行数据库事务的系统，方法和计算机产品。 一个或多个数据处理器在数据库上执行第一个事务。 第一事务包括与一个或多个记录中的每一个相关联的事务锁，以在第一事务期间更新一个或多个记录;以及预提交命令，用于在第一个事务期间请求确认提交一个或多个记录的更新 。 一个或多个数据处理器与第一事务并行地执行数据库上的第二事务。 第二事务包括与一个或多个记录中的每一个相关联的事务锁，以在第二事务期间更新一个或多个记录;以及预提交命令，用于在第二次事务期间请求确认提交一个或多个记录的更新 。 在刷新与第一和第二事务相关联的日志记录之前，释放第一和第二事务的事务锁。

    Cache-conscious concurrency control scheme for database systems
    5.
    发明授权
    Cache-conscious concurrency control scheme for database systems 有权
    数据库系统的缓存意识并发控制方案

    公开(公告)号：US07293028B2

    公开(公告)日：2007-11-06

    申请号：US10162731

    申请日：2002-06-04

    申请人： Sang K. Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

    发明人： Sang K. Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F17/30356 ,  G06F17/30351 ,  Y10S707/99933

    摘要： An optimistic, latch-free index traversal (“OLFIT”) concurrency control scheme is disclosed for an index structure for managing a database system. In each node of an index tree, the OLFIT scheme maintains a latch, a version number, and a link to the next node at the same level of the index tree. Index traversal involves consistent node read operations starting from the root. To ensure the consistency of node read operations without latching, every node update operation first obtains a latch and increments the version number after update of the node contents. Every node read operation begins with reading the version number into a register and ends with verifying if the current version number is consistent with the register-stored version number. If they are the same, the read operation is consistent. Otherwise, the node read is retried until the verification succeeds. The concurrency control scheme of the present invention is applicable to many index structures such as the B+-tree and the CSB+-tree.

    摘要翻译： 公开了一种用于管理数据库系统的索引结构的乐观，无锁定索引遍历（“OLFIT”）并发控制方案。 在索引树的每个节点中，OLFIT方案维护锁存器，版本号和到索引树的同一级别的下一个节点的链接。 索引遍历涉及从根开始的一致的节点读取操作。 为了确保节点读取操作的一致性，无需锁存，每个节点更新操作首先获取锁存器，并在更新节点内容后增加版本号。 每个节点读取操作都从读取寄存器中的版本号开始，并结束验证当前版本号是否与寄存器存储的版本号一致。 如果它们相同，则读取操作是一致的。 否则，重新尝试节点读取，直到验证成功。 本发明的并发控制方案适用于诸如B +树和CSB +树的许多索引结构。

    Unique value calculation in partitioned table
    6.
    发明授权
    Unique value calculation in partitioned table 有权

    公开(公告)号：US09697273B2

    公开(公告)日：2017-07-04

    申请号：US14453401

    申请日：2014-08-06

    申请人： Lars Fricke ,  Sangyong Hwang

    发明人： Lars Fricke ,  Sangyong Hwang

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30595 ,  G06F17/30315 ,  G06F17/30424 ,  G06F17/30442 ,  G06F17/30445 ,  G06F17/30469 ,  G06F17/30498 ,  G06F17/30545 ,  G06F17/30584 ,  G06F17/30657 ,  G06F17/30864

    摘要： An estimation algorithm can generate a uniqueness metric representative of data in a database table column that is split across a plurality of data partitions. The column can be classified as categorical if the uniqueness metric is below a threshold and as non-categorical if the uniqueness metric is above the threshold. A first estimation factor can be assigned to the column if the column is classified as categorical or a larger second estimation factor can be assigned if the column is non-categorical. A cost estimate for system resources required to perform a database operation on the database table can be calculated. The cost estimate can include an estimated total number of distinct values in the column across all of the plurality of data partitions determined using the assigned first estimation factor or second estimation factor and a number of rows in the table as inputs to an estimation function.

    Processing Database Queries Using Format Conversion
    7.
    发明申请
    Processing Database Queries Using Format Conversion 有权
    使用格式转换处理数据库查询

    公开(公告)号：US20150026154A1

    公开(公告)日：2015-01-22

    申请号：US14508524

    申请日：2014-10-07

    申请人： Chanho Jeong ,  Sangyong Hwang ,  Sang Kyun Cha ,  Sung Heun Wi

    发明人： Chanho Jeong ,  Sangyong Hwang ,  Sang Kyun Cha ,  Sung Heun Wi

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30463 ,  G06F17/30 ,  G06F17/30286 ,  G06F17/30471 ,  G06F17/30492 ,  G06F17/30569

    摘要： Devices, methods and systems for processing database queries formatted differently than the database storage model being queried are disclosed. Processing database queries independent of the storage model of the queried database may be performed by receiving a query for one or more data items stored in a database, determining whether to use at least one query operator that uses data having a format different from the storage model format of at least one of one or more data items stored in the database and converting the format of the data used by the at least one query operator to a format that matches the storage model format of at least one of one or more data items stored in the database. Related systems, methods, and articles of manufacture are also described.

    摘要翻译： 公开了用于处理与正在查询的数据库存储模型不同的数据库查询的设备，方法和系统。 可以通过接收对存储在数据库中的一个或多个数据项的查询来确定是否使用至少一个使用具有不同于存储模型的格式的数据的查询运算符来执行独立于查询数据库的存储模型的数据库查询 格式化存储在数据库中的一个或多个数据项中的至少一个，并且将由至少一个查询运算符使用的数据的格式转换为与存储的一个或多个数据项中的至少一个的存储模型格式相匹配的格式 在数据库中。 还描述了相关系统，方法和制品。

    CACHE-CONSCIOUS CONCURRENCY CONTROL SCHEME FOR DATABASE SYSTEMS
    8.
    发明申请
    CACHE-CONSCIOUS CONCURRENCY CONTROL SCHEME FOR DATABASE SYSTEMS 有权
    数据库系统的高速缓存控制方案

    公开(公告)号：US20080065670A1

    公开(公告)日：2008-03-13

    申请号：US11934986

    申请日：2007-11-05

    申请人： Sang Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

    发明人： Sang Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30356 ,  G06F17/30351 ,  Y10S707/99933

    摘要： An optimistic, latch-free index traversal (“OLFIT”) concurrency control scheme is disclosed for an index structure for managing a database system. In each node of an index tree, the OLFIT scheme maintains a latch, a version number, and a link to the next node at the same level of the index tree. Index traversal involves consistent node read operations starting from the root. To ensure the consistency of node read operations without latching, every node update operation first obtains a latch and increments the version number after update of the node contents. Every node read operation begins with reading the version number into a register and ends with verifying if the current version number is consistent with the register-stored version number. If they are the same, the read operation is consistent. Otherwise, the node read is retried until the verification succeeds. The concurrency control scheme of the present invention is applicable to many index structures such as the B+-tree and the CSB+-tree.

    摘要翻译： 公开了一种用于管理数据库系统的索引结构的乐观，无锁定索引遍历（“OLFIT”）并发控制方案。 在索引树的每个节点中，OLFIT方案维护锁存器，版本号和到索引树的同一级别的下一个节点的链接。 索引遍历涉及从根开始的一致的节点读取操作。 为了确保节点读取操作的一致性，无需锁存，每个节点更新操作首先获取锁存器，并在更新节点内容后增加版本号。 每个节点读取操作都从读取寄存器中的版本号开始，并结束验证当前版本号是否与寄存器存储的版本号一致。 如果它们相同，则读取操作是一致的。 否则，重新尝试节点读取，直到验证成功。 本发明的并发控制方案适用于诸如B +树和CSB +树的许多索引结构。