메뉴 건너뛰기




Volumn , Issue , 2012, Pages

Probabilistic deduplication for cluster-based storage systems

Author keywords

Cloud computing; Deduplication; Distributed storage systems; Set intersection

Indexed keywords

BACK-UP SYSTEMS; CLUSTER-BASED; CLUSTER-BASED STORAGE; COMPUTATIONAL COSTS; DATA BLOCKS; DATA SETS; DEDUPLICATION; DISTRIBUTED STORAGE SYSTEM; EXPERIMENTAL PLATFORM; INDEXING MECHANISMS; LOAD-BALANCING; MEMORY OVERHEADS; MEMORY RESOURCES; SET INTERSECTION; STORAGE SYSTEMS; WIKIPEDIA;

EID: 84870480815     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2391229.2391246     Document Type: Conference Paper
Times cited : (40)

References (23)
  • 1
    • 84870515887 scopus 로고    scopus 로고
    • http://dumps.wikimedia.org/enwiki/.
  • 2
    • 84870571522 scopus 로고    scopus 로고
    • https://www.grid5000.fr/.
  • 4
    • 76349109236 scopus 로고    scopus 로고
    • Extreme binning: Scalable, parallel deduplication for chunk-based file backup
    • Deepavali Bhagwat, Kave Eshghi, Darrell D. E. Long, and Mark Lillibridge. Extreme Binning: Scalable, Parallel Deduplication for Chunk-based File Backup. In MASCOTS, 2009.
    • (2009) MASCOTS
    • Bhagwat, D.1    Eshghi, K.2    Long, D.D.E.3    Lillibridge, M.4
  • 5
    • 84976810280 scopus 로고
    • Copy detection mechanisms for digital documents
    • S. Brin, J. Davis, and H. Garcia-Molina. Copy Detection Mechanisms for Digital Documents. In SIGMOD, 1995.
    • (1995) SIGMOD
    • Brin, S.1    Davis, J.2    Garcia-Molina, H.3
  • 6
    • 85077072489 scopus 로고    scopus 로고
    • Tradeoffs in scalable data routing for deduplication clusters
    • Wei Dong, Fred Douglis, Kai Li, Hugo Patterson, Sazzala Reddy, and Philip Shilane. Tradeoffs in Scalable Data Routing for Deduplication Clusters. In FAST, 2011.
    • (2011) FAST
    • Wei, D.1    Douglis, F.2    Li, K.3    Patterson, H.4    Reddy, S.5    Shilane, P.6
  • 8
    • 10444235961 scopus 로고    scopus 로고
    • Loglog counting of large cardinalities
    • M. Durand and P. Flajolet. Loglog counting of large cardinalities. In ESA, 2003.
    • (2003) ESA
    • Durand, M.1    Flajolet, P.2
  • 11
    • 84860571208 scopus 로고    scopus 로고
    • Building a high-performance deduplication systems
    • Fanglu Guo and Petros Efstathopoulos. Building a High-performance Deduplication Systems. In USENIX ATC, 2011.
    • (2011) USENIX ATC
    • Guo, F.1    Efstathopoulos, P.2
  • 12
    • 85077053929 scopus 로고    scopus 로고
    • Bimodal content defined chunking for backup streams
    • Erik Kruus, Cristian Ungureanu, and Cezary Dubnicki. Bimodal Content Defined Chunking for Backup Streams. In FAST, 2010.
    • (2010) FAST
    • Kruus, E.1    Ungureanu, C.2    Dubnicki, C.3
  • 13
    • 85091109842 scopus 로고    scopus 로고
    • Redundancy elimination within large collections of files
    • Purushottam Kulkarni, Fred Douglis, Jason LaVoie, and John M. Tracey. Redundancy elimination within large collections of files. In USENIX ATC, 2004.
    • (2004) USENIX ATC
    • Kulkarni, P.1    Douglis, F.2    LaVoie, J.3    Tracey, J.M.4
  • 14
  • 15
    • 85077032135 scopus 로고    scopus 로고
    • A study of practical deduplication
    • Dutch T. Meyer and William J. Bolosky. A Study of Practical Deduplication. In FAST, 2011.
    • (2011) FAST
    • Meyer, D.T.1    Bolosky, W.J.2
  • 16
    • 34547637575 scopus 로고    scopus 로고
    • Discovering and exploiting keyword and attribute-value co-occurrences to improve P2P routing indices
    • Sebastian Michel, Matthias Bender, Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum, and Christian Zimmer. Discovering and Exploiting Keyword and Attribute-Value Co-occurrences to Improve P2P Routing Indices. In CIKM, 2006.
    • (2006) CIKM
    • Michel, S.1    Bender, M.2    Ntarmos, N.3    Triantafillou, P.4    Weikum, G.5    Zimmer, C.6
  • 18
    • 84870815282 scopus 로고    scopus 로고
    • Alternatives for detecting redundancy in storage systems data
    • C. Policroniades and I. Pratt. Alternatives for Detecting Redundancy in Storage Systems Data. In USENIX ATC, 2004.
    • (2004) USENIX ATC
    • Policroniades, C.1    Pratt, I.2
  • 19
    • 79955492701 scopus 로고    scopus 로고
    • Exploiting similarity for multi-source downloads using file handprints
    • Himabindu Pucha, David G. Andersen, and Michael Kaminsky. Exploiting Similarity for Multi-Source Downloads Using File Handprints. In NSDI, 2007.
    • (2007) NSDI
    • Pucha, H.1    Andersen, D.G.2    Kaminsky, M.3
  • 20
    • 76349123641 scopus 로고    scopus 로고
    • Fast, inexpensive content-addressed storage in foundation
    • Sean Rhea, Russ Cox, and Alex Pesterev. Fast, inexpensive content-addressed storage in foundation. In USENIX ATC, 2008.
    • (2008) USENIX ATC
    • Rhea, S.1    Cox, R.2    Pesterev, A.3
  • 21
    • 77953300991 scopus 로고    scopus 로고
    • Efficient similarity estimation for systems exploiting data redundancy
    • Kanat Tangwongsan, Himabindu Pucha, David G. Andersen, and Michael Kaminsky. Efficient Similarity Estimation for Systems Exploiting Data Redundancy. In INFOCOM, 2010.
    • (2010) INFOCOM
    • Tangwongsan, K.1    Pucha, H.2    Andersen, D.G.3    Kaminsky, M.4
  • 22
    • 85077053402 scopus 로고    scopus 로고
    • HydraFS: A high-throughput file system for the HYDRAstor content-addressable storage system
    • Cristian Ungureanu, Benjamin Atkin, Akshat Aranya, Salil Gokhale, Stephen Rago, Grzegorz Calkowski, Cezary Dubnicki, and Aniruddha Bohra. HydraFS: a High-Throughput File System for the HYDRAstor Content-Addressable Storage System. In FAST, 2010.
    • (2010) FAST
    • Ungureanu, C.1    Atkin, B.2    Aranya, A.3    Gokhale, S.4    Rago, S.5    Calkowski, G.6    Dubnicki, C.7    Bohra, A.8


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.