Please download the dossier by clicking on the dossier button x
×

Request routing and query processing in a sharded database

  • US 10,331,634 B2
  • Filed: 09/16/2016
  • Issued: 06/25/2019
  • Est. Priority Date: 10/07/2015
  • Status: Active Grant
First Claim
Patent Images

1. A method, comprising:

  • storing, by a shard coordinator, a plurality of map entries;

    wherein each map entry, of the plurality of map entries, maps a distinct sharding key value set to a shard of a plurality of shards of a sharded database;

    wherein at least one shard of the plurality of shards is mapped to a sharding key value set that comprises non-contiguous sharding key values;

    wherein each shard of the plurality of shards comprises one or more database servers;

    receiving, at the shard coordinator, a first query from a client application, wherein the first query comprises a first sharding key value;

    in response to receiving the first query, performing;

    identifying a particular map entry, of the plurality of map entries, that corresponds to a sharding key value set that includes the first sharding key value;

    using the particular map entry to identify a target shard, from the plurality of shards, that corresponds to the sharding key value set that includes the first sharding key value;

    generating a first result for the first query by using the target shard that corresponds to the sharding key value set that includes the first sharding key value; and

    sending, to the client application, a response to the first query that is based on the first result;

    wherein generating the first result for the first query and sending the response to the first query are performed by the target shard.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×