CN110020272A - Caching method, device and computer storage medium - Google Patents
Caching method, device and computer storage medium Download PDFInfo
- Publication number
- CN110020272A CN110020272A CN201710689714.1A CN201710689714A CN110020272A CN 110020272 A CN110020272 A CN 110020272A CN 201710689714 A CN201710689714 A CN 201710689714A CN 110020272 A CN110020272 A CN 110020272A
- Authority
- CN
- China
- Prior art keywords
- character
- node
- url
- refreshed
- child node
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
- G06F16/9566—URL specific, e.g. using aliases, detecting broken or misspelled links
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/957—Browsing optimisation, e.g. caching or content distillation
- G06F16/9574—Browsing optimisation, e.g. caching or content distillation of access to content, e.g. by caching
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a kind of caching method, device and computer storage mediums, are related to field of computer technology.The URL of each cache file is stored in URL tree in the present invention, each node is stored with character in URL tree, the quantity of character is indefinite, the initial character of each node of same layer is different, and a complete URL can be formed from root node to the character of each leaf node or intermediate node or domain name, the cache information of cache file are then stored in the corresponding node of URL last character.The storage organization of URL tree is convenient for searching and management, when there is file refresh requests, can according to corresponding URL or domain name it is simple and quick find corresponding cache information, and then file is refreshed.In addition, the storage organization of URL tree can save memory space.
Description
Technical field
The present invention relates to field of computer technology, in particular to a kind of caching method, device and computer storage medium.
Background technique
Cache server is the Edge Server of CDN (Content Delivery Network, content distributing network).It is slow
It deposits content and is stored in local hard drive, to improve magnanimity cache contents concurrent access speed, it is distributed generally to provide multiple hard disks
Storage.The content caching of the corresponding page of one URL (Uniform Resource Locator, uniform resource locator) is one
A file, cache file storage catalogue and filename are all by encryption.The hashing algorithm that cache server is calculated by URL is caching
File is distributed in different hard disks, can be not necessarily stored under a hard disk URL under same domain name catalogue.
Refreshing for single URL after cache server receives refresh requests, can be calculated by algorithm identical when caching
The hard disk and path position of URL storage and encrypted filename, then delete this document.But for the whole of catalogue
Body refreshes, and cache server treatment effect is with regard to very complicated, because filename is encryption, traverses hard disk manner
It can not find and；Since the URL storage location under same catalogue is distributed, so the mesh cannot be found by the directory name
All URL storage locations under record；It is also ignorant which URL, which has been locally stored, under one catalogue, therefore according to URL mono- one
A method for calculating cache file position and then deleting is also impractical.The URL under same catalogue is refreshed at present
There are following methods:
Method one: not deleting the cache file of all URL under the catalogue when cache server receives catalogue refresh requests,
Only recording this catalogue has refresh requirements and refresh tasks moment, this request can be inquired when there is Internet user's request
URL whether under the catalogue for having refresh requests, and if current cache file renewal time before the refresh tasks moment, then go
Source station crawl what be new simultaneously updates caching.
Method two: when cache server receives catalogue refresh requests, current all cache file names import databases into
Row sequence, finds the All Files under catalogue to be refreshed, then deletes these files.
Summary of the invention
Inventors have found that not carried out very to the cache information of file after file is cached due in the above method
Good management, corresponding file can not be found rapidly when there is refresh tasks, lead to refresh URL or the corresponding file of catalogue
Method is complicated, low efficiency.
A technical problem to be solved by this invention is: proposing a kind of management method of file cache information, Neng Gouxun
File cache information is found in quick checking, is refreshed convenient for what is be simple and efficient to cache file.
According to one embodiment of present invention, a kind of caching method provided, comprising: by the corresponding unified money of cache file
Each field of the domain name part of source finger URL URL carries out inverted sequence arrangement, each in the field and each field in addition to domain name part
The sequence of a character is constant, the URL being inserted into；Since the root node of the first character for the URL being inserted into and URL tree
It is matched: if the initial character in the current character character not matched corresponding with present node is identical, by next word
Symbol is updated to current character, if the corresponding character of present node has all matched, the child node for choosing present node updates
For present node；If the initial character in the current character character not matched corresponding from present node is different, and with it is current
The different character of character match is the corresponding initial character of present node, then by all words after current character and current byte
Accord with the child node insertion of the father node as present node；If the current character character not matched corresponding with present node
In initial character it is different, and matching different characters not from current character is the corresponding initial character of present node, then extracts current
Character before matching different characters from current character in node replaces present node, extraction and current character as new node
It matches different character and character later is inserted into as the first child node of new node, by current character and current character
All characters later are inserted into as the second child node of new node, each item of each child node of present node to each leaf node
Path is inserted into after the first child node；The cache information of the corresponding cache file of the URL being inserted into is stored to the URL being inserted into
The corresponding node of last character in.
In one embodiment, this method further include: by each field of the domain name part of the corresponding URL of file to be refreshed into
Row inverted sequence arranges, and the sequence of each character is constant in the field and each field in addition to domain name part, obtains to be refreshed
URL；The character of URL to be refreshed character corresponding with node each in URL tree is matched, obtains URL's to be refreshed
The corresponding node of last character；According to the file stored in the corresponding node of the last character of URL to be refreshed
Cache information, the corresponding file found, and file is refreshed.
In one embodiment, this method further include: each field of the corresponding domain name of file to be refreshed is subjected to inverted sequence row
It arranges, the sequence of each character is constant in each field, obtains domain name to be refreshed；It will be in the character and URL tree of domain name to be refreshed
The corresponding character of each node is matched, and the corresponding node of last character of domain name to be refreshed is obtained；According to be brushed
The cache information of the file stored in each child node of the corresponding node of the last character of new domain name and the node,
Corresponding each file is found, and each file is refreshed.
In one embodiment, the character of URL to be refreshed character corresponding with node each in URL tree is matched
It include: to be matched since the first character of URL to be refreshed and the root node of URL tree: if URL to be refreshed is current
Initial character in the character character not matched corresponding with present node is identical, then next character is updated to current character,
If the corresponding character of present node has all matched, the child node for choosing present node is updated to present node, until will
The alphabet of URL to be refreshed has matched.
In one embodiment, by the character progress corresponding with node each in URL tree of the character of domain name to be refreshed
With including: to be matched since the first character of domain name to be refreshed and the root node of URL tree: if domain name to be refreshed
The current character character not matched corresponding with present node in initial character it is identical, then next character is updated to currently
Character, if the corresponding character of present node has all matched, the child node for choosing present node is updated to present node, directly
Extremely the alphabet of domain name to be refreshed has been matched.
In one embodiment, the initial value of the child node of the node, the son section of the node are stored in URL tree in each node
Point array of indexes, the initial value of child node are the minimum value of the corresponding initial character of each child node, in child node array of indexes
The address of each child node in memory is stored respectively；It includes: to utilize that the child node for choosing present node, which is updated to present node,
Current character subtracts the initial value of the corresponding child node of present node, obtains the child node index number class value of present node；According to
Child node index number class value finds corresponding child node array of indexes；It is searched according to the memory address in child node array of indexes
Present node is updated to corresponding child node, and by the child node.
In one embodiment, other characters except separator are removed in character uses ASCII
ASCII character indicates that separator midpoint and oblique line are respectively adopted different default values and indicate.
According to another embodiment of the invention, a kind of buffer storage provided, comprising: URL conversion module, for that will delay
Each field for depositing the domain name part of the corresponding uniform resource position mark URL of file carries out inverted sequence arrangement, in addition to domain name part
The sequence of each character is constant in field and each field, the URL being inserted into；
URL is inserted into module, for being matched since the first character for the URL being inserted into and the root node of URL tree:
If the initial character in the current character character not matched corresponding with present node is identical, next character is updated to work as
Preceding character, if the corresponding character of present node has all matched, the child node for choosing present node is updated to present node；
If the initial character in the current character character not matched corresponding from present node is different and different from current character matching
Character be the corresponding initial character of present node, then using all characters after current character and current byte as working as prosthomere
The child node insertion of the father node of point；If the initial character in the current character character not matched corresponding with present node is not
Together, and from current character matching different characters not is the corresponding initial character of present node, then extracts in present node and current
Character before the different character of character match replaces present node as new node, extracts and matches different words from current character
Symbol and character later are inserted into as the first child node of new node, by all words after current character and current character
It accords with and being inserted into as the second child node of new node, each paths of each child node to each leaf node of present node are inserted into first
After child node；Cache information memory module, for by the cache information of the corresponding cache file of the URL being inserted into store to
In the corresponding node of the last character of the URL of insertion.
In one embodiment, the device further include: URL refresh module, for by the domain of the corresponding URL of file to be refreshed
Each field of name part carries out inverted sequence arrangement, and the sequence of each character is not in the field and each field in addition to domain name part
Become, obtains URL to be refreshed, the character of URL to be refreshed character corresponding with node each in URL tree is matched, is obtained
To the corresponding node of last character of URL to be refreshed, according to the corresponding node of the last character of URL to be refreshed
The cache information of the file of middle storage, the corresponding file found, and file is refreshed.
In one embodiment, the device further include: catalogue refresh module, for by the corresponding domain name of file to be refreshed
Each field carries out inverted sequence arrangement, and the sequence of each character is constant in each field, domain name to be refreshed is obtained, by domain name to be refreshed
Character character corresponding with node each in URL tree matched, the last character for obtaining domain name to be refreshed is corresponding
Node, according to what is stored in each child node of the corresponding node of the last character of domain name to be refreshed and the node
The cache information of file finds corresponding each file, and refreshes to each file.
In one embodiment, URL refresh module is used for from the first character of URL to be refreshed and the root section of URL tree
Point starts to be matched: if the lead-in in the URL current character to be refreshed character not matched corresponding with present node
It accords with identical, then next character is updated to current character, if the corresponding character of present node all match, choose currently
The child node of node is updated to present node, until the alphabet of URL to be refreshed has been matched.
In one embodiment, catalogue refresh module is used for from the first character of domain name to be refreshed and the root of URL tree
Node starts to be matched: if in the current character of the domain name to be refreshed character not matched corresponding with present node
Initial character is identical, then next character is updated to current character, if the corresponding character of present node has all matched, chooses
The child node of present node is updated to present node, until the alphabet of domain name to be refreshed has been matched.
In one embodiment, the initial value of the child node of the node, the son section of the node are stored in URL tree in each node
Point array of indexes, the initial value of child node are the minimum value of the corresponding initial character of each child node, in child node array of indexes
The address of each child node in memory is stored respectively；URL insertion module is used to subtract present node using current character corresponding
Child node initial value, obtain the child node index number class value of present node, found pair according to child node index number class value
The child node array of indexes answered finds corresponding child node according to the memory address in child node array of indexes, and by the son
Node updates are present node.
In one embodiment, other characters except separator are removed in character uses ASCII
ASCII character indicates that separator midpoint and oblique line are respectively adopted different default values and indicate.
According to still another embodiment of the invention, a kind of buffer storage provided, comprising: memory；And it is coupled to and deposits
The processor of reservoir, processor are configured as executing based on the instruction being stored in memory devices such as any one aforementioned implementation
The caching method of example.
A kind of still another embodiment in accordance with the present invention, the computer readable storage medium provided, is stored thereon with calculating
Machine program, the program realize the caching method of any one aforementioned embodiment when being executed by processor.
The URL of each cache file is stored in URL tree in the present invention, each node is stored with character, word in URL tree
The quantity of symbol is indefinite, and the initial character of each node of same layer is different, and from root node to each leaf node or middle node
The character of point can form a complete URL or domain name, and the cache information of cache file is then stored in URL last character
In corresponding node.The storage organization of URL tree, can be according to corresponding when there is file refresh requests convenient for searching and managing
URL or domain name it is simple and quick find corresponding cache information, and then file is refreshed.In addition, the storage knot of URL tree
Structure can save memory space.
By referring to the drawings to the detailed description of exemplary embodiment of the present invention, other feature of the invention and its
Advantage will become apparent.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 shows the structural schematic diagram of the buffer storage of one embodiment of the present of invention.
Fig. 2 shows the structural schematic diagrams of the buffer storage of another embodiment of the invention.
Fig. 3 shows the flow diagram of the caching method of one embodiment of the present of invention.
Fig. 4 shows the structural schematic diagram of the URL tree of one embodiment of the present of invention.
Fig. 5 shows the flow diagram of the caching method of another embodiment of the invention.
Fig. 6 shows the structural schematic diagram of the buffer storage of one embodiment of the present of invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Below
Description only actually at least one exemplary embodiment be it is illustrative, never as to the present invention and its application or make
Any restrictions.Based on the embodiments of the present invention, those of ordinary skill in the art are not making creative work premise
Under every other embodiment obtained, shall fall within the protection scope of the present invention.
Aiming at the problem that file cache mode in the prior art leads to the complicated method of file refreshing, low efficiency, this is proposed
Scheme.
Buffer storage in the embodiment of the present invention can be realized respectively by various calculating equipment or computer system, tie below
Fig. 1 and Fig. 2 is closed to be described.
Fig. 1 is the structure chart of one embodiment of buffer storage of the present invention.As shown in Figure 1, the device 10 of the embodiment wraps
Include: memory 110 and the processor 120 for being coupled to the memory 110, processor 120 are configured as being based on being stored in storage
Instruction in device 110 executes the caching method in the present invention in any one embodiment.
Wherein, memory 110 is such as may include system storage, fixed non-volatile memory medium.System storage
Device is for example stored with operating system, application program, Boot loader (Boot Loader), database and other programs etc..
Fig. 2 is the structure chart of another embodiment of buffer storage of the present invention.As shown in Fig. 2, the device 20 of the embodiment
Include: memory 210 and processor 220, memory 210 and processor 220 respectively with memory 110 in Fig. 1 and place
It is similar to manage device 120.It can also include input/output interface 230, network interface 240, memory interface 250 etc..These interfaces 230,
It can for example be connected by bus 260 between 240,250 and memory 210 and processor 220.Wherein, input/output interface
It 230 is display, the input-output equipment such as mouse, keyboard, touch screen provide connecting interface.Network interface 240 is various networkings
Equipment provides connecting interface, such as may be coupled to database server or cloud storage server etc..Memory interface 250 is
The external storages such as SD card, USB flash disk provide connecting interface.
The present invention proposes a kind of caching method, is described below with reference to Fig. 3 and Fig. 4.
Fig. 3 is the flow chart of caching method one embodiment of the present invention.As shown in figure 3, the method for the embodiment includes:
Each field of the domain name part of the corresponding URL of cache file is carried out inverted sequence arrangement, removes domain name part by step S302
Except field and each field in each character sequence it is constant, the URL being inserted into.
For example, www.test.cn/2014/07/12, domain name part www.test.cn, each field of domain name carries out anti-
Sequence is arranged as cn.test.www, and the sequence of each character is constant in the field and each field in addition to domain name part, then converts
For cn.test.www/2014/07/12.
For the ease of storing and matching, URL can be converted into lint-long integer.Specifically, being removed except separator in character
Other characters using ASCII character (ASCII) indicate, difference is respectively adopted in separator midpoint and oblique line
Default value indicate.Such as point () indicates that oblique line (/) is indicated with 1 with 0.Separator does not use ASCII character to indicate convenient for area
Divide the point or oblique line for being not used in URL and indicating separator.When actual match, the corresponding numerical value of matching character.
For example, it is 63 6e 074 65 73 74 0 that cn.test.www/2014/07/12, which is converted to lint-long integer (16 system),
77 77 77 1 32 30 31 34 1 30 37 1 31 32.63 be the ASCII character of c, and so on.
Step S304 chooses the first character for the URL being inserted into as current character, and the root node for choosing URL tree is made
For present node.
The root node in URL tree is entrance under normal conditions, does not store specific character, and stores the memory bits of child node
It sets.
Step S306, judges whether the corresponding character of present node has all matched, if matching is complete, thens follow the steps
S308, it is no to then follow the steps S310.
Step S308, the child node for choosing present node are updated to present node.Step S306 is returned to restart to execute.
It as shown in Figure 4, is utilization URL www.test.cn, www.test.cn/news, www.test.cn/2016/
08, video.uv.cn/study.mp4, www.test.com, mp3.test.com/10.mp3, mp3.test.com/13.mp3
The URL tree of building.
Assuming that the URL being inserted into is cn.test.www/2014/07, the first character c, Cong Genjie of URL are matched first
Point entrance enters, and does not have character that the child node of root node is then updated to present node in root node.
Present node can be updated to according to the child node that the sequence of preset order for example from left to right chooses present node.
Step S310, judge initial character in the current character character not matched corresponding with present node whether phase
Together, if it is identical, S312 is thened follow the steps, otherwise, executes step S314.
The next character for the URL being inserted into is updated to current character by step S312.Step S306 is returned to restart to hold
Row.
As shown in Figure 4, it by the first character c of URL, is matched with the child node of root node, matching is identical, then more by n
It is newly current character.
Step S314, judgement match whether different characters are the corresponding initial character of present node from current character.If
It is to then follow the steps S316, otherwise, executes step S318.
Step S316, using all characters after the current character for the URL being inserted into and current byte as working as prosthomere
The child node insertion of the father node of point.
As shown in Figure 4, it is assumed that www.test.cn/2016/08 and www.test.cn/news are also not inserted into URL tree
In, the URL being inserted into is cn.test.www/2014/07, then the node of test.www/ is not present.When current character is t, with
The corresponding node of uv is matched, and the two is different, and t is different from initial character v, then using the alphabet after t and t as n.'s
Child node insertion.So far, in a URL insertion URL tree being inserted into.
Step S318 extracts the character before matching different characters from current character in present node and takes as new node
For present node, extracts and match different character with current character and character later is slotting as the first child node of new node
Enter, is inserted using current character in the URL being inserted into and all characters after current character as the second child node of new node
Enter, each paths of each child node to each leaf node of present node are inserted into after the first child node.
In the present invention, " first ", " second " in the first child node and the second child node are only used for distinguishing different son sections
Point does not play any other restriction effect.
Such as Fig. 4, it is assumed that the URL being inserted into is cn.test.www/2014/07, current character 4, present node 2016
Corresponding node is matched 4 with 6, and the two is different, and 6 be not 2016 initial character, then extract 201 structure of character before 6
New node is built, is inserted into using 6 and character later as 201 the first child node, character/07 by current character 4 and later is made
It is inserted into for 201 the second child node, each paths insertion first of each child node to each leaf node of present node 2016 is sub
After node 6.
It should be noted that if can also be torn open according to separator when current character and its character later are too long
Be allocated as multiple nodes, for example, when cn.test.www/2014/07 is as in first node insertion URL tree, due to it is no its
He is URL, then can be inserted into directly as the child node of root node, can also be split as multiple nodes in sequence, if cn. is one
A node, test. are a node, and www/ is a node, and 2014/ is a node, and 07 is a node, and according to URL
The set membership of each node of hierarchical arrangement from top to bottom.
Step S320 stores the cache information of the corresponding cache file of the URL being inserted into last to the URL being inserted into
In the corresponding node of one character.
If the URL being inserted into has found existing identical URL in URL tree by above-mentioned matching process, only need to delay
The cache information for depositing file is stored into the corresponding node of last character for the URL being inserted into.
The corresponding one section of memory address of one node of URL tree, is stored with the cache information of character and cache file, caches
Information for example, the file name of buffer address and encryption in disk.File name is by encryption, safety coefficient
It is high, it is not easy to be tampered.
The URL of each cache file is stored in URL tree by the method for above-described embodiment, each node storage in URL tree
There is character, the quantity of character is indefinite, and the initial character of each node of same layer is different, and from root node to each leaf node
Or the character of intermediate node can form a complete URL or domain name, it is last that the cache information of cache file is then stored in URL
In the corresponding node of one character.The storage organization of URL tree is convenient for searching and managing, when there is file refresh requests, Ke Yigen
According to corresponding URL or domain name it is simple and quick find corresponding cache information, and then file is refreshed.In addition, URL tree
Storage organization can save memory space.
The present invention also provides the methods for carrying out file refreshing based on above-mentioned URL, are described below with reference to Fig. 5.
Fig. 5 is the flow chart of another embodiment of caching method of the present invention.As shown in figure 5, may be used also after step S320
To include:
Each field of the domain name part of the corresponding URL of file to be refreshed is carried out inverted sequence arrangement, removes domain name portion by step S502
The sequence of each character is constant in/outer field and each field, obtains URL to be refreshed.
The step can refer to the method in step S302.
The character of URL to be refreshed character corresponding with node each in URL tree is matched, is obtained by step S504
The corresponding node of the last character of URL to be refreshed.
Specific matching process is for example are as follows:
(1) using the first character of URL to be refreshed as current character, the root node for choosing URL tree, which is used as, works as prosthomere
Point.
(2) judge that the corresponding character of present node has all matched, if matching is complete, thens follow the steps (3), otherwise execute
Step (4).
(3) child node for choosing present node is updated to present node, returns to step (2) and restarts to execute.
(4) judge whether the initial character in the current character character not matched corresponding with present node is identical, if
It is identical, then follow the steps (5).
(5) judging URL to be refreshed, whether there are also not matched characters, restart to hold if there is then returning to step (2)
Row, otherwise, matching terminates.
Step S506 believes according to the caching of the file stored in the corresponding node of the last character of URL to be refreshed
Breath, the corresponding file found, and file is refreshed.
Refresh operation, which can be, deletes corresponding file.According to the buffer address in disk in cache information
Corresponding file can be found.
Can also include: after step S320
Each field of the corresponding domain name of file to be refreshed is carried out inverted sequence arrangement, each character in each field by step S508
Sequence it is constant, obtain domain name to be refreshed.
File under catalogue is refreshed, the corresponding file of URL each under same domain name is refreshed.The step
It can refer to the method in step S302.
The character of domain name to be refreshed character corresponding with node each in URL tree is matched, is obtained by step S510
The corresponding node of the last character of domain name to be refreshed.
Specific matching process is for example are as follows:
(1) using the first character of domain name to be refreshed as current character, the root node for choosing URL tree, which is used as, works as prosthomere
Point.
(2) judge that the corresponding character of present node has all matched, if matching is complete, thens follow the steps (3), otherwise execute
Step (4).
(3) child node for choosing present node is updated to present node, returns to step (2) and restarts to execute.
(4) judge whether the initial character in the current character character not matched corresponding with present node is identical, if
It is identical, then follow the steps (5).
(5) judging domain name to be refreshed, whether there are also not matched characters, restart to hold if there is then returning to step (2)
Row, otherwise, matching terminates.
Step S512, according to the corresponding node of the last character of domain name to be refreshed and each height section of the node
The cache information of the file stored in point finds corresponding each file, and refreshes to each file.
As shown in figure 4, it is corresponding to find the domain name last character if domain name to be refreshed is cn.test.www
Node be test.www/, then according to the text stored in test.www/ and its each child node, that is, news, 201,4/07,6/08
The cache information of part finds corresponding each file, and refreshes to each file.
The method of above-described embodiment is carried out by each node that file to be refreshed is corresponded to URL and domain name and URL tree
Matching can quickly find the cache information of file to be refreshed, and then quickly refresh to file.
It, can be to this after URL to be matched or domain name have matched one layer of node in URL tree in above-mentioned each embodiment
The child node of node layer continues to match, can sequence for example from left to right in a certain order successively match each height
Node, but possible speed is slower.The present invention is on the basis of the URL of above-described embodiment it is further proposed that a kind of storage of node
Mode can accelerate matching speed, be described below with reference to Fig. 4.
The corresponding one section of memory address of a node in URL tree, wherein storing the attribute of this node.Nodal community can wrap
It includes: the corresponding character of this node key, i.e. this node such as the numerical value of the conversion regime conversion in step S302；The starting of child node
Value is the minimum value of the corresponding initial character of each child node；Child node array of indexes is stored respectively in child node array of indexes
The address of each child node in memory；The corresponding cache information of this node.Leaf node has corresponding cache information certainly, non-
Leaf node some also has corresponding cache information.Cache information includes the position of cache file name, cache file in disk.
In the corresponding child node array of indexes of child node=first byte-child node initial value of child node key.Due to each
The key first byte of child node is not necessarily continuous, thus in child node array of indexes promising sky index value.
Such as in Fig. 4, the child node of 201 node is 4 and 6, and 201 nodal community includes:
This node key i.e. 201 ASCII character, the initial value of child node i.e. 4 ASCII character, child node array of indexes, that is, rope
Argument group [0]: 4/ storage location, array of indexes [1]: null, array of indexes [2]: 6/ storage location.The institute of child node 6/
Array of indexes, that is, 6-4=2.
It includes: benefit that the child node for choosing present node in further above-described embodiment in step S308, which is updated to present node,
The initial value that the corresponding child node of present node is subtracted with current character obtains the child node index number class value of present node；Root
Corresponding child node array of indexes is found according to child node index number class value；It is looked into according to the memory address in child node array of indexes
Corresponding child node is found, and the child node is updated to present node.
Similarly, (3) step and step S510 (3) step in step S504, can also be in the same way by child node
It is updated to present node.
It is assumed that cn.test.www/2015/08 is ingress to be inserted, current character 5, present node is
201 is matched complete, needs to update present node, then subtracts child node initial value 4 with 5 and obtain 1 as index number class value, find rope
Argument group 1 discovery be stored as sky, then match it is unsuccessful, and with 5 match unsuccessful character be the node initial character, then by 5 works
It is inserted into for 201 child node, it will be in 5 memory address deposit array of indexes 1.
Further, the embodiment in above-mentioned Fig. 3 can will be in node in being inserted into URL tree when originally not no node
Deposit address store the node that is inserted into corresponding array of indexes initial character subtract insertion node father node child node
Initial value obtains corresponding index number class value.If the initial character of the node of insertion is less than the initial value of child node, need new
The initial value for indexing array, and updating child node is the value of the initial character of the node of insertion.
The method of above-described embodiment can accelerate the matching speed of URL or domain name in URL tree, further increase efficiency,
To according to the refreshing of the realization file of simple and effective.
The present invention also provides a kind of buffer storages, are described below with reference to Fig. 6.
Fig. 6 is the structure chart of buffer storage one embodiment of the present invention.As shown in fig. 6, the device 60 includes:
URL conversion module 602, for by each word of the domain name part of the corresponding uniform resource position mark URL of cache file
Duan Jinhang inverted sequence arranges, and the sequence of each character is constant in the field and each field in addition to domain name part, is inserted into
URL.
URL is inserted into module 604, for the progress since the first character for the URL being inserted into and the root node of URL tree
Match:
If the initial character in the current character character not matched corresponding with present node is identical, by next character
It is updated to current character, if the corresponding character of present node has all matched, the child node for choosing present node is updated to
Present node；
If the initial character in the current character character not matched corresponding from present node is different, and and current character
Matching different characters is the corresponding initial character of present node, then makees all characters after current character and current byte
For the child node insertion of the father node of present node；
If the initial character in the current character character not matched corresponding from present node is different, and and current character
Matching different characters not is the corresponding initial character of present node, then extracts and match different words in present node from current character
Character before symbol replaces present node as new node, extracts and matches different character and character later from current character
The first child node as new node is inserted into, using all characters after current character and current character as the of new node
Each paths of the insertion of two child nodes, each child node to each leaf node of present node are inserted into after the first child node.
In one embodiment, the initial value of the child node of the node, the son section of the node are stored in URL tree in each node
Point array of indexes, the initial value of child node are the minimum value of the corresponding initial character of each child node, in child node array of indexes
The address of each child node in memory is stored respectively.
URL insertion module 604 is used to subtract the initial value of the corresponding child node of present node using current character, is worked as
The child node index number class value of front nodal point finds corresponding child node array of indexes according to child node index number class value, according to
Memory address in child node array of indexes finds corresponding child node, and the child node is updated to present node.
Cache information memory module 606, for by the cache information of the corresponding cache file of the URL being inserted into store to
In the corresponding node of the last character of the URL of insertion.
In one embodiment, buffer storage 60 can also include:
URL refresh module 608, for each field of the domain name part of the corresponding URL of file to be refreshed to be carried out inverted sequence row
It arranges, the sequence of each character is constant in the field and each field in addition to domain name part, obtains URL to be refreshed, will be to be brushed
The character of new URL character corresponding with node each in URL tree is matched, and the last character of URL to be refreshed is obtained
Corresponding node is accorded with, according to the cache information of the file stored in the corresponding node of the last character of URL to be refreshed, is looked into
The corresponding file found, and file is refreshed.
URL refresh module 608 is used for the progress since the first character of URL to be refreshed and the root node of URL tree
Match: if the initial character in the URL current character to be refreshed character not matched corresponding with present node is identical, will under
One character is updated to current character, if the corresponding character of present node has all matched, chooses the child node of present node
It is updated to present node, until the alphabet of URL to be refreshed has been matched.
In one embodiment, buffer storage 60 can also include:
Catalogue refresh module 610, for each field of the corresponding domain name of file to be refreshed to be carried out inverted sequence arrangement, each field
The sequence of interior each character is constant, obtains domain name to be refreshed, by each node pair in the character and URL tree of domain name to be refreshed
The character answered is matched, and the corresponding node of last character of domain name to be refreshed is obtained, according to domain name to be refreshed
The cache information of the file stored in each child node of the corresponding node of last character and the node, finds correspondence
Each file, and each file is refreshed.
Catalogue refresh module 610 since the first character of domain name to be refreshed and the root node of URL tree for carrying out
Matching: if the initial character in the current character of the domain name to be refreshed character not matched corresponding with present node is identical,
Next character is then updated to current character, if the corresponding character of present node has all matched, chooses present node
Child node is updated to present node, until the alphabet of domain name to be refreshed has been matched.
Other characters except separator are removed in above-mentioned each embodiment, in character uses ASCII American Standard Code for Information Interchange generation
Code ASCII character indicates that separator midpoint and oblique line are respectively adopted different default values and indicate.
The present invention also provides a kind of computer readable storage mediums, are stored thereon with computer program, and the program is processed
The step of device realizes the method for any one aforementioned embodiment when executing.
Those skilled in the art should be understood that the embodiment of the present invention can provide as method, system or computer journey
Sequence product.Therefore, complete hardware embodiment, complete software embodiment or combining software and hardware aspects can be used in the present invention
The form of embodiment.Moreover, it wherein includes the calculating of computer usable program code that the present invention, which can be used in one or more,
Machine can use the meter implemented in non-transient storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.)
The form of calculation machine program product.
The present invention be referring to according to the method for the embodiment of the present invention, the process of equipment (system) and computer program product
Figure and/or block diagram describe.It is interpreted as to be realized by computer program instructions each in flowchart and/or the block diagram
The combination of process and/or box in process and/or box and flowchart and/or the block diagram.It can provide these computer journeys
Sequence instruct to general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices processor with
A machine is generated, so that the instruction generation executed by computer or the processor of other programmable data processing devices is used for
Realize the dress for the function of specifying in one or more flows of the flowchart and/or one or more blocks of the block diagram
It sets.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
The foregoing is merely presently preferred embodiments of the present invention, is not intended to limit the invention, it is all in spirit of the invention and
Within principle, any modification, equivalent replacement, improvement and so on be should all be included in the protection scope of the present invention.
Claims (16)
1. a kind of caching method characterized by comprising
Each field of the domain name part of the corresponding uniform resource position mark URL of cache file is subjected to inverted sequence arrangement, removes domain name portion
The sequence of each character is constant in/outer field and each field, the URL being inserted into；
It is matched since the first character of the URL being inserted into and the root node of URL tree:
If the initial character in the current character character not matched corresponding with present node is identical, next character is updated
For current character, if the corresponding character of the present node has all matched, the child node for choosing present node is updated to
Present node；
If the initial character in the current character character not matched corresponding from the present node is different, and with it is current
The different character of character match is the corresponding initial character of the present node, then by the current character and the current byte
All characters later are inserted into as the child node of the father node of the present node；
If the initial character in the current character character not matched corresponding from the present node is different, and with it is current
The different character of character match is not the corresponding initial character of the present node, then extract in the present node with current character
Character before matching different characters replaces the present node as new node, extracts and matches different words from current character
Symbol and character later are inserted into as the first child node of the new node, by the current character and the current character
All characters later are inserted into as the second child node of the new node, each child node of the present node to each leaf section
Each paths of point are inserted into after first child node；
The cache information of the corresponding cache file of the URL being inserted into is stored to the last one of the URL being inserted into
In the corresponding node of character.
2. the method according to claim 1, wherein further include:
Each field of the domain name part of the corresponding URL of file to be refreshed is subjected to inverted sequence arrangement, the field in addition to domain name part
And in each field each character sequence it is constant, obtain URL to be refreshed；
The character of the URL to be refreshed character corresponding with node each in the URL tree is matched, obtain it is described to
The corresponding node of the last character of the URL of refreshing；
According to the cache information of the file stored in the corresponding node of last character of the URL to be refreshed, find
Corresponding file, and the file is refreshed.
3. described in any item methods according to claim 1, which is characterized in that further include:
Each field of the corresponding domain name of file to be refreshed is subjected to inverted sequence arrangement, the sequence of each character is constant in each field, obtains
To domain name to be refreshed；
The character of the domain name to be refreshed character corresponding with node each in the URL tree is matched, is obtained described
The corresponding node of the last character of domain name to be refreshed；
According to being stored in each child node of the corresponding node of last character of the domain name to be refreshed and the node
File cache information, find corresponding each file, and refresh to each file.
4. according to the method described in claim 2, it is characterized in that,
The character by URL to be refreshed character corresponding with node each in the URL tree carries out matching
It is matched since the first character of the URL to be refreshed and the root node of URL tree:
If the initial character in the URL current character to be refreshed character not matched corresponding with present node is identical,
Next character is then updated to current character, if the corresponding character of the present node has all matched, prosthomere is worked as in selection
The child node of point is updated to present node, until the alphabet of the URL to be refreshed has been matched.
5. according to the method described in claim 3, it is characterized in that,
The character by domain name to be refreshed character corresponding with node each in the URL tree carries out matching
It is matched since the first character of the domain name to be refreshed and the root node of URL tree:
If the initial character phase in the current character of the domain name to be refreshed character not matched corresponding with present node
Together, then next character is updated to current character, if the corresponding character of the present node has all matched, chosen current
The child node of node is updated to present node, until the alphabet of the domain name to be refreshed has been matched.
6. the method according to claim 1, wherein
The initial value of the child node of the node is stored in the URL tree in each node, the child node array of indexes of the node is described
The initial value of child node is the minimum value of the corresponding initial character of each child node, is stored respectively in the child node array of indexes
The address of each child node in memory；
The child node for choosing present node is updated to present node and includes:
The initial value that the corresponding child node of the present node is subtracted using the current character obtains the son of the present node
Node index number class value；
Corresponding child node array of indexes is found according to the child node index number class value；
Corresponding child node is found according to the memory address in the child node array of indexes, and the child node is updated to work as
Front nodal point.
7. method according to claim 1-6, which is characterized in that
Other characters except separator are removed in the character to be indicated using ASCII ASCII character, institute
It states separator midpoint and oblique line is respectively adopted different default values and indicates.
8. a kind of buffer storage characterized by comprising
URL conversion module, it is anti-for carrying out each field of the domain name part of the corresponding uniform resource position mark URL of cache file
Sequence arranges, and the sequence of each character is constant in the field and each field in addition to domain name part, the URL being inserted into；
URL is inserted into module, for being matched since the first character of the URL being inserted into and the root node of URL tree:
If the initial character in the current character character not matched corresponding with present node is identical, next character is updated
For current character, if the corresponding character of the present node has all matched, the child node for choosing present node is updated to
Present node；
If the initial character in the current character character not matched corresponding from the present node is different, and with it is current
The different character of character match is the corresponding initial character of the present node, then by the current character and the current byte
All characters later are inserted into as the child node of the father node of the present node；
If the initial character in the current character character not matched corresponding from the present node is different, and with it is current
The different character of character match is not the corresponding initial character of the present node, then extract in the present node with current character
Character before matching different characters replaces the present node as new node, extracts and matches different words from current character
Symbol and character later are inserted into as the first child node of the new node, by the current character and the current character
All characters later are inserted into as the second child node of the new node, each child node of the present node to each leaf section
Each paths of point are inserted into after first child node；
Cache information memory module, for storing the cache information of the corresponding cache file of the URL being inserted into described
In the corresponding node of the last character for the URL being inserted into.
9. device according to claim 8, which is characterized in that further include:
URL refresh module removes domain for each field of the domain name part of the corresponding URL of file to be refreshed to be carried out inverted sequence arrangement
The sequence of each character is constant in field and each field except name part, obtains URL to be refreshed, will be described to be refreshed
The character of URL character corresponding with node each in the URL tree is matched, and last of the URL to be refreshed is obtained
The corresponding node of a character, according to the slow of the file stored in the corresponding node of last character of the URL to be refreshed
Information is deposited, the corresponding file found, and the file is refreshed.
10. device according to claim 8, which is characterized in that further include:
Catalogue refresh module, it is each in each field for each field of the corresponding domain name of file to be refreshed to be carried out inverted sequence arrangement
The sequence of character is constant, obtains domain name to be refreshed, by each node in the character of the domain name to be refreshed and the URL tree
Corresponding character is matched, and the corresponding node of last character of the domain name to be refreshed is obtained, according to described to be brushed
The cache information of the file stored in each child node of the corresponding node of the last character of new domain name and the node,
Corresponding each file is found, and each file is refreshed.
11. device according to claim 9, which is characterized in that
The URL refresh module is used for the progress since the first character of the URL to be refreshed and the root node of URL tree
Match: if the initial character in the URL current character to be refreshed character not matched corresponding with present node is identical,
Next character is updated to current character, if the corresponding character of the present node has all matched, chooses present node
Child node be updated to present node, until the alphabet of the URL to be refreshed has been matched.
12. device according to claim 10, which is characterized in that
The catalogue refresh module since the first character of the domain name to be refreshed and the root node of URL tree for carrying out
Matching: if the initial character phase in the current character of the domain name to be refreshed character not matched corresponding with present node
Together, then next character is updated to current character, if the corresponding character of the present node has all matched, chosen current
The child node of node is updated to present node, until the alphabet of the domain name to be refreshed has been matched.
13. device according to claim 8, which is characterized in that
The initial value of the child node of the node is stored in the URL tree in each node, the child node array of indexes of the node is described
The initial value of child node is the minimum value of the corresponding initial character of each child node, is stored respectively in the child node array of indexes
The address of each child node in memory；
The URL insertion module is used to subtract the initial value of the corresponding child node of the present node using the current character,
The child node index number class value of the present node is obtained, corresponding child node is found according to the child node index number class value
Array of indexes finds corresponding child node according to the memory address in the child node array of indexes, and more by the child node
It is newly present node.
14. according to the described in any item devices of claim 8-13, which is characterized in that
Other characters except separator are removed in the character to be indicated using ASCII ASCII character, institute
It states separator midpoint and oblique line is respectively adopted different default values and indicates.
15. a kind of buffer storage characterized by comprising
Memory；And
It is coupled to the processor of the memory, the processor is configured to based on the finger being stored in the memory devices
It enables, executes such as the described in any item caching methods of claim 1-7.
16. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the program is by processor
The step of any one of claim 1-7 the method is realized when execution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710689714.1A CN110020272B (en) | 2017-08-14 | 2017-08-14 | Caching method and device and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710689714.1A CN110020272B (en) | 2017-08-14 | 2017-08-14 | Caching method and device and computer storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110020272A true CN110020272A (en) | 2019-07-16 |
| CN110020272B CN110020272B (en) | 2021-11-05 |
Family
ID=67186064
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710689714.1A Active CN110020272B (en) | 2017-08-14 | 2017-08-14 | Caching method and device and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110020272B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112861031A (en) * | 2019-11-27 | 2021-05-28 | 北京金山云网络技术有限公司 | URL (Uniform resource locator) refreshing method, device and equipment in CDN (content delivery network) and CDN node |
| CN112861030A (en) * | 2019-11-27 | 2021-05-28 | 北京金山云网络技术有限公司 | CDN refreshing method and device, cache server and storage medium |
| CN113271359A (en) * | 2021-05-19 | 2021-08-17 | 北京百度网讯科技有限公司 | Method and device for refreshing cache data, electronic equipment and storage medium |
| CN113836138A (en) * | 2021-09-07 | 2021-12-24 | 海南太美航空股份有限公司 | Flight data caching method and system |
Citations (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101431539A (en) * | 2008-12-11 | 2009-05-13 | 华为技术有限公司 | Domain name resolution method, system and apparatus |
| CN101917494A (en) * | 2010-09-09 | 2010-12-15 | 刁永平 | Realization of autonomous Internet |
| CN102663022A (en) * | 2012-03-21 | 2012-09-12 | 浙江盘石信息技术有限公司 | Classification recognition method based on URL (uniform resource locator) |
| CN102819586A (en) * | 2012-07-31 | 2012-12-12 | 北京网康科技有限公司 | Uniform Resource Locator (URL) classifying method and equipment based on cache |
| CN103077208A (en) * | 2012-12-28 | 2013-05-01 | 华为技术有限公司 | Uniform resource locator matching processing method and device |
| CN103765419A (en) * | 2011-08-29 | 2014-04-30 | 谷歌公司 | System and method for providing offline access in hosted document service |
| CN103870495A (en) * | 2012-12-14 | 2014-06-18 | 阿里巴巴集团控股有限公司 | Method and device for extracting information from website |
| CN103927325A (en) * | 2014-03-13 | 2014-07-16 | 中国联合网络通信集团有限公司 | URL (uniform resource locator) classifying method and device |
| CN104219327A (en) * | 2014-09-27 | 2014-12-17 | 上海瀚之友信息技术服务有限公司 | Distributed cache system |
| WO2015036817A1 (en) * | 2013-09-15 | 2015-03-19 | Yogesh Chunilal Rathod | Structured updated status, requests, user data & programming based presenting & accessing of connections |
| CN104767835A (en) * | 2014-01-03 | 2015-07-08 | 携程计算机技术（上海）有限公司 | System and method for configuring URL (Uniform Resource Locator) address |
| CN105868251A (en) * | 2015-12-22 | 2016-08-17 | 乐视云计算有限公司 | Cache data updating method and device |
| CN105934930A (en) * | 2014-01-31 | 2016-09-07 | 瑞典爱立信有限公司 | Method and apparatus for obtaining content from a media server |
| CN105930405A (en) * | 2013-07-12 | 2016-09-07 | 北京奇虎科技有限公司 | Method and apparatus suitable for caching data in URL data capture |
| US20160357865A1 (en) * | 2010-06-30 | 2016-12-08 | Cbs Interactive Inc. | System and method for locating data feeds |
| US9600591B2 (en) * | 2012-09-25 | 2017-03-21 | Samsung Electronics Co., Ltd. | Method and apparatus for URL address search in URL list |
| WO2017080459A1 (en) * | 2015-11-10 | 2017-05-18 | 中兴通讯股份有限公司 | Method, device and system for caching and providing service contents and storage medium |
| CN107026758A (en) * | 2017-04-14 | 2017-08-08 | 深信服科技股份有限公司 | For the information processing method of CDN processing business and updates, information processing system and server |
| US9754046B2 (en) * | 2012-11-09 | 2017-09-05 | Microsoft Technology Licensing, Llc | Taxonomy driven commerce site |
-
2017
- 2017-08-14 CN CN201710689714.1A patent/CN110020272B/en active Active
Patent Citations (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101431539A (en) * | 2008-12-11 | 2009-05-13 | 华为技术有限公司 | Domain name resolution method, system and apparatus |
| US20160357865A1 (en) * | 2010-06-30 | 2016-12-08 | Cbs Interactive Inc. | System and method for locating data feeds |
| CN101917494A (en) * | 2010-09-09 | 2010-12-15 | 刁永平 | Realization of autonomous Internet |
| CN103765419A (en) * | 2011-08-29 | 2014-04-30 | 谷歌公司 | System and method for providing offline access in hosted document service |
| CN102663022A (en) * | 2012-03-21 | 2012-09-12 | 浙江盘石信息技术有限公司 | Classification recognition method based on URL (uniform resource locator) |
| CN102819586A (en) * | 2012-07-31 | 2012-12-12 | 北京网康科技有限公司 | Uniform Resource Locator (URL) classifying method and equipment based on cache |
| CN102819586B (en) * | 2012-07-31 | 2015-10-07 | 北京网康科技有限公司 | A kind of URL sorting technique based on high-speed cache and equipment |
| US9600591B2 (en) * | 2012-09-25 | 2017-03-21 | Samsung Electronics Co., Ltd. | Method and apparatus for URL address search in URL list |
| US9754046B2 (en) * | 2012-11-09 | 2017-09-05 | Microsoft Technology Licensing, Llc | Taxonomy driven commerce site |
| CN103870495A (en) * | 2012-12-14 | 2014-06-18 | 阿里巴巴集团控股有限公司 | Method and device for extracting information from website |
| CN103077208A (en) * | 2012-12-28 | 2013-05-01 | 华为技术有限公司 | Uniform resource locator matching processing method and device |
| CN105930405A (en) * | 2013-07-12 | 2016-09-07 | 北京奇虎科技有限公司 | Method and apparatus suitable for caching data in URL data capture |
| WO2015036817A1 (en) * | 2013-09-15 | 2015-03-19 | Yogesh Chunilal Rathod | Structured updated status, requests, user data & programming based presenting & accessing of connections |
| CN104767835A (en) * | 2014-01-03 | 2015-07-08 | 携程计算机技术（上海）有限公司 | System and method for configuring URL (Uniform Resource Locator) address |
| CN105934930A (en) * | 2014-01-31 | 2016-09-07 | 瑞典爱立信有限公司 | Method and apparatus for obtaining content from a media server |
| CN103927325A (en) * | 2014-03-13 | 2014-07-16 | 中国联合网络通信集团有限公司 | URL (uniform resource locator) classifying method and device |
| CN104219327A (en) * | 2014-09-27 | 2014-12-17 | 上海瀚之友信息技术服务有限公司 | Distributed cache system |
| WO2017080459A1 (en) * | 2015-11-10 | 2017-05-18 | 中兴通讯股份有限公司 | Method, device and system for caching and providing service contents and storage medium |
| CN105868251A (en) * | 2015-12-22 | 2016-08-17 | 乐视云计算有限公司 | Cache data updating method and device |
| CN107026758A (en) * | 2017-04-14 | 2017-08-08 | 深信服科技股份有限公司 | For the information processing method of CDN processing business and updates, information processing system and server |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112861031A (en) * | 2019-11-27 | 2021-05-28 | 北京金山云网络技术有限公司 | URL (Uniform resource locator) refreshing method, device and equipment in CDN (content delivery network) and CDN node |
| CN112861030A (en) * | 2019-11-27 | 2021-05-28 | 北京金山云网络技术有限公司 | CDN refreshing method and device, cache server and storage medium |
| WO2021104100A1 (en) * | 2019-11-27 | 2021-06-03 | 北京金山云网络技术有限公司 | Url refreshing method, apparatus and device in cdn, and cdn node |
| JP2023500418A (en) * | 2019-11-27 | 2023-01-05 | ベイジン キングソフト クラウド ネットワーク テクノロジー カンパニー リミテッド | URL refresh method, device, equipment and CDN node in CDN |
| US20230022141A1 (en) * | 2019-11-27 | 2023-01-26 | Beijing Kingsoft Cloud Network Technology Co., Ltd | Url refreshing method, apparatus and device in cdn, and cdn node |
| JP7392168B2 (en) | 2019-11-27 | 2023-12-05 | ベイジン キングソフト クラウド ネットワーク テクノロジー カンパニー リミテッド | URL refresh method, device, equipment and CDN node in CDN |
| CN112861031B (en) * | 2019-11-27 | 2024-04-02 | 北京金山云网络技术有限公司 | URL refreshing method, device and equipment in CDN and CDN node |
| CN112861030B (en) * | 2019-11-27 | 2024-04-05 | 北京金山云网络技术有限公司 | CDN refreshing method and device, cache server and storage medium |
| CN113271359A (en) * | 2021-05-19 | 2021-08-17 | 北京百度网讯科技有限公司 | Method and device for refreshing cache data, electronic equipment and storage medium |
| CN113836138A (en) * | 2021-09-07 | 2021-12-24 | 海南太美航空股份有限公司 | Flight data caching method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110020272B (en) | 2021-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109254733B (en) | Method, device and system for storing data | |
| CN107391653B (en) | Distributed NewSQL database system and picture data storage method | |
| CN106980669B (en) | A kind of storage of data, acquisition methods and device | |
| US9830324B2 (en) | Content based organization of file systems | |
| CN107423422B (en) | Spatial data distributed storage and search method and system based on grid | |
| CN109376156B (en) | Method for reading hybrid index with storage awareness | |
| CN104850572A (en) | HBase non-primary key index building and inquiring method and system | |
| CN107045530A (en) | A kind of method that object storage system is embodied as to local file system | |
| US20160350302A1 (en) | Dynamically splitting a range of a node in a distributed hash table | |
| CN110020272A (en) | Caching method, device and computer storage medium | |
| CN103577123A (en) | Small file optimization storage method based on HDFS | |
| CN109086133B (en) | The method and system of data is safeguarded in memory | |
| CN110347651A (en) | Method of data synchronization, device, equipment and storage medium based on cloud storage | |
| CN105677904B (en) | Small documents storage method and device based on distributed file system | |
| CN100424699C (en) | Attribute extensible object file system | |
| CN113721862B (en) | Data processing method and device | |
| US11392314B2 (en) | Sequentially writing metadata into a solid state disk by redirect-on-write | |
| CN104423982A (en) | Request processing method and device | |
| CN106844089A (en) | A kind of method and apparatus for recovering tree data storage | |
| CN101763415A (en) | Method and device for generating B tree index of database | |
| Chrysafis et al. | Foundationdb record layer: A multi-tenant structured datastore | |
| CN103942301A (en) | Distributed file system oriented to access and application of multiple data types | |
| CN110352410A (en) | Track the access module and preextraction index node of index node | |
| CN110008030A (en) | A kind of method of metadata access, system and equipment | |
| CN109299059A (en) | File storage, search method, device, storage medium and server |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220127 Address after: 100007 room 205-32, floor 2, building 2, No. 1 and No. 3, qinglonghutong a, Dongcheng District, Beijing Patentee after: Tianyiyun Technology Co.,Ltd. Address before: No.31, Financial Street, Xicheng District, Beijing, 100033 Patentee before: CHINA TELECOM Corp.,Ltd. |