CN103139224A - Network file system and method for accessing network file system - Google Patents
Network file system and method for accessing network file system Download PDFInfo
- Publication number
- CN103139224A CN103139224A CN2011103733072A CN201110373307A CN103139224A CN 103139224 A CN103139224 A CN 103139224A CN 2011103733072 A CN2011103733072 A CN 2011103733072A CN 201110373307 A CN201110373307 A CN 201110373307A CN 103139224 A CN103139224 A CN 103139224A
- Authority
- CN
- China
- Prior art keywords
- node
- local file
- pointer
- access
- access destination
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a network file system. The system comprises local file cache, a local file database, a remote server and a client. The local file cache is used for storing access targets which are accessed by users recently, the local file database is used for storing all access targets which are accessed by users and conducting synchronization through a preset synchronization strategy and original user file systems stored in the remote server, the remote server is used for storing original user file systems, when the client is used for determining locations of access targets in accordance with operation commands of users, the client searches in the local file cache, the client searches in the local file database if the client does not search in the local file cache, and the client searches in the remote server if the client does not search in the local file database. The invention also discloses a method for accessing the network file system. By the aid of the method, the interaction of the client and the remote server is reduced, and the file access stability and the access speed are improved.
Description
Technical field
The present invention relates to network communications technology field, particularly the access method of a kind of NFS and NFS.
Background technology
NFS as cloud storage system, refers to that user file is stored in far-end server, and client is carried out the file system of file operation by the access to netwoks far-end server.
Current NFS is generally taked simple primary structure, be that client is direct and far-end server is mutual, client can arrive far-end server by Internet Transmission to the operational order of file, respond and carry out by far-end server, when for example client needs file reading, to the reading command of far-end server Transmit message, after finding corresponding file destination from far-end server, pull corresponding file data with directly.
For existing NFS, at every turn the operation of file all needed directly to access far-end server, increased the processing load of server, and can not guarantee that file can access smoothly during Network Abnormal, the poor stability of file access; Simultaneously, be subjected to the restriction of network transfer speeds, can't reach gratifying file access speed.
Summary of the invention
In view of this, the invention provides the access method of a kind of NFS and NFS, can reduce the mutual of client and far-end server, and improve stability and the access speed of file access.
For reaching above-mentioned purpose, technical scheme of the present invention specifically is achieved in that
A kind of NFS, this system comprises: client, local file buffer memory, local data base and far-end server;
Described client is used for the operational order according to the user, determines the position of access destination in described operational order; When determining the access destination position, first inquire about in described local file buffer memory, if do not inquire, inquire about in described local file database, if do not inquire yet, to described far-end server inquiry;
Described local file buffer memory is used for preserving the access destination of accessing in nearest a period of time of user;
Described local file database, be used for preserving all access destination that the user had accessed, and synchronize by the original user file system of preserving in default synchronization policy and far-end server, make in access destination and original user file system to be consistent;
Far-end server is connected with described client by network, is used for preserving the original user file system.
A kind of access method of NFS, the method comprises:
According to user's operational order, when determining the position of access destination in described operational order;
First inquire about in the local file buffer memory of preserving the access destination that the user accessed in nearest a period of time;
If do not inquire, all access destination of preserving the user and accessed, and synchronize by the original user file system of preserving in default synchronization policy and far-end server, make in the local file database that is consistent in the access destination of preservation and original user file system and inquire about;
If do not inquire yet, to being connected with described client by network, preserve the far-end server inquiry of original user file system.
As seen from the above technical solution, the access method of this NFS of the present invention and NFS can be controlled to greatest extent client terminal local to the access of NFS with the user and complete, thereby avoided the impact of network condition on NFS, improved stability and the access speed of file access.
Description of drawings
Fig. 1 is the NFS structural representation of the embodiment of the present invention;
Fig. 2 is the linked list type file system index schematic diagram of embodiment of the present invention local file cache maintenance;
Fig. 3 is LRU chained list schematic diagram in the linked list type file system index of embodiment of the present invention local file cache maintenance;
Fig. 4 is in the linked list type file system index of embodiment of the present invention local file cache maintenance, set membership chained list schematic diagram.
Embodiment
For making purpose of the present invention, technical scheme and advantage clearer, referring to the accompanying drawing embodiment that develops simultaneously, the present invention is described in more detail.
The present invention has increased the file cache of client terminal local and the document data bank of client terminal local between the client of NFS and far-end server; The document data bank of client terminal local is preserved all access destination that the user had accessed; The client terminal local file cache is preserved the access destination that in nearest a period of time, the user accessed; When carrying out file access, first inquiring client terminal local file buffer memory, if miss, inquiring client terminal local file database, if still miss, visit again far-end server; Simultaneously, keep consistent in the original user file system of access destination that the client file database preserves and far-end server preservation by synchronization policy.The present invention can make the user occur in as much as possible client terminal local to the access of network file, thereby reduces the mutual of client and far-end server, reduces the dependence to network, improves stability and the access speed of network file access.
Fig. 1 is the NFS structural representation of the embodiment of the present invention, and as shown in Figure 1, this system comprises: client 101, local file buffer memory 102, local file database 103 and far-end server 104;
Wherein, access destination is file destination or the catalogue that in operational order, the needs of appointment operate.
For different operational orders, although concrete operations are different, but all need access destination is inquired about before the executable operations instruction, determine the position of access destination, just can carry out follow-up operational order and carry out and respond, so, if access destination is in client 101 this locality, rather than the server of network far-end, namely can carry out file operation in client 101 this locality, and not need to access far-end server 104.
Therefore, in the present embodiment, when client 101 is determined the access destination position, can first inquire about in local file buffer memory 102, if inquire, determine that the position of access destination is in local file buffer memory 102; Otherwise inquiry in local file database 103 if find, is determined the position of access destination in local file database 103, if do not find, at last again to far-end server 104 inquiries.
Local file buffer memory 102 is used for preserving the access destination of accessing in nearest a period of time of user;
Local file buffer memory 102 can be arranged in client 101 this locality internal memory, hard disk or other memory device (for improving access speed, with interior save as good); In addition, need to safeguard a file system index in local file buffer memory 102, for the particular location of client 101 queried access targets in buffer memory.
Far-end server 104 is connected with client 101 by network, is used for preserving the original user file system, and synchronizes with the access destination of preservation in local file database 103, makes in access destination and original user file system to be consistent.
What preserve in far-end server 104 is original user file, it is final formal user data, all access destination that the user who preserves in local file database 103 had accessed, a subset that is equivalent to the original user file system is the copy of the certain customers' file in the original user file system; And the access destination of accessing in the nearest a period of time of user of preserving in local file buffer memory 102, one subset of all access destination that the user who is equivalent to again to preserve in local file database 103 had accessed is also the copy of the certain customers' file in the original user file system;
In addition, the file system index of safeguarding in local file buffer memory 102 can adopt the chain sheet form to manage (the chain sheet form generally is used for the situation that local file buffer memory 102 is positioned at the client terminal local internal memory), also can adopt database form (being arranged in the situation of client terminal local hard disk as local file buffer memory 102), perhaps other self-defining indexed mode; For the chain sheet form, concrete chained list way to manage, the pointer field that comprises etc. arbitrarily, the below lifts one, and to adopt the chain sheet form be the object lesson that protects the file system index.
As shown in Figure 2, each access destination, namely single file or catalogue, represent with an Archive sit in chained list, indicate by pointer the position of Archive sit in internal memory.The index of whole file system is from root, in Fig. 2, pRoot is the root node pointer, and the pointer of all child nodes under root node is kept in Hash table, pHashTable is the pointer of Hash table, and client 101 can find the position of Hash table in internal memory by pHashTable; Lelru is least recently used (lru) territory (back is introduced in detail) of Archive sit;
Wherein, Hash table comprises the pointer in all entrances (entry) territory, and each entry territory chain enters Hash (leHash) territory of respective file node; Archive sit enters corresponding entry territory in Hash table by its leHash territory chain, forms the doubly linked list structure, the concrete position of each Archive sit in Hash table, by this node
The father Node pointerAnd should
The file name of node (filename or directory name)Determine, the cryptographic Hash that the pointer that for example makes this document node is calculated by the title of the father node pointer of this document node and this document node represents.
Be subject to the restriction of memory size, possibly can't preserve all access destination that the user accessed in local file buffer memory 102, therefore, the Archive sit of safeguarding in local file buffer memory 102 can not infinitely increase, therefore need to adopt least recently used (LRU) algorithm to carry out eliminating of Archive sit, only preserve the access destination that in nearest a period of time, the user accessed, to reduce taking of local file 102 pairs of internal memories of buffer memory.
In this example, be to realize with the LRU chained list, as shown in Figure 3, each Archive sit comprises a LRU territory (representing with lelru), enters by these mutual chains in LRU territory, forms the LRU chained list.Whether certain Archive sit adds the LRU chained list, can count by reference decision, and when certain Archive sit was accessed, reference count added 1; When access finished, counting subtracted 1; Can decision node whether finish using like this; For the node of finishing using (reference count is 0), can be added into the LRU chained list, etc. to be recycled, when the memory headroom that takies when local file buffer memory 102 surpasses preset value, to start removal process, an Archive sit in deletion LRU chained list, with the data field content of the Archive sit that reclaims, namely concrete access destination (file or catalogue) is saved in local file database 103 simultaneously.If Archive sit is cited again before starting recovery, this document node can remove from the LRU chained list.
Particularly, as a new Archive sit need to be increased, at this moment, if taking up room, local file buffer memory 102 surpasses preset value in local file buffer memory 102, for example 90% of memory size (configurable), remove an existing file node and return as new node from the LRU chained list; Otherwise, distribute a new node from memory pool, and hang in local file buffer memory 102, specifically remove which Archive sit any, can choose at random, also can choose according to certain rule.
In addition, for energy fast finding Archive sit, inquire about according to the tree-shaped relation between Archive sit, can further increase the pointer field that is used for set membership between the reflection Archive sit in Archive sit, for example shown in Figure 4, child node enters subdirectory (leSubDirs) chained list of father node by child (leChild) territory chain; Child node can upwards be accessed the concrete data in the data field of its father node by his father (pParent) territory.
By above-mentioned file system index, can realize the fast finding of access destination, for example accessed path be the net dish I document readme.txt " the search procedure of file be:
At first according to separator " " path decomposing is become a plurality of Archive sits, i.e. " net dish ", " my document ", " readme.txt "; From superior node, calculate cryptographic Hash according to the father node pointer of this node character string and this node, this cryptographic Hash utilizes this cryptographic Hash to find the pointer of this node from Hash table to should the pointer of node in Hash table; With this node pointer of finding character string calculating cryptographic Hash with the next stage child node of this node, utilize this cryptographic Hash to find the pointer of the next stage child node of this node from Hash table again; So circulation is until all nodes are all found, and the node that finds at last is the Archive sit that will inquire about, and the pointer of this document node is the position of access destination in internal memory.
Particularly, first calculate its hash value according to root node pointer and " net dish " character string, find the pointer of " net dish " node according to this hash value, use again the pointer of " net dish " node to calculate the hash value with " my document " character string, and find the pointer of " net dish my document " node, calculate the hash value according to the pointer of " net dish my document " node with " readme.txt " character string, and find " the net dish I document readme.txt " pointer of node, thereby find corresponding readme.txt file according to this pointer.
In addition, for avoiding data collision, can also introduce the file lock in local file buffer memory 102, comprise read lock and write lock; Before access destination is carried out certain operational order, to attempt access destination is locked, the type of lock is by the operational order type decided; For example reading command is read lock, revises and create instruction for writing lock etc.; As lock and ask to show that unsuccessfully access destination is used, and prompting user; Successful access destination is locked, before this operational order is completed, can't be accessed by other operational orders.
In addition, file system does not allow the file of the same name in same paths, the existence of subdirectory of the same name, therefore also need to introduce the duplication of name testing mechanism, when relating to the operations such as newly-increased access destination, mobile access target or modification access destination title in execution, search according to new title; If find represent duplication of name is arranged; Current operation can not continue, and the prompting user.
In addition, creation operation for access destination, need to carry out at far-end server 104 by network, but the delay on free due to network operation represent that this access destination is created so need to create a temporary file node at local file buffer memory 102; Other concurrent operation wants that the access destination that creates same title will be interrupted by the duplication of name testing mechanism like this; If the access destination on far-end server 104 creates successfully, the temporary file node of local file buffer memory 102 establishments can become effective Archive sit; Otherwise, cancel the temporary file node and point out the user to create failure.
For local file database 103, it can adopt any database file form to preserve the access destination that the user accessed, concrete preserving type is not the emphasis that the present invention discusses, here repeat no more, only introduce the concrete grammar of queried access target in local file database 103, for example need to search the All Files under " net dish my document "; Concrete grammar is as follows:
Because " net dish " is root, there is no father node, be recorded as sky so at first search father node, name is called the data-base recording RowId1 of " net dish ", then search father node and be recorded as RowId1, the data-base recording RowId2 that name is called " my document " searches successively more afterwards the entries that records all in RowId2 and gets final product.
Wherein, RowId is the recording mechanism of Archive sit in database file, the corresponding unique recording mechanism of each Archive sit; Therefore for the subfile under a catalogue, the recording mechanism of having preserved its father node in the record of subfile node can add according to the recording mechanism of father node that the name of subfile searches, and obtains the record of subfile or subdirectory.
By the above embodiments as seen, the access method of this NFS of the present invention and NFS can be controlled to greatest extent client terminal local to the access of NFS with the user and complete, thereby avoided the impact of network condition on NFS, improved stability and the access speed of file access.
The above is only preferred embodiment of the present invention, and is in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, is equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.
Claims (16)
1. a NFS, is characterized in that, this system comprises: client, local file buffer memory, local data base and far-end server;
Described client is used for the operational order according to the user, determines the position of access destination in described operational order; When determining the access destination position, first inquire about in described local file buffer memory, if do not inquire, inquire about in described local file database, if do not inquire yet, to described far-end server inquiry;
Described local file buffer memory is used for preserving the access destination of accessing in nearest a period of time of user; Described local file database, be used for preserving all access destination that the user had accessed, and synchronize by the original user file system of preserving in default synchronization policy and far-end server, make in access destination and original user file system to be consistent;
Far-end server is connected with described client by network, is used for preserving the original user file system.
2. NFS as claimed in claim 1, is characterized in that, safeguards a file system index in described local file buffer memory, for the particular location of described client query access destination in buffer memory.
3. NFS as claimed in claim 1 or 2, is characterized in that, described local file database is preserved access destination with database format, the position that the search method queried access target that described client is provided by database records in database.
4. NFS as claimed in claim 1, is characterized in that, described local file buffer memory is safeguarded the index of whole file system in the chained list mode, and described access destination represents with Archive sit in chained list; Wherein, the pointer of all child nodes under root node is kept in Hash table, and Hash table comprises the pointer in all entrances territory, and each entrance territory chain enters the Hash territory of respective file node; Archive sit enters corresponding entrance territory in Hash table by its Hash territory chain, forms the doubly linked list structure; The cryptographic Hash that the pointer of each Archive sit is calculated by the title of the father node pointer of this document node and this document node represents.
5. NFS as claimed in claim 4, is characterized in that, described local file buffer memory is eliminated described Archive sit by least recently used lru algorithm.
6. NFS as claimed in claim 5, is characterized in that, in the file system index of described local file cache maintenance, each Archive sit comprises the LRU territory, enters by these mutual chains in LRU territory, forms the LRU chained list;
When Archive sit was accessed, reference count added 1; When access finished, counting subtracted 1; It is 0 Archive sit for reference count, can be added into the LRU chained list, when the memory headroom that takies when described local file buffer memory surpassed preset value, Archive sit of deletion reclaimed from the LRU chained list, and the concrete data with the Archive sit that reclaims are saved in the local file database simultaneously.
7. NFS as claimed in claim 5, is characterized in that, in the file system index of described local file cache maintenance, each Archive sit comprises the pointer field for set membership between the reflection Archive sit;
Wherein child node enters the subdirectory chained list of father node by its child territory chain; Child node is upwards accessed the data field of its father node by father field.
8. NFS as claimed in claim 5, is characterized in that, described client becomes a plurality of Archive sits with the path decomposing of access destination; From superior node, calculate cryptographic Hash according to the father node pointer of this node character string and this node, utilize this cryptographic Hash to find the pointer of this node from Hash table; With this node pointer of finding character string calculating cryptographic Hash with the next stage child node of this node, utilize this cryptographic Hash to find the pointer of the next stage child node of this node from Hash table again; So circulation is until all nodes are all found, and the pointer of the Archive sit that finds at last is the position of access destination in internal memory.
9. the access method of a NFS, is characterized in that, the method comprises:
According to user's operational order, when determining the position of access destination in described operational order;
First inquire about in the local file buffer memory of preserving the access destination that the user accessed in nearest a period of time;
If do not inquire, all access destination of preserving the user and accessed, and synchronize by the original user file system of preserving in default synchronization policy and far-end server, make in the local file database that is consistent in the access destination of preservation and original user file system and inquire about;
If do not inquire yet, to being connected with described client by network, preserve the far-end server inquiry of original user file system.
10. the access method of NFS as claimed in claim 9, is characterized in that, describedly inquires about in the local file buffer memory, comprising:
By the file system index of safeguarding in the local file buffer memory, the particular location of queried access target in buffer memory.
11. the access method as claim 9 or 10 described NFSs is characterized in that, describedly inquires about in the local file database, comprising:
By the search method that described local file database provides, the access destination that inquiry is preserved with database format, the position of recording in database.
12. the access method of NFS as claimed in claim 10 is characterized in that, described index safeguards in the chained list mode, and described access destination represents with Archive sit in chained list; Wherein, the pointer of all child nodes under root node is kept in Hash table, and Hash table comprises the pointer in all entrances territory, and each entrance territory chain enters the Hash territory of respective file node; Archive sit enters corresponding entrance territory in Hash table by its Hash territory chain, forms the doubly linked list structure; The cryptographic Hash that the pointer of each Archive sit is calculated by the title of the father node pointer of this document node and this document node represents.
13. the access method of NFS as claimed in claim 12 is characterized in that, described Archive sit is eliminated by least recently used lru algorithm.
14. the access method of NFS as claimed in claim 13 is characterized in that, described eliminating comprises:
Each Archive sit comprises a LRU territory, enters by these mutual chains in LRU territory, forms the LRU chained list;
When Archive sit was accessed, reference count added 1; When access finished, counting subtracted 1; It is 0 Archive sit for reference count, can be added into the LRU chained list, when the memory headroom that takies when described local file buffer memory surpassed preset value, Archive sit of deletion reclaimed from the LRU chained list, and the concrete data with the Archive sit that reclaims are saved in the local file database simultaneously.
15. the access method of NFS as claimed in claim 12 is characterized in that, described each Archive sit further comprises the pointer field for set membership between the reflection Archive sit;
Wherein child node enters the subdirectory chained list of father node by its child territory chain; Child node is upwards accessed the data field of its father node by its father field.
16. the access method of NFS as claimed in claim 12 is characterized in that, described by the file system index, the particular location of queried access target in internal memory comprises:
The path decomposing of access destination is become a plurality of Archive sits; From superior node, calculate cryptographic Hash according to the father node pointer of this node character string and this node, utilize this cryptographic Hash to find the pointer of this node from Hash table; With this node pointer of finding character string calculating cryptographic Hash with the next stage child node of this node, utilize this cryptographic Hash to find the pointer of the next stage child node of this node from Hash table again; So circulation is until all nodes are all found, and the pointer of the Archive sit that finds at last is the position of access destination in internal memory.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110373307.2A CN103139224B (en) | 2011-11-22 | 2011-11-22 | The access method of a kind of NFS and NFS |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110373307.2A CN103139224B (en) | 2011-11-22 | 2011-11-22 | The access method of a kind of NFS and NFS |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103139224A true CN103139224A (en) | 2013-06-05 |
| CN103139224B CN103139224B (en) | 2016-01-27 |
Family
ID=48498529
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110373307.2A Active CN103139224B (en) | 2011-11-22 | 2011-11-22 | The access method of a kind of NFS and NFS |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103139224B (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103546574A (en) * | 2013-10-30 | 2014-01-29 | 中国航空工业集团公司第六三一研究所 | Onboard embedded network file access control method based on static allocation list |
| CN103631914A (en) * | 2013-11-30 | 2014-03-12 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Offline browsing method and system of massive internet content |
| CN103944958A (en) * | 2014-03-14 | 2014-07-23 | 中国科学院计算技术研究所 | Wide area file system and implementation method |
| CN104182487A (en) * | 2014-08-11 | 2014-12-03 | 浪潮软件股份有限公司 | Unified storage method supporting various storage modes |
| CN104573128A (en) * | 2014-10-28 | 2015-04-29 | 北京国双科技有限公司 | Business data processing method, a business data processing device and server |
| CN104750715A (en) * | 2013-12-27 | 2015-07-01 | 中国移动通信集团公司 | Data elimination method, device and system in caching system and related server equipment |
| CN104935636A (en) * | 2015-04-29 | 2015-09-23 | 广州杰赛科技股份有限公司 | Network channel acceleration method and system |
| CN105718291A (en) * | 2016-01-25 | 2016-06-29 | 山东蓝创网络技术有限公司 | Multi-level cache acceleration method for mixing desktop applications |
| CN105975528A (en) * | 2016-04-29 | 2016-09-28 | 努比亚技术有限公司 | Method, device and system for synchronizing background configuration file |
| CN106133719A (en) * | 2014-03-31 | 2016-11-16 | 瓦欧尼斯系统有限公司 | The authorization portions of enterprise's index |
| CN106357769A (en) * | 2016-09-20 | 2017-01-25 | 百度在线网络技术（北京）有限公司 | Resource downloading method, device and network disk server |
| CN106452893A (en) * | 2016-10-25 | 2017-02-22 | 广东西奥物联网科技股份有限公司 | Method for loading configuration in startup of intermediate equipment |
| CN106469186A (en) * | 2016-08-29 | 2017-03-01 | 北京像素软件科技股份有限公司 | A kind of method and device of character string comparison |
| CN108021339A (en) * | 2017-11-03 | 2018-05-11 | 网宿科技股份有限公司 | A kind of method of disk read-write, equipment and computer-readable recording medium |
| CN108984128A (en) * | 2018-07-19 | 2018-12-11 | 郑州云海信息技术有限公司 | A kind of method for reading data and device |
| CN111001157A (en) * | 2019-11-29 | 2020-04-14 | 腾讯科技（深圳）有限公司 | Method and device for generating reference information, storage medium and electronic device |
| CN113656366A (en) * | 2021-08-03 | 2021-11-16 | 北京数码大方科技股份有限公司 | Data processing method and device for electronic warehouse |
| CN116541365A (en) * | 2023-07-06 | 2023-08-04 | 成都泛联智存科技有限公司 | File storage method, device, storage medium and client |
| CN117708179A (en) * | 2024-02-02 | 2024-03-15 | 成都深瑞同华科技有限公司 | Method, device, equipment and medium for caching measurement point data of electric power comprehensive monitoring system |
| CN117914867A (en) * | 2024-03-19 | 2024-04-19 | 苏州元脑智能科技有限公司 | Data buffering method, device, equipment and computer readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1370103A1 (en) * | 2002-06-07 | 2003-12-10 | Evolium S.A.S. | Connecting a terminal over a mobile radio access network or a local access network to the core network of a radio communications system |
| CN1997015A (en) * | 2006-11-24 | 2007-07-11 | 华为技术有限公司 | Cache application method and device, and file transfer system |
| CN101122885A (en) * | 2007-09-11 | 2008-02-13 | 腾讯科技（深圳）有限公司 | Data cache processing method, system and data cache device |
| CN101539918A (en) * | 2008-03-19 | 2009-09-23 | 天下互联（北京）科技有限公司 | Method and system for internet search |
| CN102014158A (en) * | 2010-11-29 | 2011-04-13 | 北京兴宇中科科技开发股份有限公司 | Cloud storage service client high-efficiency fine-granularity data caching system and method |
-
2011
- 2011-11-22 CN CN201110373307.2A patent/CN103139224B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1370103A1 (en) * | 2002-06-07 | 2003-12-10 | Evolium S.A.S. | Connecting a terminal over a mobile radio access network or a local access network to the core network of a radio communications system |
| CN1997015A (en) * | 2006-11-24 | 2007-07-11 | 华为技术有限公司 | Cache application method and device, and file transfer system |
| CN101122885A (en) * | 2007-09-11 | 2008-02-13 | 腾讯科技（深圳）有限公司 | Data cache processing method, system and data cache device |
| CN101539918A (en) * | 2008-03-19 | 2009-09-23 | 天下互联（北京）科技有限公司 | Method and system for internet search |
| CN102014158A (en) * | 2010-11-29 | 2011-04-13 | 北京兴宇中科科技开发股份有限公司 | Cloud storage service client high-efficiency fine-granularity data caching system and method |
Cited By (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103546574A (en) * | 2013-10-30 | 2014-01-29 | 中国航空工业集团公司第六三一研究所 | Onboard embedded network file access control method based on static allocation list |
| CN103631914A (en) * | 2013-11-30 | 2014-03-12 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Offline browsing method and system of massive internet content |
| CN104750715A (en) * | 2013-12-27 | 2015-07-01 | 中国移动通信集团公司 | Data elimination method, device and system in caching system and related server equipment |
| CN103944958A (en) * | 2014-03-14 | 2014-07-23 | 中国科学院计算技术研究所 | Wide area file system and implementation method |
| CN106133719A (en) * | 2014-03-31 | 2016-11-16 | 瓦欧尼斯系统有限公司 | The authorization portions of enterprise's index |
| CN104182487A (en) * | 2014-08-11 | 2014-12-03 | 浪潮软件股份有限公司 | Unified storage method supporting various storage modes |
| CN104573128A (en) * | 2014-10-28 | 2015-04-29 | 北京国双科技有限公司 | Business data processing method, a business data processing device and server |
| CN104573128B (en) * | 2014-10-28 | 2019-02-19 | 北京国双科技有限公司 | A kind of processing method of business datum, device and server |
| CN104935636A (en) * | 2015-04-29 | 2015-09-23 | 广州杰赛科技股份有限公司 | Network channel acceleration method and system |
| CN105718291A (en) * | 2016-01-25 | 2016-06-29 | 山东蓝创网络技术有限公司 | Multi-level cache acceleration method for mixing desktop applications |
| CN105975528A (en) * | 2016-04-29 | 2016-09-28 | 努比亚技术有限公司 | Method, device and system for synchronizing background configuration file |
| CN105975528B (en) * | 2016-04-29 | 2021-05-21 | 努比亚技术有限公司 | Synchronization method, device and system for background configuration file |
| CN106469186A (en) * | 2016-08-29 | 2017-03-01 | 北京像素软件科技股份有限公司 | A kind of method and device of character string comparison |
| CN106357769A (en) * | 2016-09-20 | 2017-01-25 | 百度在线网络技术（北京）有限公司 | Resource downloading method, device and network disk server |
| CN106452893A (en) * | 2016-10-25 | 2017-02-22 | 广东西奥物联网科技股份有限公司 | Method for loading configuration in startup of intermediate equipment |
| CN108021339A (en) * | 2017-11-03 | 2018-05-11 | 网宿科技股份有限公司 | A kind of method of disk read-write, equipment and computer-readable recording medium |
| CN108984128B (en) * | 2018-07-19 | 2022-03-08 | 郑州云海信息技术有限公司 | Data reading method and device |
| CN108984128A (en) * | 2018-07-19 | 2018-12-11 | 郑州云海信息技术有限公司 | A kind of method for reading data and device |
| CN111001157A (en) * | 2019-11-29 | 2020-04-14 | 腾讯科技（深圳）有限公司 | Method and device for generating reference information, storage medium and electronic device |
| CN111001157B (en) * | 2019-11-29 | 2021-09-28 | 腾讯科技（深圳）有限公司 | Method and device for generating reference information, storage medium and electronic device |
| CN113656366A (en) * | 2021-08-03 | 2021-11-16 | 北京数码大方科技股份有限公司 | Data processing method and device for electronic warehouse |
| CN113656366B (en) * | 2021-08-03 | 2024-05-03 | 北京数码大方科技股份有限公司 | Data processing method and device for electronic warehouse |
| CN116541365A (en) * | 2023-07-06 | 2023-08-04 | 成都泛联智存科技有限公司 | File storage method, device, storage medium and client |
| CN116541365B (en) * | 2023-07-06 | 2023-09-15 | 成都泛联智存科技有限公司 | File storage method, device, storage medium and client |
| CN117708179A (en) * | 2024-02-02 | 2024-03-15 | 成都深瑞同华科技有限公司 | Method, device, equipment and medium for caching measurement point data of electric power comprehensive monitoring system |
| CN117708179B (en) * | 2024-02-02 | 2024-05-03 | 成都深瑞同华科技有限公司 | Method, device, equipment and medium for caching measurement point data of electric power comprehensive monitoring system |
| CN117914867A (en) * | 2024-03-19 | 2024-04-19 | 苏州元脑智能科技有限公司 | Data buffering method, device, equipment and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103139224B (en) | 2016-01-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103139224B (en) | The access method of a kind of NFS and NFS | |
| US9672235B2 (en) | Method and system for dynamically partitioning very large database indices on write-once tables | |
| CN104133882A (en) | HDFS (Hadoop Distributed File System)-based old file processing method | |
| CN104932841B (en) | Economizing type data de-duplication method in a kind of cloud storage system | |
| US8126997B2 (en) | Hot data management method based on hit counter | |
| CN109299113B (en) | Range query method with storage-aware mixed index | |
| CN103345472B (en) | De-redundant file system based on limited binary tree Bloom filter and construction method thereof | |
| CN110162528A (en) | Magnanimity big data search method and system | |
| US20120317155A1 (en) | Hybrid Data Management System and Method for Managing Large, Varying Datasets | |
| US20060259525A1 (en) | Recovery method using extendible hashing-based cluster logs in shared-nothing spatial database cluster | |
| CN109726177A (en) | A kind of mass file subregion indexing means based on HBase | |
| CN103077199A (en) | File resource searching and locating method and device | |
| CN104408111A (en) | Method and device for deleting duplicate data | |
| CN106294772A (en) | The buffer memory management method of distributed memory columnar database | |
| CN101127879A (en) | Stream media VoD system for intelligent access data | |
| CN107944041B (en) | Storage structure optimization method of HDFS (Hadoop distributed File System) | |
| CN110399348A (en) | File deletes method, apparatus, system and computer readable storage medium again | |
| CN102866995A (en) | File access method for PPN (Peer-to-Peer Network), management method and distributed file system | |
| CN106354805A (en) | Optimization method and system for searching and caching distribution storage system NoSQL | |
| CN107391600A (en) | Method and apparatus for accessing time series data in internal memory | |
| CN107291915A (en) | A kind of small documents storage method, small documents read method and system | |
| US8612717B2 (en) | Storage system | |
| CN103049574A (en) | Key value system and key value method for implementation of dynamic duplicates of documents | |
| CN108319634A (en) | The directory access method and apparatus of distributed file system | |
| CN110008289B (en) | Relational database and power grid model data storage and retrieval method |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230920 Address after: 518057 Tencent Building, No. 1 High-tech Zone, Nanshan District, Shenzhen City, Guangdong Province, 35 floors Patentee after: TENCENT TECHNOLOGY (SHENZHEN) Co.,Ltd. Patentee after: TENCENT CLOUD COMPUTING (BEIJING) Co.,Ltd. Address before: 2, 518044, East 403 room, SEG science and Technology Park, Zhenxing Road, Shenzhen, Guangdong, Futian District Patentee before: TENCENT TECHNOLOGY (SHENZHEN) Co.,Ltd. |