CN102063473B - Method for expanding storage space on line - Google Patents
Method for expanding storage space on line Download PDFInfo
- Publication number
- CN102063473B CN102063473B CN201010597937A CN201010597937A CN102063473B CN 102063473 B CN102063473 B CN 102063473B CN 201010597937 A CN201010597937 A CN 201010597937A CN 201010597937 A CN201010597937 A CN 201010597937A CN 102063473 B CN102063473 B CN 102063473B
- Authority
- CN
- China
- Prior art keywords
- storage space
- server
- catalogue
- storage
- space
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 25
- 238000012217 deletion Methods 0.000 claims description 13
- 230000037430 deletion Effects 0.000 claims description 13
- PEDCQBHIVMGVHV-UHFFFAOYSA-N Glycerine Chemical compound OCC(O)CO PEDCQBHIVMGVHV-UHFFFAOYSA-N 0.000 description 6
- 239000012467 final product Substances 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000007796 conventional method Methods 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a method for expanding storage space on line, which comprises a step of providing a storage virtualization manager which can virtualize many storage spaces accessed by a server into a unique virtual storage space and display the unique virtual storage space to a user in a directory structure mode. The method is characterized in that the many storage spaces have the same directory structure. In the method, the online expansion of the storage space of the server can be realized by increasing the storage spaces the server can access at any time and avoiding turning off the service in advance at each time of capacity expansion, and as the number and size of the online storage spaces the server can access are not limited, endless capacity expansion can be realized.
Description
Technical field
The present invention relates to a kind of method that can online extension storage space.
Background technology
Through hardware approachs such as RAID cards the polylith hard disk is formed disk array, the polylith hard-disk capacity is combined into a jumbo purpose to reach.But hardware approach is not supported online expansion, and each dilatation all get earlier shutdown earlier, and the hard disk number that can support of RAID is limited after all in addition, and the max cap. that promptly can support is limited.
Summary of the invention
The purpose of this invention is to provide a kind of all storage spaces that server can be visited invent unique storage space and with the mode of catalogue be shown to the user can online extension storage space method.
For solving the problems of the technologies described above; The present invention takes following technical scheme: a kind of method that can online extension storage space; Comprise: a Storage Virtualization manager is provided; A plurality of storage spaces that said Storage Virtualization manager can be visited server invent unique virtual memory space, and will this unique virtual memory space be shown to the user with the mode of catalogue; It is characterized in that: said a plurality of storage spaces have identical bibliographic structure; Said method also comprises the new storage space of interpolation in said server; The said new storage space that is added is any storage space that said server can be visited.
Further, on said server, create storage space information table and directory information table; Said storage space information table comprises storage space numeral number and two fields of storage space residual capacity at least; Said directory information table comprises directory name and two fields of upper directory at least.
Further, the top-level director corresponding upper catalogue in said directory information table in said a plurality of storage space is said top-level director itself.
Further, when said unique virtual store was carried out directory operation, this operation related to operating with the corresponding catalogue of operated said catalogue in each said a plurality of storage space.
Further, when user's new files, on each said storage space of poll whether remaining space is arranged successively, if remaining space is arranged, new files on this said storage space just.
Further, when the user deletes a file, search for each said storage space successively and whether have this document, if there is this document, then with its deletion.
Further; When the user need copy to a certain catalogue on the said server; Whether there has been said a certain catalogue to be duplicated in the said directory information table of first retrieval,, then under each said storage space, distinguished newly-built corresponding said a certain catalogue if do not retrieve corresponding catalogue; And in said directory information table, add respective record, to guarantee each said storage space identical bibliographic structure is arranged all.
Further, said method also comprises from said server and deletes storage space; During the deletion storage space, in said storage space information table, delete the relevant information of this storage space, and the number designation of other storage spaces is arranged again.
Further, at least a portion in said a plurality of storage spaces is network storage space, then when this network storage space of said server inaccessible, does not show the content on this network storage space to the user.
Method among the present invention is through increase the addressable storage area of said server at any time in server; And needn't first closing server when each dilatation; Thereby can realize online expansion to the storage space of server; And, therefore can realize unrestrictedly dilatation because the number and the size of the addressable online storage space of said server are unrestricted.
Description of drawings
Fig. 1 is the storage space synoptic diagram when having two accessible spaces among the present invention.
Fig. 2 is the storage space synoptic diagram when having three accessible spaces among the present invention.。
Fig. 3 is the flow process of new files among the present invention.
Fig. 4 is bibliographic structure and institute's files stored of storage space 1.
Fig. 5 is bibliographic structure and institute's files stored of storage space 2.
Fig. 6 is bibliographic structure and the institute's files stored that the user sees.
Embodiment
Be elaborated in the face of technical scheme of the present invention down.
Said method that can unlimited online extension storage space comprises: a Storage Virtualization manager is provided; At least one storage space that said Storage Virtualization manager can be visited server invents unique virtual memory space; And will this unique virtual memory space be shown to the user with the mode of catalogue; Therefore the user needn't be concerned about reality has several storage spaces and file to be stored on earth on which storage space on earth, and concerning the user, that sees has only a storage space.The residual capacity size of a said storage space is the residual capacity size summation of all storage spaces, the user only need according to the normal mode access server and carry out newly-built catalogue, new files, deltree, sequence of operations such as deleted file gets final product.Preferably, said Storage Virtualization manager is through being arranged to identical bibliographic structure with the catalogue on said at least one storage space, and the catalogue mechanism that the user finally sees is identical with bibliographic structure on said each storage space.
When said unique virtual store was carried out directory operation, this operation related to operating with the corresponding catalogue of operated said catalogue in each said a plurality of storage space.
Preferably, when a newly-built catalogue, newly-built same catalogue on said at least one storage space is to keep on said each storage space identical catalogue being arranged.Preferably, when catalogue of deletion, search for catalogue corresponding on each said storage space successively, and delete this catalogue.
Preferably, when a newly-built file, analyze successively on each said storage space whether remaining space is arranged, if remaining space is arranged, new files on this said storage space just.
Preferably, when file of deletion, search for each said storage space successively and whether have this document, if there is this document, then with its deletion.
Therefore, said the seeking among the present invention can be implemented in the line extend sizes, and capacity is restricted hardly.
The concrete operations of the said method among the present invention are described through an embodiment below in conjunction with accompanying drawing 1-6.
If the IP address of a certain server be, the storage space that can visit of this server has two at first, is followed successively by said two numeral numbers that memory allocation is unique, is called storage space 1 and storage space 2, sees Fig. 1.
At first, on said server, create storage space information table and directory information table.Said storage space information table comprises following field: storage space numeral number, storage space residual capacity.Said directory information table comprises following field: directory name, upper directory, and the upper directory field set up index.
Secondly; Through said Storage Virtualization manager, newly-built identical catalogue on said storage space 1 and storage space 2 is like the catalogue of called after " temp "; And in said directory information table, add respective record, the upper directory of " temp " catalogue is itself.
The 3rd, through said Storage Virtualization manager, what be shown to the user just has only " temp " catalogue, and its capacity is the residual capacity sum of said storage space 1 and storage space 2.
At this moment, the user can carry out following corresponding operation under " temp " catalogue:
1. newly-built catalogue:
Like the newly-built catalogue that is called " userA " under " temp " catalogue, the user gets into " temp " catalogue according to the conventional method logon server, and directly newly-built then " userA " catalogue gets final product.And can be at the present addressable storage space of server through said Storage Virtualization manager, promptly newly-built same catalogue " userA " under " temp " catalogue on said storage space 1 and the storage space 2 is added respective record simultaneously in directory information table.
2. duplicate catalog:
Newly-built catalogue is a kind of special case of duplicate catalog; In the time of more; The user will copy to a certain catalogue on the server; As " 2010 year 01 the moon " this catalogue is copied to the following time of " temp " catalogue of server, whether there has been " userB " by name and its upper directory catalogue earlier in the said directory information table of retrieval, if do not retrieve corresponding catalogue for " temp "; The catalogue of newly-built by name " userB " under " temp " of each said storage space catalogue then, and in said directory information table, add respective record; There is same directory if retrieve, then then retrieves one deck catalogue " 2010 " down.Each layer catalogue all handled according to the method described above, to guarantee each said storage space identical bibliographic structure arranged all.
3. new files:
As will be under " 2010 year 01 the moon " this catalogue the file of new files " a.doc " by name; Then get into after " 2010 year 01 the moon " catalogue; Directly newly-built " a.doc " file is just passable; The user need not to be concerned about that this document exists on said storage space 1 or the storage space 2 on earth, because concerning the user, all storage spaces are all invented a space through said Storage Virtualization manager.
And as user in new files the time, the residue size of each said storage space that said Storage Virtualization manager can be visited the size of institute's new files with said server successively at present compares.For example; Earlier the size of institute's new files and the residue size of said storage space 1 are compared; If the size of institute's new files is less than the residue size of said storage space 1; Then just with the file storage of newly-built " a.doc " by name under " userB year 01 the moon " of storage space 1 catalogue, and " storage space residual capacity " field of said storage space information table carried out modify; If the size of institute's new files then compares the size of institute's new files and the residue size of said storage space 2 greater than the residue size of said storage space 1 again, carry out and above-mentioned storage space 1 identical operations.If relatively intacter all said storage spaces 1 and 2; Find that the two has not all had enough big remaining space to store this new files; Then provide the prompting of " memory space inadequate ", at this moment can select following online dilatation (promptly adding storage space), this moment, the step of new files was seen Fig. 3.
4. interpolation storage space:
So long as the storage space that said server can be visited all can be used to dilatation, if any the addressable storage space 3 of a server; When selecting said storage space 3 to carry out dilatation; According to said directory information table, said storage space 3 is carried out initialization operation, promptly create and existing said storage space 1 and 2 identical bibliographic structures for 3 times at this storage space; And in said storage space information table, add respective record, see Fig. 2.
5. deletion storage space:
During the deletion storage space; Only need this storage space and server are broken off physical connection; And in said storage space information table, carry out modify, promptly delete the relevant information of this storage space, and the number designation of other storage spaces arranged again get final product.For example, 5 storage spaces are arranged originally, existing the number designation of then former storage space 1 and storage space 2 is constant with storage space 3 deletions, and the number designation of the storage space after the former storage space 3 all adds 1.The data of being stored on the storage space of being deleted will no longer show, the data on the storage space that the user can be as required deletes this quilt dump to earlier on other storage mediums.
6. xcopy:
New files is a special case of xcopy, and in the time of more, the user can be with a certain file copy to server, and xcopy comprises that two go on foot greatly: duplicate catalog and xcopy.As will " 2009 year 05 the moon b.ppt " be copied on the server, earlier catalogue is carried out handled according to the step of duplicate catalog, and then " b.ppt " this file is carried out handled according to the step of new files.
7. show
Because the bibliographic structure of each storage space is on all four; Just the memory location of file is different, and can the content summation on each storage space be shown to the user according to the form of the tree-shaped catalogue of similar resource manager through the Storage Virtualization manager.
Suppose that the storage space that present server can be visited has only storage space 1 and storage space 2; Be illustrated in figure 4 as bibliographic structure and institute's files stored of storage space 1; Shown in Figure 5 is bibliographic structure and institute's files stored of storage space 2, and bibliographic structure that the user saw and storage file are then as shown in Figure 6.
If a certain storage space is network storage space; Then when this network storage space is not online; Be connected with the network of server in other words when breaking off; Then the content on this network storage space temporarily can not show, when its again when server is set up network and is connected, the content of being stored then can be shown to the user.
8. deleted file
To whether " c.txt " this file delete under " 2010 year 05 the moon " catalogue then be existed this document on the search storage space 1 earlier like the user, comprise the path of this document in the time of search.The file that for example under " 2010 year " catalogue, also has one " c.txt " by name, this file just be not the object that will delete.
If on storage space 1, search qualified file, just with its deletion, complete operation; Otherwise just continue on all the other storage spaces, to retrieve respective file successively, up to searching respective file, with its deletion, complete operation.
9. deltree
Deltree and comprised for two steps greatly: the file deltreeing under and deltreeing; As will be with " 2010 " this directory delete under " userA " catalogue; Then earlier according to the All Files under this catalogue of step deletion of deleted file, then this catalogue on each storage space is comprised that its sub-directory all deletes.
Method among the present invention is through increase the addressable storage area of said server at any time in server; And needn't first closing server when each dilatation; Thereby can realize online expansion to the storage space of server; And, therefore can realize unrestrictedly dilatation because the number and the size of the addressable online storage space of said server are unrestricted.
Claims (7)
- One kind can online extension storage space method, comprising:A Storage Virtualization manager is provided, and a plurality of storage spaces that said Storage Virtualization manager can be visited server invent unique virtual memory space, and will this unique virtual memory space be shown to the user with the mode of catalogue;It is characterized in that:Said a plurality of storage space has identical bibliographic structure: on said server, create storage space information table and directory information table to realize the operation to bibliographic structure; Wherein, said storage space information table comprises storage space numeral number and two fields of storage space residual capacity at least, and said directory information table comprises directory name and two fields of upper directory at least;When said unique virtual memory space was carried out directory operation, this operation related to operating with the corresponding catalogue of operated said catalogue in each said a plurality of storage space;Said method also comprises the new storage space of interpolation in said server; The said new storage space that is added is any storage space that said server can be visited; And needn't first closing server when each dilatation; Thereby can realize online expansion to the storage space of server; And, therefore can realize unrestrictedly dilatation because the number and the size of the addressable online storage space of said server are unrestricted.
- 2. the method for claim 1, it is characterized in that: the corresponding upper catalogue in said directory information table of the top-level director in said a plurality of storage spaces is said top-level director itself.
- 3. the method described in claim 1 is characterized in that: when user's new files, on each said storage space of poll whether remaining space is arranged successively, if remaining space is arranged, and new files on this said storage space just.
- 4. the method described in claim 1 is characterized in that: when the user deletes a file, search for each said storage space successively and whether have this document, if there is this document, then with its deletion.
- 5. the method described in claim 1; The user it is characterized in that: when need copy to a certain catalogue on the said server; Whether there has been said a certain catalogue to be duplicated in the said directory information table of first retrieval,, then under each said storage space, distinguished newly-built corresponding said a certain catalogue if do not retrieve corresponding catalogue; And in said directory information table, add respective record, to guarantee each said storage space identical bibliographic structure is arranged all.
- 6. the method described in claim 1, it is characterized in that: said method also comprises from said server deletes storage space; During the deletion storage space, in said storage space information table, delete the relevant information of this storage space, and the number designation of other storage spaces is arranged again.
- 7. the method described in claim 1-3; It is characterized in that: at least a portion in said a plurality of storage spaces is network storage space; Then when this network storage space of said server inaccessible, do not show the content on this network storage space to the user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010597937A CN102063473B (en) | 2010-12-21 | 2010-12-21 | Method for expanding storage space on line |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010597937A CN102063473B (en) | 2010-12-21 | 2010-12-21 | Method for expanding storage space on line |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102063473A CN102063473A (en) | 2011-05-18 |
| CN102063473B true CN102063473B (en) | 2012-10-10 |
Family
ID=43998749
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010597937A Active CN102063473B (en) | 2010-12-21 | 2010-12-21 | Method for expanding storage space on line |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102063473B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013106993A1 (en) * | 2012-01-17 | 2013-07-25 | 华为技术有限公司 | Capacity expansion method and device and data access method and device |
| CN103513940B (en) * | 2013-10-21 | 2016-09-07 | 北京华胜天成科技股份有限公司 | Virtual machine extends method and the virtual system console of disk size online |
| CN103902665A (en) * | 2014-03-11 | 2014-07-02 | 浪潮电子信息产业股份有限公司 | Storage virtualization system implementation method |
| CN106959827B (en) * | 2017-03-30 | 2020-02-21 | 联想(北京)有限公司 | Information processing method, information processing apparatus, and server |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005089446A2 (en) * | 2004-03-18 | 2005-09-29 | Andrew Peter Liebman | A novel media file access and storage solution for multi-workstation/multi-platform non-linear video editing systems |
| CN101311911A (en) * | 2007-05-23 | 2008-11-26 | 株式会社日立制作所 | Staging memory system and data migration method thereof |
| CN101729510A (en) * | 2008-10-29 | 2010-06-09 | Tcl集团股份有限公司 | Storage service system for virtual network and method for establishing the same |
-
2010
- 2010-12-21 CN CN201010597937A patent/CN102063473B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005089446A2 (en) * | 2004-03-18 | 2005-09-29 | Andrew Peter Liebman | A novel media file access and storage solution for multi-workstation/multi-platform non-linear video editing systems |
| CN101311911A (en) * | 2007-05-23 | 2008-11-26 | 株式会社日立制作所 | Staging memory system and data migration method thereof |
| CN101729510A (en) * | 2008-10-29 | 2010-06-09 | Tcl集团股份有限公司 | Storage service system for virtual network and method for establishing the same |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102063473A (en) | 2011-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104395904B (en) | Efficient data object storage and retrieval | |
| EP2368199B1 (en) | Asynchronous distributed de-duplication for replicated content addressable storage clusters | |
| US7814056B2 (en) | Method and apparatus for data backup using data blocks | |
| US8732217B2 (en) | Using a per file activity ratio to optimally relocate data between volumes | |
| US10037340B2 (en) | Tiered distributed storage policies | |
| CN100388276C (en) | Multiple concurrent active file systems | |
| US20070220029A1 (en) | System and method for hierarchical storage management using shadow volumes | |
| US9778996B1 (en) | File system version set infrastructure | |
| US7634627B1 (en) | System and method for performing extent level backups that support single file restores | |
| US9110919B2 (en) | Method for quickly identifying data residing on a volume in a multivolume file system | |
| US9037541B2 (en) | Metadata for data storage array | |
| CN102779180A (en) | Operation processing method of data storage system and data storage system | |
| US20060004890A1 (en) | Methods and systems for providing directory services for file systems | |
| US9189493B2 (en) | Object file system | |
| US8370300B2 (en) | Method and apparatus of data protection | |
| JP4739786B2 (en) | Data relocation method | |
| JP5798258B2 (en) | Content selection for storage hierarchy | |
| CN103460197A (en) | Computer system, file management method and metadata server | |
| US9569311B2 (en) | Computer system for backing up data | |
| JP6298903B2 (en) | Computer system, distributed object sharing method, edge node | |
| US20150205525A1 (en) | Fine-grained data reorganization in tiered storage architectures | |
| CN102063473B (en) | Method for expanding storage space on line | |
| KR101652436B1 (en) | Apparatus for data de-duplication in a distributed file system and method thereof | |
| US9898485B2 (en) | Dynamic context-based data protection and distribution | |
| JP4213430B2 (en) | File system integrity guarantee method, computer system capable of realizing integrity guaranteeable file system, file system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee | ||
| CP01 | Change in the name or title of a patent holder |
Address after: Guanghua Road, Baixia District Nanjing city Jiangsu province 210014 No. 166 East Midlands Building 5 layer Patentee after: NANJING UNARY INFORMATION TECHNOLOGY Inc.,Ltd. Address before: Guanghua Road, Baixia District Nanjing city Jiangsu province 210014 No. 166 East Midlands Building 5 layer Patentee before: Nanjing Unary Information Technology Co.,Ltd. |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Method for expanding storage space on line Effective date of registration: 20171204 Granted publication date: 20121010 Pledgee: Bank of China Limited by Share Ltd. Jiangsu branch Pledgor: NANJING UNARY INFORMATION TECHNOLOGY Inc.,Ltd. Registration number: 2017320000054 |
|
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 210014 Five Floors East of Delan Building, 166 Guanghua Road, Baixia District, Nanjing City, Jiangsu Province Patentee after: NANJING UNARY INFORMATION TECHNOLOGY Co.,Ltd. Address before: 210014 Five Floors East of Delan Building, 166 Guanghua Road, Baixia District, Nanjing City, Jiangsu Province Patentee before: NANJING UNARY INFORMATION TECHNOLOGY Inc.,Ltd. |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20201126 Granted publication date: 20121010 Pledgee: Bank of China Limited by Share Ltd. Jiangsu branch Pledgor: NANJING UNARY INFORMATION TECHNOLOGY Inc.,Ltd. Registration number: 2017320000054 |
|
| DD01 | Delivery of document by public notice | ||
| DD01 | Delivery of document by public notice |
Addressee: Xu Pingping Document name: Notification of Eligibility for Procedures |
|
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: Building 1, 6th Floor, Changfeng Building, No.14 Xinghuo Road, Research and Innovation Park, Jiangbei New District, Nanjing City, Jiangsu Province, 210000 Patentee after: Aerospace One System (Jiangsu) Information Technology Co.,Ltd. Address before: 210014 Five Floors East of Delan Building, 166 Guanghua Road, Baixia District, Nanjing City, Jiangsu Province Patentee before: NANJING UNARY INFORMATION TECHNOLOGY Co.,Ltd. |