KR101482014B1 - File cache system and method using allocation table and system and method for distributing file cache application - Google Patents

Abstract

A file cache system and method using an allocation table and a distribution system and a distribution method for distributing a file cache application are disclosed. The file cache system includes, for a single cache data store in which information on a plurality of files is stored, a memory for storing an allocation table including a cache index for indexing stored information, and a cache index corresponding to a file access request in the allocation table And extracting the request information corresponding to the file access request from the single cache data store using the checked cache index.

Description

TECHNICAL FIELD The present invention relates to a file cache system and method using allocation tables, a distribution system for distributing a file cache application, and a distribution system and a distribution method for allocating file cache applications.

Embodiments of the present invention relate to a file cache system and method using allocation tables and a distribution system and distribution method for distributing file cache applications.

In the file cache system according to the related art, a plurality of cache data stores are configured in units of files or binary chunks. For example, in caching in an Internet browser or data communication between a server and a server, a cache unit of a file unit is used. Therefore, in order to cache a plurality of files, a plurality of cache files must be created and managed.

That is, in this conventional technology, when a plurality of cache data stores are configured in units of files or binary chunks and the same data is repeatedly requested, the data transfer time can be reduced. However, There is a problem that the cost for finding a block is very large. For example, when the cache data is held on a file-by-file basis for a plurality of files, it is not possible to know which cache file the cache data block is stored in. Therefore, each cache file is open / close) to find the cache data blocks that are needed.

Particularly, since the access time of a nonvolatile storage medium such as a hard disk is relatively long as compared with a volatile storage medium such as a memory, when cache files are stored in a nonvolatile storage medium, The time cost for closure is very large.

In this specification, a system and method are provided that enable caching of files more efficiently.

There is provided a file cache system and method capable of efficiently processing a file transfer using a high performance file cache when the same file is repeatedly requested between systems that send and receive file data.

A memory for storing an allocation table including a cache index for indexing stored information, a memory for providing a cache index returned from the allocation table, and a file access There is provided a file cache system including a processor for checking a cache index corresponding to a request and extracting request information corresponding to a file access request from a single cache data repository using the checked cache index.

According to one aspect, a single cache data store can be classified into a plurality of clusters each assigned a cache index as an identifier and each having a predetermined unit size. At this time, the processor can identify the cluster in which the request information is stored among the plurality of clusters through the cache index identified in the allocation table.

According to another aspect, the allocation table includes a cache for identifying a cluster in which the beginning of each of a plurality of files of clusters of a single cache data store is stored, information about the file path and last modified time for each of the plurality of files, And cache maps that store indexes in association with each other.

According to another aspect, a file access request may include a file path of a file containing request information and a time when the file was last modified. At this time, the processor can check the corresponding cache index in the cache map based on the file path and the time included in the file connection request.

According to another aspect, the allocation table may include a cache index identified in the cache map and a plurality of cache indexes for identifying the plurality of clusters in which the file or request information is stored if the file or request information is divided and stored across the plurality of clusters And a list for storing them in association with each other.

According to another aspect, the list may include a plurality of nodes identified according to the value of the cache index. In this case, at least one of the nodes corresponding to the plurality of cache indexes for identifying the plurality of clusters storing the file or the request information has a pointer for indicating another one of the nodes corresponding to the plurality of cache indexes A cache index of another node may be included.

According to another aspect, a processor can identify a plurality of clusters on which a file or request information is stored based on a pointer.

According to another aspect, each of the chunks, which are file data stored in each of a plurality of clusters in which a file or request information is stored, can be identified by a chunk number. In this case, each of the nodes identified through the same cache index as the plurality of clusters in which the file or request information is stored may contain the chunk number of the chunk stored in the corresponding cluster.

According to another aspect, the processor can identify clusters in which the request information is stored based on the chunk number stored in the node of the list and the chunk number contained in the file access request, if the file access request includes a chunk number.

According to another aspect, a processor may use an allocation table and an offset, or an allocation table and a file, if an offset or cache index indicating the location of request information in a file containing request information is included in a file access request, The cluster in which the request information is stored can be confirmed by using the cache index included in the connection request.

According to another aspect, a processor is configured to download request information from a predetermined server to process a file access request if the request information is not present in a single cache data store, to store the downloaded information in a single cache data store, The allocation table of the memory can be updated.

Providing a file access request for request information to a memory in which an allocation table including a cache index for indexing stored information is stored for a single cache data store in which information on a plurality of files is stored; Extracting request information from a single cache data store using a cache index identified in response to the request.

A computer readable storage medium containing instructions for controlling a computer system to calculate advertising costs, the instructions comprising: for a single cache data store where information about a plurality of files is stored, a cache index for indexing stored information Providing a file access request for request information to a memory in which an allocation table is stored, and extracting request information from a single cache data store using a cache index identified according to a file access request in an allocation table A computer readable storage medium is provided for controlling a computer system by a method.

An installation file holding section for storing and maintaining an installation file of the file cache application, and an installation file transmission section for transferring the installation file to the client at the request of the client, and when the file cache application is installed on the client through the installation file, An allocation table including a cache index for indexing information on a plurality of files stored in a cache data storage is stored in a memory of a client according to a control of a file cache application, The cache index according to the request is confirmed in the allocation table, and the request information corresponding to the file access request is extracted from the single cache data storage using the checked cache index.

Storing and maintaining an installation file of the file cache application, and transferring the installation file to the client at the request of the client, wherein when the file cache application is installed on the client through the installation file, An allocation table including a cache index for indexing information on a plurality of files is stored in the memory of the client under the control of the file cache application and the cache index Is identified in the allocation table, and the request information corresponding to the file access request is extracted from the single cache data repository using the checked cache index.

When the same file is repeatedly requested between systems that send and receive file data, it is possible to efficiently process the transmission of file data using the high performance file cache.

