专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08412689B2 Shared log-structured multi-version transactional datastore with metadata to enable melding trees 有权
标题翻译：具有元数据的共享日志结构多版本事务数据存储区，以实现熔化树
公开(公告)号：US08412689B2
公开(公告)日：2013-04-02
申请号：US12831259
申请日：2010-07-07
申请人： Colin W. Reid , Philip A. Bernstein
发明人： Colin W. Reid , Philip A. Bernstein
IPC分类号： G06F17/30
CPC分类号： G06F11/1471 , G06F9/466 , G06F17/30356
摘要： Architecture that includes an ordered and shared log of indexed transaction records represented as multi-version data structures of nodes and node pointers. The log is a sole monolithic source of datastore state and is used for enforcing concurrency control. The architecture also includes a transaction processing component that appends transaction records to the log from concurrent transactions executing on different processors. Each node of a record is assigned a log address.
摘要翻译：架构包括索引事务记录的有序和共享日志，表示为节点和节点指针的多版本数据结构。日志是数据存储区状态的唯一单一源，用于执行并发控制。该体系结构还包括一个事务处理组件，它将事务记录从不同处理器上执行的并发事务追加到日志中。记录的每个节点都被分配一个日志地址。

2. 发明授权

US08386421B2 Concurrency control for confluent trees 有权
标题翻译：汇合树的并发控制
公开(公告)号：US08386421B2
公开(公告)日：2013-02-26
申请号：US12824254
申请日：2010-06-28
申请人： Colin W. Reid , Philip A. Bernstein
发明人： Colin W. Reid , Philip A. Bernstein
IPC分类号： G06F7/00
CPC分类号： G06F17/30356
摘要： Architecture that addresses the efficient detection of conflicts and the merging of data structures such as trees, when possible. The process of detecting conflicts and merging the trees is a meld operation. Confluent trees offer transactional consistency with some degree of isolation, and scaling out a concurrent system based on confluent trees can be accomplished where the meld operation is more efficient than the transaction computations. Transactions execute optimistically using lazily versioned “intention trees” that efficiently describe dependencies and effects using structure and content version information for each intention subtree. The data structure is modified by melding the intention trees in sequence, which causes each transaction to either commit (producing an incremental new version of the data structure) or abort (identifying a conflict which prevents the intention tree from being melded). The architecture is computationally efficient and completes without needing to access much of each tree.
摘要翻译：解决冲突有效检测的架构，以及数据结构（如树木）的合并。检测冲突和合并树木的过程是一个融合的行动。融合树提供了一定程度的交互性隔离，并且在融合操作比交易计算更有效的情况下，可以实现基于汇合树的并行系统的扩展。交易使用延迟版本化意图树乐观地执行，使用每个意图子树的结构和内容版本信息有效地描述依赖和效果。数据结构通过按顺序合并意图树进行修改，这导致每个事务提交（产生数据结构的增量新版本）或中止（识别妨碍意图树的融合的冲突）。该架构在计算上是有效的并且完成，而不需要访问每个树的大部分。

3. 发明授权

US08347050B2 Append-based shared persistent storage 有权
标题翻译：基于附加的共享永久存储
公开(公告)号：US08347050B2
公开(公告)日：2013-01-01
申请号：US12360122
申请日：2009-01-27
申请人： Philip A. Bernstein , Colin W. Reid
发明人： Philip A. Bernstein , Colin W. Reid
IPC分类号： G06F12/16
CPC分类号： G06F3/0659 , G06F3/0623 , G06F3/0638 , G06F3/0679 , G06F3/0688 , G06F12/0246 , G06F2212/1036 , G06F2212/7211
摘要： A shared storage system is described herein that is based on an append-only model of updating a storage device to allow multiple computers to access storage with lighter-weight synchronization than traditional systems and to reduce wear on flash-based storage devices. Appending data allows multiple computers to write to the same storage device without interference and without synchronization between the computers. Computers can also safely read a written page without using synchronization because the system limits how data can be changed once written. The system may record a log of append operations performed and ensure idempotence by storing a key specified by the caller in the log along with each log entry. The system also provides broadcasts about appended data to computers so that coordination between computers can occur without direct communication between the computers.
摘要翻译：这里描述了一种共享存储系统，其基于仅更新存储设备的附加模型，以允许多个计算机以比传统系统更轻的重量同步访问存储器，并减少基于闪存的存储设备的磨损。附加数据允许多台计算机写入相同的存储设备而不会受到干扰，并且计算机之间没有同步。计算机也可以安全地读取书面页面而不使用同步，因为系统限制了一旦写入数据后可以更改数据。系统可以记录执行的附加操作的日志，并通过将日志中的主叫方指定的密钥与每个日志条目一起存储来确保等权力。该系统还向计算机提供关于附加数据的广播，使得计算机之间的协调可以在计算机之间进行直接通信而发生。

