Processing

Please wait...

Settings

Settings

Goto Application

1. WO2020117413 - FREE WORLD REPLICATION FOR KEY-VALUE STORE

Publication Number WO/2020/117413
Publication Date 11.06.2020
International Application No. PCT/US2019/059775
International Filing Date 05.11.2019
IPC
G06F 16/27 2019.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
16Information retrieval; Database structures therefor; File system structures therefor
20of structured data, e.g. relational data
27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
H04L 12/801 2013.01
HELECTRICITY
04ELECTRIC COMMUNICATION TECHNIQUE
LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
12Data switching networks
70Packet switching systems
801Flow control or congestion control
CPC
G06F 16/2237
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
16Information retrieval; Database structures therefor; File system structures therefor
20of structured data, e.g. relational data
22Indexing; Data structures therefor; Storage structures
2228Indexing structures
2237Vectors, bitmaps or matrices
G06F 16/2365
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
16Information retrieval; Database structures therefor; File system structures therefor
20of structured data, e.g. relational data
23Updating
2365Ensuring data consistency and integrity
G06F 16/27
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
16Information retrieval; Database structures therefor; File system structures therefor
20of structured data, e.g. relational data
27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
G06F 16/288
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
16Information retrieval; Database structures therefor; File system structures therefor
20of structured data, e.g. relational data
28Databases characterised by their database models, e.g. relational or object models
284Relational databases
288Entity relationship models
G06F 2209/548
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
2209Indexing scheme relating to G06F9/00
54Indexing scheme relating to G06F9/54
548Queue
G06F 9/546
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
FELECTRIC DIGITAL DATA PROCESSING
9Arrangements for program control, e.g. control units
06using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
46Multiprogramming arrangements
54Interprogram communication
546Message passing systems or structures, e.g. queues
Applicants
  • EBAY INC. [US]/[US]
Inventors
  • MITTAL, Rishabh
  • KADAYAM, Harihara
Agents
  • SWICKHAMER, Christopher M.
Priority Data
16/210,94805.12.2018US
Publication Language English (EN)
Filing Language English (EN)
Designated States
Title
(EN) FREE WORLD REPLICATION FOR KEY-VALUE STORE
(FR) RÉPLICATION DU MONDE LIBRE POUR MAGASIN DE VALEURS CLÉS
Abstract
(EN)
The "free world replication protocol" makes use of client computing resources, wherein the clients are not part of the replicated key- value store, but instead reside in the "free world" outside of the dedicated resources of the nodes of the replicated key-value store. In the free world replication protocol, only a single "write" client is authorized to modify the key- value store at any time but any number of clients may be authorized to read data from the key-value store. The write client sends its transactions to multiple nodes in the replicated key-value store. As a result, the latency between the transaction being sent from the client and the transaction being received by the multiple nodes is reduced by comparison to existing protocols in which each client sends transactions to a single node and that node forwards the transactions.
(FR)
L'invention concerne un « protocole de réplication du monde libre » qui utilise des ressources informatiques de client, les clients ne faisant pas partie de la mémoire de valeurs clés répliquées, mais, résidant plutôt dans le « monde libre » à l'extérieur des ressources dédiées des nœuds de la mémoire de valeurs clés répliquées. Dans le protocole de réplication du monde libre, seulement un seul client « d'écriture » est autorisé à modifier la mémoire de valeurs clés à tout moment, mais n'importe quel nombre de clients peut être autorisé à lire des données dans la mémoire de valeurs clés. Le client d'écriture envoie ses transactions à de multiples nœuds dans la mémoire de valeurs clés répliquées. Il s'ensuit que la latence entre la transaction qui est envoyée par le client et la transaction qui est reçue par les multiples nœuds est réduite par comparaison avec des protocoles existants dans lesquels chaque client envoie des transactions à un nœud unique et ce nœud transmet les transactions.
Latest bibliographic data on file with the International Bureau