Font Size: a A A

Study Of Mass Storage Security System Framework And Fast Location Algorithm

Posted on:2012-03-04Degree:MasterType:Thesis
Country:ChinaCandidate:S GaoFull Text:PDF
GTID:2178330338998828Subject:Computer system architecture
Abstract/Summary:PDF Full Text Request
With the increasing of network size, the rapid expansion of network resources and more and more demands of users for data security and data access, the distributed storage technology faces enormous challenges. Because of the increasing scale of data and the more complex queries, traditional index system has been difficult to adapt to the rapidly growing application requirements. This paper studied a distributed storage strategies to make the system having some abilities of security and fault tolerance after storage, and then proposed a quick detecting algorithm based on improved skip list to solve the search speed.This paper designed a quick positioning storage system in the framework of storage security. The system has good security, availability and efficiency of data search. The main contents are as follows:(1) This paper studied the storage security technology, searched technology and data separation positioning algorithm. The data storage security is dependent on physical security and software security. This paper summed up a variety of technical means for the quick data searching in the positioning data technology. Then this paper analysised the data separation technology algorithm preliminarily.(2)This paper studied the storage security system policy. For the realization of storage security, it was considered the distributed storage system storage to ensure the security and availability. The study of RS algorithm solved the separation of data and split the process efficiency and fault tolerance issues. Finally the analysis of algorithms demonstrated its safety and efficiency and ensured the efficiency and safety of data processing in the mass data storage.(3) In order to ensure the data location search efficiency in the server-side when the data storage system are reading data, this paper proposed data location algorithm based on the improved skip list. Through the study of double skip list, the algorithm proved that it has ability of fast average seek time, easy programming and other characteristics, which was suitable for handling large-scale data.(4)After the study and analysis of two algorithms, this paper proposed a security framework with fast location function and designed each part of system on the basis of combining the two technologies, which realized the comprehensive improvement of security and efficiency.
Keywords/Search Tags:Storage Security, Distributed Storage, Double Skip List
PDF Full Text Request
Related items