利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

8 条记录 (耗时 0.05 秒)

    Transaction and version management system
    3.
    发明授权
    Transaction and version management system 失效
    交易和版本管理系统

    公开(公告)号：US5535386A

    公开(公告)日：1996-07-09

    申请号：US484619

    申请日：1995-06-07

    申请人： Chung C. Wang

    发明人： Chung C. Wang

    IPC分类号： G06F9/44 ,  G06F17/30

    CPC分类号： G06F17/30356 ,  G06F8/71 ,  Y10S707/99952 ,  Y10S707/99954

    摘要： Each element of a database may have multiple versions; the versions are partitioned into branches, and versions of a branch are ordered linearly according to their timestamps. Branches are timestamped and related to one another by a version graph. Each version of an element of a database is represented by a unique identifier, a timestamp, a branch name and a value. A new version of an element associated with a branch is created in response to an operation associated with the branch which would modify the element. An object graph in the database is represented independent of the branches and version; an application coded for elements in one version (and branch) can be reused for the same elements in a different version and (different branch) without any re-coding effort. Methods for long duration transactions, cooperative transactions and schema evolutions are provided.

    摘要翻译： 数据库的每个元素可能有多个版本; 这些版本被分割成分支，并且分支的版本根据它们的时间戳线性地排序。 分支是时间戳的，并通过版本图相互关联。 数据库元素的每个版本由唯一标识符，时间戳，分支名称和值表示。 响应于与将修改元素的分支相关联的操作，创建与分支相关联的元素的新版本。 数据库中的对象图独立于分支和版本进行表示; 为一个版本（和分支）中的元素编码的应用程序可以在不同的版本和（不同的分支）中重用于相同的元素，而无需任何重新编码的努力。 提供了长期交易，合作交易和模式演变的方法。

    System for selectively registering and blocking requests initiated by optimistic and pessimistic transactions respectively for shared objects based upon associated locks
    4.
    发明授权
    System for selectively registering and blocking requests initiated by optimistic and pessimistic transactions respectively for shared objects based upon associated locks 失效
    用于基于相关联的锁分别为共享对象分别对由乐观和悲观的事务发起的请求进行选择性地注册和阻止请求的系统

    公开(公告)号：US5263155A

    公开(公告)日：1993-11-16

    申请号：US658919

    申请日：1991-02-21

    申请人： Chung C. Wang

    发明人： Chung C. Wang

    IPC分类号： G06F9/46 ,  G06F9/00

    CPC分类号： G06F9/466 ,  Y10S707/99938

    摘要： A method is disclosed for concurrency control in a system having both pessimistic and optimistic transactions, comprises the steps of entering locks on objects both for optimistic and pessimistic transactions, and validating an optimistic transaction at commit time by checking that all objects on which said optimistic transaction holds a lock have not become obsolete during the execution of said optimistic transaction. Further, a system is shown enabling optimistic and pessimistic transactions to coexist, comprising a lock table into which locks are entered for both optimistic and pessimistic transactions, a wait queue in which pessimistic transactions are entered to wait for locks held by either optimistic or pessimistic transactions, a conflict table which is referenced to determine if a lock held by a first transaction is a conflict lock with respect to a lock requested by a second transaction, and code connected to the lock table, wait queue, and conflict table. This code which is responsive to transaction requests, updates the lock table and the wait queue so that optimistic transactions do not wait for locks to release, whereas pessimistic transactions do wait for locks to release. Other systems and methods are also disclosed.

    摘要翻译： 公开了一种用于具有悲观和乐观事务的系统中的并发控制的方法，包括以下步骤：为了乐观和悲观的事务而在对象上输入锁，以及在提交时通过检查所有乐观交易的所有对象来验证乐观交易 在执行所述乐观交易期间持有锁并没有变得过时。 此外，显示了一种使乐观和悲观的交易共存的系统，包括锁表，对于乐观和悲观的交易都输入了锁;等待队列，其中输入悲观交易以等待乐观或悲观交易所持有的锁 参考的冲突表，用于确定第一事务所持有的锁是否是针对第二事务所请求的锁的冲突锁，以及连接到锁表，等待队列和冲突表的代码。 响应于事务请求的代码更新锁表和等待队列，以便乐观事务不等待释放锁，而悲观事务则等待释放锁。 还公开了其它系统和方法。

    Laterally tearing tape strip
    5.
    发明授权
    Laterally tearing tape strip 失效
    撕裂带子

    公开(公告)号：US5153043A

    公开(公告)日：1992-10-06

    申请号：US670935

    申请日：1991-03-18

    申请人： Chung C. Wang

    发明人： Chung C. Wang

    IPC分类号： B65D85/672 ,  B65H18/28

    CPC分类号： B65H18/28 ,  B65D85/672 ,  Y10S206/813 ,  Y10S206/82 ,  Y10S428/906 ,  Y10T428/1495 ,  Y10T428/24777 ,  Y10T428/24793 ,  Y10T428/24851 ,  Y10T428/2486 ,  Y10T428/24868

    摘要： A laterally tearing tape strip torn from a roll having a longitudinal axis. The tape is originally annularly rolled onto the roll. Several cuts extending parallel with the longitudinal axis of the roll extend radially through the tape to divide the tape into a plurality of laterally tearing tape strips. A portion of the tape and therefore each tape strip does not include adhesive over a defined area which serves as a leading edge for each strip, a remaining portion of which does not include adhesive, to facilitate removal of a laterally tearing tape strip from the roll.

    摘要翻译： 从具有纵向轴线的辊撕开的横向撕裂带条。 胶带最初是环形卷在卷上。 与辊的纵向轴线平行延伸的几个切口径向延伸穿过带子，以将带分割成多个横向撕裂的带条。 胶带的一部分，因此每个带条不包括用作每个条带的前缘的限定区域上的粘合剂，其余部分不包括粘合剂，以便于从辊子中去除横向撕裂带条带 。

    Data structure and search method for a data base management system
    6.
    发明授权
    Data structure and search method for a data base management system 失效
    数据库管理系统的数据结构和搜索方法

    公开(公告)号：US4468728A

    公开(公告)日：1984-08-28

    申请号：US277103

    申请日：1981-06-25

    申请人： Chung C. Wang

    发明人： Chung C. Wang

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

    CPC分类号： G06F17/30327 ,  Y10S707/99931

    摘要： A data structure and search method for a data base management system. The structure and method allow the locating of a stored record in a massive system in a controlled and small number of mass memory accesses. The data structure is arranged into a plurality of search trees, each defining patent nodes and terminal nodes. The nodes of a tree are hierarchically arranged, and the trees are hierarchically arranged as a whole into levels. The initial search tree and an initial subset of trees, in some cases, are designed to be maintained in a main fast access memory. The remaining trees are kept in mass memory. A plurality of first storage files maintained in the mass memory are associated with terminal nodes of each of the trees except the final trees in the hierarchical structure. Terminating storage files, which are the ultimate repository for information, are associated with terminal nodes of the final trees. An input search parameter is partitioned into a plurality of subparameters, one for each level of search trees. The subparameters are used to search a tree in each level of the data structure until the location of a terminating file is determined.

    摘要翻译： 数据库管理系统的数据结构和搜索方法。 结构和方法允许在受控和少量的大容量存储器访问中将存储的记录定位在海量系统中。 数据结构被布置成多个搜索树，每个搜索树定义专利节点和终端节点。 树的节点被分层排列，并且树被分层地排列成一个整体。 在某些情况下，初始搜索树和树的初始子集被设计为保持在主快速存取存储器中。 剩下的树木保持在大量的记忆中。 维护在大容量存储器中的多个第一存储文件与分层结构中的最终树之外的每个树的终端节点相关联。 终止存储文件（它们是信息的最终存储库）与最终树的终端节点相关联。 输入搜索参数被划分成多个子参数，每个子参数一个用于搜索树的每个级别。 子参数用于搜索数据结构的每个级别中的树，直到确定终止文件的位置。

    Tandem pump/filter for aquarium
    7.
    发明授权
    Tandem pump/filter for aquarium 失效
    用于水族箱的串联泵/过滤器

    公开(公告)号：US5318701A

    公开(公告)日：1994-06-07

    申请号：US127079

    申请日：1993-09-27

    申请人： Chung C. Wang

    发明人： Chung C. Wang

    IPC分类号： A01K63/04

    CPC分类号： A01K63/045 ,  A01K63/047

    摘要： A tandem pump equipped with a pair of pump units that are assembled together each having a water inlet and a water outlet. Each water outlet duct is associated with a control chamber which is equipped with a volume control disc which can be operated with click sound. Each water outlet duct is provided an air intake tube with which flexible pipe can be engaged so that air or different kinds of gas can be introduced into water of a fish globe along with the projected water. The pump umits of the tandem pump are in communication with each other so that water can be controllably dispensed via a single water outlet or both water outlets at variable speed or volume. Different kinds of accessories for fish raising can be selectively mounted to both or either of the pump units so as to make the tandem pump to be more effectively employed.

    摘要翻译： 串联泵配备有一对泵单元，它们组装在一起，每个具有进水口和出水口。 每个出水管道与控制室相关联，控制室配备有可以用点击声操作的音量控制盘。 每个出水管设置有进气管，柔性管可以与该入口管接合，使得空气或不同种类的气体可以与投影的水一起引入鱼眼的水中。 串联泵的泵浦单元彼此连通，以便可以通过单个出水口或两个出水口以可变速度或体积可控地分配水。 可以选择性地将不同种类的用于鱼类养殖的附件安装到两个或两个泵单元中，以便更有效地使用串联泵。

    System for accessing shared data using a serialization graph constructed from a history file showing completed locking dependencies between transactions
    8.
    发明授权
    System for accessing shared data using a serialization graph constructed from a history file showing completed locking dependencies between transactions 失效
    使用从历史记录文件构建的序列化图来访问共享数据的系统，显示事务之间的完全锁定依赖关系

    公开(公告)号：US5280619A

    公开(公告)日：1994-01-18

    申请号：US524775

    申请日：1990-05-17

    申请人： Chung C. Wang

    发明人： Chung C. Wang

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

    CPC分类号： G06F17/30362 ,  Y10S707/99938

    摘要： Apparatus for scheduling at least two concurrent transactions accessing a shared data is provided. When a lock request is granted, the apparatus provides for constructing a history file for the shared data to show each data accessing transaction, and also provides for constructing a serialization graph with each node denoting an active transaction, and each directed edge denoting a dependency between two transactions. The serialization graph is searched for a cycle formed by transactions, and if any is found, the transactions are aborted and restarted.

    摘要翻译： 提供了用于调度访问共享数据的至少两个并发事务的装置。 当授予锁定请求时，该装置提供用于构建用于共享数据的历史文件以显示每个数据访问事务，并且还提供构建序列化图，其中每个节点表示活动事务，并且每个有向边表示第 两笔交易。 搜索序列化图形由事务形成的循环，如果发现任何一个循环，则会中止并重新启动事务。