中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

2699 records (took 0.06 seconds)

筛选除外

    Utilizing shared numeric locks
    3.
    发明授权
    Utilizing shared numeric locks 有权

    公开(公告)号：US09928265B2

    公开(公告)日：2018-03-27

    申请号：US13601135

    申请日：2012-08-31

    Applicant: Konduru Israel Rajakumar

    Inventor： Konduru Israel Rajakumar

    IPC: G06F17/30 ,  G06F9/52

    CPC classification number: G06F17/30362 ,  G06F9/526 ,  Y10S707/99938 ,  Y10S707/99952

    Abstract: A method and system for performing at least one transaction on at least one column of a table in a database system is disclosed. The method includes determining whether a first transaction of the at least one transaction fulfills all of at least one criteria. The method further includes ensuring that the at least one column is in a shared numeric lock if the first transaction fulfills all of the at least one criteria, wherein the shared numeric lock is a lock that allows at least a second transaction fulfilling all of the at least one criteria to access the same column concurrently with the first transaction without releasing the shared numeric lock between transactions, and wherein the shared numeric lock is released only after all of the transactions fulfilling all of the criteria have completed processing. The method further includes processing the first transaction.

    Metadata structures and related locking techniques to improve performance and scalability in a cluster file system
    6.
    发明授权
    Metadata structures and related locking techniques to improve performance and scalability in a cluster file system 有权
    元数据结构和相关的锁定技术，以提高集群文件系统的性能和可扩展性

    公开(公告)号：US09442952B2

    公开(公告)日：2016-09-13

    申请号：US14337567

    申请日：2014-07-22

    Applicant: Red Hat, Inc.

    Inventor： Kenneth Preslan ,  Michael J. Declerk ,  Matthew O'Keefe

    IPC: G06F17/30 ,  H04L29/08

    CPC classification number: G06F17/30171 ,  G06F17/30067 ,  H04L67/1002 ,  H04L67/1029 ,  H04L67/1031 ,  H04L67/1097 ,  Y10S707/99938

    Abstract: Metadata structures and related locking techniques to improve performance and scalability in a cluster file system are disclosed. In one implementation, a method includes receiving, by a server, a request for a first file, retrieving, by the server, the first file and metadata for a second file that is related to the first file, and sending, by the server in response to the retrieving and in advance of any request for the metadata for the second file, an asynchronous lock request to obtain a lock for accessing at least a portion of the metadata for the second file.

    Abstract translation: 公开了用于提高集群文件系统中的性能和可扩展性的元数据结构和相关锁定技术。 在一个实现中，一种方法包括由服务器接收对第一文件的请求，由服务器检索与第一文件相关的第二文件的第一文件和元数据，并由服务器发送 响应于检索并提前对第二文件的元数据的任何请求，获得用于访问第二文件的元数据的至少一部分的锁的异步锁定请求。

    Eventually consistent storage and transactions in cloud based environment
    7.
    发明授权
    Eventually consistent storage and transactions in cloud based environment 有权
    最终在云环境中存储和交易一致

    公开(公告)号：US09436502B2

    公开(公告)日：2016-09-06

    申请号：US13530661

    申请日：2012-06-22

    Applicant: Sebastian Burckhardt ,  Daniel Johannes Pieter Leijen ,  Manuel A. Fahndrich ,  Benjamin Paul Wood

    Inventor： Sebastian Burckhardt ,  Daniel Johannes Pieter Leijen ,  Manuel A. Fahndrich ,  Benjamin Paul Wood

    IPC: G06F9/46 ,  G06F17/30

    CPC classification number: G06F9/466 ,  G06F17/30212 ,  G06F17/30371 ,  G06F17/30575 ,  Y10S707/99938 ,  Y10S707/99954

    Abstract: An “Eventually Consistent Sharing Model” provides various techniques for using “revision diagrams” to determine both arbitration and visibility of changes or updates to shared data (e.g., data, databases, lists, etc.) without requiring a causally consistent partial order for visibility, and without requiring change or update timestamps for arbitration. In particular, the Eventually Consistent Sharing Model provides fork-join automata based on revision diagrams to track the forking and joining of data versions, thereby tracking updates made to replicas of that data by one or more sources. “Cloud types” are used to define a structure of the shared data that enables fully automatic conflict resolution when updating the shared data. These concepts enable mobile devices (or other computing devices that may periodically go “offline”) to share structured data in cloud-based environments in a manner that provides local data replicas for offline operation while guaranteeing eventually consistent convergence of the data replicas.

    Abstract translation: “最终一致共享模型”提供了各种使用“修订图”来确定对共享数据（例如数据，数据库，列表等）进行更改或更新的仲裁和可见性的各种技术，而不需要因果关系一致的部分可见度 ，而不需要更改或更新仲裁的时间戳。 特别地，最终一致共享模型基于修订图提供叉连接自动机，以跟踪数据版本的分支和加入，从而跟踪由一个或多个源对该数据的副本的更新。 “云类型”用于定义共享数据的结构，以便在更新共享数据时实现全自动冲突解决。 这些概念使移动设备（或其他可能定期“离线”的计算设备）能够以提供本地数据副本进行脱机操作的方式在基于云的环境中共享结构化数据，同时保证数据副本最终保持一致的收敛。

    Replicating data across multiple copies of a table in a database system
    10.
    发明授权
    Replicating data across multiple copies of a table in a database system 有权
    在数据库系统中的表的多个副本上复制数据

    公开(公告)号：US09244996B2

    公开(公告)日：2016-01-26

    申请号：US11771801

    申请日：2007-06-29

    Applicant: Serge Bourbonnais ,  Elizabeth B. Hamel ,  Bruce G. Lindsay ,  Stephen J. Todd

    Inventor： Serge Bourbonnais ,  Elizabeth B. Hamel ,  Bruce G. Lindsay ,  Stephen J. Todd

    IPC: G06F17/30

    CPC classification number: G06F17/30578 ,  G06F17/30345 ,  Y10S707/99938

    Abstract: A mechanism for handling transaction messages in asynchronous data replication in a database system, in which the database system includes a source node and a target node, and each transaction message has information concerning a row change to a table copy at the source node. The mechanism determines whether a first transaction message has a dependency on a preceding non-completed transaction message. Responsive to the first transaction message having a dependency on the preceding non-completed transaction, the mechanism holds the first transaction message, completes the preceding non-completed transaction message including applying the row change associated with the preceding non-completed transaction message to the table copy at the target node, and responsive to completing the preceding non-completed transaction message, releases the first transaction message and applying the row change associated with the first transaction message to the table copy at the target node.

    Abstract translation: 用于在数据库系统中处理异步数据复制中的事务消息的机制，其中数据库系统包括源节点和目标节点，并且每个事务消息具有关于在源节点处的表副本的行更改的信息。 该机制确定第一事务消息是否具有对先前未完成的事务消息的依赖性。 响应于对先前未完成的事务具有依赖性的第一交易消息，该机制保持第一交易消息，完成前述未完成的交易消息，包括将与先前未完成的交易消息相关联的行变更应用于表 在目标节点处的副本，并且响应于完成上述未完成的交易消息，释放第一交易消息并将与第一交易消息相关联的行变更应用于目标节点处的表副本。

Patent Agency Ranking