REQUEST ROUTING AND QUERY PROCESSING IN A SHARDED DATABASE
First Claim
Patent Images
1. A method comprising:
- performing a first operation that involves data that resides in both a first shard and a second shard of a sharded database by;
causing a client application to send a first request to the first shard to cause the first shard to perform a first portion of the first operation that involves data in the first shard, andcausing the client application to send a second request to the second shard to cause the second shard to perform a second portion of the first operation that involves data in the second shard;
performing a second operation that involves data that resides in both the first shard and the second shard of the sharded database by;
causing the client application to send a third request to a shard coordinator; and
in response to the third request, the shard coordinator causing;
the first shard to perform a first portion of the second operation that involves data in the first shard, andthe second shard to perform a second portion of the second operation that involves data in the second shard.
0 Assignments
0 Petitions
Accused Products
Abstract
Techniques are provided for creating, organizing, and maintaining a sharded database. A sharded database can be created using user-defined sharding, system-managed sharding, or composite sharding. The sharded database is implemented with relational database techniques. The techniques described can be used to route database requests and process queries in a sharded database.
6 Citations
20 Claims
-
1. A method comprising:
-
performing a first operation that involves data that resides in both a first shard and a second shard of a sharded database by; causing a client application to send a first request to the first shard to cause the first shard to perform a first portion of the first operation that involves data in the first shard, and causing the client application to send a second request to the second shard to cause the second shard to perform a second portion of the first operation that involves data in the second shard; performing a second operation that involves data that resides in both the first shard and the second shard of the sharded database by; causing the client application to send a third request to a shard coordinator; and in response to the third request, the shard coordinator causing; the first shard to perform a first portion of the second operation that involves data in the first shard, and the second shard to perform a second portion of the second operation that involves data in the second shard. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. One or more non-transitory computer-readable media storing instructions which, when executed by one or more processors, cause:
-
performing a first operation that involves data that resides in both a first shard and a second shard of a sharded database by; causing a client application to send a first request to the first shard to cause the first shard to perform a first portion of the first operation that involves data in the first shard, and causing the client application to send a second request to the second shard to cause the second shard to perform a second portion of the first operation that involves data in the second shard; performing a second operation that involves data that resides in both the first shard and the second shard of the sharded database by; causing the client application to send a third request to a shard coordinator; and in response to the third request, the shard coordinator causing; the first shard to perform a first portion of the second operation that involves data in the first shard, and the second shard to perform a second portion of the second operation that involves data in the second shard. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
Specification