BlobSeer: How to Enable Efficient Versioning for Large Object Storage under Heavy Access Concurrency

Bogdan Nicolae 1, * Gabriel Antoniu 1 Luc Bougé 1
* Corresponding author
1 KerData - Scalable Storage for Clouds and Beyond
Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
Abstract : To accommodate the needs of large-scale distributed P2P systems, scalable data management strategies are required, allowing appli cations 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.
Complete list of metadatas

https://hal.inria.fr/inria-00382354
Contributor : Bogdan Nicolae <>
Submitted on : Thursday, May 7, 2009 - 4:43:44 PM
Last modification on : Friday, November 16, 2018 - 1:40:44 AM
Long-term archiving on : Thursday, June 30, 2011 - 11:26:36 AM

Identifiers

Citation

Bogdan Nicolae, Gabriel Antoniu, Luc Bougé. BlobSeer: How to Enable Efficient Versioning for Large Object Storage under Heavy Access Concurrency. EDBT/ICDT '09: Proceedings of the 2009 EDBT/ICDT Workshops, Mar 2009, St Petersburg, Russia. pp.18-25, ⟨10.1145/1698790.1698796⟩. ⟨inria-00382354⟩

Share

Metrics

Record views

544

Files downloads

487