中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

920 records (took 0.024 seconds)

    REPLICATION LAG-CONSTRAINED DELETION OF DATA IN A LARGE-SCALE DISTRIBUTED DATA STORAGE SYSTEM
    2.
    发明申请
    REPLICATION LAG-CONSTRAINED DELETION OF DATA IN A LARGE-SCALE DISTRIBUTED DATA STORAGE SYSTEM 审中-公开

    公开(公告)号：US20180336237A1

    公开(公告)日：2018-11-22

    申请号：US15971792

    申请日：2018-05-04

    Applicant: Dropbox, Inc.

    Inventor： Mehant Baid ,  Bogdan Munteanu ,  Daniel K. Tahara

    IPC: G06F17/30

    CPC classification number: G06F17/30371 ,  G06F17/30283 ,  G06F17/30348

    Abstract: Computer-implemented techniques for replication-lag constrained deletion of data in a distributed data storage system. In some aspects, the techniques improve the operation of a computing system by preventing too high of a delete rate that causes severe replication lag while at the same time increasing and decreasing the delete rate over time to a maximum allowable delete rate constrained by measured replication lag in terms of both local replication lag and geographic replication lag. In one implementation, the delete rate is adjusted by increasing or decreasing a pause interval that determines how long a database data deletion process pauses between submitting database deletion commands to a database server.

    Relaxing transaction serializability with statement-based data replication
    3.
    发明授权
    Relaxing transaction serializability with statement-based data replication 有权

    公开(公告)号：US09990225B2

    公开(公告)日：2018-06-05

    申请号：US14695870

    申请日：2015-04-24

    Applicant: International Business Machines Corporation

    Inventor： Thomas P. Boldt ,  Sunil K. Sarin ,  Dirk A. Seelemann, II ,  Glenn P. Steffler

    IPC: G06F9/46 ,  G06F17/30

    CPC classification number: G06F9/466 ,  G06F17/30283 ,  G06F17/30575

    Abstract: Consistency of replicated data copies with statement-based replication is provided without requiring transaction serializability. At a subordinate replication node, a transaction start message, replicated data modification statements, and a transaction commit message are received for a next committed transaction from a master replication node, wherein the transaction start message carries a master transaction identifier, an invisibility list consisting of identifiers of other master transactions that had started and not yet committed when this master transaction started, and an earliest invisible master transaction identifier. The master transaction identifier, invisibility list, and earliest invisible transaction identifier are mapped to subordinate transaction identifiers to preserve an order of transaction identifiers from the master replication node. A subordinate transaction is started with the mapped subordinate transaction identifier and with an invisibility list consisting of the mapped subordinate transaction identifiers for the master invisibility list for execution of the received data modification statements.

    METHOD FOR PROVIDING M2M DATA
    5.
    发明申请
    METHOD FOR PROVIDING M2M DATA 审中-公开

    公开(公告)号：US20180124810A1

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

    申请号：US15854845

    申请日：2017-12-27

    Applicant: NEC Europe Ltd.

    Inventor： Tobias Jacobs ,  Salvatore Longo

    IPC: H04W72/12 ,  H04W4/00 ,  G06F9/54 ,  G06F17/30 ,  H04L29/08

    CPC classification number: H04W72/1242 ,  G06F9/54 ,  G06F9/542 ,  G06F17/30283 ,  H04L67/2842 ,  H04W4/70

    Abstract: A method for providing M2M data items according to M2M data subscriptions retrieved from an M2M frontend (FE) by an M2M backend (BE) to one or more M2M applications includes representing the data items by a set of parameters including a required update frequency and a weight representing an importance of the data item; determining a schedule for retrieving data items from the FE by the BE based on the weights of the data items; determining that an actual period required to update each of one or more respective data items is larger than a required period corresponding to the required update frequency and adding a penalty value to the weight of each of the respective one or more data items to provide updated weights; and modifying the schedule based on the updated weights.

    METHOD AND SYSTEM FOR PROVIDING A FEDERATED WIDE AREA MOTION IMAGERY COLLECTION SERVICE
    6.
    发明申请
    METHOD AND SYSTEM FOR PROVIDING A FEDERATED WIDE AREA MOTION IMAGERY COLLECTION SERVICE 审中-公开

    公开(公告)号：US20180121425A1

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

    申请号：US15850069

    申请日：2017-12-21

    Applicant: PIXIA CORP.

    Inventor： Rahul C. THAKKAR ,  Michael L. MARAIST

    IPC: G06F17/30 ,  H04L29/08

    CPC classification number: G06F17/3028 ,  G06F17/30047 ,  G06F17/30241 ,  G06F17/30283 ,  G06F17/30858 ,  H04L67/16

    Abstract: This disclosure provides a federated wide area motion imagery (WAMI) collection service (CS) by: receiving an alert from a WAMI alert-service (A) respectively associated with a WAMI CS regarding any updates to WAMI data served by the WAMI CS at the federated WAMI CS, the WAMI CS providing WAMI collection metadata; issuing a request to the WAMI A associated with the WAMI CS to read information on what is updated; receiving a response from the WAMI A at the federated WAMI CS, the response comprising tree nodes corresponding to WAMI collection metadata that are updated by the WAMI CS; issuing a subsequent request to the WAMI CS from the federated WAMI CS to retrieve the WAMI collection metadata from the WAMI CS corresponding to the collection tree nodes that are updated; receiving a response including the WAMI collection metadata from the WAMI CS; and storing the received WAMI collection metadata in cache of the federated WAMI CS of the system.

    Map-reduce job virtualization
    8.
    发明授权
    Map-reduce job virtualization 有权

    公开(公告)号：US09910888B2

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

    申请号：US14504237

    申请日：2014-10-01

    Applicant: Red Hat, Inc.

    Inventor： Shaun David Appleton

    IPC: G06F7/04 ,  G06F17/30 ,  G06F9/46

    CPC classification number: G06F17/30424 ,  G06F9/46 ,  G06F17/30283 ,  G06F17/30575 ,  G06F17/30598

    Abstract: A method for map-reduce job virtualization is disclosed. The method includes receiving a map-reduce job written in a first map-reduce language. The map-reduce job is to be performed in parallel on a plurality of nodes of a plurality of clusters. The method also includes selecting one or more clusters to run the map-reduce job. The method further includes identifying a second map-reduce language associated with the selected clusters. The method also includes converting the first map-reduce language of the map-reduce job into the second map-reduce language. The method further causes the map-reduce job in the second map-reduce language to be run on the plurality of nodes of the selected clusters.

Patent Agency Ranking