CN101187901A - High speed cache system and method for implementing file access - Google Patents
High speed cache system and method for implementing file access Download PDFInfo
- Publication number
- CN101187901A CN101187901A CNA200710125440XA CN200710125440A CN101187901A CN 101187901 A CN101187901 A CN 101187901A CN A200710125440X A CNA200710125440X A CN A200710125440XA CN 200710125440 A CN200710125440 A CN 200710125440A CN 101187901 A CN101187901 A CN 101187901A
- Authority
- CN
- China
- Prior art keywords
- storage unit
- index
- pointer
- file
- chained list
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 27
- 230000007246 mechanism Effects 0.000 claims description 11
- 230000006870 function Effects 0.000 claims description 4
- 230000004048 modification Effects 0.000 claims description 3
- 238000012986 modification Methods 0.000 claims description 3
- 238000007726 management method Methods 0.000 description 21
- 238000010586 diagram Methods 0.000 description 3
- 101100317378 Mus musculus Wnt3 gene Proteins 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000013500 data storage Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000037361 pathway Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000002123 temporal effect Effects 0.000 description 1
Images
Abstract
The invention discloses a high speed cache system for realizing file visit and a method, the system comprises an index area unit, a data area unit, and an idle pointer chained list unit, wherein the data area unit comprises continuous storing units with fixed sizes, the data area unit occupies continuous and corresponded internal memory spaces as each storing unit according to size and number of the storing units which are preset, the storing units record information of files, the index area unit is provided with index managing area modules and at least one index node. Each catalog is provided with an index node which stores an absolute path which is corresponded with the catalogs and catalogs and information of files under the absolute path, and the index nodes adopt an object pointer to point at each storing unit which records information of each file. An idle pointer chained list unit maintains an idle point chained list, and each chained list unit respectively stores a pointer of each storing unit. The invention has the advantage of flexible and convenient application, and quickly realizes high-speed cache of data of local or remote magnetic disks, and improves index efficiency of files.
Description
Technical field
The present invention relates to reading of disk file, in particular, a kind of cache systems and method that realizes file access.
Background technology
For reducing visit to disk, particularly to the visit of remote disk, improve the recall precision of file, prior art has adopted the mode of high-speed cache, is about to general information and is put into cache memory.
The value of disk cache is two aspects: the first, the speed of visit disk will be well below the speed of access memory, therefore, from the internal storage access data than faster from disk access speed.The second, data are in a single day accessed, just probably are accessed to once more in a short time.This in short-term central access be known as interim local principle (temporal locality) with the principle of a slice data.Interim local principle can guarantee: if in first time during visit data, it is carried out buffer memory, that promptly has access to the data in the high-speed cache just very likely in a short time once more by cache hit.
Therefore, how more effectively realizing disk cache, is to need improved technical matters in actual applications.
Summary of the invention
Technical matters to be solved by this invention provide a kind of concrete, realize the cache systems and the method for file access efficiently.
Technical scheme of the present invention is as follows:
A kind of cache systems of realizing file access, it comprises: unit, index area, unit, data field and free pointer linked list units; Unit, described data field comprises storage unit continuous, fixed size, be used for according to the size and the number that pre-set storage unit, take continuous correspondence memory space as each storage unit, described storage unit is used to write down the fileinfo that comprises file type and filename; Unit, described index area is provided with index management district module and at least one index node; For each catalogue is provided with an index node, described index node is used to store the absolute path of its corresponding catalogue, and the information of catalogue under this absolute path and file, and adopts pointer to object to point to each storage unit of each fileinfo of record; Described index management district module is used to manage described index node; Described free pointer linked list units is used to safeguard that one has the free pointer chained list of a plurality of linked list units, and each linked list units is respectively applied for deposits the pointer that points to each storage unit.
Described cache systems, wherein, described free pointer linked list units comprises first in first out module and lock mechanism module, is respectively applied for to realize first in first out function and lock mechanism, to safeguard described free pointer chained list.
Described cache systems, wherein, it also comprises the Local or Remote disk, described storage unit is used to write down the fileinfo of described disk, and sets up corresponding index node for it, upgrades described index management district.
A kind of cache method of realizing file access, be used to comprise the cache systems of index area, data field and free pointer chained list, this method may further comprise the steps: A1, the size that pre-sets storage unit in internal memory and number, the corresponding memory headroom of initialization is as the described data field with at least one described storage unit, and described storage unit is used to write down the fileinfo that comprises file type and filename; Index management district and at least one index node in A2, the described index area of initialization, for each catalogue is provided with an index node, store the absolute path of its corresponding catalogue at described index node, and the information of catalogue under this absolute path and file, and adopt pointer to object to point to each storage unit that has write down each fileinfo; A3, pre-set described free pointer chained list in internal memory, wherein each linked list units is deposited the pointer that points to each storage unit respectively; A4, receive the file access request,, retrieve each index node by described index management district; A5, judge whether that retrieval obtains required file, be then to carry out A6, otherwise carry out A7; The required file in the Local or Remote disk is read in path in A6, the basis index node that obtains; A7, search and read required file in the Local or Remote disk.
Described cache method, wherein, in the steps A 2, described index management district adopts the MAP mode to realize, and the absolute directory path that adopts index node adopts the value of pointer to object as key word as key word.
Described cache method, wherein, in the steps A 3, described free pointer chained list is the first in first out structure, and adopts lock mechanism to realize.
Described cache method wherein, in the steps A 5, when being empty in the index management district, judges that then retrieval does not obtain required file.
Described cache method, wherein, after the steps A 7, also carry out following steps: A71, by described free pointer chained list, obtain the storage unit of a free time, the file type and the filename of required file is recorded in this storage unit, and sets up index node of correspondence for it.
Described cache method wherein, after the steps A 71, is also carried out following steps: A72, is upgraded described index management district, increases or the catalogue of this required file of modification storage and the information index node of file.
Described cache method wherein, after the steps A 71, is also carried out following steps: A73, is judged that the storage unit that required file takies is used to complete, or described free pointer chained list is selected not the longest storage unit service time when empty; The data of A74, release storage unit, making it becomes idle storage unit, deposits the pointer that points to this idle storage unit in a linked list units of described free pointer chained list.
Adopt such scheme, the present invention passes through the idle storage unit of record, and index node is managed, and applying flexible, convenience efficiently, have promptly realized the high-speed cache to the Local or Remote data in magnetic disk, have improved the recall precision of file.
Description of drawings
Fig. 1 is the high-speed cache synoptic diagram of one embodiment of the present invention;
Fig. 2 is the free pointer list structure synoptic diagram of one embodiment of the present invention;
Fig. 3 is the process flow diagram of the inventive method.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is described in detail.
As shown in Figure 1, the invention provides a kind of cache systems of realizing file access, it comprises: unit, index area, unit, data field and free pointer linked list units; Be used to reduce visit,, improve the recall precision of fileinfo particularly to the visit of remote disk to disk.This cache systems specifies as follows.
Unit, described data field comprises storage unit continuous, fixed size, be used for according to the size and the number that pre-set storage unit, take continuous correspondence memory space as each storage unit, described storage unit is used to write down the fileinfo that comprises file type and filename; In the present invention, high-speed cache adopts the static memory cell design, and each storage unit size is configurable, and the storage unit number also can dispose, and the space that disposable application is enough during module initialization is as the data field of high-speed cache.
Below the internal storage data district is further specified, this internal storage data district is the data storing memory headroom of continuous a, fixed size, data unit size and data field total amount according to configuration are created, and the pointer of creating successful the time each unit leaves in the free pointer chain.
For example, the storage format of data field is as shown in table 1.
| Title | Type | Length | Explanation | |
| 1 | File type | Integer | 4 bytes | |
| 2 | File name | The character array | 256 bytes | Filename (not comprising the path) |
Table 1
For reducing to the disk frequent operation, improve the recall precision of file data, the present invention has designed the index area, is the special use of document retrieval function.Unit, described index area is provided with index management district module and at least one index node; Described index management district module is used to manage each index node; For each catalogue is provided with an index node, described index node is used to store the absolute path of its corresponding catalogue, and the information of catalogue under this absolute path and file, and adopts pointer to object to point to each storage unit of each fileinfo of record.
The data structure definition of index node is as shown in table 2.
| Title | Type | Length | Explanation | |
| 1 | The path | Character string | 256 bytes | The routing information of index node correspondence |
| 2 | State | Integer | 4 bytes | 0: illustrate that catalogue, file corresponding under this node all are written into; 1: part is written into |
| 3 | Start sequence number | Unsigned int | 4 bytes | The catalogue that is written into, the start sequence number of file (since 0) are annotated: when catalogue under certain path of sequence number-read, file, and the serial number of return data |
| 4 | Finish sequence number | Unsigned int | 4 bytes | The end sequence number of the catalogue that is written into, file |
| 5 | Time | Long | 4 bytes | The record data access time, so that the internal storage data district is when finishing using or finishing using, module will discharge at most not index of reference node. |
| 6 | The chained list pointer to object | Pointer | Each data item description in the chained list catalogue, file attribute data, and " internal storage data district data memory format " seen in the definition of data item attribute |
Table 2
The index management district manages index node, and the index management district adopts the MAP mode to design, and is key with the absolute directory path of node, adopts index node pointer to object key value.
The MAP data definition is as shown in table 3.
| Title | Type | Length | Explanation | |
| 1 | The path | Character string | 256 bytes | The path |
| 2 | The node object pointer | Pointer | The index node pointer to object |
Table 3
Described free pointer linked list units is used to safeguard that one has the free pointer chained list of a plurality of linked list units, and each linked list units is respectively applied for deposits the pointer that points to each storage unit.The present invention also needs to set up a chained list, deposits the owner pointer of storage unit in chained list, is referred to as the free pointer chained list.When external system when module is sent the document retrieval request, system is retrieving files index management district at first, if the index management district is for sky or do not retrieve corresponding file, read fileinfo under the specified path from disk then, ask a memory node in then from idle chained list, then with data storage in this node; Data are finished using, or idle chained list internal memory finishes using, and system can pass through corresponding scheduling strategy, find out the data that do not have visit in the internal storage data district at most, require data to discharge, and again data pointer are recovered to idle chained list then.
Specifically, as shown in Figure 2, the free pointer chained list can be the list structure of a first in first out, Storage Unit Pointer in each store data district, unit.It can provide Alloc, is used to get idle data cell; The Free method uses up recurrence; And the GetAllocSize attribute, be used for the defining operation interface.
Big or small during module initialization according to configuration, obtain the size of chain, open up the internal storage data district of a unified size, Storage Unit Pointers all in the internal storage data district is put into the free pointer chained list one by one, when requiring foundation, updating file index area, the idle Storage Unit Pointer of application is stored data from the free pointer chained list; Internal storage data district expired when data or that open up finishes using, and module is found out in requisition for the Archive sit that discharges by relevant scheduling strategy, then node pointer is added to the idle queues tail, to reach the purpose that internal memory discharges.
If at multi-thread environment it is operated, above chained list all must use a lock mechanism to protect in use, and the thread that only obtains locking could be operated chained list.Lock mechanism is meant blockade just by the data of a transactions modify, prevents other user captures to inconsistent data, will be the object release of being blocked by it after finishing.
An embodiment is that described free pointer linked list units comprises first in first out module and lock mechanism module, is respectively applied for to realize first in first out function and lock mechanism, to safeguard described free pointer chained list.
Another embodiment is, described cache systems also comprises the Local or Remote disk, and described storage unit is used to write down the fileinfo of described disk, and sets up corresponding index node for it, upgrades described index management district.
And as shown in Figure 3, the present invention also provides a kind of cache method of realizing file access, is used to comprise the cache systems of index area, data field and free pointer chained list, and this method specifically may further comprise the steps.
A1, the size that in internal memory, pre-sets storage unit and number, the corresponding memory headroom of initialization is as the described data field with at least one described storage unit, and described storage unit is used to write down the fileinfo that comprises file type and filename.Fileinfo can also comprise other content, specifically is actual needs and deciding; For example, under the situation of not considering the storage unit size, fileinfo can also comprise this document associated pathway, the summary or the like.
Index management district and at least one index node in A2, the described index area of initialization, for each catalogue is provided with an index node, store the absolute path of its corresponding catalogue at described index node, and the information of catalogue under this absolute path and file, and adopt pointer to object to point to each storage unit that has write down each fileinfo.
Described index management district can adopt Hash (Hash) algorithm to realize, is more preferably, and described index management district adopts the MAP mode to realize, the absolute directory path that adopts index node adopts the value of pointer to object as key word as key word.
A3, pre-set described free pointer chained list in internal memory, wherein each linked list units is deposited the pointer that points to each storage unit respectively; Be more preferably, described free pointer chained list is the first in first out structure, and adopts lock mechanism to realize.
A4, receive the file access request,, retrieve each index node by described index management district; Then,
A5, judge whether that retrieval obtains required file, be then to carry out A6, otherwise carry out A7; Wherein, when the index management district was sky, then the result of Pan Duaning thought that retrieval does not obtain required file.
The required file in the Local or Remote disk is read in path in A6, the basis index node that obtains;
A7, search and read required file in the Local or Remote disk.
An example is, after steps A 7, can also carry out following steps: A71, by described free pointer chained list, obtain an idle storage unit, the file type and the filename of required file are recorded in this storage unit, and set up corresponding index node for it.
Another example is after steps A 71, also to carry out following steps: A72, upgrade described index management district, increase or the catalogue of this required file of modification storage and the information index node of file.
Perhaps, after steps A 71 or steps A 72, also carry out following steps:
A73, judge that the storage unit that required file takies is used to complete, or described free pointer chained list is selected not the longest storage unit service time when empty;
The data of A74, release storage unit make it to become idle storage unit, deposit the pointer that points to this idle storage unit in a linked list units of described free pointer chained list.
Need to prove that the inventive method can adopt various embodiments in conjunction with above-mentioned explanation to cache systems in specific implementation, no longer repeat to give unnecessary details at this.
Should be understood that, for those of ordinary skills, can be improved according to the above description or conversion, and all these improvement and conversion all should belong to the protection domain of claims of the present invention.
Claims (10)
1. a cache systems of realizing file access is characterized in that, comprising: unit, index area, unit, data field and free pointer linked list units;
Unit, described data field comprises storage unit continuous, fixed size, be used for according to the size and the number that pre-set storage unit, take continuous correspondence memory space as each storage unit, described storage unit is used to write down the fileinfo that comprises file type and filename;
Unit, described index area is provided with index management district module and at least one index node; For each catalogue is provided with an index node, described index node is used to store the absolute path of its corresponding catalogue, and the information of catalogue under this absolute path and file, and adopts pointer to object to point to each storage unit of each fileinfo of record; Described index management district module is used to manage described index node;
Described free pointer linked list units is used to safeguard that one has the free pointer chained list of a plurality of linked list units, and each linked list units is respectively applied for deposits the pointer that points to each storage unit.
2. cache systems according to claim 1 is characterized in that, described free pointer linked list units comprises first in first out module and lock mechanism module, is respectively applied for to realize first in first out function and lock mechanism, to safeguard described free pointer chained list.
3. cache systems according to claim 1 is characterized in that it also comprises the Local or Remote disk, and described storage unit is used to write down the fileinfo of described disk, and sets up corresponding index node for it, upgrades described index management district.
4. cache method of realizing file access is used to comprise the cache systems of index area, data field and free pointer chained list, and this method may further comprise the steps:
A1, the size that in internal memory, pre-sets storage unit and number, the corresponding memory headroom of initialization is as the described data field with at least one described storage unit, and described storage unit is used to write down the fileinfo that comprises file type and filename;
Index management district and at least one index node in A2, the described index area of initialization, for each catalogue is provided with an index node, store the absolute path of its corresponding catalogue at described index node, and the information of catalogue under this absolute path and file, and adopt pointer to object to point to each storage unit that has write down each fileinfo;
A3, pre-set described free pointer chained list in internal memory, wherein each linked list units is deposited the pointer that points to each storage unit respectively;
A4, receive the file access request,, retrieve each index node by described index management district;
A5, judge whether that retrieval obtains required file, be then to carry out A6, otherwise carry out A7;
The required file in the Local or Remote disk is read in path in A6, the basis index node that obtains;
A7, search and read required file in the Local or Remote disk.
5. cache method according to claim 4 is characterized in that, in the steps A 2, described index management district adopts the MAP mode to realize, the absolute directory path that adopts index node adopts the value of pointer to object as key word as key word.
6. cache method according to claim 4 is characterized in that, in the steps A 3, described free pointer chained list is the first in first out structure, and adopts lock mechanism to realize.
7. cache method according to claim 4 is characterized in that, in the steps A 5, when being empty in the index management district, judges that then retrieval does not obtain required file.
8. according to the arbitrary described cache method of claim 4 to 7, it is characterized in that, after the steps A 7, also carry out following steps: A71, by described free pointer chained list, obtain the storage unit of a free time, the file type and the filename of required file are recorded in this storage unit, and set up corresponding index node for it.
9. cache method according to claim 8 is characterized in that, after the steps A 71, also carries out following steps: A72, upgrades described index management district, increases or the catalogue of this required file of modification storage and the information index node of file.
10. cache method according to claim 8 is characterized in that, after the steps A 71, also carries out following steps:
A73, judge that the storage unit that required file takies is used to complete, or described free pointer chained list is selected not the longest storage unit service time when empty;
The data of A74, release storage unit, making it becomes idle storage unit, deposits the pointer that points to this idle storage unit in a linked list units of described free pointer chained list.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710125440XA CN101187901B (en) | 2007-12-20 | 2007-12-20 | High speed cache system and method for implementing file access |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710125440XA CN101187901B (en) | 2007-12-20 | 2007-12-20 | High speed cache system and method for implementing file access |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101187901A true CN101187901A (en) | 2008-05-28 |
| CN101187901B CN101187901B (en) | 2012-07-18 |
Family
ID=39480304
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710125440XA Active CN101187901B (en) | 2007-12-20 | 2007-12-20 | High speed cache system and method for implementing file access |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101187901B (en) |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101819603A (en) * | 2010-05-07 | 2010-09-01 | 中兴通讯股份有限公司 | Embedded system based method and device for searching information record based on |
| CN102024020A (en) * | 2010-11-04 | 2011-04-20 | 曙光信息产业(北京)有限公司 | Efficient metadata memory access method in distributed file system |
| CN102023992A (en) * | 2009-09-18 | 2011-04-20 | 青岛海信电器股份有限公司 | Content browsing method and apparatus |
| CN102231137A (en) * | 2011-05-26 | 2011-11-02 | 浪潮(北京)电子信息产业有限公司 | Data memory system and method |
| CN102843396A (en) * | 2011-06-22 | 2012-12-26 | 中兴通讯股份有限公司 | Data writing and reading method and device in distributed caching system |
| CN102929923A (en) * | 2012-09-19 | 2013-02-13 | Tcl集团股份有限公司 | Organization and management and displaying methods and devices for ordered data interface elements |
| CN102955861A (en) * | 2012-11-30 | 2013-03-06 | 华为技术有限公司 | Method and device for generating index files based on backup files |
| CN102968464A (en) * | 2012-11-08 | 2013-03-13 | 广东电子工业研究院有限公司 | Index-based local resource quick retrieval system and retrieval method thereof |
| CN103020186A (en) * | 2012-11-30 | 2013-04-03 | 广东欧珀移动通信有限公司 | File searching method, device and equipment based on embedded device |
| CN103136293A (en) * | 2011-12-02 | 2013-06-05 | 福建星网视易信息系统有限公司 | Form design and read method of picture resource bundles |
| CN103268291A (en) * | 2013-05-23 | 2013-08-28 | 清华大学 | Method for delaying persistent indexing metadata in flash memory storage system |
| CN103365918A (en) * | 2012-04-09 | 2013-10-23 | 腾讯科技（深圳）有限公司 | Method and device for processing data |
| CN103412786A (en) * | 2013-08-29 | 2013-11-27 | 苏州科达科技股份有限公司 | High performance server architecture system and data processing method thereof |
| CN103560976A (en) * | 2013-11-20 | 2014-02-05 | 迈普通信技术股份有限公司 | Method, device and system for having control over data sending |
| CN103631726A (en) * | 2013-11-28 | 2014-03-12 | 北京锐安科技有限公司 | File processing method and device of series-connection streaming computational nodes |
| CN104067279A (en) * | 2012-03-30 | 2014-09-24 | 惠普发展公司，有限责任合伙企业 | Authorization cache |
| CN104516945A (en) * | 2014-11-18 | 2015-04-15 | 国家电网公司 | Hadoop distributed file system metadata storage method based on relational data base |
| WO2016082196A1 (en) * | 2014-11-28 | 2016-06-02 | 华为技术有限公司 | File access method and apparatus and storage device |
| CN105653609A (en) * | 2015-12-24 | 2016-06-08 | 中国建设银行股份有限公司 | Memory-based data processing method and device |
| CN109240989A (en) * | 2018-09-07 | 2019-01-18 | 深圳市万普拉斯科技有限公司 | File object querying method, device, terminal device and readable storage medium storing program for executing |
| CN110471764A (en) * | 2019-08-01 | 2019-11-19 | 郑州阿帕斯科技有限公司 | A kind of processing method and processing device of memory cleaning |
| CN111191082A (en) * | 2019-12-23 | 2020-05-22 | 宁波港信息通信有限公司 | Data management method and device, computer equipment and storage medium |
| CN111767436A (en) * | 2020-06-23 | 2020-10-13 | 北京思特奇信息技术股份有限公司 | HASH index data storage and reading method and system |
| CN112379833A (en) * | 2020-11-12 | 2021-02-19 | 阿米华晟数据科技(江苏)有限公司 | File caching device, file caching method, idle space recycling method and fault recovery method |
| CN113821160A (en) * | 2020-11-27 | 2021-12-21 | 北京京东拓先科技有限公司 | Memory data access device and memory data storage and reading method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1165000C (en) * | 2001-12-20 | 2004-09-01 | 中国科学院计算技术研究所 | Microprocessor high speed buffer storage method of dynamic index |
-
2007
- 2007-12-20 CN CN200710125440XA patent/CN101187901B/en active Active
Cited By (45)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102023992A (en) * | 2009-09-18 | 2011-04-20 | 青岛海信电器股份有限公司 | Content browsing method and apparatus |
| CN101819603A (en) * | 2010-05-07 | 2010-09-01 | 中兴通讯股份有限公司 | Embedded system based method and device for searching information record based on |
| WO2011137684A1 (en) * | 2010-05-07 | 2011-11-10 | 中兴通讯股份有限公司 | Search method and device based on information records of embedded system |
| CN102024020B (en) * | 2010-11-04 | 2013-02-06 | 曙光信息产业(北京)有限公司 | Efficient metadata memory access method in distributed file system |
| CN102024020A (en) * | 2010-11-04 | 2011-04-20 | 曙光信息产业(北京)有限公司 | Efficient metadata memory access method in distributed file system |
| CN102231137A (en) * | 2011-05-26 | 2011-11-02 | 浪潮(北京)电子信息产业有限公司 | Data memory system and method |
| CN102843396A (en) * | 2011-06-22 | 2012-12-26 | 中兴通讯股份有限公司 | Data writing and reading method and device in distributed caching system |
| CN102843396B (en) * | 2011-06-22 | 2018-03-13 | 中兴通讯股份有限公司 | Data write-in and read method and device in a kind of distributed cache system |
| CN103136293B (en) * | 2011-12-02 | 2016-01-13 | 福建星网视易信息系统有限公司 | The format design of picture resource bag and read method |
| CN103136293A (en) * | 2011-12-02 | 2013-06-05 | 福建星网视易信息系统有限公司 | Form design and read method of picture resource bundles |
| US9514290B2 (en) | 2012-03-30 | 2016-12-06 | Hewlett Packard Enterprise Development Lp | Authorization cache |
| CN104067279A (en) * | 2012-03-30 | 2014-09-24 | 惠普发展公司，有限责任合伙企业 | Authorization cache |
| CN103365918A (en) * | 2012-04-09 | 2013-10-23 | 腾讯科技（深圳）有限公司 | Method and device for processing data |
| CN102929923B (en) * | 2012-09-19 | 2017-05-03 | Tcl集团股份有限公司 | Organization and management and displaying methods and devices for ordered data interface elements |
| CN102929923A (en) * | 2012-09-19 | 2013-02-13 | Tcl集团股份有限公司 | Organization and management and displaying methods and devices for ordered data interface elements |
| CN102968464A (en) * | 2012-11-08 | 2013-03-13 | 广东电子工业研究院有限公司 | Index-based local resource quick retrieval system and retrieval method thereof |
| CN102968464B (en) * | 2012-11-08 | 2016-07-13 | 广东电子工业研究院有限公司 | A kind of search method of the local resource quick retrieval system based on index |
| CN103020186A (en) * | 2012-11-30 | 2013-04-03 | 广东欧珀移动通信有限公司 | File searching method, device and equipment based on embedded device |
| CN102955861A (en) * | 2012-11-30 | 2013-03-06 | 华为技术有限公司 | Method and device for generating index files based on backup files |
| CN103020186B (en) * | 2012-11-30 | 2016-04-13 | 广东欧珀移动通信有限公司 | A kind of document retrieval method based on embedded device, device and equipment |
| CN102955861B (en) * | 2012-11-30 | 2017-04-12 | 华为技术有限公司 | Method and device for generating index files based on backup files |
| CN103268291A (en) * | 2013-05-23 | 2013-08-28 | 清华大学 | Method for delaying persistent indexing metadata in flash memory storage system |
| CN103268291B (en) * | 2013-05-23 | 2016-02-24 | 清华大学 | The method of persistence index metadata is postponed in flash-memory storage system |
| CN103412786A (en) * | 2013-08-29 | 2013-11-27 | 苏州科达科技股份有限公司 | High performance server architecture system and data processing method thereof |
| CN103412786B (en) * | 2013-08-29 | 2017-04-12 | 苏州科达科技股份有限公司 | High performance server architecture system and data processing method thereof |
| CN103560976B (en) * | 2013-11-20 | 2018-12-07 | 迈普通信技术股份有限公司 | A kind of method, apparatus and system that control data are sent |
| CN103560976A (en) * | 2013-11-20 | 2014-02-05 | 迈普通信技术股份有限公司 | Method, device and system for having control over data sending |
| CN103631726A (en) * | 2013-11-28 | 2014-03-12 | 北京锐安科技有限公司 | File processing method and device of series-connection streaming computational nodes |
| CN103631726B (en) * | 2013-11-28 | 2017-01-25 | 北京锐安科技有限公司 | File processing method and device of series-connection streaming computational nodes |
| CN104516945A (en) * | 2014-11-18 | 2015-04-15 | 国家电网公司 | Hadoop distributed file system metadata storage method based on relational data base |
| WO2016082196A1 (en) * | 2014-11-28 | 2016-06-02 | 华为技术有限公司 | File access method and apparatus and storage device |
| KR20170088933A (en) * | 2014-11-28 | 2017-08-02 | 후아웨이 테크놀러지 컴퍼니 리미티드 | File access method and apparatus and storage device |
| US10067684B2 (en) | 2014-11-28 | 2018-09-04 | Huawei Technologies Co., Ltd. | File access method and apparatus, and storage device |
| KR101944876B1 (en) | 2014-11-28 | 2019-02-01 | 후아웨이 테크놀러지 컴퍼니 리미티드 | File access method and apparatus and storage device |
| CN105653609B (en) * | 2015-12-24 | 2019-08-09 | 中国建设银行股份有限公司 | Data processing method memory-based and device |
| CN105653609A (en) * | 2015-12-24 | 2016-06-08 | 中国建设银行股份有限公司 | Memory-based data processing method and device |
| CN109240989A (en) * | 2018-09-07 | 2019-01-18 | 深圳市万普拉斯科技有限公司 | File object querying method, device, terminal device and readable storage medium storing program for executing |
| CN109240989B (en) * | 2018-09-07 | 2020-12-29 | 深圳市万普拉斯科技有限公司 | File object query method and device, terminal device and readable storage medium |
| CN110471764A (en) * | 2019-08-01 | 2019-11-19 | 郑州阿帕斯科技有限公司 | A kind of processing method and processing device of memory cleaning |
| CN111191082A (en) * | 2019-12-23 | 2020-05-22 | 宁波港信息通信有限公司 | Data management method and device, computer equipment and storage medium |
| CN111191082B (en) * | 2019-12-23 | 2023-09-05 | 宁波港信息通信有限公司 | Data management method, device, computer equipment and storage medium |
| CN111767436A (en) * | 2020-06-23 | 2020-10-13 | 北京思特奇信息技术股份有限公司 | HASH index data storage and reading method and system |
| CN111767436B (en) * | 2020-06-23 | 2023-11-10 | 北京思特奇信息技术股份有限公司 | HASH index data storage and reading method and system |
| CN112379833A (en) * | 2020-11-12 | 2021-02-19 | 阿米华晟数据科技(江苏)有限公司 | File caching device, file caching method, idle space recycling method and fault recovery method |
| CN113821160A (en) * | 2020-11-27 | 2021-12-21 | 北京京东拓先科技有限公司 | Memory data access device and memory data storage and reading method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101187901B (en) | 2012-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101187901B (en) | High speed cache system and method for implementing file access | |
| CN102364474B (en) | Metadata storage system for cluster file system and metadata management method | |
| CN102035881B (en) | Data caching method of cloud storage system | |
| US9047301B2 (en) | Method for optimizing the memory usage and performance of data deduplication storage systems | |
| CN107391391B (en) | Method, system and the solid state hard disk of data copy are realized in the FTL of solid state hard disk | |
| JP5445682B2 (en) | Storage system | |
| US7966289B2 (en) | Systems and methods for reading objects in a file system | |
| CN107168657B (en) | Virtual disk hierarchical cache design method based on distributed block storage | |
| CN103838853B (en) | Mixed file system based on different storage media | |
| CN101488153A (en) | Method for implementing high-capacity flash memory file system in embedded type Linux | |
| CN106662981A (en) | Storage device, program, and information processing method | |
| CN106708427A (en) | Storage method suitable for key value pair data | |
| WO2009033419A1 (en) | A data caching processing method, system and data caching device | |
| CN103020315A (en) | Method for storing mass of small files on basis of master-slave distributed file system | |
| CN107016100A (en) | A kind of metadata management method based on Nonvolatile memory file system | |
| KR101356470B1 (en) | Flash file system | |
| CN106682110B (en) | Image file storage and management system and method based on Hash grid index | |
| Lee et al. | An efficient index buffer management scheme for implementing a B-tree on NAND flash memory | |
| CN102024019B (en) | Suffix tree based catalog organizing method in distributed file system | |
| CN102402622A (en) | Memory page managing and scheduling method for embedded memory database | |
| CN102024060B (en) | Method for memorizing files and restoring error deleted files | |
| CN111881107A (en) | Distributed storage method supporting mounting of multi-file system | |
| CN102411632A (en) | Chain table-based memory database page type storage method | |
| CN108595589A (en) | A kind of efficient access method of magnanimity science data picture | |
| KR100907477B1 (en) | Apparatus and method for managing index of data stored in flash memory |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |