WO2014177080A1

WO2014177080A1 - Method and device for processing resource object storage

Info

Publication number: WO2014177080A1
Application number: PCT/CN2014/077603
Authority: WO
Inventors: 薛晔; 周国胜
Original assignee: 中兴通讯股份有限公司
Priority date: 2013-11-06
Filing date: 2014-05-15
Publication date: 2014-11-06
Also published as: CN104639570A

Abstract

Disclosed are a method and device for processing resource object storage. The method comprises: being based on a Key-Value storage manner, wherein the resource object is stored in units of bucket, comprising: receiving the resource object to be stored; determining the position of a bucket stored with the resource object according to a dynamic hash algorithm; and storing the resource object according to the determined position of the bucket. By means of the present invention, the problems in the related art of how to process large capacity storage, large space consumption and being inconvenient for query are solved, thus achieving the effects of improving the storage efficiency, saving the storage space and improving the query efficiency.

Description

TECHNICAL FIELD The present invention relates to the field of communications, and in particular to a resource object storage processing method and apparatus. BACKGROUND OF THE INVENTION A Chinese telecom cloud storage system is different from a traditional file system storage in that an object storage method based on a consistent HASH key value pair is used, and storage contents such as management resources and object attributes are distributed in a storage system in a key-value manner. Each management resource (or object attribute) has a key in the system, and the resource itself (or attribute) is stored in the system as a value. This storage method is compared with the traditional storage method. Performance improvement has a certain advantage. On the other hand, storing resources in this way also solves the problem of security and physical isolation between different users to some extent. For the key-value storage mode, if the value is large, for example, it is a list containing thousands or tens of thousands of data, which will undoubtedly increase the difficulty of finding the data, and need to find a better storage method for the value. In the current cloud storage system, an object uploading or downloading process first needs to access, authenticate, acquire attributes, etc. of the tenant, sub-tenant, and user to which the object belongs. If these resources are frequently accessed, the object will be The uploading and downloading rate has a certain impact, which affects the performance of the entire system. Furthermore, if there are too many users, the reasonable use of the storage space needs to be considered. Therefore, how to perform large-capacity storage processing in the related art, and It takes a lot of space and is inconvenient to query. SUMMARY OF THE INVENTION The present invention provides a resource object storage processing method and apparatus, so as to at least solve the problem of how to perform large-capacity storage processing in the related art, and which consumes a large space and is inconvenient to query. According to an aspect of the present invention, a resource object storage processing method is provided, which is based on a key-value Key-Value storage method, wherein the resource object is stored in a bucket unit, and includes: receiving a storage to be stored a resource object; determining, according to a dynamic hash algorithm, a location of the bucket stored by the resource object; storing the resource object according to the determined location of the bucket. Preferably, determining the location of the bucket that is stored by the resource object according to the dynamic hashing algorithm includes: determining a hash algorithm corresponding to each bucket, where the bucket is located by using a keyword Key, and is used for each bucket. Book The naming of the rule is performed by performing hash processing on the resource object according to the hash algorithm corresponding to the bucket to determine a bucket storing the resource object, where the stored resource object corresponds to the value Value. Preferably, determining, according to the dynamic hash algorithm, the location of the bucket that is stored by the resource object includes: determining, according to a first hash algorithm, a location of an initial bucket stored by the resource object; determining whether the initial bucket is full If the result of the determination is yes, the initial bucket splitting is triggered; and the split bucket and the bucket before the split store the existing resource object according to the second hash algorithm, wherein the existing resource object includes The resource object and the resource object stored in the bucket that existed before the split. Preferably, when it is determined that the initial bucket is full, triggering the bucket splitting includes: determining whether there is a split pointer that points to the split bucket in advance; if the determination result is yes, preferentially triggering splitting of the bucket pointed by the split pointer. Preferably, after storing the resource object according to the determined location of the bucket, the method further includes: receiving a resource access request; uploading the requested resource object according to the resource access request. Preferably, the resource according to the resource access request upload request includes: determining whether the resource access request is legal, and if the determination result is yes, uploading the requested resource object according to the resource access request. According to another aspect of the present invention, a resource object storage processing apparatus is provided, based on a keyword-value

