Data structure for hash digest metadata component
作者： Kobi Luz , Tal Ben-Moshe , Renen Hallak
DOI:
关键词:
摘要: In one aspect, a method includes providing server that stores hash digest metadata table and configuring entries in the to include persistent fields non-persistent fields. The maps representing X-Page data its information. short field, physical layout offset deduplication reference count field flags field.
lens.org 参考文章(22)
Yaron Segev, Erez Webman, Irit Yadin-Lempel, Kobi Luz, Shahar Frank, Renen Hallak, Scalable block data storage using content addressing ,(2010)
Lior Aronovich, Optimizing hash table structure for digest matching in a data deduplication system ,(2013)
Chang-Ming Lin, Data alignment systems and methods ,(2003)
Sean M. Gulley, Wajdi K. Feghali, James D. Guilford, Vinodh Gopal, Method for signing and verifying data using multiple hash algorithms and digests in pkcs ,(2012)
Michael Kilian, Tom Teugels, Stephen J Todd, Methods and apparatus for accessing content in a virtual pool on a content addressable storage system ,(2004)
Kayuri Patel, Mark Muhlestein, System and method for representing named data streams within an on-disk structure of a file system ,(2003)
Osamu Torii, Tokumasa Hara, Memory controller, semiconductor memory system, and memory control method ,(2012)
Ulf Troppens, Harald Seipp, Daniel J. Winarski, Nils Haustein, Integrity checking and selective deduplication based on network parameters ,(2013)
Michael Zappe, Jonathan Thatcher, David Flynn, Apparatus, system, and method for coordinating storage requests in a multi-processor/multi-thread environment ,(2011)
Tao Haukka, Aki Niemi, Method of protecting digest authentication and key agreement (AKA) against man-in-the-middle (MITM) attack ,(2004)