KEYWORDS: Data storage, Associative arrays, Data storage servers, Computing systems, Algorithms, Data modeling, Control systems, Mathematics, Computer science, Explosives
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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.