4. 发明申请

US20110320496A1 CONCURRENCY CONTROL FOR CONFLUENT TREES 有权
标题翻译：争议条约的同意控制
公开(公告)号：US20110320496A1
公开(公告)日：2011-12-29
申请号：US12824254
申请日：2010-06-28
申请人： Colin W. Reid , Philip A. Bernstein
发明人： Colin W. Reid , Philip A. Bernstein
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30356
摘要： Architecture that addresses the efficient detection of conflicts and the merging of data structures such as trees, when possible. The process of detecting conflicts and merging the trees is a meld operation. Confluent trees offer transactional consistency with some degree of isolation, and scaling out a concurrent system based on confluent trees can be accomplished where the meld operation is more efficient than the transaction computations. Transactions execute optimistically using lazily versioned “intention trees” that efficiently describe dependencies and effects using structure and content version information for each intention subtree. The data structure is modified by melding the intention trees in sequence, which causes each transaction to either commit (producing an incremental new version of the data structure) or abort (identifying a conflict which prevents the intention tree from being melded). The architecture is computationally efficient and completes without needing to access much of each tree.
摘要翻译：解决冲突有效检测的架构，以及数据结构（如树木）的合并。检测冲突和合并树木的过程是一个融合的行动。融合树提供了一定程度的交互性隔离，并且在融合操作比交易计算更有效的情况下，可以实现基于汇合树的并行系统的扩展。交易使用延迟版本的“意图树”乐观地执行，使用每个意图子树的结构和内容版本信息有效地描述依赖和效果。数据结构通过按顺序合并意图树进行修改，这导致每个事务提交（产生数据结构的增量新版本）或中止（识别妨碍意图树的融合的冲突）。该架构在计算上是有效的并且完成，而不需要访问每个树的大部分。

5. 发明申请

US20100191919A1 APPEND-BASED SHARED PERSISTENT STORAGE 有权
标题翻译：基于附录的共享存储
公开(公告)号：US20100191919A1
公开(公告)日：2010-07-29
申请号：US12360122
申请日：2009-01-27
申请人： Philip A. Bernstein , Colin W. Reid
发明人： Philip A. Bernstein , Colin W. Reid
IPC分类号： G06F12/08
CPC分类号： G06F3/0659 , G06F3/0623 , G06F3/0638 , G06F3/0679 , G06F3/0688 , G06F12/0246 , G06F2212/1036 , G06F2212/7211
摘要： A shared storage system is described herein that is based on an append-only model of updating a storage device to allow multiple computers to access storage with lighter-weight synchronization than traditional systems and to reduce wear on flash-based storage devices. Appending data allows multiple computers to write to the same storage device without interference and without synchronization between the computers. Computers can also safely read a written page without using synchronization because the system limits how data can be changed once written. The system may record a log of append operations performed and ensure idempotence by storing a key specified by the caller in the log along with each log entry. The system also provides broadcasts about appended data to computers so that coordination between computers can occur without direct communication between the computers.
摘要翻译：这里描述了一种共享存储系统，其基于仅更新存储设备的附加模型，以允许多个计算机以比传统系统更轻的重量同步访问存储器，并减少基于闪存的存储设备的磨损。附加数据允许多台计算机写入相同的存储设备而不会受到干扰，并且计算机之间没有同步。计算机也可以安全地读取书面页面而不使用同步，因为系统限制了一旦写入数据后可以更改数据。系统可以记录执行的附加操作的日志，并通过将日志中的主叫方指定的密钥与每个日志条目一起存储来确保等权力。该系统还向计算机提供关于附加数据的广播，使得计算机之间的协调可以在计算机之间没有直接通信的情况下进行。

