id: 01555940
dt: a
an: 01555940
au: Lin, Xuemin; Orlowska, Maria E.
ti: An efficient optimal algorithm for minimizing the overall communication
    cost in replicated data management.
so: Du, Ding-Zhu (ed.) et al., Algorithms and computation. 5th international
    symposium, ISAAC ’94, Beijing, P. R. China, August 25-27, 1994.
    Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 834, 243-251
    (1994).
py: 1994
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: 
ab: Summary: Quorum consensus methods have been widely applied to managing
    replicated data. In this paper, we study the problem of vote and quorum
    assignments for minimizing the overall communication cost of processing
    the typical demands of transactions. This problem is left open, even
    restricted to a uniform network, and we shall show that it can be
    solved by an efficient polynomial time algorithm.
rv: