CN113949750B - Handle identification analysis caching method, query method and handle identification analysis system - Google Patents
Handle identification analysis caching method, query method and handle identification analysis system Download PDFInfo
- Publication number
- CN113949750B CN113949750B CN202111494103.4A CN202111494103A CN113949750B CN 113949750 B CN113949750 B CN 113949750B CN 202111494103 A CN202111494103 A CN 202111494103A CN 113949750 B CN113949750 B CN 113949750B
- Authority
- CN
- China
- Prior art keywords
- value
- values
- handle identification
- handle
- type
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/22—Parsing or analysis of headers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/31—Indexing; Data structures therefor; Storage structures
- G06F16/316—Indexing structures
- G06F16/325—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application provides a handle identification analysis caching, a query method and a corresponding handle identification analysis system, which can effectively reduce the caching query times of handle identification analysis results, improve the query caching efficiency and reduce the query caching delay, thereby improving the query rate per second of the whole system business processing. The application provides a handle identification analysis caching method, which specifically comprises the following steps: step S1, a character string formed by arranging a handle identification character string, an index value and a type value is used as a key value, and a hash address corresponding to the key value is calculated, so that a hash table is established; and S2, caching the handle identification analysis result into a storage unit corresponding to the hash address.
Description
The application claims priority of patent application with application date of 2020, 12-month 9, application number of 202011430641.2, application name of handle identification analysis caching method, query method and handle identification analysis system, which are all incorporated herein by reference.
Technical Field
The application relates to the technical field of network communication, in particular to a handle identification analysis caching method, a handle identification analysis inquiring method and a handle identification analysis system.
Background
In 1994, the parent of the world Internet, the TCP/IP protocol, together with the inventor Robert Kahn invented a handle (handle) identification resolution system. The handle identification analysis system is a (K, V) type distributed database system, uses a handle identification character string (including prefix, full identification, secondary node identification, enterprise node identification and the like) as a key Value (key, K), and analyzes the key Value to obtain a group of handle values (Value, V). Then, the index value (index) and the type value (type) in the handle value can be used as separate secondary keys, and the index value (index) and the type value (type) can be sequentially searched, so that the handle value of the specific target can be continuously searched in the searched handle value, and the data corresponding to the handle value can be accessed after the handle value is finally determined.
In order to implement a high-performance identification resolution system, a cache system is generally matched to cache data in the prior art. When the analysis result of a handle identifier is queried in the cache system in the above way, even if the index value in the handle value has only one condition value and the type value has only one condition value, the query of the corresponding results of the handle identifier character string, the index value and the type value needs to be performed at least three times to obtain a specific target value. When there are multiple condition values for the index value and the type value, the number of queries will be greater. The mode that the final handle identification analysis result can be positioned by multiple times of inquiry is low in efficiency, and the delay of inquiry buffering is long.
Therefore, a technical solution is needed to reduce the number of cache queries of the handle identifier analysis result, improve the cache efficiency, and reduce the query cache delay, so as to achieve the effect of improving the query rate per second (qps) of the whole system service processing.
Disclosure of Invention
Aiming at the problems, the application provides a handle identification analysis caching method, a query method and a corresponding handle identification analysis system, which can effectively reduce the caching query times of handle identification analysis results.
The application provides a handle identification analysis caching method, which specifically comprises the following steps: step S1, a character string formed by arranging a handle identification character string, an index value and a type value is used as a key value, and a hash address corresponding to the key value is calculated, so that a hash table is established; and step S2, caching the handle identification analysis result into a storage unit corresponding to the hash address.
According to the technical scheme, the hash inquiry is carried out by taking the character string formed by arranging the handle identification character string, the index value and the type value as the key value, so that the hash address corresponding to the key value can be accurately obtained by only one hash inquiry in the inquiry mode, the inquiry times are greatly reduced, and the inquiry caching efficiency and accuracy are improved.
In the preferred technical scheme of the application, the index value in the key value is an index list value in an index list formed by sequencing a plurality of index values; the type values in the key values are type list values in a type list formed by sorting a plurality of type values.
According to the technical scheme, the index values and the type values are converted, and the list values are distributed after sorting, so that even if the same index list values and type list values are input in different orders, the unique key values can be still corresponding to the hash table through sorting.
The application also provides a handle identification analysis query method, which comprises the following steps: step S3, a character string formed by arranging the handle identification character string, the index value and the type value is used as a key value, and a hash address corresponding to the key value in a hash table is queried; and S4, reading a handle identification analysis result from a storage unit corresponding to the hash address.
According to the technical scheme, the hash inquiry is carried out by taking the character string formed by arranging the handle identification character string, the index value and the type value as the key value (key), so that the hash address where the handle identification analysis result is located can be accurately obtained by only one hash inquiry in the inquiry mode, the inquiry times are greatly reduced, and the inquiry caching efficiency and accuracy are improved.
In the preferred technical scheme of the application, the handle identification analysis query method further comprises the following steps: step S5, judging whether the handle identification analysis result is out of date according to the survival time value: if the handle identification is out of date, deleting the handle identification analysis result and returning a null value; if not, returning the handle identification analysis result. According to the preferred technical scheme, the handle identification analysis query method can effectively distinguish the expired data and ensure the timeliness of the data.
The handle identification analysis system provided by the application comprises: a processor; a memory provided with a cache space and communicatively coupled to the processor; the memory also stores a hash table, the hash table is read and executed by the processor, and the key value can be converted into a corresponding hash address, wherein the key value is configured as a character string formed by arranging a handle identification character string, an index value and a type value, and the hash address is configured as an address stored in the cache space by the handle identification analysis result.
Drawings
FIG. 1 is an overall block diagram of a handle identification resolution system provided in one embodiment of the application;
FIG. 2 is a general process flow diagram of handle identification resolution in the embodiment of FIG. 1;
FIG. 3 is a flow chart of a handle identification resolution cache in the embodiment of FIG. 1;
FIG. 4 is a flow diagram of a handle identification resolution query in the embodiment of FIG. 1;
FIG. 5 is a schematic diagram of a handle identification resolution system provided in the embodiment of FIG. 1.
Reference numerals: 1-security policy subsystem, 2-tcp/http(s) subsystem, 3-cache system, 4-recursion forwarding subsystem, 5-recursion server, 6-cache self-checking subsystem, 7-service management subsystem, 8-log subsystem, 9-hash table, 10-memory, 101, 102-storage unit, 11-processor.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all embodiments of the application. All other embodiments, which can be made by those skilled in the art without making any inventive effort, are intended to be within the scope of the present application.
[ System architecture ]
In this embodiment, the overall structure of the handle identification resolution system is shown in fig. 1. Preferably, the handle identification parsing system includes a security policy subsystem 1, a tcp/http(s) subsystem 2, a caching system 3, a recursive forwarding subsystem 4, a buffered self-test subsystem 6, a traffic management subsystem 7, and a logging subsystem 8. The security policy subsystem 1 is used for judging security of information such as handle identification analysis request/response and request/response user identity. The information with no security problem can pass through the security policy subsystem 1, so as to carry out the next transmission or analysis. Information interaction exists among the security policy subsystem 1, the service management subsystem 7 and the log subsystem 8 respectively, and the security policy subsystem 1 can store information such as date, time and user into the log subsystem 8 for later calling and inquiry.
the tcp/http(s) subsystem 2 is configured to transfer information transferred from the security policy subsystem 1 to the cache system 3 and the recursive forwarding subsystem 4 after performing tcp/http(s) protocol conversion, and in addition, the tcp/http(s) subsystem 2 is also capable of transferring back-end return information to the security policy subsystem 1. there is information interaction between the tcp/http(s) subsystem 2 and the service management subsystem 7, and the tcp/http(s) subsystem 2 can store date, time, analysis actions and other information into the logging subsystem 8 for later recall and inquiry.
After the query request is answered, the answer result can be cached in the cache system 3, so that the answer is directly performed when the same query request is received next time, and the answer speed can be improved. The cache system 3 is in communication connection with the service management subsystem 7 and the tcp/http(s) subsystem 2, so as to facilitate querying and retrieving required information in the cache system 3. On the other hand, the cache system 3 has information interaction with the cache self-checking subsystem 6, so that the content in the cache system 3 is updated by using new entries obtained by recursion query in time.
The recursion forwarding subsystem 4 can recursively forward the information transmitted from the tcp/http(s) subsystem 2 to an external recursion server 5, and can transmit the information returned from the recursion server 5 to the cache self-checking subsystem 6 for query judgment.
The recursive server 5 may be located outside the system, and is used for local recursive query without buffering results, that is, after receiving a query request sent by the recursive forwarding subsystem 4, performing recursive query, if no response information is available, recursing the query request to the next-level recursive server 5 until a certain recursive server 5 transmits back corresponding response information, and then transmitting back corresponding response information to the recursive forwarding subsystem 4. There is an information interaction between the recursive server 5 and the service management subsystem 7, and the recursive server 5 stores the recursive query log containing the server name and other contents generated by the recursive query in the log subsystem 8 for later recall and query.
The cache self-checking subsystem 6 is configured to receive the response result of the recursive query sent by the recursive forwarding subsystem 4, and determine whether the response result needs to be cached in the cache system 3. In some embodiments, if the corresponding answer result is not cached in the cache system 3 or the corresponding item data has expired, and the answer result satisfies a predetermined condition, the answer result may be cached in the cache system 3. If the corresponding response result is cached in the cache system 3 or the response result does not meet the preset condition, the response result obtained by the recursive query is returned without updating the cache system 3.
The service management subsystem 7 has information interaction with the above security policy subsystem 1, tcp/http(s) subsystem 2, the cache system 3, the recursion server 5 and the cache self-checking subsystem 6, so that the service management subsystem 7 systematically manages and monitors each flow in the whole handle identification analysis system.
The log subsystem 8 has information interaction with the above security policy subsystem 1, tcp/http(s) subsystem 2, recursive server 5, etc., and is used for recording and storing system log information such as date, time, action, etc. of the security policy subsystem 1, tcp/http(s) subsystem 2, recursive server 5, etc.
[ Process flow ]
Further, the overall process flow of the handle identification parsing system in this embodiment is shown in fig. 2.
The handle identification analysis system starts to operate, firstly, system configuration initialization is carried out, and if the system configuration initialization fails, analysis is exited; if the system configuration initialization is successful, the analysis is continued. After the system configuration initialization is successful, carrying out log initialization, and if the log initialization fails, exiting analysis; if the log initialization is successful, the analysis is continued. After the log is initialized successfully, carrying out buffer initialization, and if the buffer initialization fails, exiting analysis; if the buffer initialization is successful, the analysis is continued. After the buffer memory initialization is successful, carrying out log statistics initialization, and if the log statistics initialization fails, exiting analysis; if the log statistics are initialized successfully, the analysis is continued. The initialization step is a process of giving a default value to a variable and setting a default state to a control, thereby ensuring the normal operation of the system.
After the initialization steps are successfully completed, the system starts to monitor request information, and the monitored information types are divided into tcpListen, http(s) Listen, realconfListen and the like. The tcp is a specification of transmission layer data and a connection mode, does not carry data, and is only used for connection communication; http(s) is a hypertext transfer security protocol, which must be established on the basis of tcp connection, define a transfer content specification, and transfer data; realConf is a configuration information command for addition, deletion, modification, and the like of configuration. While the list instruction functions to specify on which ports or combinations of addresses and ports the server listens for access requests.
When the system monitors the request information from a specific port or address, namely when the external information trigger is received, the system can judge the external event type.
When the external event type is handle identification analysis query request based on tcp, tcp subsystem in tcp/http(s) subsystem 2 firstly carries out tcp service packet receiving and unpacking, and then carries out policy check, wherein the policy check refers to whether a corresponding hash address can be obtained after substituting a specific function based on a received key value (key). If the strategy check fails, namely, the hash address corresponding to the keyword value is not found in the hash table, the analysis is terminated and the result of the strategy check failure is returned to the user; if the policy check is successful, that is, the hash address corresponding to the key value is found in the hash table, a storage unit corresponding to the hash address is found in the cache database of the cache system 3. If the corresponding handle identification analysis result is cached in the storage unit corresponding to the hash address in the cache database, returning the handle identification analysis result to the user; if the corresponding handle identification analysis result is not cached in the storage unit corresponding to the hash address in the cache database or the corresponding handle identification analysis result is expired, continuing to carry out recursive query. The recursive server obtains a handle identification analysis result through one or more recursive queries, returns the handle identification analysis result to the user, and sends the handle identification analysis result to the cache self-checking subsystem 6. The cache self-checking subsystem 6 judges whether the handle identification analysis result needs to be cached, and if the handle identification analysis result is not cached in the cache database, the handle identification analysis result is cached in the cache database.
When the external event type is http(s), the http(s) subsystem in the tcp/http(s) subsystem 2 is used for receiving and unpacking the http(s) service, and other processing manners are similar to those when the external event type is tcp, and are not repeated here.
When the external event type is realConf, a crm command is issued. According to the specific content of the crm command, the operations of correspondingly adding, deleting, modifying and the like to the information in the hash table and the cache database can be realized.
[ handle identification string, handle value ]
The hash table is a data structure directly accessed according to (Key, value). That is, it maps a key value (key) to a hash address in a table to access a record by way of hash function computation to speed up the search. In a handle identification analysis system in the prior art, a keyword value used when a hash table is established is only a handle identification character string, and the handle identification character string comprises a prefix and a suffix, wherein the prefix comprises a top-level country node identification, a second-level node identification and an enterprise node identification. Such as the following character strings,
10.1045.xxx/january99-bearman
10 represents a top-level country node identifier; 1045, representing a secondary node identity; xxx, representing enterprise node identity; "." is a hierarchical separator separating the node identifiers at each level; the "/" is a prefix-suffix separator, the part preceding the "/" is a prefix, and the part following the "/" is a suffix; the handle identification string does not include "," and "/".
In the prior art, a set of handle values obtained by parsing the handle identification string is as follows:
the above is only schematically shown as a result of analysis of one type value (type) in one column of data. A set of handle values may actually contain multiple columns of data, each column of data being indexed with an index value (index) to distinguish this column of data from other columns of data. Each column of data may also contain data of different type values. Wherein, the liquid crystal display device comprises a liquid crystal display device,
index value (index), 4-byte unsigned integer;
type value (type), a UTF8 string;
data (data) describing a data asset identified by the handle;
time-to-live (TTL), which represents the time that data remains in the buffer space;
permission mask (permission), 8-bit permission mask, for access permission control of the handle;
reference number (reference) indicates references to other handles.
Wherein the type value (type) specifically comprises
An administrator (hs_admin) representing one or a group of administrators of the handle resolution service;
service SITE (hs_site) indicating a service SITE providing a handle resolution service;
a naming authority proxy service (hs_na_delete) for assigning naming authority to service sites;
service (HS_SERV) representing handle resolution service content;
an ALIAS (hs_alias), which can be represented by an ALIAS when the handle identifier object has a plurality of names;
a PRIMARY site (HS_primary), designating a PRIMARY service site;
list value (hs_vlist) indicating references to other handle list values.
The handle identification must specify a type value in its type field. The type value (type) includes not only the types described above, but the handle system also provides a type registration service that allows a user or organization to register a new type value for its application.
According to the above data structure, if the query mode in the prior art is adopted, in order to accurately locate the specific handle identifier analysis result, besides the mapping process of the hash table, an index value and a type value are needed to be used, and the specific handle identifier analysis result can be obtained by further querying a group of handle values.
[ cache method ]
The embodiment provides a handle identifier analysis caching method, which comprises the following steps of, as shown in fig. 3:
step S1, a character string formed by arranging a handle identification character string, an index value and a type value is used as a key value, and a hash address corresponding to the key value is calculated, so that a hash table is established;
and S2, caching the handle identification analysis result into a storage unit corresponding to the hash address.
In this embodiment, since the index value and the type value are already used as a part of the key value when the hash table is built, the hash table built based on the key value of the encoding method can directly parse the specific handle identifier parsing result without performing multiple queries. The caching method greatly facilitates the subsequent query process, reduces the times required by the subsequent query, and improves the query efficiency and accuracy.
Preferably, in the handle identification analysis caching method provided in this embodiment, the index value and the type value are list values after sorting. In other words, the index value in the key value is an index list value in the index list formed by sorting the plurality of index values; the type values in the key values are type list values in a type list formed by sorting a plurality of type values.
For example, for the type values, the available type values may be sorted according to a preset rule to form a type list, and a type list value may be assigned to each type value. The available type values not only comprise the common type values listed before, but also can comprise user-defined type values, and the query function can be applicable only by adding the type values into a type list in time and giving corresponding list values. For example, the correspondence between the type value and the type list value can be seen in table 1 below.
TABLE 1
The ordering rules assigned to the type list values may be ordered, such as alphabetically by name, by type, or any other suitable ordering, and combinations thereof, or unordered, as long as the type values are in a one-to-one correspondence with the type list values. The index value may also be implemented in the same or similar manner as the above manner, and will not be described herein.
Through the mode, the index values and the type values are respectively ordered according to a certain rule to obtain an index list value and a type list value; and integrating the handle identification character string with the index list value and the type list value to form a key word value.
For example, if the handle identifier string is 10.1045.Xxx/january 99-beaman, the index value is 2, and the type value is hs_admin, then when the key value is formed, the index list value corresponding to the index value and the type list value corresponding to the type value are queried. By querying the type list, the type list value corresponding to the type value of hs_admin is known to be 1, and similarly, the index list value corresponding to the query index value 2 is known to be 2. Thus, if the key value is encoded in the manner of handle identification string + index list + typeList, the key value should be 10.1045.Xxx/january 99-beaman 2 1.
By means of distributing list values after sorting, even if the same index list value and the same type list value are input in different orders, the unique key value can still be corresponding to the hash table through sorting. Of course, in some embodiments, the hash table may be established or queried by directly arranging the index value or the type value and the handle identification string to form a key value. In addition, in other embodiments, the key value may also allow some reasonable variation as long as it contains information of the index value, the type value, and the handle identification string.
After the key value is determined, the hash address corresponding to the key value can be determined by utilizing the hash function, the key value can be directly mapped to the hash address corresponding to the handle identification analysis result by utilizing the calculation process of the hash function, and resource waste caused by multiple hash searches is avoided.
[ query method ]
The handle identification analysis cache query flow proposed in this embodiment is shown in fig. 4.
First, step S3 is executed, in which a string formed by arranging the handle identification string, the index value, and the type value is used as a key value, and a hash address corresponding to the key value in the hash table is queried.
In this embodiment, step S3 further includes a step of calling a query program (for example, hhdl_cache_get program) to query the key value, and calculating a corresponding hash address from the key value.
Next, after step S3, step S4 is executed to read the handle identifier analysis result from the storage unit corresponding to the hash address.
Specifically, according to the hash address, the cache database of the cache system 3 is queried whether the corresponding handle identifier analysis result is cached in the storage unit corresponding to the hash address. And if the corresponding handle identification analysis result exists, reading the handle identification analysis result. And if the corresponding handle identification analysis result is not cached in the storage unit corresponding to the hash address, returning a NULL value (NULL) to the user.
After performing step S4, further comprising: step S5, judging whether the handle identification analysis result corresponding to the hash address is out of date according to the survival time value: if the handle identification is out of date, deleting the handle identification analysis result and returning a null value; if not, returning the handle identification analysis result.
Specifically, in step S5, if the corresponding handle identifier analysis result is cached in the storage unit corresponding to the hash address, it is checked whether the handle identifier analysis result has expired according to a time-to-live value (TTL) corresponding to the handle identifier analysis result. If the handle identification analysis result has expired, returning a NULL value (NULL) to the user; and if the handle identification analysis result is not expired, returning the corresponding handle identification analysis result to the user.
In addition, when executing step S3, if the string formed by arranging the handle identifier string, the index value and the type value is used as the key value, the hash table is queried, but when the hash address corresponding to the key value is not queried, a corresponding group of handle values can be queried according to the handle identifier string, and then the index value and the type value are used to further query in the group of handle values, so as to obtain a specific handle identifier analysis result
[ handle identification resolution System ]
In addition, this embodiment proposes a handle identifier analysis system, as shown in fig. 5, which specifically includes a processor 11 and a memory 10 communicatively connected to the processor 11, at least partially for providing a cache space. The memory 10 stores a hash table 9, and the hash table 9 is read and executed by the processor 11, and is capable of converting a key value into a corresponding hash address. Wherein the key value is configured as a string formed by arranging the handle identification string, the index value and the type value, and the hash address is configured as an address where the handle identification analysis result is stored in the cache system 3. The cache system 3 of the memory 10 includes a plurality of storage units 101, 102 corresponding to hash addresses for caching handle identification analysis results.
In the hash table 9, a corresponding hash address may be calculated from the key value, and the handle identifier analysis result may be cached in the storage unit 101, 102 corresponding to the hash address in the cache database of the cache system 3, or the corresponding handle identifier analysis result may be read from the storage unit 101, 102 corresponding to the hash address.
In summary, the above-mentioned method is used to cache and query the handle identifier analysis result, and when querying, the corresponding hash address can be calculated by using the key value, and the corresponding handle identifier analysis result can be directly queried by using the hash address. The effect which can be achieved by the hash inquirer originally needing more than three times can be achieved by only one hash inquiry, the cache inquiry times of the handle identification analysis result are effectively reduced, the inquiry cache delay is reduced, and therefore the inquiry rate per second of the whole system business processing is improved.
In the embodiment of the present application, the memory 10 and the processor 11 may be located in the same storage medium, such as a DNS server, a computer storage medium, or the like, or may be separately located in different hardware, software, or a cloud network, in other words, the handle identifier analysis system may be formed by a single DNS server, a computer, or the like, or may be formed by combining one or more of a plurality of hardware, software, hardware and software, and a cloud network, or the like.
In addition, it should be noted that memory 10 may comprise a non-volatile memory such as read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), FLASH memory (FLASH), or any other device capable of storing program instructions or data with or without application of power. The memory 10 may also include volatile memory such as Random Access Memory (RAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), and Synchronous Dynamic Random Access Memory (SDRAM), although other types of RAM may be used to implement the memory 10. Memory 10 may be implemented using a single memory module or multiple memory modules. Although memory 10 is depicted as being locally interconnected to processor 11, those skilled in the art will recognize that memory 10 may be provided in a different computer separately from processor 11 without departing from the scope of the subject technology.
Processor 11 may be a general purpose processor, a processor core, a multiprocessor, a reconfigurable processor, a microcontroller, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Graphics Processing Unit (GPU), a Field Programmable Gate Array (FPGA), a Programmable Logic Device (PLD), a controller, a state machine, gating logic, a discrete hardware component, or any other processing unit or combination of one or more of the above.
The foregoing description of the preferred embodiment of the application is not intended to be limiting, but rather is intended to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the application.
Claims (4)
1. The handle identification analysis caching method is characterized by comprising the following steps of:
step S1, a character string formed by arranging a handle identification character string, an index list value and a type list value is used as a key value, and a hash address corresponding to the key value is calculated, so that a hash table is established;
ordering index values according to a preset rule to obtain index list values, wherein the index values correspond to the index list values one by one;
sorting the type values according to a preset rule to obtain the type list values, wherein the type values are in one-to-one correspondence with the type list values;
and step S2, caching the handle identification analysis result into a storage unit corresponding to the hash address.
2. The handle identification analysis query method is characterized by comprising the following steps of:
step S3, a character string formed by arranging the handle identification character string, the index list value and the type list value is used as a key value, and a hash address corresponding to the key value in a hash table is queried;
ordering index values according to a preset rule to obtain index list values, wherein the index values correspond to the index list values one by one;
sorting the type values according to a preset rule to obtain the type list values, wherein the type values are in one-to-one correspondence with the type list values;
and S4, reading a handle identification analysis result from a storage unit corresponding to the hash address.
3. The handle identification resolution query method of claim 2, further comprising:
step S5, judging whether the handle identification analysis result is out of date according to the survival time value:
if the handle identification analysis result is out of date, deleting the handle identification analysis result and returning a null value;
and if not, returning the handle identification analysis result.
4. A handle identification resolution system, comprising:
a processor;
a memory provided with a cache space, in communication with the processor;
the memory also stores a hash table, which is read and executed by the processor, capable of converting a key value into a corresponding hash address, wherein,
the key value is configured as a character string formed by arranging a handle identification character string, an index list value and a type list value, and the hash address is configured as an address stored in the cache space by the handle identification analysis result;
ordering index values according to a preset rule to obtain index list values, wherein the index values correspond to the index list values one by one;
and sequencing the type values according to a preset rule to obtain the type list values, wherein the type values are in one-to-one correspondence with the type list values.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2020114306412 | 2020-12-09 | ||
| CN202011430641.2A CN112600823A (en) | 2020-12-09 | 2020-12-09 | Handle identifier analysis caching method, query method and handle identifier analysis system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113949750A CN113949750A (en) | 2022-01-18 |
| CN113949750B true CN113949750B (en) | 2023-09-19 |
Family
ID=75191387
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011430641.2A Pending CN112600823A (en) | 2020-12-09 | 2020-12-09 | Handle identifier analysis caching method, query method and handle identifier analysis system |
| CN202111494103.4A Active CN113949750B (en) | 2020-12-09 | 2021-12-08 | Handle identification analysis caching method, query method and handle identification analysis system |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011430641.2A Pending CN112600823A (en) | 2020-12-09 | 2020-12-09 | Handle identifier analysis caching method, query method and handle identifier analysis system |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN112600823A (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1211842A1 (en) * | 2000-11-30 | 2002-06-05 | BRITISH TELECOMMUNICATIONS public limited company | Network management apparatus |
| CN104516974A (en) * | 2014-12-26 | 2015-04-15 | 华为技术有限公司 | Management method and device for file system directory entry |
| US9049117B1 (en) * | 2009-10-21 | 2015-06-02 | Narus, Inc. | System and method for collecting and processing information of an internet user via IP-web correlation |
| CN105828017A (en) * | 2015-10-20 | 2016-08-03 | 广东亿迅科技有限公司 | Cloud storage access system and method for video conferences |
| GB2534617A (en) * | 2015-01-28 | 2016-08-03 | Canon Kk | Improved client-driven push of resources by a server device |
| CN107045530A (en) * | 2017-01-20 | 2017-08-15 | 华中科技大学 | A kind of method that object storage system is embodied as to local file system |
| CN107197001A (en) * | 2017-05-05 | 2017-09-22 | 工业和信息化部电信研究院 | A kind of industry internet module information method |
| CN108268509A (en) * | 2016-12-30 | 2018-07-10 | 迈普通信技术股份有限公司 | Configuration data management method and device |
| CN108366356A (en) * | 2018-01-10 | 2018-08-03 | 广州中国科学院计算机网络信息中心 | The interoperability methods and device of M2M systems and identification (RNC-ID) analytic system |
| CN111382341A (en) * | 2020-03-23 | 2020-07-07 | 湖南城市学院 | Scientific and technological information resource retrieval and query system and method based on big data |
| CN111752804A (en) * | 2020-06-29 | 2020-10-09 | 中国电子科技集团公司第二十八研究所 | Database cache system based on database log scanning |
| CN111917552A (en) * | 2020-06-23 | 2020-11-10 | 深圳奥联信息安全技术有限公司 | Handle authority control method, device and system based on identification key |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5678717B2 (en) * | 2011-02-24 | 2015-03-04 | 富士通株式会社 | Monitoring device, monitoring system, and monitoring method |
-
2020
- 2020-12-09 CN CN202011430641.2A patent/CN112600823A/en active Pending
-
2021
- 2021-12-08 CN CN202111494103.4A patent/CN113949750B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1211842A1 (en) * | 2000-11-30 | 2002-06-05 | BRITISH TELECOMMUNICATIONS public limited company | Network management apparatus |
| US9049117B1 (en) * | 2009-10-21 | 2015-06-02 | Narus, Inc. | System and method for collecting and processing information of an internet user via IP-web correlation |
| CN104516974A (en) * | 2014-12-26 | 2015-04-15 | 华为技术有限公司 | Management method and device for file system directory entry |
| GB2534617A (en) * | 2015-01-28 | 2016-08-03 | Canon Kk | Improved client-driven push of resources by a server device |
| CN105828017A (en) * | 2015-10-20 | 2016-08-03 | 广东亿迅科技有限公司 | Cloud storage access system and method for video conferences |
| CN108268509A (en) * | 2016-12-30 | 2018-07-10 | 迈普通信技术股份有限公司 | Configuration data management method and device |
| CN107045530A (en) * | 2017-01-20 | 2017-08-15 | 华中科技大学 | A kind of method that object storage system is embodied as to local file system |
| CN107197001A (en) * | 2017-05-05 | 2017-09-22 | 工业和信息化部电信研究院 | A kind of industry internet module information method |
| CN108366356A (en) * | 2018-01-10 | 2018-08-03 | 广州中国科学院计算机网络信息中心 | The interoperability methods and device of M2M systems and identification (RNC-ID) analytic system |
| CN111382341A (en) * | 2020-03-23 | 2020-07-07 | 湖南城市学院 | Scientific and technological information resource retrieval and query system and method based on big data |
| CN111917552A (en) * | 2020-06-23 | 2020-11-10 | 深圳奥联信息安全技术有限公司 | Handle authority control method, device and system based on identification key |
| CN111752804A (en) * | 2020-06-29 | 2020-10-09 | 中国电子科技集团公司第二十八研究所 | Database cache system based on database log scanning |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113949750A (en) | 2022-01-18 |
| CN112600823A (en) | 2021-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6301614B1 (en) | System and method for efficient representation of data set addresses in a web crawler | |
| US6377984B1 (en) | Web crawler system using parallel queues for queing data sets having common address and concurrently downloading data associated with data set in each queue | |
| US6754800B2 (en) | Methods and apparatus for implementing host-based object storage schemes | |
| US7191170B2 (en) | Predicate indexing of data stored in a computer with application to indexing cached data | |
| US7219160B1 (en) | Method for fast network-aware clustering | |
| CN102971732A (en) | System architecture for integrated hierarchical query processing for key/value stores | |
| EP2073505A1 (en) | Query routing in distributed database system | |
| CN103701957A (en) | Domain name server (DNS) recursive method and system thereof | |
| CN103685583A (en) | Method and system for resolving domain names | |
| US6654795B1 (en) | System and method for distribution of network file accesses over network storage devices | |
| US8521696B2 (en) | Structure of an alternative evaluator for directory operations | |
| CN113946587A (en) | Handle identifier analysis caching method, query method and handle identifier analysis system | |
| CN112600868A (en) | Domain name resolution method, domain name resolution device and electronic equipment | |
| CN104253796B (en) | Quick area's recognition methods based on network address binding region layer level in domain name system | |
| CN103220379A (en) | Domain name reverse-resolution method and device | |
| CN113949750B (en) | Handle identification analysis caching method, query method and handle identification analysis system | |
| US20050114372A1 (en) | System and method for content management over network storage devices | |
| CN113821461B (en) | Domain name resolution caching method, DNS server and computer readable storage medium | |
| CN115002072A (en) | JMX-based data acquisition method, device and medium | |
| KR20120085375A (en) | Analysis system for log data | |
| JP3570606B2 (en) | Data retrieval apparatus and method | |
| JP5132359B2 (en) | Data distributed processing system and method | |
| CN113094391B (en) | Calculation method, device and equipment for data summarization supporting cache | |
| CN114124887B (en) | View query method of DNS server, DNS server and readable storage medium | |
| CN114221934B (en) | Domain name resolution caching method, DNS server and computer readable storage medium |
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 |