A computer implemented method for dynamic sharding
When handling a request (13) for data (11) of at least one key (12): - providing this request (13) to a predetermined shard store (20); - this predetermined shard store (20) verifying, by means of its local subrange collection (42), whether this at least one key (12) is present in a local subrange (...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng ; fre ; ger |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | When handling a request (13) for data (11) of at least one key (12):
- providing this request (13) to a predetermined shard store (20);
- this predetermined shard store (20) verifying, by means of its local subrange collection (42), whether this at least one key (12) is present in a local subrange (40) of a shard (30) stored on this predetermined shard store (20); and
- when at least one key (12) is not present in a local subrange (40) of a shard (30) stored on this predetermined shard store (20), returning a message (60) comprising the local subrange collection (42) of this predetermined shard store (20). |
|---|