The storage method of the key-value, wherein the resource object is stored in a bucket unit, comprising: a first receiving module, configured to receive a resource object to be stored; a determining module, configured to determine according to a dynamic hash algorithm a location of the bucket stored by the resource object; a storage module configured to store the resource object according to the determined location of the bucket. Preferably, the determining module includes: a first determining unit, configured to determine a hash algorithm corresponding to each bucket, where the bucket is located by using a keyword Key, and each bucket is named by using a predetermined rule; And the unit is configured to perform hash processing on the resource object according to the hash algorithm corresponding to the bucket to determine a bucket that stores the resource object, where the stored resource object corresponds to a value Value. Preferably, the determining module includes: a third determining unit, configured to determine, according to the first hash algorithm, a location of an initial bucket stored by the resource object; and a first determining unit, configured to determine whether the initial bucket is full; a triggering unit, configured to trigger the initial bucket splitting if the determining result of the determining unit is yes; and an allocating unit configured to store the existing resource according to the second hashing algorithm for the split bucket and the bucket before splitting The object is reassigned, wherein the existing resource object includes the resource object and a resource object stored in a bucket existing before the splitting. Preferably, the triggering unit includes: a determining subunit, configured to determine whether there is a split pointer that points to the split bucket in advance; and a triggering subunit, configured to trigger the pair preferentially if the judgment result of the determining subunit is yes The bucket pointed by the split pointer splits. Preferably, the apparatus further includes: a second receiving module, configured to receive a resource access request; and an uploading module, configured to upload the requested resource object according to the resource access request. Preferably, the uploading module includes: a second determining unit, configured to determine whether the resource access request is legal, and if the determination result is yes, uploading the requested resource object according to the resource access request. According to the present invention, a storage method based on a keyword-value Key-Value is adopted, wherein the resource object is stored in a bucket unit, including: receiving a resource object to be stored; determining the resource according to a dynamic hash algorithm The location of the bucket stored by the object; storing the resource object according to the determined location of the bucket, solving the problem of how to perform large-capacity storage processing in the related art, and requiring a large space and inconvenient query, thereby achieving an improvement Storage efficiency, saving storage space, and improving query efficiency. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are set to illustrate,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, 1 is a flowchart of a resource object storage processing method according to an embodiment of the present invention; FIG. 2 is a block diagram showing a structure of a resource object storage processing apparatus according to an embodiment of the present invention; A preferred block diagram of the determination module 24 in the resource object storage processing device is shown in FIG. 4; FIG. 4 is a block diagram showing a preferred structure of the determination module 24 in the resource object storage processing device according to an embodiment of the present invention.

