中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

3 records (took 0.007 seconds)

    RETRIEVING POINT-IN-TIME COPIES OF A SOURCE DATABASE FOR CREATING VIRTUAL DATABASES
    1.
    发明申请
    RETRIEVING POINT-IN-TIME COPIES OF A SOURCE DATABASE FOR CREATING VIRTUAL DATABASES 审中-公开
    检索源数据库创建虚拟数据库的时间点复本

    公开(公告)号：US20140108348A1

    公开(公告)日：2014-04-17

    申请号：US13799644

    申请日：2013-03-13

    Applicant: Matthew Allen Ahrens ,  Subhadeep Sinha ,  George Raymond Wilson ,  Jeffrey Karr Biseda

    Inventor： Matthew Allen Ahrens ,  Subhadeep Sinha ,  George Raymond Wilson ,  Jeffrey Karr Biseda

    IPC: G06F17/30

    CPC classification number: G06F16/21 ,  G06F3/065 ,  G06F11/1446 ,  G06F11/1451 ,  G06F11/1456 ,  G06F11/1471 ,  G06F16/178 ,  G06F16/273 ,  G06F2201/80 ,  G06F2201/815 ,  G06F2201/84

    Abstract: A storage system maintains copies of a source database to allow virtual databases to be provisioned. Transaction logs received from the source database are applied to database blocks stored in the storage system to update the database blocks. The storage system checks if there are defect in the transaction logs of the source database. If a defect in transaction logs is detected, the storage system obtains a latest copy of the source database. The storage system matches database blocks of the received copy with database blocks already available in the storage system to determine whether a corresponding database block is already available in the storage system. If a received database block is different from database blocks already available at the storage system, the received database block is stored in the storage system. The database blocks may be matched using a hash value of the database blocks.

    Abstract translation: 存储系统维护源数据库的副本以允许配置虚拟数据库。 从源数据库接收的事务日志应用于存储在存储系统中的数据库块，以更新数据库块。 存储系统检查源数据库的事务日志中是否存在缺陷。 如果检测到事务日志中的缺陷，则存储系统将获取源数据库的最新副本。 存储系统将接收到的副本的数据库块与存储系统中已经可用的数据库块相匹配，以确定存储系统中相应的数据库块是否已经可用。 如果接收的数据库块与存储系统上已经可用的数据库块不同，则所接收的数据库块被存储在存储系统中。 可以使用数据库块的哈希值来匹配数据库块。

    ADAPTIVE RESOURCE MANAGEMENT
    3.
    发明申请
    ADAPTIVE RESOURCE MANAGEMENT 有权
    自适应资源管理

    公开(公告)号：US20110161973A1

    公开(公告)日：2011-06-30

    申请号：US12647337

    申请日：2009-12-24

    Applicant: Boris Klots ,  Subhadeep Sinha ,  Satish Kumar

    Inventor： Boris Klots ,  Subhadeep Sinha ,  Satish Kumar

    IPC: G06F9/46 ,  G06F17/30 ,  G06F15/173

    CPC classification number: H04L47/822 ,  G06F17/30566 ,  H04L41/0816 ,  H04L41/5009 ,  H04L41/5022 ,  H04L43/08 ,  H04L43/0888 ,  H04L47/10 ,  H04L47/805 ,  H04L47/828 ,  H04L67/10 ,  H04L67/325 ,  H04M15/00

    Abstract: Allocation of resources across multiple consumers allows efficient utilization of shared resources. Observed usages of resources by consumers over time intervals are used to determine a total throughput of resources by the consumers. The total throughput of resources is used to determine allocation of resources for a subsequent time interval. The consumers are associated with priorities used to determine their allocations. Minimum and maximum resource guarantees may be associated with consumers. The resource allocation aims to allocate resources based on the priorities of the consumers while aiming to avoid starvation by any consumer. The resource allocation allows efficient usage of network resources in a database storage system storing multiple virtual databases.

    Abstract translation: 跨多个消费者分配资源可以有效利用共享资源。 消费者随时间间隔观察资源的用途，用于确定消费者的资源总量。 资源的总吞吐量用于确定后续时间间隔内资源的分配。 消费者与确定其分配的优先级相关联。 最低和最高的资源保证可能与消费者有关。 资源分配旨在根据消费者的优先事项分配资源，同时旨在避免任何消费者的饥饿。 资源分配允许在存储多个虚拟数据库的数据库存储系统中有效地使用网络资源。

Patent Agency Ranking