1 is an example of a client and a service server according to an embodiment of the present invention.
2 illustrates an example of a client, a service server, and a distribution server according to an embodiment of the present invention.
3 illustrates an example of a memory and a storage device of a file cache system according to an embodiment of the present invention.
4 illustrates an example of a list including a cache map and a chunk number according to an embodiment of the present invention.
5 is a block diagram for explaining an internal configuration of a file cache system according to an embodiment of the present invention.
6 is a flowchart illustrating a file cache method in an embodiment of the present invention.
7 is a block diagram for explaining an internal configuration of a distribution system according to an embodiment of the present invention.
8 is a flowchart showing a distribution method in an embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

Embodiments of the present invention relate to a high performance file cache system which includes a device for transmitting an I / O request packet between a server and a client, between a server and a server, or a file system driver, To a system for managing file transfers between devices that process request packets. Hereinafter, a file cache system and method for enabling efficient file transfer using a high-performance file cache when the same file is repeatedly requested between systems transmitting and receiving file data will be described.

1 is an example of a client and a service server according to an embodiment of the present invention.

The client 110 is an apparatus that can be implemented by including at least one processor and a memory. For example, as shown in FIG. 1, the client 110 includes an operating system 112 including a file system 111, A file searcher 113 and at least one application 114 may be installed. Since the operating system 112 and the file searcher 113 are well known, a detailed description will be omitted.

The service explorer 115 is a program installed and operated in the client 110, and may be included in at least one application 114. At this time, the service explorer 115 may perform a function of converting a user's file access request (read / write request) into a network request (upload / download request) for the file.

Such a service explorer 115 may include a download cache 116 as shown in FIG. In embodiments of the present invention, such a download cache 116 can be used to efficiently process repeated requests of the same file. Although FIG. 1 illustrates transmission of file data between the client 110 and the service server 120, the present invention is not limited to such an embodiment. For example, the service explorer 115 may be used in any system that receives file data among systems that send and receive file data.

The service server 120 may also include at least one processor and a memory. The service server 120 may provide the client 110 with file data. For example, the service server 120 may be a system that provides a cloud storage service to the client 110. In this case, the service server 120 may include the cloud storage 121 or may provide the cloud storage service to the client 110 in cooperation with the external cloud storage 121.

The client 110 and the service server 120 may communicate through a wired or wireless network. As described above, the service explorer 115 can convert the file access request of the user into a network request for the file, and the user of the client 110 can access the file data stored in the service server 120 .

As described above, in the file cache system according to the related art, a cache data storage is configured in units of files or binary chunks.

However, in a file cache system according to embodiments of the present invention, a single cache store may be used instead of a plurality of cache data stores. At this time, the file cache system quickly accesses the necessary cache by storing indexes and metadata for a single cache store in a memory (e.g., memory of the client 110) in the form of an allocation table. can do. Therefore, by using the file cache system according to the present embodiments, it is possible to reduce data transmission time and improve the availability and efficiency of the entire system.

More specifically, when using multiple cache files, such as the file cache system of the prior art, a large expense is incurred to open / cache each file to find each cache data block. However, when using a single cache store (e.g., a single cache file), one handle can be maintained to locate the desired cache data block in a single cache store. Thus, using a single cache store can reduce the open / close times of the handles that occur when using multiple file unit caches.

In the file cache system according to the present embodiments, the metadata about the cache is stored in the allocation table and used as an index for the cache data. In addition, file location management and deletion can be easily implemented using such metadata.

2 illustrates an example of a client, a service server, and a distribution server according to an embodiment of the present invention. The client 210 may correspond to the client 110 described with reference to FIG. 1, and the service server 220 may correspond to the service server 120 described with reference to FIG.

Here, the distribution server 230 may be a system for providing the service explorer 115 described with reference to FIG. For example, the distribution server 230 may provide an installation file for installing the service explorer 115, and the client 210 may download the installation file from the distribution server 230 and install the service explorer 115 .

2, the distribution server 230 is described as a separate system from the service server 220. However, in another embodiment, the distribution server 230 and the service server 220 may be the same system. That is, the service server 220 may provide file data to the client 210 and may provide an installation file for installation of the service explorer 115.

3 illustrates an example of a memory and a storage device of a file cache system according to an embodiment of the present invention. In this embodiment, the file cache system may correspond to the client 110 described with reference to FIG. 1 or the client 210 described with reference to FIG. That is, a system for receiving file data among systems transmitting and receiving file data may correspond to a file cache system according to the present embodiment. At this time, the file cache system may further include a storage device 320, such as a hard disk, in addition to the memory 310 as shown in FIG.

In the memory 310, an allocation table can be stored as described above. An example of an allocation table stored in the memory 310 is shown in the memory 310 of FIG. The allocation table may include a table containing location information for the cache file 321 stored in the storage device 320. [ This allocation table is stored in the memory 310, thereby enabling faster caching processing.

The allocation table may be configured to include a cache map 311 as shown in FIG. The cache map 311 may return a cache index for a file request. At this time, the cache index returned from the cache map 311 may indicate the start position of the corresponding file in the cache file 321 (for example, the cluster number of the cluster where the start portion of the file is stored). 3, the cache map 311 may include a file path and a last write time as a key, and maps the cache index to a corresponding value Can be implemented using a data structure.

As described above, the cluster number of the cluster in which the start of the requested file is stored can be confirmed according to the cache index returned from the cache map 311. [ However, if the size of the requested file is larger than the size of the cluster, the requested file may be stored in the location of the plurality of clusters. Therefore, subsequent parts of the requested file also need to be acknowledged. That is, the allocation table may further include a list (312) as shown in FIG. 3 to further locate subsequent portions beyond the beginning of the requested file.

The list 312 may include a plurality of nodes. In FIG. 3, each of the columns of the list 312 may represent one node. At this time, each of the nodes may include a cache index as information for identifying the corresponding node. That is, the cache index corresponds to the cluster number of the cluster, but can also be used to identify the nodes included in the list 312. [ In FIG. 3, the numbers written on the upper side of each column may indicate the value of the cache index for identifying the corresponding node. For example, when the cache index '1' is returned from the cache map 311, the node corresponding to the cache index '1' (that is, the node corresponding to the second column in the list 312) .

In FIG. 3, each node may also include two rows.

The first row of the list 312 shows information indicating the start of a file or information indicating a previous node. For example, the 'Begin Of File' (BOF) in the second and fifth columns may indicate the beginning of the file, and the number '1' in the fourth column may be a pointer to the cache index corresponding to the previous node.

The second row of the list 312 may represent the node corresponding to the location where the subsequent portion of the requested file is stored. That is, the number '3' in the second row of the second column may represent the node corresponding to the cache index '3' (i.e., the node corresponding to the fourth column). That is, it is shown that the next file data of the file data included in the cluster of the cluster number '1' having the cache index '1' is stored in the cluster of the cluster number '3' having the cache index '3'. It is also shown that the next file data of the file data stored in the cluster of cluster number '3' is stored in the cluster of cluster number 'n'. 'EOF (End Of File)' can indicate the end of the file. For example, in the example of FIG. 2, it can be seen that files having values of 'file path 2' and 'time 2' are stored in the cache file at positions of cluster numbers '4' and '5'.

The values 'a', 'b', 'c', 'd', and 'd' in the list 312 shown in FIG. 3 are transferred to the memory map 313, And " 5 " respectively. Here, the memory map 313 is a constituent element indicating a storage location allocation state in a general computer system, and is not essential in the implementation of the present invention, and is not well described because it is well known.

In FIG. 3, the list 312 is shown in the form of a double linked-list in FIG. 2, but is provided only as an example for facilitating understanding of the present invention. The structure is not limited to a specific data structure, such as a linked list or a double-linked list. That is, one of every data structure that can find the next part of the file can be used. For example, by using a structure such as an array or a tree, the cluster number of the cluster in which the succeeding portion of the file is stored can be confirmed by confirming other connected values.

Also, as described above, the cache index returned from the cache map 311 may indicate the start position (cluster number) of the file in the cache file. However, the starting location here may refer to the location of the chunks in the earliest order among the chunks stored in the cache file for the file.

For example, each node in the list 312 may include a value (not shown in FIG. 2) corresponding to the chunk number of the cached specific file. In this specification, 'chunk' may refer to a data block corresponding to a specific range of a specific file cached by the cache file 321, and 'cluster' may refer to a predetermined size unit of the cache file 321 .

At this time, the file cache system may access the cache file from the middle portion of the specific file using the chunk number. For example, for file 'A', which can be divided into ten chunks, if only the third through fifth chunks and the eighth through tenth chunks are cached and stored in the caching file, A 'to return the value of the cache index to indicate the location of the third chunk. At this time, the node in the list 312 corresponding to the value of the returned cache index includes the information for indicating the node including the position of the fourth chunk in the second row. As another example, for file 'A', if there is no cached data in cache file 321 and the third to fifth chunks of file 'A' are requested by the user, The chunks of the range may be requested to another system and downloaded and stored in the cache file 321. At this time, the index of the cache file 321 in which the third chunk of the file 'A' is stored may be set to the cache index for the file 'A'. The location of the file stored in the cache file 321 can be confirmed through the chunk number contained in the list 312.

At this time, when a request for the first chunk and the second chunk is received for the file 'A', the chunks of the range corresponding to the first chunk and the second chunk are downloaded from another system and stored in the cache file 321 . At this time, the cache index for the file 'A' may be updated with the index of the cache file 321 in which the first chunk is stored. In addition, information on the node corresponding to the third chunk may be included in the node of the list 312 corresponding to the second chunk. Conversely, the node corresponding to the third chunk may contain information for indicating the second chunk. That is, the nodes from the node corresponding to the first chunk to the node corresponding to the fifth chunk are connected through the list 312.

Also, the chaining order of the chunks does not necessarily have to be continuous. For example, if from the first chunk to the fifth chunk for the file 'A' and from the eighth chunk to the tenth chunk are stored in the cache file 221, then the node corresponding to the fifth chunk is in the eighth chunk And may include information for indicating a corresponding node. That is, in the list 312, continuity between currently existing chunks may be maintained. At this time, the node corresponding to the first chunk may include 'BOF', which indicates the start of the file, and the node corresponding to the tenth chunk, may contain 'EOF', which indicates the end of the file.

Thereafter, if a read request for the sixth chunk and the seventh chunk occurs and is further cached, the list of intermediate parts can be modified to complete the entire list from the first chunk to the tenth chunk.

The storage device 320 stores a cache file 321 composed of one file as described above. The size of the cache file may be set by (1) the user, (2) adaptively by the file cache system in consideration of at least one of the frequency of I / O requests, the cache state, ).

The cache file 221 can be divided into cluster units of a predetermined size (for example, 16 kilobytes). For example, when one cluster unit divides the size of the entire cache file 321 by a unit size, it may represent a unit corresponding to one specific size. At this time, an index (the above-described cluster number) may be given to each cluster in order. The file cache system according to the present embodiments may be a system for receiving and processing a file access request. At this time, the file access request may include at least one of a file identifier and a file access request range. The file identifier is for identifying the file, and may include the file path and the latest modification time. In addition, the scope of the file access request may indicate a portion of the file desired by the user. Such a file access request range can be expressed using an offset from a file start position or a cluster number or a chunk number.

The file cache system can manage data in a predetermined cluster unit. Therefore, when a file access request is generated using the file access request range, the file access request range can be adjusted to correspond to a multiple of the cluster. For example, if the unit of the cluster is 64 kilobytes (65536 bytes) and the scope of the file access request corresponds to a portion of offset 0 to 68607 bytes corresponding to 67 kilobytes before the file, By adjusting the range, you can process the data of the requested offset by checking the data in the range from offset 0 to 131071 (65536 * 2 - 1) bytes (that is, the range of the offset corresponding to 128 kilobytes, have. That is, in the data corresponding to the offset 0 to 68607 bytes, the list 312 is configured so that there are two chunks, one chunk from offset 0 to 65535 byte and another chunk from offset 65536 byte to 68607 byte . Here, the offset need not necessarily have a range from the file start position. For example, an offset may indicate a range in the middle of a file, such as a range from 65536 bytes to 68607 bytes.

When the requested file is stored in the cache file 321 (that is, when information on the file exists in the cache map 311), the file cache system reads the corresponding data (binary chunk binary chunks) can be read and returned. More specifically, the cache index 311 is searched for in the cache map 311 using the file path and the most recently modified time, and the requested file access request is retrieved from the cache file 321 of the storage device 320 using the list 312 You can read and return parts of the range.

Whether or not a portion corresponding to the file access request range is stored in the cache file 321 can be determined using the chunk number stored in the list 312. For example, if the chunk number '3' and the chunk number '4' are identifiable through the node 'A' and the node 'B' of the list 312, the cache index of the node 'A' And the cluster number in which the chunk corresponding to the chunk number '3' and the chunk number '4' is stored can be known. Therefore, chunks corresponding to chunk number '3' and chunk number '4' can be read.

If a file that is not stored in the cache file 321 or a file access request range in which the file is not stored is required, the file cache system requests the necessary data from another system and downloads the cache file 321, Lt; / RTI > If the capacity of the cache file 321 is full (that is, in a cache full state), some of the existing data may be deleted to store new data. For example, the oldest file data that has been used can be deleted using the LRU (Least Recently Used) algorithm. In this case, the file data can be deleted more simply by deleting the metadata stored in the allocation table, rather than directly deleting the file data from the cache file 321. [

4 illustrates an example of a list including a cache map and a chunk number according to an embodiment of the present invention. The cache map 410 may be implemented in the form of a data structure, such as the cache map 311 described with reference to FIG. 3, in which the file path and the most recently modified time of the file are received as keys and the cache index is returned as a value.

In addition, as described above, the file access request may further include a file access request range as well as a file path and time. In the example of FIG. 4, it is assumed that a file access request range is set for the chunks of the chunk number '2' and the chunk number '3' for the specific file 'A'. At this time, the file access request range may include a direct chunk number, but may include an offset. For example, suppose that the unit of the cluster is 64 kilobytes (65536 bytes), and the file access request range corresponds to the portion from offset 65536 bytes to 134144 bytes, which corresponds to 67 kilobytes in the middle part of the file. At this time, the chunk number '1' corresponds to the chunk number '1' from the offset 0 to 65535 bytes, the chunk number '2' corresponds to the offset 65536 bytes to the 131071 byte, the chunk number '3' corresponds to the 131072 byte to the 134144 byte, Can be calculated. Therefore, it can be seen that the offset from 65536 bytes to 134144 bytes input in the file access request range corresponds to the chunk number '2' and the chunk number '3'. Thus, a chunk number can also be calculated through an offset using a cluster unit.

The list 420 further includes one row (the second row in the list 420 of FIG. 4) than the list 312 described with reference to FIG. This second row may correspond to a chunk number.

That is, if the cache map 410 returns the cache index '1', the file cache system can identify the second node (the node corresponding to the second column) of the list 420. At this time, the second row of the second node includes the chunk number '1', and the chunk number '1' is not included in the file access request range.

Accordingly, the file cache system can identify the fourth node (the node corresponding to the fourth column) according to the value '3' of the third row included in the second node of the list 420. At this time, the file cache system can confirm the chunk number '2' in the second row of the fourth node and know that the cluster of cluster number '3' contains the chunk corresponding to the chunk number '2'.

In addition, the file cache system can identify the fifth node (the node corresponding to the fifth column) of the list 420 through the value '4' included in the third row of the fourth node. At this time, the file cache system can recognize the chunk number '3' in the second row of the fifth node, and the cluster of the cluster number '4' contains the chunk corresponding to the chunk number '3'.

Therefore, the file cache system extracts and provides file data of cluster numbers '4' and '5' in the cache file included in the storage device in response to the file access request, And may provide chunks corresponding to chunk number '2' and chunk number '3' of the corresponding file.

In other words, by using the list 420 including the chunk number, the file cache system becomes accessible from the middle of the file.

5 is a block diagram for explaining an internal configuration of a file cache system according to an embodiment of the present invention. The file cache system 500 according to the present embodiment may be a device including at least one memory 510 and at least one processor 520, or a system included in the device. At this time, the file cache system 500 may further include a single cache data store 530 as needed. Although a single cache data store 530 is illustrated in FIG. 5 as being embodied in a file cache system 500, a single cache data store 530 may be provided outside the file cache system 500, Or may be implemented in a form linked with the file cache system 500 so that data can be transmitted and received.

The single cache data store 530 may be implemented through a storage device such as a hard disk, and file data may be stored in a single file format stored in the storage device.

The memory 510 may store an allocation table including a cache index for indexing stored information for a single cache data store 530 where information about a plurality of files is stored. As described above, when a plurality of cache files are used, a large cost is incurred to open / cache each file to find each cache data block. In contrast, in the present embodiment, 530), it is possible to reduce the cost incurred for a plurality of cache files since it is necessary to hold only a handle to this one cache file. In addition, by storing the cache index for indexing the information stored in the single cache data store 530 in the memory 510, it is possible to quickly access necessary cache data. Accordingly, the transmission time of the cache data can be reduced, and the availability and efficiency of the entire system for transmitting and receiving data can be increased.

The processor 520 may check the cache index corresponding to the file access request in the allocation table and extract the request information corresponding to the file access request from the single cache data store 530 using the checked cache index . That is, the processor 520 can find and extract the necessary information from the single cache data store 530 according to the cache index.

For example, the single cache data store 530 may be classified into a plurality of clusters each assigned a cache index as an identifier and each having a predetermined unit size. At this time, the processor 520 can confirm the cluster in which the request information is stored among the plurality of clusters through the cache index identified in the allocation table.

The allocation table may include a cache map for storing file identification information and cache indexes for each of a plurality of files in association with each other. Here, the file identification information may include at least one of a file path, a file name, and a last modified time, and the cache index may include at least one of clusters of a single cache data storage 530, May be used to identify the stored cluster. At this time, the file access request may include at least one of the file path of the file containing the request information, the file name, and the time when the file was last modified. In this case, the processor 520 can check the corresponding cache index in the cache map based on at least one of the file path, file name, and time included in the file access request. That is, the processor 520 can identify the cluster in which the beginning of the file including the request information is stored through the cache index returned from the cache map.

However, since one cluster has a predetermined unit size and the size of one file is variable, it is possible that one file can not be stored in one cluster. In other words, one file may be divided and stored in a plurality of clusters.

For this case, the allocation table may include a cache index identified in the cache map and a plurality of cache indexes for identifying the plurality of clusters in which the file or request information is stored, if the file or request information is stored in a plurality of clusters And may further include a list associating and storing. Here, the list may include a plurality of nodes identified according to the cache index value. In this case, at least one node among the nodes corresponding to the plurality of cache indexes for identifying the plurality of clusters storing the file or the request information may be configured to represent another node among the nodes corresponding to the plurality of cache indexes The cache index of another node may be included as a pointer. At this time, the processor 520 can identify a plurality of clusters on which the file or request information is stored based on the pointer.

Here, when the specific node includes the cache index of another node, the information stored in the cluster identified through the cache index of the specific node and the information stored in the cluster identified through the cache index of the other node are continuous information, May be associated information. Here, the information related to each other may refer to information connecting non-contiguous information when the information stored in the single cache data store 530 for one file is not continuous. For example, when only A, B, and D are stored in different clusters in a file consisting of A, B, C, and D, B and D may be information related to each other.

The cache index for identifying the cluster may correspond to the cluster number of the corresponding cluster. That is, one cluster number may be assigned to one cluster, and one cluster number may correspond to one cache index. Therefore, one cluster index can be identified through one cache index.

Each of the chunks, which are file data stored in each of a plurality of clusters in which a file or request information is stored, can be identified by a chunk number. In this case, each of the nodes identified through the same cache index as the plurality of clusters in which the file or request information is stored may contain the chunk number of the chunk stored in the corresponding cluster. At this time, if the chunk number is included in the file access request, the processor 520 can confirm the cluster storing the request information based on the chunk number stored in the node of the list and the chunk number included in the file access request.

If an offset or cache index indicating the location of the requested information in the file containing the request information is included in the file access request, the processor 520 may use the allocation table and the offset, It is possible to confirm the cluster including the request information by using the cache index included in the cache index.

In addition, if the request information is not present in the single cache data store 530, the processor 520 may download the request information from a predetermined server to process the file access request, May be stored in the storage 530 and the allocation table of the memory 510 may be updated. The predetermined server may correspond to the service server 120 described with reference to FIG.

A concrete example of extracting the request information using the cache map and list of the allocation table or a specific example of a processing method when the request information does not exist in the single cache data storage 530 is already described with reference to FIGS. 3 and 4 So that repetitive description will be omitted.

6 is a flowchart illustrating a file cache method in an embodiment of the present invention. The file cache method according to the present embodiment can be performed by the file cache system 500 described with reference to FIG.

In step 610, the file cache system 500 is a memory for storing, for a single cache data store in which information about a plurality of files is stored, an allocation table including a cache index for indexing stored information, It can provide an access request. As described above, when a plurality of cache files are used, a large cost is incurred to open / cache each file to find each cache data block. On the other hand, in the present embodiment, By storing, only the open / closure cost for this one cache file occurs, so that the cost incurred for a plurality of cache files can be reduced. In addition, by storing the cache index for indexing the information stored in the single cache data storage in the memory, it is possible to quickly access necessary cache data. Accordingly, the transmission time of the cache data can be reduced, and the availability and efficiency of the entire system for transmitting and receiving data can be increased.

In step 620, the file cache system 500 may extract the request information from a single cache data store using the cache index identified according to the file access request in the allocation table. That is, the file cache system 500 can find and extract the necessary information from a single cache data store according to the cache index in step 620. [

For example, a single cache data store may be classified into a plurality of clusters each assigned a cache index as an identifier and each having a predetermined unit size. At this time, the file cache system 500 can identify the cluster in which the request information is stored among the plurality of clusters through the cache index identified in the allocation table in step 620. [

Here, the allocation table may include a cache map for storing file identification information and cache indexes in association with each other. Here, the file identification information may include at least one of a file path, a file name, and a last modified time for each of a plurality of files, and the cache index may include at least one of the plurality of files Each beginning may be used to identify the cluster in which it is stored. At this time, the file access request may include at least one of the file path of the file containing the request information, the file name, and the time when the file was last modified. In this case, the cache index identified in the allocation table may include a cache index identified in the cache map based on at least one of the file path, file name, and time included in the file access request. That is, the file cache system 500 may identify the cluster in which the beginning of the file containing the request information is stored, through the cache index returned in the cache map in step 620. [

However, since one cluster has a predetermined unit size and the size of one file is variable, it is possible that one file can not be stored in one cluster. In other words, one file may be divided and stored in a plurality of clusters.

For this case, the allocation table may include a cache index identified in the cache map and a plurality of cache indexes for identifying the plurality of clusters in which the file or request information is stored, if the file or request information is stored in a plurality of clusters And may further include a list associating and storing. Here, the list may include a plurality of nodes identified according to the cache index value. In this case, at least one of the nodes corresponding to the plurality of cache indexes for identifying the plurality of clusters storing the file or the request information has a pointer for indicating another one of the nodes corresponding to the plurality of cache indexes A cache index of another node may be included. At this time, the file cache system 500 can identify a plurality of clusters in which the file or request information is stored based on the pointer in step 620. [

Here, when the specific node includes the cache index of another node, the information stored in the cluster identified through the cache index of the specific node and the information stored in the cluster identified through the cache index of the other node are continuous information, May be associated information. Here, the information related to each other may refer to information that links non-contiguous information when information stored in a single cache data store for one file is not continuous. For example, when only A, B, and D are stored in different clusters in a file consisting of A, B, C, and D, B and D may be information related to each other.

The cache index for identifying the cluster may correspond to the cluster number of the corresponding cluster. That is, one cluster number may be assigned to one cluster, and one cluster number may correspond to one cache index. Therefore, one cluster index can be identified through one cache index.

Each of the chunks, which are file data stored in each of a plurality of clusters in which a file or request information is stored, can be identified by a chunk number. In this case, each of the nodes identified through the same cache index as the plurality of clusters in which the file or request information is stored may contain the chunk number of the chunk stored in the corresponding cluster. At this time, if the chunk number is included in the file access request in step 620, the file cache system 500 stores the cluster in which the request information is stored based on the chunk number stored in the node of the list and the chunk number included in the file access request Can be confirmed.

In addition, if the file cache 500 includes an offset or a cache index indicating the location of the requested information in the file including the requested information in step 620, the file cache 500 uses the allocation table and the offset Or the cluster in which the request information is stored can be confirmed using the cache index included in the allocation table and the file access request.

In addition, the file cache method includes a step (not shown) of downloading request information from a predetermined server if the request information does not exist in a single cache data store, processing a file access request based on the downloaded information, (Not shown) of storing the information in a single cache data store and updating the allocation table of the memory (not shown). At this time, further steps included in the file cache method may also be performed by the file cache system 500. The predetermined server may correspond to the service server 120 described with reference to FIG.

Detailed examples of extracting the request information using the cache map and the list of the allocation table or a processing method when the request information does not exist in a single cache data storage have been described in detail with reference to FIGS. 3 and 4, .

7 is a block diagram for explaining an internal configuration of a distribution system according to an embodiment of the present invention. The distribution system 700 according to the present embodiment may correspond to the distribution server 230 described with reference to FIG. This distribution system 700 may include an installation file holding unit 710 and an installation file transmission unit 720, as shown in FIG.

The installation file holding unit 710 stores and maintains the installation file of the file cache application. Here, the file cache application may correspond to the service explorer described with reference to FIG.

The installation file transmission unit 720 transmits the installation file to the client at the request of the client. Here, the client may correspond to the file cache system 500 described with reference to FIG. 5 as an example.

When the file cache application is installed in the client through the installation file, an allocation table including a cache index for indexing information on a plurality of files stored in a single cache data repository is stored in the memory of the client under the control of the file cache application Lt; / RTI > Also, according to the control of the file cache application, a cache index according to a file access request can be checked in the allocation table, and request information corresponding to a file access request is extracted from a single cache data store using the checked cache index .

The single cache data storage may be implemented through a storage device such as a hard disk, and file data may be stored in a single file format stored in the storage device. At this time, a single cache data repository can be classified into a plurality of clusters each assigned a cache index as an identifier and each having a predetermined unit size. In this case, according to the control of the file cache application, the cluster in which the request information among the plurality of clusters is stored can be identified in the client through the cache index identified in the allocation table.

Here, the allocation table includes cache indexes for identifying clusters in which the beginning of each of a plurality of files among the clusters of a single cache data repository and information about the file path and last modified time for each of the plurality of files are stored And cache maps that associate and store cache maps. At this time, the file access request may include the file path of the file containing the requested information and the time when the file was last modified. In this case, according to the control of the file cache application, the cache index corresponding to the file path and the time included in the file access request can be confirmed at the client using the cache map.

Also, the allocation table associates a cache index identified in the cache map and a plurality of cache indexes for identifying a file or a plurality of clusters in which the requested information is stored, when the file or request information is divided and stored through a plurality of clusters And may further include a list for storing. Such a list may include a plurality of nodes identified according to the value of the cache index. At this time, at least one of the nodes corresponding to the plurality of cache indexes for identifying the plurality of clusters storing the file or the request information is a pointer for indicating another node among the nodes corresponding to the plurality of cache indexes The cache index of another node may be included. In this case, according to the control of the file cache application, at the client, a plurality of clusters storing the file or the request information based on the pointer can be identified.

Each of the chunks, which are file data stored in each of a plurality of clusters in which a file or request information is stored, can be identified by a chunk number. At this time, each of the nodes identified through the same cache index as the plurality of clusters storing the file or the request information may include a chunk number of the chunk stored in the corresponding cluster. In this case, according to the control of the file cache application, when the client includes a chunk number in the file access request, the cluster storing the request information is checked based on the chunk number stored in the node of the list and the chunk number included in the file access request .

If an offset or cache index indicating the location of the requested information in the file containing the request information is included in the file access request, then the client may use the allocation table and offset, or in accordance with the control of the file cache application, And the cluster in which the request information is stored can be confirmed using the cache index included in the file connection request. Detailed examples of extracting the request information using the cache map and the list of the allocation table or a processing method when the request information does not exist in a single cache data storage have been described in detail with reference to FIGS. 3 and 4, .

If the request information does not exist in a single cache data store, the client downloads the request information from the predetermined server to process the file access request, stores the downloaded information in a single cache data store, and updates the allocation table of the memory . Such downloading of the request information, processing of the file access request, storage of the downloaded information, and update of the allocation table can be performed under the control of the file cache application. The predetermined server may correspond to the service server 120 described with reference to FIG.

8 is a flowchart showing a distribution method in an embodiment of the present invention. The distribution method according to the present embodiment can be performed by the distribution system 700 described with reference to FIG.

At step 810, the distribution system 700 stores and maintains the installation file of the file cache application. Here, the file cache application may correspond to the service explorer described with reference to FIG.

In step 820, the distribution system 700 transmits the installation file to the client at the request of the client. Here, the client may correspond to the file cache system 500 described with reference to FIG. 5 as an example.

When the file cache application is installed in the client through the installation file, an allocation table including a cache index for indexing information on a plurality of files stored in a single cache data repository is stored in the memory of the client under the control of the file cache application Lt; / RTI > Also, according to the control of the file cache application, a cache index according to a file access request can be checked in the allocation table, and request information corresponding to a file access request is extracted from a single cache data store using the checked cache index .

The single cache data storage may be implemented through a storage device such as a hard disk, and file data may be stored in a single file format stored in the storage device. At this time, a single cache data repository can be classified into a plurality of clusters each assigned a cache index as an identifier and each having a predetermined unit size. In this case, according to the control of the file cache application, the cluster in which the request information among the plurality of clusters is stored can be identified in the client through the cache index identified in the allocation table.

Here, the allocation table includes cache indexes for identifying clusters in which the beginning of each of a plurality of files among the clusters of a single cache data repository and information about the file path and last modified time for each of the plurality of files are stored And cache maps that associate and store cache maps. At this time, the file access request may include the file path of the file containing the requested information and the time when the file was last modified. In this case, according to the control of the file cache application, the cache index corresponding to the file path and the time included in the file access request can be confirmed at the client using the cache map.

Also, the allocation table associates a cache index identified in the cache map and a plurality of cache indexes for identifying a file or a plurality of clusters in which the requested information is stored, when the file or request information is divided and stored through a plurality of clusters And may further include a list for storing. Such a list may include a plurality of nodes identified according to the value of the cache index. At this time, at least one of the nodes corresponding to the plurality of cache indexes for identifying the plurality of clusters storing the file or the request information is a pointer for indicating another node among the nodes corresponding to the plurality of cache indexes The cache index of another node may be included. In this case, according to the control of the file cache application, at the client, a plurality of clusters storing the file or the request information based on the pointer can be identified.

Each of the chunks, which are file data stored in each of a plurality of clusters in which a file or request information is stored, can be identified by a chunk number. At this time, each of the nodes identified through the same cache index as the plurality of clusters storing the file or the request information may include a chunk number of the chunk stored in the corresponding cluster. In this case, according to the control of the file cache application, when the client includes a chunk number in the file access request, the cluster storing the request information is checked based on the chunk number stored in the node of the list and the chunk number included in the file access request .

If an offset or cache index indicating the location of the requested information in the file containing the request information is included in the file access request, then the client may use the allocation table and offset, or in accordance with the control of the file cache application, And the cluster in which the request information is stored can be confirmed using the cache index included in the file connection request. Detailed examples of extracting the request information using the cache map and the list of the allocation table or a processing method when the request information does not exist in a single cache data storage have been described in detail with reference to FIGS. 3 and 4, .

If the request information does not exist in a single cache data store, the client downloads the request information from the predetermined server to process the file access request, stores the downloaded information in a single cache data store, and updates the allocation table of the memory . Such downloading of the request information, processing of the file access request, storage of the downloaded information, and update of the allocation table can be performed under the control of the file cache application. The predetermined server may correspond to the service server 120 described with reference to FIG.

The contents omitted in FIGS. 5 to 8 can be referred to the contents of FIG. 1 to FIG.

As described above, according to the embodiments of the present invention, when the same file is repeatedly requested between systems that send and receive file data, it is possible to efficiently process the transmission of file data using the high performance file cache.

The apparatus described above may be implemented as a hardware component, a software component, and / or a combination of hardware components and software components. For example, the apparatus and components described in the embodiments may be implemented within a computer system, such as, for example, a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable array (FPA) A programmable logic unit (PLU), a microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to execution of the software. For ease of understanding, the processing apparatus may be described as being used singly, but those skilled in the art will recognize that the processing apparatus may have a plurality of processing elements and / As shown in FIG. For example, the processing unit may comprise a plurality of processors or one processor and one controller. Other processing configurations are also possible, such as a parallel processor.

The software may include a computer program, code, instructions, or a combination of one or more of the foregoing, and may be configured to configure the processing device to operate as desired or to process it collectively or collectively Device can be commanded. The software and / or data may be in the form of any type of machine, component, physical device, virtual equipment, computer storage media, or device , Or may be permanently or temporarily embodied in a transmitted signal wave. The software may be distributed over a networked computer system and stored or executed in a distributed manner. The software and data may be stored on one or more computer readable recording media.

The method according to an embodiment may be implemented in the form of a program command that can be executed through various computer means and recorded in a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions to be recorded on the medium may be those specially designed and configured for the embodiments or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. For example, it is to be understood that the techniques described may be performed in a different order than the described methods, and / or that components of the described systems, structures, devices, circuits, Lt; / RTI > or equivalents, even if it is replaced or replaced.

Therefore, other implementations, other embodiments, and equivalents to the claims are also within the scope of the following claims.

310: memory
311: cache map
312: List
320: Storage device
330: cache file

Claims (19)

A single cache data store in which information about a plurality of files is stored;
A memory for storing an allocation table including a cache index for indexing the stored information; And
A processor for checking a cache index corresponding to a file access request in the allocation table and extracting request information corresponding to the file access request from the single cache data store using the checked cache index,
Lt; / RTI >
Wherein the allocation table includes a cache map for storing file identification information for each of the plurality of files and the cache indexes in association with each other,
Wherein the file identification information comprises at least one of a file path, a file name and a last modified time, the cache index identifying a cluster in which the beginning of each of the plurality of files of the single cache data repository is stored And the file cache system. The method according to claim 1,
Wherein the single cache data store is classified into a plurality of clusters each having the cache index assigned as an identifier and each having a predetermined unit size,
The processor comprising:
And a cluster in which the request information is stored among the plurality of clusters is identified through a cache index identified in the allocation table. delete The method according to claim 1,
Wherein the allocation table includes a plurality of cache indexes for identifying a cache index identified in the cache map and a plurality of clusters in which the file or the request information is stored when the file or the request information is divided and stored through a plurality of clusters, Further comprising a list for associating and storing the files. 5. The method of claim 4,
Each of the chunks being file data stored in each of the plurality of clusters in which the file or the request information is stored is identified by a chunk number,
Wherein the list includes a chunk number of a chunk stored in a cluster corresponding to the cache index. 6. The method of claim 5,
The processor comprising:
And if the chunk number is included in the file access request, checks the cluster where the request information is stored based on the chunk number stored in the node of the list and the chunk number included in the file access request. The method according to claim 1,
The processor comprising:
When an offset or a cache index indicating the location of the request information in the file including the request information is included in the file access request,
Using the allocation table and the offset, or by using a cache index included in the allocation table and the file access request, the cluster storing the request information. The method according to claim 1,
The processor comprising:
If the request information is not present in the single cache data store, download the request information from a predetermined server to process the file access request, store the downloaded information in the single cache data store, And updates the allocation table. Providing a file access request for request information to a memory in which an allocation table including a cache index for indexing the stored information is stored, for a single cache data store in which information on a plurality of files is stored; And
Extracting the request information from the single cache data store using the cache index identified according to the file access request in the allocation table
Lt; / RTI >
Wherein the allocation table includes a cache map for storing file identification information for each of the plurality of files and the cache indexes in association with each other,
Wherein the file identification information comprises at least one of a file path, a file name and a last modified time, the cache index identifying a cluster in which the beginning of each of the plurality of files of the single cache data repository is stored The file cache method comprising: 10. The method of claim 9,
Wherein the single cache data store is classified into a plurality of clusters each having the cache index assigned as an identifier and each having a predetermined unit size,
Wherein the extracting comprises:
And a cluster in which the request information is stored among the plurality of clusters is identified through the cache index identified in the allocation table. delete 10. The method of claim 9,
Wherein the allocation table includes a plurality of cache indexes for identifying a cache index identified in the cache map and a plurality of clusters in which the file or the request information is stored when the file or the request information is divided and stored through a plurality of clusters, And a list for associating and storing the files. 13. The method of claim 12,
Each of the chunks being file data stored in each of the plurality of clusters in which the file or the request information is stored is identified by a chunk number,
Wherein the list includes a chunk number of a chunk stored in a cluster corresponding to the cache index. A computer-readable recording medium recording a program for performing the method according to any one of claims 1, 2, 4 to 10, 12 or 13. delete An installation file holding unit for storing and maintaining an installation file of the file cache application; And
An installation file transfer unit for transferring the installation file to the client according to a request from the client,
Lt; / RTI >
When the file cache application is installed in the client through the installation file,
An allocation table including a cache index for indexing information on a plurality of files stored in a single cache data store is stored in the memory of the client under the control of the file cache application,
A cache index according to a file access request is identified in the allocation table in response to the control of the file cache application, and request information corresponding to the file access request is read from the single cache data store using the checked cache index Is extracted,
Wherein the allocation table includes a cache map for storing file identification information for each of the plurality of files and the cache indexes in association with each other,
Wherein the file identification information comprises at least one of a file path, a file name and a last modified time, the cache index identifying a cluster in which the beginning of each of the plurality of files of the single cache data repository is stored The distribution system comprising: 17. The method of claim 16,
Wherein the single cache data store is classified into a plurality of clusters each having the cache index assigned as an identifier and each having a predetermined unit size,
Wherein the clusters in which the request information is stored among the plurality of clusters are identified in the client according to the control of the file cache application through the cache index identified in the allocation table. Storing and maintaining an installation file of the file cache application; And
Transmitting the installation file to the client at the request of the client
Lt; / RTI >
When the file cache application is installed in the client through the installation file,
An allocation table including a cache index for indexing information on a plurality of files stored in a single cache data store is stored in the memory of the client under the control of the file cache application,
A cache index according to a file access request is identified in the allocation table in response to the control of the file cache application, and request information corresponding to the file access request is read from the single cache data store using the checked cache index Is extracted,
Wherein the allocation table includes a cache map for storing file identification information for each of the plurality of files and the cache indexes in association with each other,
Wherein the file identification information comprises at least one of a file path, a file name and a last modified time, the cache index identifying a cluster in which the beginning of each of the plurality of files of the single cache data repository is stored And distributing the distribution information. A computer readable storage medium comprising instructions for a computer system to distribute a file cache application,
The command includes:
Storing and maintaining an installation file of the file cache application; And
Transmitting the installation file to the client at the request of the client
Lt; / RTI >
When the file cache application is installed in the client through the installation file,
An allocation table including a cache index for indexing information on a plurality of files stored in a single cache data store is stored in the memory of the client under the control of the file cache application,
A cache index according to a file access request is identified in the allocation table in response to the control of the file cache application, and request information corresponding to the file access request is read from the single cache data store using the checked cache index Is extracted,
Wherein the allocation table includes a cache map for storing file identification information for each of the plurality of files and the cache indexes in association with each other,
Wherein the file identification information comprises at least one of a file path, a file name and a last modified time, the cache index identifying a cluster in which the beginning of each of the plurality of files of the single cache data repository is stored Wherein the computer system is controlled by the method.

Images