Abstract

this article proposes a storage sharding method for systems implementing a registry model. The given steps of the method make it possible to obtain an efficiently distributed, easily scalable storage architecture optimized for the computing resources used, based on an approximating model of the business process of registries.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call