J. Metzner. Efficient replicated remote file comparison. IEEE Transactions on Computers, 40(5):651--659, May 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Delta Compression and Remote File Synchronization - Suel, Memon (2002) (Correct)
....presented earlier, or by transmitting the entire item in the case of small database records. In the following, we discuss the problems arising in this scenario, with emphasis on a recent approach described in [26, 33, 46] Some earlier work on reconciliation of record based data appeared in [7, 1, 31, 32]. Consider the case, assumed in [46] of a handheld device using the Palm Hotsync program to synchronize its database of addresses or appointments with a desktop device. If the handheld was last synchronized with the same desktop, then the Palm Hotsync software can use auxiliary logging ....
J. Metzner. Efficient replicated remote file comparison. IEEE Transactions on Computers, 40(5):651--659, May 1991.
Comparing File Copies with at Most Three Disagreeing Pages - Hwang, Wan (1997) (Correct)
....for the 1 problem. Let page k be indexed by the binary N vector of the number k. Then the ith comparison consists of signatures of the set of pages with 1 in the ith bit. We call the set of comparisons the binary representation matrix (BRM) Metzner [3] proposed a sequential algorithm and later [4] improved it with two other sequential tree algorithms. In particular, for the 2 problem, the second algorithm in [4] is equivalent to a parallel algorithm consisting of BRM and a comparison on 0018 9340 97 10.00 1997 IEEE . F.K. Hwang is with ....
....signatures of the set of pages with 1 in the ith bit. We call the set of comparisons the binary representation matrix (BRM) Metzner [3] proposed a sequential algorithm and later [4] improved it with two other sequential tree algorithms. In particular, for the 2 problem, the second algorithm in [4] is equivalent to a parallel algorithm consisting of BRM and a comparison on 0018 9340 97 10.00 1997 IEEE . F.K. Hwang is with AT T Bell Laboratories, Murray Hill, NJ 07974 0636. P.J. Wan is with the Department of Computer Science, University ....
J.M. Metzner, "Efficient Replicated Remote File Comparison," IEEE Trans. Computers, vol. 40, no. 5, pp. 651-660, May 1991.
Communication Complexity of Document Exchange - Cormode, Paterson, Sahinalp.. (2000) (31 citations) (Correct)
....These protocols assume a fixed upper bound f on d(x; y) and they require the transmission of Omega Gamma f log n) bits for the Hamming distance. If d(x; y) f , then the protocols result in an error; if d(x; y) o(f) then we show in this paper that too many bits are transmitted. Metzner [Met83, Met91] Abdel Ghaffar and El Abbadi [AGE94] and Barbar a and Lipton [BL91] consider the concrete problem of identifying different pages between two copies of an updated file. It is assumed that the differences between pages are aligned with the page boundaries, effectively resulting in Hamming ....
J. J. Metzner. Efficient replicated remote file comparison. IEEE Transactions on Computers, 40(5):651--659, May 1991.
Locating Corruptions in a Replicated File in a Distributed.. - Fu (1997) (Correct)
....this problem. In Table 1, N is the number of pages in the file, a1 is the assumption that an uncorrupted copy resides in a known site, and a2 is the assumption that N is a power of 2. 4 WAICHEE FU AND SIU CHEUNG CHAU Algorithm # copies a1 a2 max # # signatures transmitted failures Met86,91[9][10] 2 Yes Yes f f [ log 2 N) 1] FWA86[7] 2 Yes No 1 (log 2 N) 1 BGMF88[4] 2 Yes No 2 (log 2 N ) log 2 N 1] 2 1 MK90[11] 2 Yes No f f 1 AGE94[3] 2 Yes No f minfN;2fg AGE93[1] M No No f (M Gamma 2)minfN;fg minfN;2fg (centralized) AGE93[1] M No No f (M Gamma bM= 2f 1)c Gamma 1) ....
....patterns, their page signatures are the same is very small. 3. The use of page signatures has an inherent probability of assigning a corrupted page copy to the same page signature as a correct page copy, which has been 6 WAICHEE FU AND SIU CHEUNG CHAU claimed acceptable in previous work such as [3, 1, 11, 10]. Therefore, the probability P rob C that given a correct page copy and a corrupted page copy, they are given the same page signatures is assumed negligible. P rob A and P rob B will be shown to be no greater than P rob C , and hence P rob A and P rob B should also be negligible. The argument is ....
Metzner, J.J. (1991). Efficient replicated remote file comparison. IEEE Transactions on Computers. May 1991, C-40(5):651-660.
Locating More Corruptions in a Replicated File - Fu, Chau (1996) (Correct)
....over some finite field and is introduced in [8, 10] In particular, a method using Reed Solomon codes [5] has been suggested in [10] for problems with only 2 sites. 1] extended the method of Reed Solomon codes and solves the problem for M replicated sites, where M 3. Some other related work are [6, 4, 9, 3]. Although [1] solves a more general problem for M copies of the file, the following assumption is made. Assumption Z: M 2f 1: Assumption Z is made for the worst case consideration: Consideration Z: the page signatures for corrupted copies of a page can be identical. The condition in ....
J. Metzner. Efficient replicated remote file comparison. IEEE Transactions on Computers, pages C-- 40(5):651--660, May 1991.
Improved File Synchronization Techniques for Maintaining - Large Replicated Collections (Correct)
No context found.
J. Metzner. Efficient replicated remote file comparison. IEEE Transactions on Computers, 40(5):651--659, May 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC