Cache classification method, device, equipment and medium based on query request path

Abstract

The present disclosure provides a cache grading method based on a query request path, including: constructing a three-level cache system, the three-level cache system including a first-level cache, a second-level cache and a third-level cache; obtaining a user's data access request, and identifying the data access path and user information therefrom; accessing the first-level cache according to a preset sequence number, and verifying the data access path through a first Bloom filter in the first-level cache; when the data access path is verified, accessing the corresponding second-level cache based on the data access path, and verifying the user information through a second Bloom filter in the second-level cache; when the user information is verified, accessing the third-level cache based on the user information to obtain cached data. This method optimizes the corresponding relationship between cache results and user requests, refines the relationship granularity, and solves the problems of slow system response, high system overhead, and long page loading time when the system load is large.

Description

Technical Field

[0001] The present disclosure relates to the field of computer technology, and in particular to a cache classification method, device, equipment and medium based on a query request path. Background Art

[0002] At present, the data cache of web pages generally adopts a cache method based on a single-layer cache. Using a single-level cache structure to store cache data means that each user login information can only correspond to one cache data, resulting in the data being too single when the cache data needs to be returned. If the user visits other pages at the same time, the database query needs to be re-performed. When the same user visits multiple pages that have already been visited, it will cause unnecessary cache refreshes, wasting system resources. Since the cache result is only directly related to the user account information, the Bloom filter can only be constructed through user information, resulting in a large size of the Bloom filter. Under the same false positive rate, the more data the established filter contains, the slower the verification speed, and when the number of requests is large, the request response speed is slowed down. In a system, when users use the system to perform frequent page switching and query operations on multiple business modules, the cache will be continuously refreshed and database query operations will be frequently performed. When the system load is large, too many system resources will be occupied, and the system response time will increase. Summary of the invention

[0003] In view of the above problems, the present invention provides a cache classification method based on query request path to solve the above technical problems.

[0004] One aspect of the present disclosure provides a cache hierarchy method based on a query request path, characterized in that it includes: constructing a three-level cache system, the three-level cache system includes a first-level cache, a second-level cache and a third-level cache, the first-level cache performs access with a preset serial number of the three-level cache system as a key value, the second-level cache performs access with a data access path as a key value, and the third-level cache performs access with user information as a key value; obtaining a user's data access request, and identifying a data access path and user information therefrom; accessing the first-level cache according to the preset serial number, and verifying the data access path through a first Bloom filter in the first-level cache; when the data access path is verified, accessing the corresponding second-level cache based on the data access path, and verifying the user information through a second Bloom filter in the second-level cache; when the user information is verified, accessing the third-level cache based on the user information to obtain cached data.

[0005] Optionally, verifying the data access path through the first Bloom filter in the first-level cache includes: presetting multiple first data access paths in the first Bloom filter, each first data access path corresponding to a key value of the second-level cache; when the data access path is not included in the multiple first data access paths, the data access path verification fails; when the data access path is included in the multiple first data access paths, the data access path verification passes.

[0006] Optionally, verifying the user information through the second Bloom filter in the second-level cache includes: presetting multiple first user information in the second Bloom filter, each first user information corresponds to a key value of the third-level cache; when the user information is not included in the multiple first user information, the user information verification fails; when the data access path is included in the multiple first user information, the user information verification passes.

[0007] Optionally, the first-level cache is subordinate to a plurality of second-level caches, and each of the second-level caches corresponds to a plurality of third-level caches.

[0008] Optionally, it also includes: if the data access request is the first data access request initiated by the user, executing a database query according to the request information in the data access request to obtain the cached data; assigning a first cache key value to the cached data, and storing the user's data access path in a specified second-level cache and a first Bloom filter, and storing the user's user information in a specified third-level cache and a second Bloom filter.

[0009] Optionally, the method further includes: if the data access path verification fails, returning an error prompt message to the user.

[0010] Optionally, the method further includes: if the user information verification fails, processing the user's data access request as a data access request for the first access.

[0011] The second aspect of the present disclosure provides a cache grading device based on a query request path, including: a three-level cache construction module, used to construct a three-level cache system, the three-level cache system includes a first-level cache, a second-level cache and a third-level cache, the first-level cache performs access with a preset sequence number of the three-level cache system as a key value, the second-level cache performs access with a data access path as a key value, and the third-level cache performs access with user information as a key value; a request acquisition module, used to obtain a user's data access request and identify the data access path and user information therefrom; a first-level cache identification module, used to access the first-level cache according to the preset sequence number and verify the data access path through a first Bloom filter in the first-level cache; a second-level cache identification module, used to access the corresponding second-level cache based on the data access path when the data access path is verified, and verify the user information through a second Bloom filter in the second-level cache; a data acquisition module, used to access the third-level cache based on the user information when the user information is verified to obtain cached data.

[0012] The third aspect of the present disclosure provides an electronic device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, each step of the cache grading method based on the query request path described in any one of the first aspects is implemented.

[0013] A fourth aspect of the present disclosure provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the computer program implements each step of any one of the cache grading methods based on the query request path in the first aspect.

[0014] At least one of the above technical solutions adopted in the embodiments of the present disclosure can achieve the following beneficial effects:

[0015] The disclosed embodiment uses a three-level cache structure so that each request path of each user's login information has corresponding request cache data and a corresponding Bloom filter. Although the number of Bloom filters is increased, the size of a single filter is reduced. Under the same false positive rate, the filter verification speed is improved, the number of times the database repeatedly executes query operations is reduced, and the database burden is reduced. At the same time, the cache performs hierarchical processing on the user's data cache results according to the path of the query request, thereby reducing the loading time of the system. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] For a more complete understanding of the present disclosure and its advantages, reference will now be made to the following description taken in conjunction with the accompanying drawings, in which:

[0017] Figure 1A main flow chart of a cache classification method based on a query request path provided by an embodiment of the present disclosure is schematically shown;

[0018] Figure 2 A schematic diagram of a specific process of a cache classification method based on a query request path provided by an embodiment of the present disclosure is shown;

[0019] Figure 3 A schematic diagram of a structure of a cache classification device based on a query request path provided by an embodiment of the present disclosure is shown;

[0020] Figure 4 A structural block diagram of an electronic device provided by an embodiment of the present disclosure is schematically shown; DETAILED DESCRIPTION

[0021] Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present disclosure. In the following detailed description, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present disclosure. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present disclosure.

[0022] The terms used herein are only for describing specific embodiments and are not intended to limit the present disclosure. The terms "comprise", "include", etc. used herein indicate the existence of the features, steps, operations and / or components, but do not exclude the existence or addition of one or more other features, steps, operations or components.

[0023] All terms (including technical and scientific terms) used herein have the meanings commonly understood by those skilled in the art, unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification, and should not be interpreted in an idealized or overly rigid manner.

[0024] Some block diagrams and / or flow charts are shown in the accompanying drawings. It should be understood that some blocks or combinations thereof in the block diagrams and / or flow charts may be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that these instructions, when executed by the processor, may create a device for implementing the functions / operations described in these block diagrams and / or flow charts.

[0025] Therefore, the technology of the present disclosure can be implemented in the form of hardware and / or software (including firmware, microcode, etc.). In addition, the technology of the present disclosure can take the form of a computer program product on a computer-readable medium storing instructions, which can be used by an instruction execution system or in combination with an instruction execution system. In the context of the present disclosure, a computer-readable medium can be any medium that can contain, store, transmit, propagate, or transmit instructions. For example, a computer-readable medium can include, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, device, or propagation medium. Specific examples of computer-readable media include: magnetic storage devices, such as magnetic tapes or hard disks (HDDs); optical storage devices, such as compact disks (CD-ROMs); memories, such as random access memories (RAMs) or flash memory; and / or wired / wireless communication links.

[0026] A Bloom filter is a long binary vector and a series of random mapping functions. Bloom filters can be used to quickly retrieve whether an element is in a set.

[0027] Cache middleware technology refers to a memory-based key-value storage used to store small pieces of arbitrary data (strings, objects). It facilitates rapid development, reduces development difficulty, and solves many problems of large data cache. In essence, it is a concise key-value storage system.

[0028] The disclosed embodiment proposes a cache grading method based on query request path, by analyzing the request path information and user login information of the query request, maintaining the consistency of the cache result through the publish-subscribe mode of the cache middleware, grading the query result according to the request path, reducing the relationship granularity between the cache result and the user login information, and reducing the system response time when the user frequently switches to access the page.

[0029] Figure 1 , 2 A flowchart of a cache classification method based on a query request path provided by an embodiment of the present disclosure is schematically shown.

[0030] like Figure 1 , 2 As shown, the embodiment of the present disclosure provides a cache classification method based on a query request path, including operations S110 to S150.

[0031] In operation S110, a three-level cache system is constructed, which includes a first-level cache, a second-level cache and a third-level cache. The first-level cache uses a preset serial number of the three-level cache system as a key value to perform access, the second-level cache uses a data access path as a key value to perform access, and the third-level cache uses user information as a key value to perform access.

[0032] The first-level cache has multiple second-level caches under it, and each second-level cache corresponds to multiple third-level caches. Specifically, the first-level cache uses the serial number NO of the three-level cache structure as the key, which cannot be repeated and is used to distinguish different first-level cache structures; the VALUE of the first-level cache structure corresponds to multiple second-level cache structure child nodes. For a stable system, the number of second-level cache structures should be fixed, and the number is the same as the number of request paths managed in the system. The second-level cache uses each query path PATH that needs to be managed in the system as the key, which cannot be repeated and is used to distinguish different second-level cache structures; the second-level cache uses multiple third-level cache structures as child nodes. For a stable system, the number of third-level cache structures is basically the same as the number of users who have requested the corresponding path within a time period. The third-level cache structure uses the login user information USER_INFO as the key, which cannot be repeated under the same second-level cache structure and is used to distinguish different third-level cache structures; the key value of the third-level cache stores the corresponding cache data of the user under the corresponding request path.

[0033] In operation S120, a data access request of a user is obtained, and a data access path and user information are identified therefrom.

[0034] When the system receives a request to query a project list, it parses the path information in the request, where the request path is project.html and the user information is user.

[0035] In operation S130 , the first level cache is accessed according to a preset sequence number, and a data access path is verified through a first Bloom filter in the first level cache.

[0036] In this embodiment, a plurality of first data access paths are preset in the first Bloom filter, and each first data access path corresponds to a key value of the second-level cache. Specifically, the first Bloom filter Bloom1 can be constructed according to the Key of all second-level cache structures.

[0037] When performing data access path verification, when the data access path is not included in the multiple first data access paths, the data access path verification fails; when the data access path is included in the multiple first data access paths, the data access path verification passes.

[0038] For requests that fail verification, it means that the current project.html indicates that the request path does not exist or is unavailable, and the response request fails. For requests that pass verification, it means that the request path exists and is available, and the second-level cache structure with project.html as the key is searched. Determine the Bloom filter Bloom2-project corresponding to the second-level cache structure.

[0039] In operation S140 , when the data access path verification passes, the corresponding second-level cache is accessed based on the data access path, and the user information is verified through the second Bloom filter in the second-level cache.

[0040] In this embodiment, a plurality of first user information are preset in the second Bloom filter, and each first user information corresponds to a key value of the third-level cache. Specifically, a Bloom filter Bloom2-x can be constructed for each second-level cache structure according to the key of the third-level cache structure in each second-level cache structure.

[0041] When verifying user information, if the user information is not included in the multiple first user information, the user information verification fails; if the data access path is included in the multiple first user information, the user information verification passes. Specifically, the user is filtered through the Bloom2-project, and if the user information verification fails, the user's data access request is treated as a data access request for the first access.

[0042] If the data access request is the first data access request initiated by the user, a database query is performed according to the request information in the data access request to obtain the cached data; the key value of the first cache is assigned to the cached data, and the user's data access path is stored in the specified second-level cache and the first Bloom filter, and the user's user information is stored in the specified third-level cache and the second Bloom filter.

[0043] According to the method provided in the embodiment of the present disclosure, it can mainly solve the problems that when the number of requests received by the system is close to the maximum carrying capacity of the system, the caching method based on single-layer cache leads to large granularity of cache-user relationship, frequent cache updates, and is not conducive to cache management. It can also avoid excessive system resources being consumed in repeated database query requests, thereby solving the problems of slow page loading and long waiting time when users query business information.

[0044] There are two important factors that affect the time to respond to requests, and they are also important indicators for measuring the system's response to requests. First, the data operation time. When the number of requests is large, the database consumes time to execute query operations and the time consumed by the operation cache. Second, the Bloom filter verification time. Under the same allowable false positive rate, the time spent by the Bloom filter to verify the data.

[0045] The method provided by the embodiment of the present disclosure only adds one more Bloom filter verification operation to the data operation time spent when the user visits the page for the first time within a time period, compared with the caching method based on a single-layer cache. Since the above operations are all based on cache operations, the response time is almost the same. However, when the user frequently switches between pages, the traditional caching method will continue to perform database query operations, while the cache grading method based on this patent will directly perform cache query operations and respond to the results. Speed ​​up the response time of the request. Through experiments, under the same situation and the same configuration, 10,000 requests were simulated. When the same user repeatedly requested two different pages, the caching method based on a single-layer cache took 31.65 seconds due to multiple executions of database query operations. The query through a cache grading method based on a query request path provided by this patent took 1.15 seconds.

[0046] Under the same false positive rate, the larger the size of the Bloom filter, the more hashes are required for verification and the longer the verification time. Compared with the cache method based on single-layer cache, the disclosed embodiment reduces the size of a single filter by increasing the number of Bloom filters, reduces the number of hashes during verification, and reduces the time spent on verification.

[0047] The disclosed embodiment constructs a three-level cache structure with the path as the first level. When the path is a multi-level structure, the second-level cache structure described in the patent can be refined and decomposed into more levels of cache structures to further refine the relationship between the cache and the user. The three-level cache structure can process requests separately according to the request path, and the cache structure of the system module is more clearly divided, which is convenient for cache management and future maintenance; when the system load is large, when the user frequently switches pages, the entire cache will not be frequently refreshed, reducing the number of database query operations, speeding up the system response speed, and reducing the system page loading time.

[0048] Figure 3 A structural block diagram of a cache classification device based on a query request path provided by an embodiment of the present disclosure is schematically shown.

[0049] like Figure 3 As shown, the embodiment of the present disclosure provides a cache grading device based on a query request path, including: a three-level cache construction module 310, a request acquisition module 320, a first-level cache identification module 330, a second-level cache identification module 340, and a data acquisition module 350.

[0050] The third-level cache construction module 310 is used to construct a three-level cache system, which includes a first-level cache, a second-level cache and a third-level cache. The first-level cache uses the preset serial number of the three-level cache system as the key value to perform access, the second-level cache uses the data access path as the key value to perform access, and the third-level cache uses the user information as the key value to perform access.

[0051] The request acquisition module 320 is used to acquire the user's data access request and identify the data access path and user information therefrom.

[0052] The first-level cache identification module 330 is used to access the first-level cache according to a preset sequence number and verify the data access path through the first Bloom filter in the first-level cache.

[0053] The secondary cache identification module 340 is used to access the corresponding second-level cache based on the data access path when the data access path verification passes, and verify the user information through the second Bloom filter in the second-level cache.

[0054] The data acquisition module 350 is used to access the third-level cache based on the user information to obtain the cache data when the user information verification is passed.

[0055] It is understandable that the three-level cache construction module 310, the request acquisition module 320, the first-level cache identification module 330, the second-level cache identification module 340 and the data acquisition module 350 can be combined in one module for implementation, or any one of the modules can be split into multiple modules. Alternatively, at least part of the functions of one or more of these modules can be combined with at least part of the functions of other modules and implemented in one module. According to an embodiment of the present invention, at least one of the three-level cache construction module 310, the request acquisition module 320, the first-level cache identification module 330, the second-level cache identification module 340 and the data acquisition module 350 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application-specific integrated circuit (ASIC), or can be implemented in hardware or firmware in any other reasonable way of integrating or packaging the circuit, or in a suitable combination of software, hardware and firmware. Alternatively, at least one of the third-level cache construction module 310, the request acquisition module 320, the first-level cache identification module 330, the second-level cache identification module 340 and the data acquisition module 350 can be at least partially implemented as a computer program module, and when the program is run by a computer, the function of the corresponding module can be executed.

[0056] Figure 4 The structural block diagram of an electronic device provided by an embodiment of the present disclosure is schematically shown.

[0057] like Figure 4 As shown, the electronic device described in this embodiment includes: the electronic device 400 includes a processor 410 and a computer readable storage medium 420. The electronic device 400 can execute the above reference Figure 1 Describes the method to achieve detection of specific operations.

[0058] Specifically, the processor 410 may include, for example, a general-purpose microprocessor, an instruction set processor and / or a related chipset and / or a dedicated microprocessor (e.g., an application-specific integrated circuit (ASIC)), etc. The processor 410 may also include an onboard memory for cache purposes. The processor 410 may be a processor for executing reference Figure 1 The described method flow according to the embodiment of the present disclosure may be a single processing unit or multiple processing units for different actions.

[0059] Computer readable storage medium 420, for example, can be any medium capable of containing, storing, conveying, propagating or transmitting instructions. For example, readable storage media can include, but are not limited to, electrical, magnetic, optical, electromagnetic, infrared or semiconductor systems, devices, devices or propagation media. Specific examples of readable storage media include: magnetic storage devices, such as magnetic tapes or hard disks (HDD); optical storage devices, such as compact disks (CD-ROMs); memory, such as random access memory (RAM) or flash memory; and / or wired / wireless communication links.

[0060] The computer readable storage medium 420 may include a computer program 421, which may include code / computer executable instructions, which when executed by the processor 410 causes the processor 410 to perform, for example, the above-mentioned combination of Figure 1 The described method sequences and any variations thereof.

[0061] Computer program 421 may be configured to have, for example, computer program code including computer program modules. For example, in an exemplary embodiment, the code in computer program 421 may include one or more program modules, for example, 421A, module 421B, ... It should be noted that the division method and number of modules are not fixed, and those skilled in the art may use appropriate program modules or program module combinations according to actual conditions. When these program module combinations are executed by processor 410, processor 410 may execute, for example, the above combination of Figure 1-2 The described method sequences and any variations thereof.

[0062] According to an embodiment of the present invention, at least one of the three-level cache construction module 410, the request acquisition module 420, the first-level cache identification module 430, the second-level cache identification module 440 and the data acquisition module 450 can be implemented as a reference Figure 4The computer program modules described above, when executed by the processor 410, can implement the corresponding operations described above.

[0063] The present disclosure also provides a computer-readable medium, which may be included in the device / apparatus / system described in the above embodiments; or may exist independently without being assembled into the device / apparatus / system. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed, the method according to the embodiment of the present disclosure is implemented.

[0064] It will be appreciated by those skilled in the art that the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways, even if such combinations and / or combinations are not explicitly described in the present disclosure. In particular, the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways without departing from the spirit and teachings of the present disclosure. All of these combinations and / or combinations fall within the scope of the present disclosure.

[0065] Although the present disclosure has been shown and described with reference to specific exemplary embodiments of the present disclosure, it should be understood by those skilled in the art that various changes in form and details may be made to the present disclosure without departing from the spirit and scope of the present disclosure as defined by the appended claims and their equivalents. Therefore, the scope of the present disclosure should not be limited to the above-mentioned embodiments, but should be determined not only by the appended claims, but also by the equivalents of the appended claims.

Claims

1. A cache classification method based on query request path, characterized in that: include: Constructing a three-level cache system, the three-level cache system comprising a first-level cache, a second-level cache and a third-level cache, the first-level cache using a preset sequence number of the three-level cache system as a key value for access, the second-level cache using a data access path as a key value for access, and the third-level cache using user information as a key value for access; Obtaining the user's data access request and identifying the data access path and user information; Access the first-level cache according to the preset sequence number, and verify the data access path through the first Bloom filter in the first-level cache; wherein the verification of the data access path through the first Bloom filter in the first-level cache includes: presetting multiple first data access paths in the first Bloom filter, each first data access path corresponds to a key value of the second-level cache; when the data access path is not included in the multiple first data access paths, the data access path verification fails; when the data access path is included in the multiple first data access paths, the data access path verification passes; When the data access path is verified, the corresponding second-level cache is accessed based on the data access path, and the user information is verified through the second Bloom filter in the second-level cache; wherein the verification of the user information through the second Bloom filter in the second-level cache includes: presetting a plurality of first user information in the second Bloom filter, each first user information corresponding to a key value of the third-level cache; when the user information is not included in the plurality of first user information, the user information verification fails; when the data access path is included in the plurality of first user information, the user information verification passes; When the user information is verified, the third-level cache is accessed based on the user information to obtain cache data.

2. The method according to claim 1, characterized in that The first-level cache is subordinate to a plurality of second-level caches, and each of the second-level caches corresponds to a plurality of third-level caches.

3. The method according to claim 1, characterized in that Also includes: If the data access request is a data access request initiated by the user for the first time, executing a database query according to the request information in the data access request to obtain the cached data; The cache data is assigned a key value of the first cache, and the data access path of the user is stored in the designated second-level cache and the first Bloom filter, and the user information of the user is stored in the designated third-level cache and the second Bloom filter.

4. The method according to claim 1, characterized in that: Also includes: If the data access path verification fails, an error prompt message is returned to the user.

5. The method according to claim 3, characterized in that: Also includes: If the user information verification fails, the user's data access request is treated as a data access request for the first access.

6. A cache classification device based on query request path, characterized in that: include: A three-level cache construction module is used to construct a three-level cache system, wherein the three-level cache system includes a first-level cache, a second-level cache, and a third-level cache, wherein the first-level cache performs access using a preset sequence number of the three-level cache system as a key value, the second-level cache performs access using a data access path as a key value, and the third-level cache performs access using user information as a key value; A request acquisition module is used to obtain a user's data access request and identify the data access path and user information; A first-level cache identification module, used for accessing the first-level cache according to the preset sequence number, and verifying the data access path through the first Bloom filter in the first-level cache; wherein the verification of the data access path through the first Bloom filter in the first-level cache comprises: presetting a plurality of first data access paths in the first Bloom filter, each first data access path corresponding to a key value of the second-level cache; when the data access path is not included in the plurality of first data access paths, the data access path verification fails; when the data access path is included in the plurality of first data access paths, the data access path verification passes; A second-level cache identification module, used for accessing the corresponding second-level cache based on the data access path when the data access path verification passes, and verifying the user information through the second Bloom filter in the second-level cache; wherein the verification of the user information through the second Bloom filter in the second-level cache includes: presetting a plurality of first user information in the second Bloom filter, each first user information corresponding to a key value of the third-level cache; when the user information is not included in the plurality of first user information, the user information verification fails; when the data access path is included in the plurality of first user information, the user information verification passes; The data acquisition module is used to access the third-level cache based on the user information to obtain cache data when the user information is verified.

7. An electronic device comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, each step of the cache grading method based on the query request path described in any one of claims 1 to 5 is implemented.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, each step of the cache grading method based on a query request path in any one of claims 1 to 5 is implemented.

Images