会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Efficient destaging of updated local cache pages for a transaction in a
multisystem and multiprocess database management system with a
high-speed shared electronic store
    • 对具有高速共享电子商店的多系统和多进程数据库管理系统中的事务进行更新的本地缓存页的有效降级
    • US5574902A
    • 1996-11-12
    • US236284
    • 1994-05-02
    • Jeffrey W. JostenTina MukaiInderpal S. NarangJames Z. Teng
    • Jeffrey W. JostenTina MukaiInderpal S. NarangJames Z. Teng
    • G06F11/14G06F13/14
    • G06F17/30377G06F17/30368G06F17/3048Y10S707/99931
    • An efficient procedure for determining the set of buffer pool database pages that must be externalized to stable storage and for scheduling their write I/O's before release of a committing transaction's locks. In a multisystem database management system (DBMS) with high-speed shared external storage (SES) environment, a DBMS instance may follow "force-at-commit" protocol for a database that has intersystem read/write interest or may alternatively follow a "no-force-at-commit" policy when operating with a database for which only one system has interest. By introducing the concept of a series of unique ordinal numbers (ORD#) for each database assigned to buffer pool data pages whenever the page state changes from clean to dirty within a single DBMS instance, this procedure maintains a transaction page list (TPL) for each transaction in ORD# order. Because the dirty page list (DPL) pages are queued in ORD# sequence and each TPL includes all modified pages associated with the transaction, a merge scan with DPL entries can be performed for each TPL at the commit time of the corresponding transaction. This searches the DPL in a single pass with minimal DPL latch contention. The TPL pages requiring destaging are distributed to two processing lists; a first list for immediate force to SES and a second list of "in-use" pages that are forced to SES if necessary upon release of existing process latches.
    • 确定缓冲池数据库页面集合的有效过程,必须将其外部化为稳定存储,并在发布提交事务的锁之前调度其写入I / O。 在具有高速共享外部存储(SES)环境的多系统数据库管理系统(DBMS)中,对于具有系统间读/写兴趣的数据库,DBMS实例可以遵循“强制提交”协议,或者可选地遵循“ 使用只有一个系统感兴趣的数据库进行操作时,无需提交“策略”。 通过在单个DBMS实例中页面状态从干净变为脏的情况下,引入分配给缓冲池数据页的每个数据库的一系列唯一序数(ORD#)的概念,该过程维护一个事务页面列表(TPL),用于 每个交易在ORD#订单。 因为脏页面列表(DPL)页面以ORD#序列排队,并且每个TPL包括与事务相关联的所有修改的页面,可以在相应的事务的提交时间为每个TPL执行具有DPL条目的合并扫描。 这将在DPL中以最小的DPL锁定争用进行一次通过。 需要降级的TPL页面分发到两个处理列表; 第一个立即强制执行SES的列表和第二个“使用中”页面列表,如果必要,在发布现有的进程锁存器时被迫使用SES。
    • 8. 发明授权
    • Method, system and program products for managing changed data of castout classes
    • 用于管理变更数据的方法,系统和程序产品
    • US06230243B1
    • 2001-05-08
    • US09251888
    • 1999-02-19
    • David Arlen ElkoJeffrey W. JostenJeffrey M. NickDavid H. SurmanWendell W. Wilkinson
    • David Arlen ElkoJeffrey W. JostenJeffrey M. NickDavid H. SurmanWendell W. Wilkinson
    • G06F1200
    • G06F12/123G06F12/0804G06F12/0866
    • Changed data of castout classes of a coupling facility cache are managed in order to be able to efficiently determine the age of the oldest changed data in the cache. A directory entry representing a changed datum is placed in a data structure corresponding to the castout class of the changed datum. The data structure includes an order queue ordered by timestamps and a process queue, having an ordered portion and an unordered portion. When the directory entry is to be added to the data structure, an attempt is first made to place the entry on the order queue. If the entry is not placed on the order queue within a predefined amount of time, then the entry is placed on the process queue, the order of which is maintained by background tasks. In order to return the oldest entry of the data structure, the smallest entry of the process queue is determined and that entry is then compared to the smallest entry of the order queue. The smaller of those two entries corresponds to the oldest entry for the castout class.
    • 管理耦合设施高速缓存的丢弃类的更改数据,以便能够有效地确定高速缓存中最早更改的数据的年龄。 表示更改的数据的目录条目被放置在与改变的基准的castout类相对应的数据结构中。 数据结构包括由时间戳排序的订单队列和具有有序部分和无序部分的处理队列。 当目录条目要添加到数据结构中时,首先尝试将条目放在订单队列上。 如果条目未在预定义的时间内放置在订单队列上,则该条目将被放置在进程队列中,其顺序由后台任务维护。 为了返回数据结构的最旧条目,确定进程队列的最小条目,然后将该条目与订单队列的最小条目进行比较。 这两个条目中较小的条目对应于castout类的最旧条目。