CN113949750B - Handle identification analysis caching method, query method and handle identification analysis system - Google Patents

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

Handle identification parsing caching method, query method and handle identification parsing system

This application requires the priority of an invention patent application with an application date of December 9, 2020, an application number of 202011430641.2, and an invention title of "Handle Identity Parsing Cache Method, Query Method and Handle Identity Parsing System", the entire content of which is incorporated by reference. This article.

Technical field

The present invention relates to the field of network communication technology. Specifically, it relates to a handle identification parsing cache method, a handle identification parsing query method and a handle identification parsing system.

Background technique

In 1994, Robert Kahn, the father of the world's Internet and co-inventor of the TCP/IP protocol, invented the handle identification parsing system. The handle identification parsing system is a (K, V) type distributed database system that uses the handle identification string (including prefix, full identification, secondary node identification, enterprise node identification, etc.) as the key value (key, K) , after parsing it, a set of handle values (Value, V) is obtained. Then, you can use the index value (index) and type value (type) in the handle value as separate secondary keys to query the index value (index) and type value (type) in sequence, thereby continuing to query the retrieved handle value. The handle value of a specific target, and the data corresponding to the handle value is accessed after the handle value is finalized.

In order to implement a high-performance identity parsing system, a high-speed cache system is usually used to cache data in the existing technology. When querying the parsing result of a handle identifier in the cache system through the above method, even if the index value in the handle value has only one condition value and the type value has only one condition value, it is necessary to perform at least three separate operations on the handle identifier. Only by querying the results corresponding to strings, index values, and type values can the specific target value be obtained. When the index value and type value have multiple condition values, the number of queries will be more. This method, which requires multiple queries to locate the final handle identification parsing result, is inefficient and requires a long query cache delay.

Therefore, there is an urgent need for a technical solution that can reduce the number of cache queries for handle identifier parsing results, improve cache efficiency, and reduce query cache latency, so as to improve the query rate per second (qps) of the entire system's business processing.

Contents of the invention

In response to the above problems, the present invention provides a handle identification parsing caching method, a query method and a corresponding handle identification parsing system, which can effectively reduce the number of cache queries for handle identification parsing results.

The handle identification parsing and caching method provided by the present invention specifically includes: step S1, taking the string formed by arranging the handle identification string, the index value and the type value as a keyword value, calculating the hash address corresponding to the keyword value, thereby establishing a hash Hash table; step S2, cache the handle identifier parsing result into the storage unit corresponding to the hash address.

According to the above technical solution, the string formed by the handle identification string, index value, and type value is used as the keyword value (key) to perform a hash query. This query method only requires one hash query to accurately obtain the key The hash address corresponding to the word value greatly reduces the number of queries and improves the efficiency and accuracy of query caching.

In the preferred technical solution of the present invention, the index value in the keyword value is the index list value in the index list formed by sorting multiple index values; the type value in the keyword value is the type list formed by sorting multiple type values. Type list value in .

According to the above technical solution, the index value and type value are converted, and the list value is assigned after sorting. For the same index list value and type list value, even if the input order is different, it can still be sorted in the hash table through sorting Corresponds to a unique keyword value.

The invention also provides a handle identification parsing and query method, which includes: step S3, using the string formed by arranging the handle identification string, the index value and the type value as a keyword value, and querying the hash table with the keyword value The corresponding hash address; step S4, read the handle identification parsing result from the storage unit corresponding to the hash address.

According to the above technical solution, the string formed by the arrangement of the handle identification string, index value, and type value is used as the keyword value (key) to perform a hash query. This query method only requires one hash query to accurately obtain the handle identification. The hash address where the parsing results are located greatly reduces the number of queries and improves the efficiency and accuracy of query caching.

In the preferred technical solution of the present invention, the handle identification parsing query method also includes: step S5, judging whether the handle identification parsing result has expired based on the survival time value: if it expires, delete the handle identification parsing result and return a null value; if not If expired, the handle identification resolution result will be returned. According to the above-mentioned superior technical solution, the handle identification parsing and query method can effectively distinguish expired data and ensure the timeliness of the data.

The handle identification parsing system provided by the present invention includes: a processor; a memory provided with a cache space and communicatively connected to the processor; a hash table is also stored in the memory, and the hash table is read and executed by the processor and can convert keywords The value is converted into the corresponding hash address, where the keyword value is configured as a string formed by the arrangement of the handle identification string, index value and type value, and the hash address is configured as the address where the handle identification parsing result is stored in the cache space.

Description of drawings

Figure 1 is an overall structural diagram of a handle identification parsing system provided in one embodiment of the present invention;

Figure 2 is an overall processing flow chart of handle identifier parsing in the embodiment of Figure 1;

Figure 3 is a flow chart of the handle identifier parsing cache in the embodiment of Figure 1;

Figure 4 is a flow chart of handle identifier parsing query in the embodiment of Figure 1;

FIG. 5 is a schematic structural diagram of a handle identification parsing system provided in the embodiment of FIG. 1 .

Reference signs: 1-security policy subsystem, 2-tcp/http(s) subsystem, 3-caching system, 4-recursive forwarding subsystem, 5-recursive server, 6-cache self-checking subsystem, 7-business Management subsystem, 8-log subsystem, 9-hash table, 10-memory, 101, 102-storage unit, 11-processor.

Detailed ways

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

【system structure】

In this implementation, the overall structure of the handle identification parsing system is shown in Figure 1. Preferably, the handle identification parsing system includes a security policy subsystem 1, a tcp/http(s) subsystem 2, a cache system 3, a recursive forwarding subsystem 4, a buffering self-checking subsystem 6, a business management subsystem 7 and a log subsystem. System 8. Among them, the security policy subsystem 1 is used to determine the security of information such as handle identification resolution request/response and request/response user identity. Only information that is judged to have no security issues can pass through the security policy subsystem 1 for further transmission or analysis. There is information interaction between the security policy subsystem 1, the business management subsystem 7, and the log subsystem 8 respectively. The security policy subsystem 1 can store date, time, user and other information into the log subsystem 8 for subsequent calls and Inquire.

The tcp/http(s) subsystem 2 is used to transmit the information transmitted from the security policy subsystem 1 to the cache system 3 and the recursive forwarding subsystem 4 after performing tcp/http(s) protocol conversion. In addition, the tcp/ http(s) subsystem 2 can also transmit backend return information to security policy subsystem 1. There is information interaction between tcp/http(s) subsystem 2 and business management subsystem 7, and tcp/http(s) subsystem 2 can store date, time, parsing actions and other information into log subsystem 8 for later use Calls and queries.

After responding to the query request, the response result can be cached in the cache system 3, so that the next time a query request that is basically the same is received, a direct response can be made, which can improve the response speed. On the one hand, the cache system 3 is communicatively connected with the business management subsystem 7 and the tcp/http(s) subsystem 2, thereby facilitating the query and retrieval of required information in the cache system 3. On the other hand, there is information interaction between the cache system 3 and the cache self-checking subsystem 6, so that the content in the cache system 3 can be updated in a timely manner using the new entries obtained by the recursive query.

The recursive forwarding subsystem 4 can recursively forward the information from the tcp/http(s) subsystem 2 to the external recursive server 5, and can transmit the information returned by the recursive server 5 to the cache self-checking subsystem 6 for its use. Inquiry and judgment.

The recursive server 5 can be located outside the system and is used for recursive queries when there is no local cached result. That is, it performs a recursive query after receiving the query request from the recursive forwarding subsystem 4. If there is no response information, the query request is recursed to the next Level recursive server 5, until a certain recursive server 5 sends back the corresponding response information, and then sends the corresponding response information back to the recursive forwarding subsystem 4. There is information interaction between the recursive server 5 and the business management subsystem 7, and the recursive server 5 will store the recursive query log containing the server name and other contents generated by the recursive query into the log subsystem 8 for subsequent calls and queries.

The cache self-checking subsystem 6 is used to receive the response result of the recursive query from the recursive forwarding subsystem 4 and determine whether the response result needs to be cached in the cache system 3 . In some implementations, if the corresponding response result is not cached in the caching system 3 or the corresponding entry data has expired, and the response result meets the predetermined conditions, the response result can be cached in the caching system 3 . If the corresponding response result has been cached in the cache system 3 or the response result does not meet the predetermined conditions, the response result obtained by the recursive query is returned without updating the cache system 3 .

The business management subsystem 7 has information interaction with the above security policy subsystem 1, tcp/http(s) subsystem 2, cache system 3, recursive server 5 and cache self-checking subsystem 6, so that the business management subsystem 7 can control the entire Each process in the handle identification resolution system is systematically managed and monitored.

Log subsystem 8 has information interaction with the above security policy subsystem 1, tcp/http(s) subsystem 2 and recursive server 5, etc., and is used to record and store security policy subsystem 1, tcp/http(s) subsystem 2 and recursive server 5, etc. system log information such as date, time, and actions.

【Processing Process】

Furthermore, the overall processing flow of the handle identification parsing system in this embodiment is shown in Figure 2.

When the handle identification parsing system starts to run, the system configuration is initialized first. If the system configuration initialization fails, the parsing will exit; if the system configuration is initialized successfully, the parsing will continue. After the system configuration is initialized successfully, the log is initialized. If the log initialization fails, parsing will exit; if the log initialization is successful, parsing will continue. After the log initialization is successful, cache initialization is performed. If cache initialization fails, parsing will exit; if cache initialization is successful, parsing will continue. After the cache initialization is successful, log statistics are initialized. If the log statistics initialization fails, parsing will exit; if log statistics are initialized successfully, parsing will continue. The above initialization step is the process of assigning variables to default values and setting controls to default states, thereby ensuring the normal operation of the system.

After the above initialization steps are successfully completed, the system begins to monitor request information. The types of information monitored are divided into tcpListen, http(s)Listen and realConfListen. Among them, tcp is the specification of the transport layer data and connection method. It does not carry data and is only used for connection communication; http(s) is the hypertext transmission security protocol. http(s) must be based on the tcp connection and defines the transmission content. Standardize and transmit data; realConf is a configuration information command, used to add, delete and modify configurations, etc. The function of the Listen instruction is to specify which ports or combinations of addresses and ports the server listens for access requests on.

When the system monitors request information from a specific port or address, that is, when it is triggered by external information, the system can determine the type of external event.

When the external event type is a TCP-based handle identification parsing query request, first the TCP subsystem in the TCP/http(s) subsystem 2 performs TCP service packet collection and unpacking, and then performs policy checking. The strategy mentioned here Checking refers to whether the corresponding hash address can be obtained after substituting a specific function based on the received keyword value (key). If the policy check fails, that is, the hash address corresponding to the keyword value is not found in the hash table, the parsing is terminated and the result of the policy check failure is returned to the user; if the policy check is successful, the hash address corresponding to the keyword value is found in the hash table. When the hash address corresponding to the keyword value is reached, the storage unit corresponding to the hash address is searched for in the cache database of the cache system 3 . If there is a corresponding handle identification parsing result cached in the storage unit corresponding to the hash address in the cache database, the handle identification parsing result will be returned to the user; if there is no corresponding handle cached in the storage unit corresponding to the hash address in the cache database If the identification parsing result or the corresponding handle identification parsing result has expired, the recursive query will continue. The recursive server obtains the handle identification parsing result through one or more recursive queries, returns the handle identification parsing result to the user, and sends the handle identification parsing result to the cache self-checking subsystem 6. The cache self-checking subsystem 6 determines whether the handle identification parsing result needs to be cached. If the handle identification parsing result is not cached in the cache database, it will be cached in the cache database.

When the external event type is http(s), use the http(s) subsystem in tcp/http(s) subsystem 2 to receive and unpack http(s) service packets. Other processing methods are the same as when the external event type is tcp. Similar, will not be repeated here.

When the external event type is realConf, the crm command is issued. According to the specific content of the crm command, operations such as adding, deleting, and modifying information in the hash table and cache database can be implemented accordingly.

[Handle identification string, handle value]

A hash table is a data structure that is directly accessed based on (Key, Value). That is to say, it uses hash function calculation to map the key value (key) to a hash address in the table to access the record to speed up the search. In the handle identification parsing system of the prior art, the key value used when establishing the hash table is only the handle identification string, and the handle identification string includes a prefix and a suffix, where the prefix includes a top-level country node identification and a secondary node identification. , enterprise node identification. For example, the following string,

10.1045.xxx/january99-bearman

Among them, 10 represents the top-level national node identifier; 1045 represents the second-level node identifier; xxx represents the enterprise node identifier; "." is the hierarchical separator that separates node identifiers at each level; "/" is the prefix and suffix separator, "/ The part before " is the prefix, and the part after "/" is the suffix; the handle identification string does not include "." and "/".

