BlobSeer：如何在高访问并发下为大型对象存储启用有效的版本控制
BlobSeer: How to Enable Efficient Versioning for Large Object Storage under Heavy Access Concurrency
摘要：
为了适应大规模分布式P2P系统的需求，需要可扩展的数据管理策略，使应用程序能够有效地处理不断增长的，高度分散的数据。本文讨论了如何有效地存储和访问超大型二进制数据对象（blob）的问题。它提出了一个有效的版本控制方案，允许大量的客户端并发地读取，写入和附加数据到巨大的blob，是碎片化的，分布在一个非常大的规模。由于原始元数据方案，基于在分布式哈希表（DHT）之上构建的分布式段树，在高并发性下实现了可伸缩性。我们的方法已经实现，并在我们的网格5000测试平台上的BlobSeer原型实验，使用多达175个节点。
英文摘要：
To accommodate the needs of large-scale distributed P2P systems, scalable data management strategies are required, allowing applications to efficiently cope with continuously growing, highly dis tributed data. This paper addresses the problem of efficiently stor ing and accessing very large binary data objects (blobs). It proposesan efficient versioning scheme allowing a large number of clients to concurrently read, write and append data to huge blobs that are fragmented and distributed at a very large scale. Scalability under heavy concurrency is achieved thanks to an original metadata scheme, based on a distributed segment tree built on top of a Distributed Hash Table (DHT). Our approach has been implemented and experimented within our BlobSeer prototype on the Grid'5000 testbed, using up to 175 nodes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
