Optimierung für Datenreplikationen

One feature of cloud storage systems is data fragmentation (or sharding) so that data can be distributed over multiple servers and subqueries can be run in parallel on the fragments. 
The data replication problem (DRP) describes the task of distributing copies of data records (that is, database fragments) among a set of servers in a distributed database system. For the application of flexible query answering, several fragments can be overlapping (in terms of rows in a database table). The optimization goals of the DRP are such that fragments are assigned to servers without exceeding their capacity and -- for a fixed replication factor m -- each table row can be found at at least m servers. This formulation of the DRP is an extension of the Bin Packing Problem with Conflicts (BPC) where the conflict graph is not a simple binary graph but a hypergraph.