会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 82. 发明申请
    • CATALOG REORGANIZATION APPARATUS AND METHOD
    • 目录重组装置和方法
    • US20110173154A1
    • 2011-07-14
    • US12684941
    • 2010-01-09
    • Philip R. ChauvetDavid C. ReedMichael R. ScottMax D. Smith
    • Philip R. ChauvetDavid C. ReedMichael R. ScottMax D. Smith
    • G06F17/30
    • G06F17/30286G06F17/30362
    • A method for reorganizing a catalog to improve I/O performance includes initially placing a shared lock on a source catalog. The method then makes a point-in-time copy of the source catalog to generate a target catalog. Once the target catalog is generated, the method reorganizes the contents of the target catalog. Optionally, while reorganizing the contents of the target catalog, the method temporarily releases the shared lock on the source catalog and mirrors I/O intended for the source catalog to a buffer. The buffered I/O may then be used to update the target catalog to bring it current with the source catalog. When the target catalog is reorganized and up-to-date, the method upgrades the shared lock on the source catalog to an exclusive lock, overwrites the source catalog with the target catalog, and releases the exclusive lock. A corresponding apparatus and computer program product are also disclosed and claimed herein.
    • 重组目录以提高I / O性能的方法包括:首先在源目录中放置一个共享锁。 然后,该方法制作源目录的时间点副本以生成目标目录。 生成目标目录后,该方法将重新组织目标目录的内容。 可选地,当重新组织目标目录的内容时,该方法临时释放源目录上的共享锁,并将源目录的I / O镜像到缓冲区。 然后可以使用缓冲的I / O来更新目标目录,使其与源目录一起使用。 当目标目录被重新组织并且是最新的时,该方法将源目录上的共享锁升级到排他锁,用目标目录覆盖源目录,并释放排他锁。 本文还公开并要求对应的装置和计算机程序产品。
    • 85. 发明授权
    • Dynamic cluster database architecture
    • 动态集群数据库架构
    • US07937377B2
    • 2011-05-03
    • US11780446
    • 2007-07-19
    • Mark F. WildingMatthew A. Huras
    • Mark F. WildingMatthew A. Huras
    • G06F7/00
    • G06F17/30575G06F17/30362Y10S707/99931Y10S707/99938Y10S707/99953
    • distributed database management system implemented on a cluster of computers. The cluster including disks organized as data nodes. The data nodes being locally connected to one or more computers in the cluster. The distributed database management system includes a distributed database manager layer having a lock manager, a resource manager, and an architecture manager. The lock manager serializes access to the data nodes in the cluster. The resource manager maintains a data representation of the resources of each computer in the cluster and makes the data available to other computers in the cluster to facilitate access to the resources by the other computers. The architecture manager defines logical ownership relationships between data nodes and computers in the cluster to permit the architecture of the database to be dynamically reconfigured to provide improved performance.
    • 分布式数据库管理系统在一组计算机上实现。 集群包括组织为数据节点的磁盘。 数据节点本地连接到集群中的一台或多台计算机。 分布式数据库管理系统包括具有锁管理器,资源管理器和架构管理器的分布式数据库管理器层。 锁定管理器将访问集群中的数据节点序列化。 资源管理器维护集群中每台计算机的资源的数据表示,并使数据可用于集群中的其他计算机,以便其他计算机访问资源。 架构管理员定义集群中数据节点和计算机之间的逻辑所有权关系,以允许动态重新配置数据库的体系结构以提供改进的性能。
    • 86. 发明申请
    • PARALLEL NESTED TRANSACTIONS IN TRANSACTIONAL MEMORY
    • 并行存储器中的并行交易
    • US20110040738A1
    • 2011-02-17
    • US12913596
    • 2010-10-27
    • Michael M. MagruderDavid DetlefsJohn Joseph DuffyGoetz GraefeVinod K. Grover
    • Michael M. MagruderDavid DetlefsJohn Joseph DuffyGoetz GraefeVinod K. Grover
    • G06F17/30
    • G06F17/30362G06F17/30368
    • Various technologies and techniques are disclosed for supporting parallel nested transactions in a transactional memory system. Releasing a duplicate write lock for rollback is supported. During rollback processing of a parallel nested transaction, a write log entry is encountered that represents a write lock. If the write lock is a duplicate, a global lock is used to synchronize access to a global versioned write lock map. Optimistic read validation is supported. During validation, if a versioned write lock indicates a sibling conflict, consult information to determine if a parallel nested transaction should be doomed. Write lock acquisition is supported. Upon attempting to acquire a write lock for a parallel nested transaction, a transactional memory word is analyzed to determine if the write lock can be obtained. If the transactional memory word indicates a versioned write lock, retrieve a write log entry pointer from a global versioned write lock map.
    • 公开了用于支持事务存储器系统中的并行嵌套事务的各种技术和技术。 支持释放重复的写入锁回滚。 在并行嵌套事务的回滚处理期间,遇到表示写入锁定的写入日志条目。 如果写入锁是重复的,则使用全局锁来同步对全局版本的写锁定映射的访问。 支持乐观阅读验证。 在验证期间,如果版本控制的写锁定表示兄弟冲突,请咨询信息以确定并行嵌套事务是否应注定。 支持写入锁定。 在尝试获取并行嵌套事务的写入锁定时,分析事务存储器字以确定是否可以获得写入锁定。 如果事务内存字指示版本化的写锁定,则从全局版本的写锁定映射中检索写入日志条目指针。
    • 87. 发明授权
    • Parallel nested transactions in transactional memory
    • 事务内存中的并行嵌套事务
    • US07890472B2
    • 2011-02-15
    • US11901647
    • 2007-09-18
    • Michael M. MagruderDavid DetlefsJohn Joseph DuffyGoetz GraefeVinod K. Grover
    • Michael M. MagruderDavid DetlefsJohn Joseph DuffyGoetz GraefeVinod K. Grover
    • G06F17/30
    • G06F9/467G06F17/30356G06F17/30359G06F17/30362
    • Various technologies and techniques are disclosed for supporting parallel nested transactions in a transactional memory system. Multiple closed nested transactions are created for a single parent transaction, and the closed nested transactions are executed concurrently as parallel nested transactions. Various techniques are used to ensure effects of the parallel nested transactions are hidden from other transactions outside the parent transaction until the parent transaction commits. For example, versioned write locks are used with parallel nested transactions. When a transactional memory word changes from a write lock to a versioned write lock, an entry is made in a global versioned write lock map to store a pointer to a write log entry that the versioned write lock replaced. When the versioned write lock is encountered during transaction processing, the global versioned write lock map is consulted to translate the versioned write lock to the pointer to the write log entry.
    • 公开了用于支持事务存储器系统中的并行嵌套事务的各种技术和技术。 为单个父事务创建多个封闭的嵌套事务,并且封闭的嵌套事务将作为并行嵌套事务并发执行。 使用各种技术来确保并行嵌套事务对父事务之外的其他事务的影响,直到父事务提交为止。 例如,版本化的写锁与并行嵌套事务一起使用。 当事务性内存单词从写入锁定更改为版本化写入锁定时,将在全局版本化写入锁定映射中创建一个条目,以存储指向版本化写入锁定替换的写入日志条目的指针。 当在事务处理期间遇到版本化的写锁时,请参考全局版本的写入锁定映射,以将版本化的写锁定转换为写入日志条目的指针。
    • 88. 发明授权
    • Database system and method with improved locks
    • 数据库系统和方法具有改进的锁
    • US07882085B2
    • 2011-02-01
    • US12457437
    • 2009-06-10
    • Udo KleinPaul Volker
    • Udo KleinPaul Volker
    • G06F7/00G06F17/00
    • G06F17/30362Y10S707/99933Y10S707/99939
    • A method for handling database locks includes detecting a new query from an administrator for a set of database records. Next, it is determined whether the administrator has any chance of being authorized to acquire a new lock. If so, an attempt is made to acquire the new lock and, on the failure to acquire, the administrator is informed that the lock has already been acquired by a prior administrator. Optionally, the new administrator is also provided with identifying information of the prior administrator and contact information for the prior administrator. The new administrator is therefore pre-screened to determine whether there is any chance to acquire a new lock to reduce the chance that an unauthorized new administrator could lock the set of database records. Also, should the new administrator be authorized but not able to access the set of database records due to a prior lock, the new administrator can be informed of the identity and contact information concerning the holder of the prior lock.
    • 用于处理数据库锁的方法包括从管理员检测一组数据库记录的新查询。 接下来,确定管理员是否有机会被授权获取新的锁。 如果是这样,尝试获取新的锁,并且在无法获取的情况下,管理员被通知已经由先前的管理员已经获取了锁。 可选地,新管理员还被提供有先前管理员的识别信息和先前管理员的联系信息。 因此,新的管理员被预先筛选,以确定是否有机会获取新的锁,以减少未经授权的新管理员锁定数据库记录集的机会。 另外,如果新的管理员被授权但由于先前的锁定无法访问数据库记录集,则可以向新管理员通知有关先前锁的持有者的身份和联系信息。
    • 90. 发明申请
    • ULTIMATE LOCKING MECHANISM
    • 最终锁定机构
    • US20100161571A1
    • 2010-06-24
    • US12338975
    • 2008-12-18
    • Winfried Schwarzmann
    • Winfried Schwarzmann
    • G06F17/30G06F7/00
    • G06F17/30362
    • A system and method for an ultimate locking mechanism which minimizes a lock period for modifying shared data in a shared database. A process is executed as one or more initial instances and a final instance. Each initial instance reads the shared data from the shared database without acquiring a lock on the shared database. The locking mechanism obtains results that are directed to modifying the shared data and buffers the results at least partially. During or after each of the initial instances, it determines whether the next instance is to be the final one (e.g., the estimated runtime of the next instance is acceptable as the lock period). In response to a positive determination, the final instance of the process is executed. The final instance uses at least one of the buffered results during execution and acquires the lock on the shared database to modify the shared data.
    • 用于最终锁定机制的系统和方法,其最小化用于修改共享数据库中的共享数据的锁定时段。 一个进程作为一个或多个初始实例和最终实例执行。 每个初始实例从共享数据库读取共享数据,而不获取共享数据库上的锁定。 锁定机制获得针对修改共享数据并至少部分缓冲结果的结果。 在每个初始实例期间或之后,它确定下一个实例是否是最后一个实例(例如,下一个实例的估计运行时间是可接受的,作为锁定周期)。 为了回应积极的决定,执行该过程的最终实例。 最终实例在执行期间使用至少一个缓冲结果,并获取共享数据库上的锁以修改共享数据。