5 is a block diagram showing a preferred structure of the trigger unit 46 in the determining module 24 in the resource object storage processing apparatus according to the embodiment of the present invention; FIG. 6 is a block diagram showing the structure of the resource object storage processing apparatus according to the embodiment of the present invention; A preferred block diagram of the uploading module 64 in the resource object storage processing device of the embodiment of the invention; 8 is a schematic diagram of a China Telecom cloud storage system architecture according to a preferred embodiment of the present invention; FIG. 9 is a schematic flowchart of a storage process according to a preferred embodiment of the present invention; FIG. 10 is a cloud storage system object uploading process according to a preferred embodiment of the present invention. Figure. BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict. In this embodiment, a resource object storage processing method is provided. FIG. 1 is a flowchart of a resource object storage processing method according to an embodiment of the present invention, where the method is based on a key-value Key-Value storage method, wherein the resource The object is stored in a bucket. As shown in FIG. 1 , the process includes the following steps: Step S102: Receive a resource object to be stored; Step S104, determine, according to a dynamic hash algorithm, a location of a bucket stored by the resource object; S106. Store the resource object according to the determined location of the bucket. Through the above steps, the dynamic hashing algorithm is used to implement dynamic storage of resource objects based on the Key-Value storage method. Compared with the related technology, only the Key-Value mode is used for storage, or only the hash algorithm is used for storage. The effective combination of the two not only solves the problem of how to carry out large-capacity storage processing in the related technology, but also consumes a large space and inconvenient query, thereby achieving the effects of improving storage efficiency, saving storage space, and improving query efficiency. The following describes the storage method based on the keyword-value Key-Value, and determines the location of the bucket in which the resource object is stored according to the dynamic hash algorithm. First, the hash algorithm corresponding to each bucket is determined, where the bucket uses the keyword Key. Positioning, each bucket is named by using a predetermined rule; then, the resource object is hashed according to the hash algorithm corresponding to the bucket to determine the bucket of the storage resource object, wherein the stored resource object corresponds to the value Value. Ρ, first, the dynamic hash table, including N hash buckets (N%2 = 0), each hash bucket is located with a key value, the bucket naming rules can be various, for example, the following can be named The rule "list name_0, list name_1, list name_2 ...", of course, other naming rules can also be used. Second, each element in the bucket has its own KEY before it is stored. By hashing this unique KEY value, it is placed in its own bucket. Preferably, determining the location of the bucket stored by the resource object according to the dynamic hash algorithm may be performed by: determining, according to the first hash algorithm, a location of the initial bucket stored by the resource object; determining whether the initial bucket is full; If yes, the initial bucket split is triggered; according to the second hash algorithm, the split bucket and the bucket before the split store the existing resource object, wherein the existing resource object includes the resource object and exists before the split The resource object stored in the bucket, that is, when a new resource object is stored, the corresponding calculation is performed according to the dynamic hash algorithm, and then stored in the bucket obtained after the calculation. It should be noted that, when the split bucket is correspondingly indicated by the split pointer, it is determined that the initial bucket is full, and the trigger bucket splitting may be solved in the following manner: First, it is determined whether there is a split pointer that points to the split bucket in advance; If the result of the determination is yes, the priority triggers the splitting of the bucket pointed to by the split pointer. After storing the resource object according to the determined location of the bucket, the method may further: receive the resource access request; upload the requested resource object according to the resource access request. In addition, the resource object that is requested to be uploaded according to the resource access request includes: determining whether the resource access request is legal, and if the determination result is yes, uploading the requested resource object according to the resource access request, that is, authenticating the resource access request, The security of the resource object is advantageously guaranteed. In this embodiment, a resource object storage processing device is also provided, which is used to implement the foregoing embodiments and preferred embodiments, and has not been described again. As used hereinafter, the term "module" may implement a combination of software and/or hardware of a predetermined function. Although the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and conceivable. 2 is a structural block diagram of a resource object storage processing apparatus according to an embodiment of the present invention. The apparatus is based on a key-value Key-Value storage method, wherein the resource object is stored in a bucket unit, as shown in FIG. 2, The apparatus includes a first receiving module 22, a determining module 24, and a storage module 26, which are described below. The first receiving module 22 is configured to receive the resource object to be stored; the determining module 24 is connected to the first receiving module 22, and is configured to determine the location of the bucket stored by the resource object according to the dynamic hash algorithm; the storage module 26, Connected to the above determining module 24, it is arranged to store the resource object according to the determined location of the bucket. 3 is a block diagram of a preferred structure of the determining module 24 in the resource object storage processing apparatus according to an embodiment of the present invention. The determining module 24 includes a first determining unit 32 and a second determining unit 34. The determining module 24 is described below. . The first determining unit 32 is configured to determine a hash algorithm corresponding to each bucket, wherein the bucket is located by using a keyword Key, and each bucket is named by using a predetermined rule; and the second determining unit 34 is connected to the first determining unit. 32. Set, according to the hash algorithm corresponding to the bucket, perform hash processing on the resource object to determine a bucket that stores the resource object, where the stored resource object corresponds to the value Value. 4 is a block diagram 2 of a preferred structure of the determining module 24 in the resource object storage processing apparatus according to an embodiment of the present invention. The determining module 24 includes a third determining unit 42, a first determining unit 44, a triggering unit 46, and an allocating unit 48. The determination module 24 will be described. The third determining unit 42 is configured to determine, according to the first hash algorithm, the location of the initial bucket stored by the resource object; the first determining unit 44 is connected to the determining unit 42 to determine whether the initial bucket is full; the triggering unit 46, Connected to the first determining unit 44, configured to trigger the initial bucket splitting if the determining result of the determining unit is yes; the assigning unit 48 is connected to the triggering unit 46, and configured to split according to the second hashing algorithm. The bucket and the bucket before the split store the existing resource object for reallocation, wherein the existing resource object includes the resource object and the resource object stored in the bucket existing before the split. FIG. 5 is a block diagram showing a preferred structure of the triggering unit 46 in the determining module 24 in the resource object storage processing apparatus according to the embodiment of the present invention. As shown in FIG. 5, the triggering unit 46 includes a determining subunit 52 and a triggering subunit 54, below. The trigger unit 46 will be described. The determining sub-unit 52 is configured to determine whether there is a split pointer that points to the split bucket in advance; the trigger sub-unit 54 is connected to the judging sub-unit 52, and is set to trigger the pair preferentially if the judgment result of the judging sub-unit 52 is YES. The bucket pointed to by the split pointer splits. FIG. 6 is a structural block diagram of a resource object storage processing apparatus according to an embodiment of the present invention. As shown in FIG. 6, the apparatus includes a second receiving module 62 and an uploading module 64, in addition to all the modules shown in FIG. The device will be described. The second receiving module 62 is connected to the storage module 26 and configured to receive a resource access request. The uploading module 64 is connected to the second receiving module 62, and is configured to upload the requested resource object according to the resource access request. FIG. 7 is a block diagram showing a preferred structure of the uploading module 64 in the resource object storage processing apparatus according to the embodiment of the present invention. As shown in FIG. 7, the uploading module 64 includes a second determining unit 72, and the second determining unit 72 is performed next. Description. The second determining unit 72 is configured to determine whether the resource access request is legal. If the determination result is yes, the requested resource object is uploaded according to the resource access request. Based on the above-mentioned problems in the related art, in order to better implement unified management of management resources such as sub-tenants and users in the cloud storage system and improve management efficiency, in this embodiment, a key-value based storage method is proposed. The key-value-based resource management method includes: storing management resources (tenants, sub-tenants, users, etc.) based on key-value key values; learning dynamic storage of management resources by using dynamic hash processing method, and cloud storage system Neutron tenant, user resource management (add, delete, insert, modify, etc.); where, based on key-value key-value pairs to store management resources (tenants, sub-tenants, users, etc.), including: First, key-value Storage can support the storage of massive data. Its distributed architecture determines that as long as there are enough machines, it can guarantee to store more data. Secondly, the key-value architecture can easily support tens of thousands of concurrent requests, making the system highly concurrent. Sex. The dynamic storage of management resources is based on the dynamic hash processing method. First, the key-value based storage architecture, when the value is large (for example, a list), in order to save space and improve search performance, it is necessary to learn from dynamics. The algorithm idea is used to solve this problem. Secondly, the dynamic hash algorithm can avoid the conflict problem generated by the static hash algorithm to a certain extent and solve the problem better. The methods for implementing list management of sub-tenants and users in the cloud storage system include: First, sub-tenants and users have their own KEY values when they are created, and then sub-tenants and users are respectively stored in their respective sub-tenant lists through hash function calculation. Second, the management resource storage interface API, management resource list creation, management resource list deletion, management resource list modification, management resource search, etc., to facilitate upper-layer applications. Based on the storage mode of KEY-VALUE of China Telecom cloud storage system, the traditional list storage method is abandoned, and the idea of dynamic hash algorithm is used to realize the allocation of space on demand, saving storage space, directly through HASH function. Positioning, shortening the average lookup length and improving performance. The dynamic hash algorithm can solve the problem of space expansion and contraction well. Its basic idea is the same as the traditional hash. First, design the mapping function from the key field U to the storage space (hash file), through two HASH mappings. Function, used to recalculate the HASH value when the bucket is split. A hash file is a set of records determined by a subfield of the key field U. A record in the hash file is determined by a keyword in the key field U, and the file contains a plurality of buckets for storing records. The basic unit for file operations is buckets. Each bucket can store b records. When more than b records are mapped to the same bucket through a hash function, the bucket overflows. At this point, the bucket is split (new bucket is added) Space), using the new HASH algorithm, recalculate the values in the current bucket and rearrange the data in the bucket. Preferred embodiments of the present invention will now be described with reference to the accompanying drawings. Based on the key-value storage mode, the dynamic hashing idea is adopted to manage the management resources of sub-tenants and users, and to quickly query and locate sub-tenants and users. 8 is a schematic diagram of a China Telecom cloud storage system architecture according to a preferred embodiment of the present invention. As shown in FIG. 8, the system mainly includes four parts, a physical storage layer, a storage interface layer, a service encapsulation layer, and a system management layer. This structure illustrates a preferred embodiment of the present invention. The physical storage layer provides physical storage space to the cloud storage system. The management resources and objects in the system are stored therein. The storage interface layer provides addition, deletion, and randomization, storage policy settings, and objects in the system according to the requirements of the upper-layer service system. An interface for managing resource storage, the service encapsulation layer, is an adaptation of related service interfaces, and provides a service interface that meets customer requirements. The system management layer maintains, manages, and configures the system to implement system configuration and performance in the system. Statistics, operation and maintenance data collection and network management related functions. In this embodiment, the content involved is at the storage interface layer, which is an improvement and re-encapsulation of the management resource storage interface API in the original storage interface. The encapsulated API includes the creation of a management resource list, the query, insertion, and deletion of management resources, and the unified application of the convenient service, and convenient storage for the next, saving physical space. 9 is a schematic flowchart of a storage process according to a preferred embodiment of the present invention. As shown in FIG. 9, the storage of a sub-tenant is taken as an example. The key corresponding to the sub-tenant resource list is the STL_tenant name, and the initialization list is 2 X 4, the process includes the following steps: Step S902, seven sub-tenants subtl~subt7 are inserted in the resource list, the split pointer splitptr points to the bucket STL_tenant_0, the bucket STL_tenant_l is full, and the two HASH algorithms are H0=Hash(key) %2, Hl=Hash(key)%4, at this time, insert the sub-tenant subt8, use HO to calculate the position of the bucket that subt8 should be inserted, and the resulting postion is STL_tenant_l. Since STL_tenant_l is full, the bucket split is triggered at this time, but because At this point, the split pointer splitptr points to STL_tenant_0, so first put subt8 into the overflow page, then split the bucket STL_tenant_0, and recalculate the data in STL_tenant_0 with the new algorithm HI to determine the data subl, sub4, sub6 in the original STL_tenant_0 Put it in STL_tenant_0 or STL_tenant_2. Step S904, after the bucket STL_tenant_0 is split according to the new HASH algorithm, subt4 is stored in STL_tenant_2, subtl and subt6 remain in the bucket STL_tenant_0, and the subt6 storage location is moved forward, and the split pointer points to the bucket STL_tenant_l, also by the HI algorithm, STL_tenant_l splits, the newly generated buckets STL_tenant_3, subt5, sub7 are stored in STL_tenant_3 according to the new algorithm, sub2, sub8 are left in the original STL tenant l, and are discharged in the new order. Step S906, after STL_tenant_l is split, the number of buckets is 4, the split pointer points back to the STL_tenant_0 bucket, and HO = Hash(key)%4, Hl=Hash(key)%8, starting a new round of insertion. And splitting, when the number of buckets is 8, the split pointer points back to STL_tenant_0, HO = Hash(key)%8, HI = Hash(key)%16, and so on. FIG. 10 is a flowchart of uploading an object of a cloud storage system according to a preferred embodiment of the present invention. As shown in FIG. 10, the process includes the following steps: an authentication step, a resource access processing, and an object upload processing. The following process is performed based on FIG. 10 Be explained. Step S1002: Authentication processing: mainly implementing authentication between the application and the system; Step S1004: The resource access processing is mainly used for accessing the management resource, and determining the legality of the request according to the attribute, and the following processing manner may be used during the operation: User status, whether the user status is available and whether the user has access, read the sub-tenant attribute of the user, determine whether the sub-tenant status is available, etc., and implement management by calling the encapsulated API (search resource search, etc.) The access of the resource, the attribute of the required resource (for example, the basic attribute of the state of the management resource); Step S1006, which is mainly used to implement uploading of the object according to the request. By adopting the storage method of the above embodiment and the preferred embodiment, the search efficiency is greatly improved, thereby improving the rate of object uploading. Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein. The steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention. Industrial Applicability As described above, a resource object storage processing method and apparatus provided by an embodiment of the present invention have the following beneficial effects: Solving the problem of how to perform large-capacity storage processing in the related art, and requiring a large space and inconvenient query. In turn, it improves storage efficiency, saves storage space, and improves query efficiency.