In the prior art, the form of a set of handle values obtained by parsing the handle identification string is as follows:

The above only schematically shows the analysis results of one type of value (type) in one column of data. A set of handle values can actually contain multiple columns of data. Each column of data is indexed by an index value to distinguish this column of data from other columns of data. Each column of data can also contain data of different types of values. in,

Index value (index), 4-byte unsigned integer type;

Type value (type), a UTF8 string;

Data, used to describe the data resource identified by the handle;

Time to Live (TTL), which represents the time that data is retained in the cache space;

Permission mask (permission), an 8-bit permission mask, used for handle access control;

Reference number (reference), indicating references to other handles.

Among them, the type value (type) specifically includes

Administrator (HS_ADMIN), which represents one or a group of administrators of the handle resolution service;

Service site (HS_SITE), which represents the service site that provides handle resolution services;

Naming authorization agent service (HS_NA_DELEGATE), used to assign naming management rights to service sites;

Service (HS_SERV), which means the handle parses the service content;

Alias (HS_ALIAS), when the handle identification object has multiple names, it can be represented by an alias;

Primary site (HS_PRIMARY), specifies the main service site;

List value (HS_VLIST), which represents a reference to a list value of another handle.

The handle identifier must specify a type value in its type field. Type values (type) not only include the above types, the handle system also provides a type registration service, which allows users or organizations to register new type values for their applications.

It can be seen from the above data structure that if the query method in the existing technology is used, in order to accurately locate the specific handle identification parsing result, in addition to the above hash table mapping process, it is also necessary to use index values and type values, in a set of handle values Only by further querying can you get the specific handle identifier parsing results.

【Caching method】

This implementation mode provides a handle identifier parsing and caching method, which includes the following steps, as shown in Figure 3:

Step S1, use the string formed by arranging the handle identification string, index value and type value as the key value, calculate the hash address corresponding to the key value, and thereby establish a hash table;

Step S2: Cache the handle identification parsing result into the storage unit corresponding to the hash address.

In this implementation, since the index value and type value have been used as part of the key value when establishing the hash table, the hash table established based on the key value of this encoding method can directly parse out the specific handle identification parsing results without the need for multiple queries. The above caching method greatly facilitates the subsequent query process, reduces the number of subsequent queries required, and improves the efficiency and accuracy of the query.

Preferably, in the handle identifier parsing and caching method proposed in this embodiment, both the index value and the type value are list values after sorting. In other words, the index value in the key value is the index list value in the index list formed by sorting multiple index values; the type value in the key value is the type list value in the type list formed by sorting multiple type values.

For example, for type values, the available type values can be sorted according to preset rules to form a type list, and each type value can be assigned a type list value. The available type values include not only the common type values listed previously, but also user-defined type values. As long as they are added to the type list in time and given the corresponding list value, the query function can be used. For example, the correspondence between type values and type list values can be seen in Table 1 below.

Table 1

The sorting rules assigned to type list values can be ordered, such as alphabetical ordering of names, type sorting, or any other suitable sorting methods and their combinations, or unordered, as long as the type value and the type list value are the same. Just one corresponding one. The index value can also be implemented in the same or similar manner as above, and will not be described again here.

Through the above method, the index values and type values are sorted according to certain rules respectively to obtain the index list value and type list value; then the handle identification string is integrated with the index list value and type list value to form the keyword value.

For example, if the handle identification string is 10.1045.xxx/january99-bearman, the index value is 2, and the type value is HS_ADMIN, then when composing the keyword value, the index list value corresponding to the index value and the type corresponding to the type value are Query list values. By querying the above type list, it can be seen that the type list value corresponding to the type value of HS_ADMIN is 1. Similarly, the index list value corresponding to the query index value 2 is 2. Therefore, if the keyword value is encoded using the method of handle identification string + indexList (index list value) + typeList (type list value), the keyword value should be 10.1045.xxx/january99-bearman 2 1.

By assigning list values after sorting, the same index list value and type list value can still correspond to a unique key value in the hash table through sorting, even if the input order is different. Of course, in some implementations, the index value or type value and the handle identification string can also be directly arranged to form a key value to create or query the hash table. In addition, in other implementations, the keyword value may also allow certain reasonable deformations, as long as it contains information about the index value, type value, and handle identification string.

