Abstract
Scaleable storage system has contradiction between usability and extendibility, so a suitable data placement scheme is given to solve this problem in scaleable object storage system. This scheme includes data placement algorithm and data reorganization algorithm. The data placement scheme has the following characteristics: the data placement algorithm uses key as the seed of random data generator to map data objects to storage nodes, which can provide reliable accessing to scaleable storage system. The data placement algorithm distributes data objects uniformly among storage nodes, which can improve I/O performance by accessing simultaneously several nodes. The data reorganization algorithm migrates data only from old storage nodes to added storage nodes (or from withdrawn nodes to surplus nodes), which can improve usability by reducing data migration. At last, the two algorithms have less cost of time and space, which is suitable to large-scale storage systems.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
