What's the difference? Efficient set reconciliation without prior context

Proceedings of the ACM SIGCOMM 2011 Conference, SIGCOMM'11

Volumn , Issue , 2011, Pages 218-229

  Eppstein, David ^a   Goodrich, Michael T ^a   Uyeda, Frank ^b   Varghese, George ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c YAHOO RESEARCH   (United States)

Author keywords

Algorithms; Design; Experimentation

Indexed keywords

CHARACTERISTIC POLYNOMIALS; COMMUNICATION OVERHEADS; DISTRIBUTED SYSTEMS; EFFICIENT SETS; ESSENTIAL COMPONENT; EXPERIMENTATION; MULTIPLE USER; PEELING ALGORITHM; PEER TO PEER; TORNADO CODES;

ALGORITHMS; COMPUTER OPERATING SYSTEMS; DESIGN; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; EXPERIMENTS;

PEER TO PEER NETWORKS;

EID: 80053169971     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2018436.2018462     Document Type: Conference Paper

References (21)

1. Data domain. http://www.datadomain.com/.
2. B. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13:422-426, 1970.
3. A. Broder. On the resemblance and containment of documents. Compression and Complexity of Sequences, '97.
4. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. J. Comput. Syst. Sci., 60:630-659, 2000.
5. J. Byers, J. Considine, M. Mitzenmacher, and S. Rost. Informed content delivery across adaptive overlay networks. In SIGCOMM, 2002.
6. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege. A digital fountain approach to reliable distribution of bulk data. In SIGCOMM, 1998.
7. G. Cormode and S. Muthukrishnan. What's new: finding significant differences in network data streams. IEEE/ACM Trans. Netw., 13:1219-1232, 2005. (Pubitemid 43034131)
8. G. Cormode, S. Muthukrishnan, and I. Rozenbaum. Summarizing and mining inverse distributions on data streams via dynamic inverse sampling. VLDB '05.
9. D. Eppstein and M. Goodrich. Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters. IEEE Trans. on Knowledge and Data Engineering, 23:297-306, 2011.
10. L. Fan, P. Cao, J. Almeida, and A. Broder. Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking (TON), 8(3):281-293, 2000.
11. J. Feigenbaum, S. Kannan, M. J. Strauss, and M. Viswanathan. An approximate L1-difference algorithm for massive data streams. SIAM Journal on Computing, 32(1):131-151, 2002.
12. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. J. of Computer and System Sciences, 31(2):182-209, 1985.
13. M. T. Goodrich and M. Mitzenmacher. Invertible Bloom Lookup Tables. ArXiv e-prints, 2011. 1101.2245.
14. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. STOC, 1998.
15. M. Karpovsky, L. Levitin, and A. Trachtenberg. Data verification and reconciliation with generalized error-control codes. IEEE Trans. Info. Theory, 49(7), july 2003.
16. P. Kulkarni, F. Douglis, J. Lavoie, and J. M. Tracey. Redundancy elimination within large collections of files. In USENIX ATC, 2004.
17. Y. Minsky, A. Trachtenberg, and R. Zippel. Set reconciliation with nearly optimal communication complexity. IEEE Trans. Info. Theory, 49(9):2213-2218, 2003.
18. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge Univ. Press, 1995.
19. S. Muthukrishnan. Data streams: Algorithms and applications. Found. Trends Theor. Comput. Sci., 2005.
20. R. Schweller, Z. Li, Y. Chen, Y. Gao, A. Gupta, Y. Zhang, P. A. Dinda, M.-Y. Kao, and G. Memik. Reversible sketches: enabling monitoring and analysis over high-speed data streams. IEEE/ACM Trans. Netw., 15:1059-1072, 2007. (Pubitemid 350111552)
21. B. Zhu, K. Li, and H. Patterson. Avoiding the disk bottleneck in the data domain deduplication file system. In FAST'08.