After the keyword value is determined, the hash function can be used to determine the hash address corresponding to the keyword value. The calculation process of the hash function can be used to directly map the keyword value to the hash address corresponding to the handle identification parsing result. , to avoid the waste of resources caused by multiple hash searches.

【Query method】

The handle identifier parsing cache query process proposed in this implementation mode is shown in Figure 4.

First, step S3 is performed to use the string formed by arranging the handle identification string, the index value and the type value as the key value, and query the hash address corresponding to the key value in the hash table.

In this embodiment, step S3 further includes the step of calling a query program (for example, hhdl_cache_get program) to query the keyword value, and calculating the corresponding hash address from the keyword value.

Next, after step S3, step S4 is executed to read the handle identification parsing 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 to see whether the corresponding handle identifier parsing result is cached in the storage unit corresponding to the hash address. If there is a corresponding handle ID parsing result, read the handle ID parsing result. If the corresponding handle identifier parsing result is not cached in the storage unit corresponding to the hash address, a null value (NULL) will be returned to the user.

After executing step S4, it also includes: step S5, judging whether the handle identification parsing result corresponding to the hash address has expired based on the survival time value: if it expires, delete the handle identification parsing result and return a null value; if it has not expired, The result of parsing the handle identifier is returned.

Specifically, in step S5, if the corresponding handle identification parsing result is cached in the storage unit corresponding to the hash address, it is checked whether the handle identification parsing result is based on the time-to-live value (TTL) corresponding to the handle identification parsing result. already expired. If the handle identification parsing result has expired, a null value (NULL) will be returned to the user; if the handle identification parsing result has not expired, the corresponding handle identification parsing result will be returned to the user.

In addition, when performing step S3, if the string formed by the handle identification string, index value and type value is used as the key value, the hash table is queried, but the hash address corresponding to the key value is not queried. When, you can find the corresponding set of handle values according to the handle identification string, and then use the index value and type value to further query in the set of handle values to obtain a specific handle identification parsing result.

[Handle identification analysis system]

In addition, this embodiment proposes a handle identification parsing system, the structure of which is shown in Figure 5 , specifically including a processor 11 and a memory 10 that is communicatively connected to the processor 11 and is at least partially used to provide cache space. A hash table 9 is stored in the memory 10. The hash table 9 is read and executed by the processor 11 and can convert the key value into a corresponding hash address. Among them, the keyword value is configured as a string formed by the arrangement of the handle identification string, the index value and the type value, and the hash address is configured as the address where the handle identification parsing result is stored in the cache system 3 . The cache system 3 of the memory 10 includes a plurality of storage units 101 and 102 corresponding to the hash addresses, and is used to cache the handle identification parsing results.

In the hash table 9, the corresponding hash address can be calculated from the key value, and the handle identification parsing result is cached in the storage units 101, 102 corresponding to the hash address in the cache database of the cache system 3 or to the hash table 9. The corresponding handle identification parsing result is read from the storage units 101 and 102 corresponding to the address.

In summary, by caching and querying the handle identifier parsing results in the above manner, the corresponding hash address can be calculated using the keyword value during query, and the corresponding handle identifier parsing result can be directly queried with the hash address. Only one hash query is needed to achieve the effect that originally required more than three hash queries, effectively reducing the number of cache queries for handle identification parsing results, reducing the query cache delay, thereby improving the business processing efficiency of the entire system. Query rate per second.

In the embodiment of the present invention, the memory 10 and the processor 11 can be in the same storage medium such as a DNS server, computer storage medium, etc., or they can be separately installed in different hardware, software or cloud networks. In other words, the above handle identifier The resolution system can be composed of an independent DNS server, computer and other equipment, or it can be composed of one or more combinations of multiple hardware, software, cloud network, etc.

In addition, it should be noted that the memory 10 may include 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 the application of power. 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), and may also be used Other types of RAM are used to implement 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 with processor 11, those skilled in the art will recognize that memory 10 may be provided separately from processor 11 in a different computer without departing from the scope of the subject technology.

The 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 arrays (FPGAs), programmable logic devices (PLDs), controllers, state machines, gated logic, discrete hardware components, or any other processing unit and combinations of one or more of the above.

The above descriptions are only preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the principles and spirit of the present invention are included in the protection of the present invention. within the range.

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.