6. 发明申请

US20110295969A1 TOTALLY ORDERED LOG ON APPENDABLE STORAGE 有权
标题翻译：完全登录可以使用的存储
公开(公告)号：US20110295969A1
公开(公告)日：2011-12-01
申请号：US12786447
申请日：2010-05-25
申请人： Philip A. Bernstein , Dahlia Malkhi , Colin Wilson Reid , Mahesh Balakrishnan
发明人： Philip A. Bernstein , Dahlia Malkhi , Colin Wilson Reid , Mahesh Balakrishnan
IPC分类号： G06F15/16
CPC分类号： G06F11/1471 , G06F11/2094 , G06F2201/82
摘要： Computers are provided with a totally ordered, durable shared log. Shared storage is used and can be directly accessed by the computers over a network. Append-log operations are made atomic in the face of failures by committing provisional append ordering information onto a log. The log may comprise multiple flash packages or non-volatile memory devices, referred to as segments, although any shared storage device(s) may be used. Each log record is a multi-page stripe, where each page of a stripe is written to a different segment. Fault-tolerant protocol variants append stripes to the log, such that stripes are totally ordered in the log and each stripe is written atomically.
摘要翻译：计算机提供了一个完全有序，耐用的共享日志。共享存储被使用，可以由网络上的计算机直接访问。通过将临时附加订单信息提交到日志，Append-log操作在面临故障时被做成原子。尽管可以使用任何共享的存储设备，该日志可以包括被称为段的多个闪存包或非易失性存储设备。每个日志记录是一个多页条带，其中每个条带的页面被写入不同的段。容错协议变体将条纹附加到日志，使得条纹在日志中完全排序，每个条带是原子写入的。

7. 发明授权

US07774469B2 Consistent cluster operational data in a server cluster using a quorum of replicas 有权
标题翻译：服务器集群中使用复制数量的一致的集群操作数据
公开(公告)号：US07774469B2
公开(公告)日：2010-08-10
申请号：US11225222
申请日：2005-09-12
申请人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh Doshi , David B. Lomet , Gor V. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita V. Shrivastava
发明人： Michael T. Massa , David A. Dion , Rajsekhar Das , Rushabh Doshi , David B. Lomet , Gor V. Nishanov , Philip A. Bernstein , Rod N. Gamache , Rohit Jain , Sunita V. Shrivastava
IPC分类号： G06F15/173 , G06F11/00
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.
摘要翻译：通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。副本成员维护集群操作数据。当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

8. 发明授权

US07647298B2 Generation of query and update views for object relational mapping 有权
标题翻译：生成对象关系映射的查询和更新视图
公开(公告)号：US07647298B2
公开(公告)日：2010-01-12
申请号：US11724991
申请日：2007-03-16
申请人： Atul Adya , Philip A. Bernstein , Sergey Melnik
发明人： Atul Adya , Philip A. Bernstein , Sergey Melnik
IPC分类号： G06F7/00 , G06F17/00 , G06F17/30
CPC分类号： G06F17/30418 , Y10S707/99932
摘要： A data access architecture may includes a mapping architecture for mapping data as may be used by an application to data as persisted in a database. Such a mapping architecture uses two types of “mapping views”—one for translating queries and the other for translating updates. A mechanism is provided that automatically generates query and update views from high-level mapping specifications. A validation may be performed to ensure that a mapping specification, when used in conjunction with a mapping architecture, allows data to “roundtrip” from the application to the database, without loss of data.
摘要翻译：数据访问架构可以包括映射体系结构，用于将应用程序可能使用的数据映射为持久存储在数据库中的数据。这种映射架构使用两种类型的“映射视图” - 一种用于翻译查询，另一种用于翻译更新。提供了一种自动生成来自高级映射规范的查询和更新视图的机制。可以执行验证以确保映射规范在与映射体系结合使用时允许数据从应用程序“往返”到数据库，而不会丢失数据。

9. 发明申请

US20080114785A1 Mapping composition using algebraic operators 失效
标题翻译：使用代数运算符绘制组合
公开(公告)号：US20080114785A1
公开(公告)日：2008-05-15
申请号：US11599744
申请日：2006-11-15
申请人： Philip A. Bernstein , Todd J. Green , Sergey Melnik , Alan Nash
发明人： Philip A. Bernstein , Todd J. Green , Sergey Melnik , Alan Nash
IPC分类号： G06F7/00
CPC分类号： G06F17/30569 , Y10S707/99932 , Y10S707/99933
摘要： A general-purpose reusable algebraic-based composition algorithm for composing mappings between data schemas. The algorithm handles more expressive mappings, makes a best-effort to eliminate symbols when a perfect answer cannot be obtained, includes new heuristics, and is extensible. A relational algebraic language is provided wherein each mapping is expressed as a set of constraints, and each constraint is either a containment or equality of two or more relational algebraic expressions. The composition mechanism exploits monotonicity properties of algebraic operators in operator arguments, handles NULLs and bag semantics, operates to allow composition to produce a partial result when a complete result is not possible, facilitates symbols elimination one symbol at a time using left composition, for example, as a way of isolating the symbols, supports making a best-effort to eliminate as many symbols as possible from an intermediate schema, and handles unknown or partially known operators via delayed handling.
摘要翻译：一种用于组合数据模式之间映射的通用可重用代数组合算法。该算法处理更具表现力的映射，尽最大努力在无法获得完美答案时消除符号，包括新的启发式，并且是可扩展的。提供了关系代数语言，其中每个映射被表示为一组约束，并且每个约束是两个或多个关系代数表达式的容纳或相等。组合机制利用代数运算符在运算符参数中的单调性，处理NULL和包语义，运算以允许组合在不完整结果时产生部分结果，便于使用左组合一次使用符号消除一个符号作为隔离符号的方法，支持尽最大努力从中间模式消除尽可能多的符号，并通过延迟处理来处理未知或部分已知的运算符。

10. 发明授权

US06826568B2 Methods and system for model matching 有权
标题翻译：模型匹配的方法和系统
公开(公告)号：US06826568B2
公开(公告)日：2004-11-30
申请号：US10028912
申请日：2001-12-20
申请人： Philip A. Bernstein , Jayant Madhavan
发明人： Philip A. Bernstein , Jayant Madhavan
IPC分类号： G06F1730
CPC分类号： G06F17/30917 , G06F17/30569 , Y10S707/99936 , Y10S707/99942
摘要： Systems and methods for automatically and generically matching models are provided, such as may be provided in a matching application or matching component, or provided in a general purpose system for managing models. The methods are generic since the methods apply to hierarchical data sets outside of any particular data model or application. Similarity coefficients are calculated for, and mappings are discovered between, schema elements based on their names, data types, constraints, and schema structure, using a broad set of techniques. Some of these techniques include the integrated use of linguistic and structural matching, context dependent matching of shared types, and a bias toward subtree, or leaf, structure where much of the schema content resides.
摘要翻译：提供了用于自动和一般匹配模型的系统和方法，例如可以在匹配的应用或匹配组件中提供，或者提供在用于管理模型的通用系统中。这些方法是通用的，因为这些方法适用于任何特定数据模型或应用程序之外的分层数据集。计算相似系数，并使用广泛的技术，基于其名称，数据类型，约束和模式结构，在模式元素之间发现映射。这些技术中的一些包括语言和结构匹配的集成使用，共享类型的上下文相关匹配，以及大部分模式内容所在的子树或叶结构的偏见。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式