메뉴 건너뛰기




Volumn , Issue , 2011, Pages 15-29

Tradeoffs in scalable data routing for deduplication clusters

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; LARGE DATASET;

EID: 85077072489     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (140)

References (37)
  • 3
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • July
    • B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, July 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.1
  • 9
    • 85080655869 scopus 로고    scopus 로고
    • EMC Corporation. Data Domain products. http://www.datadomain.com/products/, 2009.
    • (2009) Data Domain Products
  • 12
    • 84871195941 scopus 로고    scopus 로고
    • EMC Corporation. Data Domain Boost Software, 2010. http://www.datadomain.com/products/dd-boost.html.
    • (2010) Data Domain Boost Software
  • 13
  • 25
    • 85080763214 scopus 로고    scopus 로고
    • Network appliance
    • Network Appliance. NetApp ONTAP. http://www.netapp.com/us/products/platform-os/dedupe.html, 2009.
    • (2009) NetApp ONTAP
  • 29
    • 85080785884 scopus 로고    scopus 로고
    • United States of America. Public Law 107-204:”Sarbanes-Oxley Act of 2002”, July
    • 107th Congress, United States of America. Public Law 107-204:”Sarbanes-Oxley Act of 2002”, July 2002.
    • (2002) 107th Congress
  • 37
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • May
    • J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343, May 1977.
    • (1977) IEEE Transactions on Information Theory , vol.23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.2


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