Claims

A resource object storage processing method, which is based on a key-value Key-Value storage method, wherein the resource object is stored in a bucket, including:

Received a resource object to be stored;

Determining, according to a dynamic hash algorithm, a location of the bucket stored by the resource object; storing the resource object according to the determined location of the bucket.

The method according to claim 1, wherein determining the location of the bucket stored by the resource object according to the dynamic hash algorithm comprises:

Determining a hash algorithm corresponding to each bucket, wherein the bucket is located by using a keyword Key, and each bucket is named by using a predetermined rule;

The resource object is hashed according to the hash algorithm corresponding to the bucket to determine a bucket storing the resource object, wherein the stored resource object corresponds to a value Value.

Determining, according to a first hash algorithm, a location of an initial bucket stored by the resource object; determining whether the initial bucket is full;

In the case that the determination result is yes, the initial bucket splitting is triggered;

And reallocating the existing resource object by the split bucket and the bucket before the split according to the second hash algorithm, where the existing resource object includes the resource object and the resource object stored in the bucket existing before the splitting .

The method according to claim 3, wherein, when it is determined that the initial bucket is full, triggering the bucket splitting comprises: determining whether there is a split pointer that points to the split bucket in advance;

If the result of the determination is yes, the bucket that is pointed to by the split pointer is preferentially triggered to split.

