会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 61. 发明申请
    • Version Garbage Collection Using Snapshot Lists
    • 版本垃圾收集使用快照列表
    • US20140149353A1
    • 2014-05-29
    • US13750204
    • 2013-01-25
    • Juchang LeeChang Gyoo ParkYongjae ChuhJaeyun NohMichael Muehle
    • Juchang LeeChang Gyoo ParkYongjae ChuhJaeyun NohMichael Muehle
    • G06F17/30
    • G06F17/3015G06F17/3023G06F17/30353G06F17/30356
    • Systems, methods and computer program product embodiments for providing version garbage collection using snapshot lists are disclosed herein. Version garbage collection using snapshot lists includes storing, by at least one processor, versions of a record in a database table, the record comprising a record value and a version timestamp, storing, by the at least one processor, active snapshots in two levels of active snapshot lists, an active snapshot comprising a transaction identifier and a snapshot timestamp, determining, by the at least one processor, a minimum active snapshot from the active snapshots in the two levels of active snapshot lists and deleting, by the at least one processor, versions of the record having a version timestamp earlier than a snapshot timestamp of the minimum active snapshot.
    • 本文公开了使用快照列表提供版本垃圾收集的系统,方法和计算机程序产品实施例。 使用快照列表的版本垃圾收集包括通过至少一个处理器存储数据库表中的记录的版本,所述记录包括记录值和版本时间戳,由所述至少一个处理器存储两个级别的活动快照 活动快照列表,包括事务标识符和快照时间戳的活动快照,由所述至少一个处理器确定所述两个活动快照列表中的活动快照中的最小主动快照,并且由所述至少一个处理器 ,该记录的版本的版本时间戳早于最小主动快照的快照时间戳。
    • 62. 发明申请
    • PARTIAL MERGE
    • 部分合并
    • US20140136473A1
    • 2014-05-15
    • US13843841
    • 2013-03-15
    • Franz FaerberJuchang LeeIvan Schreter
    • Franz FaerberJuchang LeeIvan Schreter
    • G06F17/30
    • G06F17/30315G06F17/30321G06F17/30339G06F17/30483G06F17/30592
    • A multi-level storage architecture and method of performing a partial merge are disclosed. A main store is partitioned into a passive main part and an active main part, the active main part being empty at a start of the partial merge, the passive main part storing encoded data records of the main store that are not subject to the partial merge. A values index corresponding to a sorted dictionary of the passive main part is set to a cardinality of n. The data records of a second level storage structure is merged into the active main part, the active main part having a dictionary that starts with a value of n+1, such that the merging into the active main part continues an encoding scheme according to the values index of the passive main part.
    • 公开了一种执行部分合并的多级存储架构和方法。 主店分为被动主体和活动主体,主动部分在部分合并开始时为空,被动主体部分存储不存在部分合并的主店铺的编码数据记录 。 将被动主体的排序词典对应的值索引设为n的基数。 第二级存储结构的数据记录被合并到活动主体部分中,活动主体部分具有以n + 1的值开始的字典,使得合并到活动主体部分继续根据 被动主体的价值指数。
    • 64. 发明申请
    • Accelerated Transactions With Precommit-Time Early Lock Release
    • 加速交易与预提早时锁定释放
    • US20120084273A1
    • 2012-04-05
    • US12898617
    • 2010-10-05
    • Juchang LeeFrank RenkesSangyong Hwang
    • Juchang LeeFrank RenkesSangyong Hwang
    • G06F17/30
    • G06F17/30377G06F17/30351G06F17/30362G06F17/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.
    • 一种用于加速并行数据库事务的系统,方法和计算机产品。 一个或多个数据处理器在数据库上执行第一个事务。 第一事务包括与一个或多个记录中的每一个相关联的事务锁,以在第一事务期间更新一个或多个记录;以及预提交命令,用于在第一个事务期间请求确认提交一个或多个记录的更新 。 一个或多个数据处理器与第一事务并行地执行数据库上的第二事务。 第二事务包括与一个或多个记录中的每一个相关联的事务锁,以在第二事务期间更新一个或多个记录;以及预提交命令,用于在第二次事务期间请求确认提交一个或多个记录的更新 。 在刷新与第一和第二事务相关联的日志记录之前,释放第一和第二事务的事务锁。
    • 69. 发明授权
    • Locking protocol for partitioned and distributed tables
    • 分区表和分布式表的锁定协议
    • US09501502B2
    • 2016-11-22
    • US13750194
    • 2013-01-25
    • Juchang LeeJin Yeon LeeYongjae ChuhJaeyun Noh
    • Juchang LeeJin Yeon LeeYongjae ChuhJaeyun Noh
    • G06F17/30
    • G06F17/30289G06F17/30008G06F17/30362
    • Systems, methods and computer program product embodiments for providing a locking protocol for partitioned and distributed database tables are disclosed herein. A locking method includes executing, by at least one processor, a first database transaction on a second node, attempting to acquire and acquiring a lock on the second node in intentional exclusive mode, executing, by the at least one processor, a second database transaction on a first node, acquiring a lock on the first node in exclusive mode and waiting to acquire a lock on the second node in exclusive mode, routing, by the at least one processor, the first database transaction to the first node and unsuccessfully trying to acquire a lock on the first node and committing, by the at least one processor, the first database transaction.
    • 本文公开了用于为分区和分布式数据库表提供锁定协议的系统,方法和计算机程序产品实施例。 锁定方法包括由至少一个处理器执行第二节点上的第一数据库事务,尝试以有意的排他模式获取和获取第二节点上的锁定,由至少一个处理器执行第二数据库事务 在第一节点上,以独占模式获取第一节点上的锁定,并且以排他模式等待获取第二节点上的锁定,由至少一个处理器将第一数据库事务路由到第一节点,并且不成功地尝试 获得第一节点上的锁并由至少一个处理器提交第一数据库事务。
    • 70. 发明申请
    • Database System With Transaction Control Block Index
    • 具有事务控制块索引的数据库系统
    • US20160147861A1
    • 2016-05-26
    • US14553494
    • 2014-11-25
    • Ivan SchreterJuchang LeeMihnea Andrei
    • Ivan SchreterJuchang LeeMihnea Andrei
    • G06F17/30
    • G06F17/30592G06F17/30353
    • A plurality of transactions is handled in a database. Each transaction includes a plurality of operations on at least one record in the database with at least two of the transactions being handled concurrently. Thereafter, a temporary timestamp is assigned to each record. The temporary timestamp are based, at least in part, on the corresponding transaction. Further, a final timestamp is assigned to each record with a commit operation. It can later be determined, using a visibility function and based on the assigned temporary timestamps and final timestamps, which of the records are visible in a consistent view for a first transaction. Based on such determination, access can be provided to those records determined to be visible to be accessed to the first transaction.
    • 在数据库中处理多个事务。 每个事务包括在数据库中的至少一个记录上的多个操作,其中至少两个事务被同时处理。 此后,将临时时间戳分配给每个记录。 临时时间戳至少部分地基于相应的事务。 此外,通过提交操作将最终时间戳分配给每个记录。 稍后可以使用可见性功能并基于分配的临时时间戳和最终时间戳来确定哪个记录在第一个事务的一致视图中可见。 基于这样的确定,可以向确定为可见以被访问到第一交易的那些记录提供访问。