Batch Codes for Asynchronous Recovery of Data
Ago-Erik Riet, Vitaly Skachek, Eldho K. Thomas

TL;DR
This paper introduces a new model of asynchronous batch codes enabling parallel data recovery in distributed systems, leveraging hypergraph theory to establish bounds and constructions for optimal redundancy.
Contribution
It defines asynchronous batch codes, connects them to hypergraph girth properties, and derives bounds on redundancy using hypergraph-theoretic problems, advancing coding theory for asynchronous data retrieval.
Findings
Optimal redundancy for t=2 is 2√k.
Asynchronous batch codes are shown to be graph-based.
Redundancy bounds for t≥3 are established as O(k^{1/(2-ε)}).
Abstract
We propose a new model of asynchronous batch codes that allow for parallel recovery of information symbols from a coded database in an asynchronous manner, i.e. when queries arrive at random times and they take varying time to process. We show that the graph-based batch codes studied by et al. are asynchronous. Further, we demonstrate that hypergraphs of Berge girth larger or equal to 4, respectively larger or equal to 3, yield graph-based asynchronous batch codes, respectively private information retrieval (PIR) codes. We prove the hypergraph-theoretic proposition that the maximum number of hyperedges in a hypergraph of a fixed Berge girth equals the quantity in a certain generalization of the hypergraph-theoretic (6,3)-problem, first posed by Brown, Erd\H{o}s and S\'{o}s. We then apply the constructions and bounds by Erd\H{o}s, Frankl and R\"{o}dl about this generalization of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