The method according to any one of claims 1 to 4, further comprising: after storing the resource object according to the determined location of the bucket, further comprising:

Receiving a resource access request; The resource object of the request is uploaded according to the resource access request. The method according to claim 5, wherein the resource object according to the resource access request upload request comprises:

Determining whether the resource access request is legal, and if the determination result is yes, uploading the requested resource object according to the resource access request. A resource object storage processing device, which is based on a key-value Key-Value storage method, wherein the resource object is stored in a bucket unit, and includes:

a first receiving module, configured to receive a resource object to be stored;

Determining a module, configured to determine a location of the bucket stored by the resource object according to a dynamic hash algorithm;

And a storage module, configured to store the resource object according to the determined location of the bucket. The device according to claim 7, wherein the determining module comprises: a first determining unit, configured to determine a hash algorithm corresponding to each bucket, wherein the bucket is located by using a keyword Key, and is used for each bucket The predetermined rules are named;

And a second determining unit, configured to perform hash processing on the resource object according to the hash algorithm corresponding to the bucket to determine a bucket that stores the resource object, where the stored resource object corresponds to a value Value. The apparatus according to claim 7, wherein the determining module comprises: a third determining unit, configured to determine a location of an initial bucket stored by the resource object according to a first hash algorithm;

a first determining unit, configured to determine whether the initial bucket is full;

a trigger unit, configured to trigger the initial bucket splitting if the determination result of the determining unit is yes;

And an allocation unit, configured to perform reallocation on the split bucket and the bucket before the split to store the existing resource object according to the second hash algorithm, where the existing resource object includes the resource object and the bucket existing before splitting The stored resource object. The device according to claim 9, wherein the triggering unit comprises: a determining subunit, configured to determine whether there is a split pointer that points to a split bucket in advance; The triggering subunit is configured to preferentially trigger splitting of the bucket pointed by the split pointer when the judgment result of the determining subunit is YES.

The device according to any one of claims 7 to 10, further comprising: a second receiving module, configured to receive a resource access request;

The uploading module is configured to upload the resource object according to the resource access request.

The device of claim 11, wherein the uploading module comprises:

The second determining unit is configured to determine whether the resource access request is legal, and if the determination result is yes, upload the requested resource object according to the resource access request.