CN115913646B - Method and device for intercepting blacklist object, electronic equipment and storage medium - Google Patents
Method and device for intercepting blacklist object, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN115913646B CN115913646B CN202211292696.0A CN202211292696A CN115913646B CN 115913646 B CN115913646 B CN 115913646B CN 202211292696 A CN202211292696 A CN 202211292696A CN 115913646 B CN115913646 B CN 115913646B
- Authority
- CN
- China
- Prior art keywords
- structured
- blacklist
- blacklist data
- data
- cache
- 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
- 238000000034 method Methods 0.000 title claims abstract description 64
- 238000004422 calculation algorithm Methods 0.000 claims description 10
- 238000006243 chemical reaction Methods 0.000 claims description 9
- 230000004044 response Effects 0.000 claims description 6
- 230000000903 blocking effect Effects 0.000 claims description 5
- 230000008859 change Effects 0.000 claims description 5
- 239000012634 fragment Substances 0.000 claims 8
- 238000004891 communication Methods 0.000 description 6
- 230000008901 benefit Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 230000008033 biological extinction Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000032683 aging Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000000802 evaporation-induced self-assembly Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000001172 regenerating effect Effects 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a method, a device, electronic equipment and a storage medium for intercepting a blacklist object; wherein the method comprises the following steps: responding to a blacklist object query request sent by a terminal, and judging timeliness of first structured blacklist data, wherein the first structured blacklist data indicates structured blacklist data in a local cache of a target application server, and the structured blacklist data indicates a finite state set of original blacklist data; if the first structured blacklist data fails, consistency judgment is carried out on the first structured blacklist data and second structured blacklist data, and the second structured blacklist data indicates structured blacklist data in the distributed cache; if the first structured blacklist data is consistent with the second structured blacklist data, performing state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data; and if the matching is successful, intercepting the blacklist object to be queried.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a method and apparatus for intercepting a blacklist object, an electronic device, and a storage medium.
Background
When the data volume of the blacklist data becomes large and the interception efficiency is required to be improved, how to ensure the blacklist interception efficiency in a distributed system and reduce the occupation of resources is a technical problem which needs to be solved in the blacklist interception.
In the prior art, all list data in a database are directly marked or classified by a blacklist, and when a request to be intercepted is corresponding, whether the corresponding object is the blacklist object is inquired from all list data, so that the technical problems of low efficiency and excessive occupation of system resources exist when massive blacklist data are processed in the mode.
Disclosure of Invention
In view of the above, the present invention aims to provide a method, an apparatus, an electronic device, and a storage medium for intercepting blacklist objects, so as to improve the efficiency of intercepting massive blacklist data and reduce the occupation of system resources.
In a first aspect, an embodiment of the present invention provides a method for intercepting a blacklist object, which is applied to a target application server in a distributed system, where the target application server is an application server indicated by a blacklist query request sent by a terminal, and the distributed system includes a plurality of application servers, where the method includes: responding to a blacklist object query request sent by a terminal, and performing timeliness judgment on first structured blacklist data, wherein the first structured blacklist data is used for indicating structured blacklist data in a local cache of the target application server, and the structured blacklist data is used for indicating a finite state set of original blacklist data; if the first structured blacklist data fails, consistency judgment is carried out on the first structured blacklist data and second structured blacklist data, wherein the second structured blacklist data is used for indicating structured blacklist data in a distributed cache of the distributed system; if the first structured blacklist data is consistent with the second structured blacklist data, performing state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data; and if the matching is successful, intercepting the blacklist object to be queried.
In a second aspect, an embodiment of the present invention provides an interception device for a blacklist object, which is applied to a target application server in a distributed system, where the target application server is an application server indicated by a blacklist query request sent by a terminal, and the distributed system includes a plurality of application servers, where the device includes: the response module is used for responding to a blacklist object query request sent by the terminal and judging timeliness of first structured blacklist data, wherein the first structured blacklist data is used for indicating structured blacklist data in a local cache of the target application server, and the structured blacklist data is used for indicating a finite state set of original blacklist data; the judging module is used for judging consistency of the first structured blacklist data and second structured blacklist data if the first structured blacklist data fails, wherein the second structured blacklist data is used for indicating structured blacklist data in a distributed cache of the distributed system; the matching module is used for carrying out state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data if the first structured blacklist data is not invalid; and the interception module is used for intercepting the blacklist object to be inquired if the matching is successful.
In a third aspect, an embodiment of the present invention provides an electronic device, including a processor and a memory, where the memory stores machine executable instructions executable by the processor, and the processor executes the machine executable instructions to implement the method for intercepting a blacklist object.
In a fourth aspect, embodiments of the present invention provide a machine-readable storage medium storing machine-executable instructions that, when invoked and executed by a processor, cause the processor to implement the method of blocking a blacklisted object described above.
The embodiment of the invention has the following beneficial effects:
According to the method, the device, the electronic equipment and the storage medium for intercepting the blacklist object, the blacklist object query request sent by the terminal is responded, timeliness judgment is carried out on first structured blacklist data, the first structured blacklist data is used for indicating structured blacklist data in a local cache of the target application server, and the structured blacklist data is used for indicating a finite state set of original blacklist data; if the first structured blacklist data fails, consistency judgment is carried out on the first structured blacklist data and second structured blacklist data, wherein the second structured blacklist data is used for indicating structured blacklist data in a distributed cache of the distributed system; if the first structured blacklist data is consistent with the second structured blacklist data, performing state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data; and if the matching is successful, intercepting the blacklist object to be queried. In the method, when blacklist object inquiry is carried out in a distributed system, whether structured blacklist data in a local cache is invalid is judged first, if yes, whether the structured blacklist data in the distributed cache is consistent with the structured blacklist data in the local cache is judged, if yes, the original blacklist data is unchanged, state matching of the blacklist object to be inquired can still be carried out through the structured blacklist data in the local cache, if matching is successful, the blacklist object to be inquired can be intercepted quickly, repeated inquiry of a database is not needed, and therefore occupation of system resources is reduced. The structured blacklist data is a finite state set, and the matching efficiency can still be ensured when the massive blacklist data are processed.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
In order to make the above objects, features and advantages of the present invention more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are needed in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are some embodiments of the invention and that other drawings may be obtained from these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of an embodiment of a method for intercepting blacklisted objects according to an embodiment of the present invention;
FIG. 2 is a flowchart of another embodiment of a method for intercepting blacklisted objects according to an embodiment of the present invention;
Fig. 3 is a schematic diagram of an interception device for blacklist objects according to an embodiment of the present invention;
Fig. 4 is a schematic diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
A distributed system is a loosely coupled system constructed by interconnecting a plurality of servers over a network, and is a software system built on top of the network that possesses software characteristics, not hardware. One or more layers of application service programs between the server and the client are called an application server (Application Server), the target application server refers to one or more layers of application service programs between the terminal sending the blacklist object query request and the server, the local cache of the target application server refers to the memory of the target application server, and the locally cached data of the application server are stored separately by taking the application server as a unit.
The warehouse used for organizing, storing and managing data in the distributed system is a database, the target database is a database corresponding to the target application server and storing original blacklist data, if the original blacklist data of the target application server a is stored in the database 1, the database 1 is the target database. The distributed cache is managed and controlled by a server in the distributed system, and data is stored by a plurality of nodes.
It can be understood that the execution body of the present invention may be an interception device of a blacklist object, and may also be a terminal or a server, which is not limited herein. The embodiment of the invention is described by taking a server as an execution main body as an example.
It should be noted that the present invention is applied to a target application server in a distributed system, where the target application server is an application server indicated by a blacklist query request sent by a terminal, and the distributed system includes a plurality of application servers.
For easy understanding, the following describes a specific flow of an embodiment of the present invention, referring to fig. 1, and an embodiment of a method for intercepting a blacklist object in an embodiment of the present invention includes:
Step S10, responding to a blacklist object query request sent by a terminal, and judging timeliness of first structured blacklist data, wherein the first structured blacklist data is used for indicating structured blacklist data in a local cache of a target application server, and the structured blacklist data is used for indicating a finite state set of original blacklist data;
It will be appreciated that a distributed system is a loosely coupled system of multiple processors interconnected by communication lines, where for any processor in the distributed system, the resources of the other processors are remote resources, with only their own resources being local resources. In one embodiment, the distributed system is composed of a plurality of servers, and the target application server refers to a server pointed to by the blacklist object query request in the distributed system, and may be any server in the distributed system. Since the blacklist object query request is usually sent by an application program of the user terminal, the target application server is further used for indicating a server operated by the target application program in the distributed system, where the target application program refers to a sending program of the blacklist object query request.
In one embodiment, the blacklist object query request sent by the terminal includes an application server identifier and a blacklist object to be queried, and when the blacklist object query request sent by the terminal is responded, the blacklist object query request is parsed to obtain the application server identifier and the blacklist object to be queried, wherein the application server identifier is used for indicating a target application server.
It should be noted that, the original blacklist data refers to at least one blacklist object data stored in the database, including all blacklist data within a search range of the blacklist object to be queried, for example, if the blacklist object to be queried is a registered user of a certain application, then the original blacklist data includes blacklist user data in all registered users of the application, and if, if the blacklist object to be queried is a merchant in a certain area, then the original blacklist data includes blacklist merchants in all merchants in the area, which is not limited herein.
In this embodiment, the first structured blacklist data is data stored in advance in a local cache of the target application server, including a finite state set of the original blacklist data. In one embodiment, the first structured blacklist data may be data obtained by performing finite state data structure conversion on the original blacklist data, or may be data directly obtained from a distributed system, which is not limited herein.
It can be understood that the finite state set includes character states of all blacklist objects in the original blacklist data, the character states include a start state, an extinction state and an end state, and for each character in the blacklist object to be queried, the character states of each character can be matched through the finite state set, so that whether the blacklist object to be queried is contained in the original blacklist data can be rapidly determined, the situation that a remote database or a local database needs to be accessed for each query is avoided, occupation of system resources is reduced, and meanwhile, interception efficiency of the blacklist data is improved.
In this embodiment, in order to ensure freshness of local cache data, the first structured blacklist data has a certain timeliness, and when the first structured blacklist data is stored in the local cache of the target application server, the timeliness parameter corresponding to the first structured blacklist data is determined according to the storing time, and is used for indicating whether the first structured blacklist data is invalid or not.
Step S20, if the first structured blacklist data fails, consistency judgment is carried out on the first structured blacklist data and second structured blacklist data, wherein the second structured blacklist data is used for indicating structured blacklist data in a distributed cache of the distributed system;
it should be noted that, the distributed caches of the distributed system support multi-process sharing, and when the cache of any process changes, the changed data can be synchronized to the caches of other processes. Based on the above, structured blacklist data, namely second structured blacklist data, is pre-stored in a distributed cache of the distributed system, and is used for data synchronization with each application server. By judging the data consistency of the distributed cache and the local cache, the system resources required by the local cache to directly read the data from the database can be reduced, and the interception efficiency of the blacklist data can be improved.
In one embodiment, if the timeliness parameter corresponding to the first structured blacklist data indicates that the first structured blacklist data has expired, that is, the first structured blacklist data fails, then consistency judgment is performed on the first structured blacklist data and the second structured blacklist data, so as to verify whether the failed structured blacklist data in the local cache is synchronous with the structured blacklist data in the distributed cache, and further judge whether the failed structured blacklist data in the local cache can be used for blacklist query.
In one embodiment, the information summary algorithm is used for respectively performing information summary calculation on the first structured blacklist data and the second structured blacklist data to obtain a first information summary and a second information summary, and then consistency judgment is performed on the first information summary and the second information summary to determine whether the first structured blacklist data and the second structured blacklist data are consistent or not, if the first information summary and the second information summary are consistent, the first structured blacklist data and the second structured blacklist data are consistent, and if the first information summary and the second information summary are inconsistent, the first structured blacklist data and the second structured blacklist data are inconsistent. Because the same information abstract can be obtained only by the same information abstract algorithm, whether the first structured blacklist data and the second structured blacklist data are consistent or not can be rapidly determined by the information abstract algorithm, and therefore the interception efficiency of the blacklist data is improved.
In one embodiment, the distributed cache tag is also used to indicate timeliness of structured blacklist data in the distributed cache. The step S20 includes: if the first structured blacklist data fails, judging timeliness of the second structured blacklist data; and if the second structured blacklist data does not fail, consistency judgment is carried out on the first structured blacklist data and the second structured blacklist data, wherein the second structured blacklist data is used for indicating the structured blacklist data in the distributed cache of the distributed system. If the second structured blacklist data fails, the structured blacklist data in the distributed cache and the local cache are emptied, and the latest blacklist data in the target database is subjected to conversion and serialization of a finite state data structure to obtain the latest structured blacklist data; and storing the latest structured blacklist data into a distributed cache, and synchronizing the structured blacklist data in the distributed cache to local caches of all application servers or target application servers to obtain the latest first structured blacklist data.
Step S30, if the first structured blacklist data is consistent with the second structured blacklist data, performing state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data;
in this embodiment, if the first structured blacklist data and the second structured blacklist data are consistent, it is indicated that the structured blacklist data in the distributed cache is the same as the structured blacklist data in the local cache, and because the structured blacklist data in the distributed cache is always consistent with the original blacklist data (the content is consistent and the data structure is different), it is indirectly indicated that the structured blacklist data in the local cache is also consistent with the original blacklist data (the content is consistent and the data structure is different), and at this time, the state matching of the blacklist object to be queried can be performed directly through the structured blacklist data in the local cache without obtaining the latest blacklist data from the distributed cache or the database again, thereby greatly improving the efficiency of blacklist data interception.
In one embodiment, the finite state set includes character segments and character states corresponding to the character segments, for example, assuming that a blacklist object is "Shenzhen company", the character segments of the blacklist object in the finite state set include: each character segment corresponds to a character state, and is used for indicating whether the character segment is in an ending state, for example, the character states corresponding to the deep segment, the Shenzhen segment and the Shenzhen segment are all in non-ending states, and the character state corresponding to the Shenzhen segment is in ending states, which are not limited herein. Based on the above, character states in the finite state set corresponding to the first structured blacklist data are matched one by one and orderly, if any character segment in the blacklist object to be queried corresponds to the character state in the finite state set to be an end state, the matching is successful, if any character segment in the blacklist object to be queried does not have the corresponding character state in the finite state set, or the character state corresponding to the last character segment in the blacklist object to be queried is a non-end state, the matching is failed. According to the method and the device, the blacklist object to be queried can be quickly matched through the finite state set, so that the interception efficiency of the blacklist data is improved.
And step S40, if the matching is successful, intercepting the blacklist object to be queried.
It can be understood that if the matching is successful, it indicates that the blacklist object to be queried is a blacklist object, and then the blacklist object to be queried needs to be intercepted. Specifically, if the matching is successful, corresponding operation restriction is performed on the blacklist object to be queried. For example, assuming that the blacklist object to be queried a is successfully matched, the login operation, comment operation, purchase operation, etc. of a in the target application program may be limited, and in particular, the method is not limited herein.
According to the blacklist object interception method provided by the embodiment, when blacklist object inquiry is carried out in a distributed system, whether structured blacklist data in a local cache is invalid is judged first, if so, whether the structured blacklist data in the distributed cache is consistent with the structured blacklist data in the local cache is judged, if so, the original blacklist data is unchanged, state matching of the blacklist object to be inquired can still be carried out through the structured blacklist data in the local cache, and if the matching is successful, the blacklist object to be inquired can be intercepted quickly without repeated inquiry of a database, so that occupation of system resources is reduced. The structured blacklist data is a finite state set, and the matching efficiency can still be ensured when the massive blacklist data are processed.
Referring to fig. 2, another embodiment of a method for intercepting a blacklist object according to an embodiment of the present invention includes:
step S201, responding to the change of original blacklist data in a target database, and carrying out finite state data structure conversion and serialization processing on the changed original blacklist data through a preset finite automaton determining algorithm to obtain original structured blacklist data;
In this embodiment, in order to ensure freshness of the queried data when querying the blacklist object, when the original blacklist data in the target database is changed, data structure conversion and serialization processing are performed on the changed original blacklist data to generate original structured blacklist data for synchronization to the distributed cache. In the step, a preset finite automaton (DETERMINISTIC FINITE Automaton, DFA) algorithm can be converted from one state to another state through a series of events, the conversion of the finite state data structure is carried out on the changed original blacklist data through the DFA algorithm to obtain a finite state set, and then the serialization processing is carried out on the finite state set to obtain the original structured blacklist data.
Step S202, storing original structured blacklist data into a distributed cache to obtain second structured blacklist data, and marking the second structured blacklist data to obtain a distributed cache mark, wherein the distributed cache mark is used for indicating the latest second structured blacklist data in the distributed cache;
in the step, after the original structured blacklist data is obtained, the original structured blacklist data is stored in the distributed cache to obtain second structured blacklist data, wherein when the original structured blacklist data is stored in the distributed cache, the original structured blacklist data in the distributed cache can be directly covered, so that only one latest structured blacklist data is ensured to be stored in the distributed cache, version conflict among the structured blacklist data stored at different moments is avoided, and the cost of version management is reduced. And then marking the second structured blacklist data to obtain a distributed cache mark, wherein the distributed cache mark is used for indicating the latest structured blacklist data in the distributed cache. By way of example and not limitation, the distributed cache tag may be a time tag, such as a time of storage when the original structured blacklist data is stored into the distributed cache, may be in a time format: 20221013-17:00:00, also in timestamp format: 1665652584664, other formats are also possible, and are not limited in this particular context. The distributed cache tag may also be any other form of unique identification, and is not limited in this particular regard.
In one embodiment, after step S202, the method further includes: acquiring second structured blacklist data and a distributed cache mark in a distributed cache through all application servers in the distributed system; all application servers respectively perform deserialization processing on the obtained structured blacklist data, and store the structured blacklist data subjected to deserialization processing and the obtained distributed cache marks into local caches corresponding to the application servers; and generating timeliness marks of the structured blacklist data in the local caches of all the application servers to obtain local cache marks respectively corresponding to all the application servers.
In this embodiment, in order to ensure data synchronization of all application servers in the distributed system, after original structured blacklist data is stored in a distributed cache (first synchronization of the distributed cache and a local cache), or when structured blacklist data in the local cache needs to be updated (non-first synchronization of the distributed cache and the local cache), second structured blacklist data and a distributed cache tag in the distributed cache are acquired through all application servers in the distributed system, then, in order to improve data processing efficiency of the local cache, all application servers perform deserialization processing on the acquired structured blacklist data, the deserialized structured blacklist data can be directly used for blacklist object query, the deserialized structured blacklist data and the acquired distributed cache tag are stored in local caches corresponding to the application servers, so as to obtain structured blacklist data and a distributed cache tag in the local cache, and then, ageing performance tag generation is performed on the structured blacklist data in the local cache, so as to obtain local cache tags corresponding to all application servers. It can be seen that structured blacklist data, distributed cache tags, and local cache tags are stored in the local cache.
Step S203, responding to a blacklist object query request sent by a terminal, and judging timeliness of first structured blacklist data, wherein the first structured blacklist data is used for indicating structured blacklist data in a local cache of a target application server, and the structured blacklist data is used for indicating a finite state set of original blacklist data;
In one embodiment, the determining of the timeliness of the first structured blacklist data includes: acquiring a local cache mark of a target application server, wherein the local cache mark is used for indicating the storage time of the latest structured blacklist data to the local cache of the target application server; judging whether the first structured blacklist data is invalid or not according to the preset cache invalidation time and storage time; in this embodiment, timeliness judgment is performed on the first structured blacklist data through the local cache mark, specifically, the local cache mark of the target application server is obtained, whether the first structured blacklist data is expired is judged according to the local cache mark and the cache expiration time, if so, the first structured blacklist data is expired, and if not, the first structured blacklist data is not expired. In one embodiment, the local cache mark is overlapped with a preset cache invalidation time to obtain invalidation time of the first structured blacklist data, and whether the first structured blacklist data is invalidated or not is judged according to the invalidation time. For example, assuming that the local cache is labeled 1665652584664 and the preset cache expiration time is 60000 (1 minute), the expiration time is 1665652584664+60000= 1665652644664, which is not limited herein. If the current time is greater than the failure time, determining that the first structured blacklist data fails, otherwise, not failing.
In one embodiment, if the first structured blacklist data does not fail, the state matching of the blacklist object to be queried indicated by the blacklist object query request can be directly performed through the first structured blacklist data without performing subsequent judgment; and if the matching is successful, intercepting the blacklist object to be queried.
Step S204, if the first structured blacklist data fails, consistency judgment is carried out on the first structured blacklist data and second structured blacklist data, wherein the second structured blacklist data is used for indicating structured blacklist data in a distributed cache of the distributed system;
In an embodiment, if the first structured blacklist data fails, performing consistency determination on the first structured blacklist data and the second structured blacklist data includes: if the first structured blacklist data fails, a distributed cache mark in the distributed cache is obtained, and the distributed cache mark in the distributed cache is compared with the distributed cache mark in the local cache in consistency to judge whether the first structured blacklist data and the second structured blacklist data are consistent, wherein the distributed cache mark in the local cache and the first structured blacklist are stored simultaneously. In this embodiment, if the first structured blacklist data fails, a distributed cache tag in the distributed cache is obtained, and then the distributed cache tag in the distributed cache is compared with the distributed cache tag in the local cache in consistency, so as to determine whether the first structured blacklist data and the second structured blacklist data are consistent. If the distributed cache tag in the distributed cache is consistent with the distributed cache tag in the local cache, determining that the first structured blacklist data and the second structured blacklist data are consistent, otherwise, not consistent.
In one embodiment, if the first structured blacklist data fails and the first structured blacklist data and the second structured blacklist data are inconsistent, the structured blacklist data in the local cache is emptied; acquiring the latest structured blacklist data and a distributed cache mark in a distributed cache, and storing the acquired structured blacklist data and the distributed cache mark in a local cache to obtain the latest first structured blacklist data and the distributed cache mark in the local cache; and generating a timeliness mark of the latest first structured blacklist data to obtain the latest local cache mark.
In this embodiment, if the first structured blacklist data fails and the first structured blacklist data and the second structured blacklist data are inconsistent, it is indicated that the original blacklist data has been changed, and therefore, the structured blacklist data in the local cache needs to be updated. Specifically, firstly deleting structured blacklist data in a local cache, then acquiring the latest structured blacklist data and a distributed cache mark from a distributed cache, and storing the latest structured blacklist data and the distributed cache mark in the local cache, so as to obtain the latest first structured blacklist data and the distributed cache mark in the local cache, and regenerating the latest timeliness mark corresponding to the first structured blacklist data to obtain the latest local cache mark. It can be appreciated that, because the structured blacklist data in the distributed cache is updated immediately when the original blacklist data is changed, the structured blacklist data obtained from the distributed cache can be guaranteed to be structured blacklist data corresponding to the changed original blacklist data, which is an advantage of the hierarchical cache mechanism.
In one embodiment, if the first structured blacklist data fails and the first structured blacklist data is consistent with the second structured blacklist data, the local cache tag in the local cache is extended in timeliness to obtain the latest local cache tag. In this embodiment, if the first structured blacklist data fails, and the first structured blacklist data is consistent with the second structured blacklist data, which indicates that the original blacklist data is unchanged, but the structured blacklist data of the local cache reaches the update period, then, in addition to the need of directly performing state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data, the need of performing timeliness extension on the local cache tag in the local cache is also required, and specifically, overlapping the local cache tag in the local cache with the preset update period duration to obtain the latest local cache tag. For example, assuming that the local cache is labeled 1665652584664 and the preset update period is 120000 (2 minutes), the latest local cache is labeled 1665652584664+120000= 1665652704664, which is not limited herein.
Step S205, if the first structured blacklist data is consistent with the second structured blacklist data, performing state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data;
In one embodiment, performing, by the first structured blacklist data, state matching on the blacklist object to be queried indicated by the blacklist object query request, including: performing character division on the blacklist object to be inquired, and performing character-by-character state matching from the first structured blacklist data, wherein the states comprise a starting state, an extinction state and an ending state; if the state of the last character in the blacklist object to be queried, which is matched in the first structured blacklist data, is an ending state, the matching is successful. In this embodiment, when the blacklist object to be queried indicated by the blacklist object query request is subjected to state matching through the first structured blacklist data, firstly performing character division and state determination on the blacklist object to be queried to obtain at least one target character and a target state corresponding to each target character, then performing character-by-character state matching from the first structured blacklist data according to a character sequence, judging whether a first target character in the blacklist object to be queried exists in the first structured blacklist data, judging whether the first target character is in a starting state in the first structured blacklist data and a target state corresponding to the blacklist object to be queried exist in the first structured blacklist data, if yes, judging whether the target character in the first structured blacklist data exists in a middle position in the blacklist object to be queried and the target state corresponding to the blacklist object to be queried are all dead states, if the first target character in the first structured blacklist data is in the first structured blacklist data, judging whether the first target character in the middle position is in the blacklist object to be queried and the blacklist object to be queried is in the last blacklist data, and if the first blacklist object to be queried is in the blacklist is in the blackout state, and the blackout state is out state is the last in the blackout state to be queried.
And step S206, if the matching is successful, intercepting the blacklist object to be queried.
The execution of step S206 is similar to that of step S104, and detailed description thereof will be omitted herein.
In response to the above method embodiment, referring to a schematic diagram of an interception device for blacklist objects shown in fig. 3, the interception device is applied to a target application server in a distributed system, where the target application server is an application server indicated by a blacklist query request sent by a terminal, and the distributed system includes a plurality of application servers, and the apparatus includes:
The response module 30 is configured to perform timeliness judgment on first structured blacklist data in response to a blacklist object query request sent by the terminal, where the first structured blacklist data is used to indicate structured blacklist data in a local cache of the target application server, and the structured blacklist data is used to indicate a finite state set of original blacklist data;
A judging module 32, configured to judge consistency of the first structured blacklist data and second structured blacklist data if the first structured blacklist data fails, where the second structured blacklist data is used to indicate structured blacklist data in a distributed cache of the distributed system;
the matching module 34 is configured to perform state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data if the first structured blacklist data is not invalid;
and the interception module 36 is configured to intercept the blacklist object to be queried if the matching is successful.
According to the blocking device for the blacklist object, when blacklist object inquiry is carried out in the distributed system, whether the structured blacklist data in the local cache is invalid is judged first, if yes, whether the structured blacklist data in the distributed cache is consistent with the structured blacklist data in the local cache is judged, if yes, the original blacklist data is not changed, state matching of the blacklist object to be inquired can still be carried out through the structured blacklist data in the local cache, if matching is successful, the blacklist object to be inquired can be rapidly blocked without repeated inquiry of a database, and therefore occupation of system resources is reduced. The structured blacklist data is a finite state set, and the matching efficiency can still be ensured when the massive blacklist data are processed.
The device further comprises: the changing module is used for responding to the change of the original blacklist data in the target database, and carrying out finite state data structure conversion and serialization processing on the changed original blacklist data through a preset finite automaton determining algorithm to obtain original structured blacklist data; and storing the original structured blacklist data into a distributed cache to obtain second structured blacklist data, and marking the second structured blacklist data to obtain a distributed cache mark, wherein the distributed cache mark is used for indicating the latest second structured blacklist data in the distributed cache.
The device further comprises: the first storage module is used for acquiring second structured blacklist data and a distributed cache mark in the distributed cache through all application servers in the distributed system; all application servers respectively perform deserialization processing on the obtained structured blacklist data, and store the structured blacklist data subjected to deserialization processing and the obtained distributed cache marks into local caches corresponding to the application servers; and generating timeliness marks of the structured blacklist data in the local caches of all the application servers to obtain local cache marks respectively corresponding to all the application servers.
The device further comprises: the second storage module is used for clearing the structured blacklist data in the local cache if the first structured blacklist data fails and the first structured blacklist data is inconsistent with the second structured blacklist data; acquiring the latest structured blacklist data and a distributed cache mark in a distributed cache, and storing the acquired structured blacklist data and the distributed cache mark in a local cache to obtain the latest first structured blacklist data and the distributed cache mark in the local cache; and generating a timeliness mark of the latest first structured blacklist data to obtain the latest local cache mark.
The device further comprises: and the delay module is used for carrying out timeliness extension on the local cache mark in the local cache of the target application server if the first structured blacklist data fails and the first structured blacklist data is consistent with the second structured blacklist data, so as to obtain the latest local cache mark.
The response module is further configured to: acquiring a local cache mark of a target application server, wherein the local cache mark is used for indicating the storage time of the latest structured blacklist data to the local cache of the target application server; judging whether the first structured blacklist data is invalid or not according to the preset cache invalidation time and storage time.
The above judging module is further configured to: if the first structured blacklist data fails, a distributed cache mark in the distributed cache is obtained, and the distributed cache mark in the distributed cache and the distributed cache mark in the local cache are subjected to consistency comparison to judge whether the first structured blacklist data and the second structured blacklist data are consistent, and the distributed cache mark in the local cache and the first structured blacklist are simultaneously stored.
The matching module is further used for: performing character division on the blacklist object to be inquired, and performing character-by-character state matching from the first structured blacklist data; if the state of the last character in the blacklist object to be queried, which is matched in the first structured blacklist data, is an ending state, the matching is successful.
The embodiment also provides an electronic device, which comprises a processor and a memory, wherein the memory stores machine executable instructions capable of being executed by the processor, and the processor executes the machine executable instructions to realize the method for intercepting the blacklist object. The electronic device may be a server or a terminal device.
Referring to fig. 4, the electronic device includes a processor 100 and a memory 101, the memory 101 storing machine executable instructions that can be executed by the processor 100, the processor 100 executing the machine executable instructions to implement the above-described blacklist object interception method.
Further, the electronic device shown in fig. 4 further includes a bus 102 and a communication interface 103, and the processor 100, the communication interface 103, and the memory 101 are connected through the bus 102.
The memory 101 may include a high-speed random access memory (RAM, random Access Memory), and may further include a non-volatile memory (non-volatile memory), such as at least one disk memory. The communication connection between the system network element and at least one other network element is implemented via at least one communication interface 103 (which may be wired or wireless), and may use the internet, a wide area network, a local network, a metropolitan area network, etc. Bus 102 may be an ISA bus, a PCI bus, an EISA bus, or the like. The buses may be classified as address buses, data buses, control buses, etc. For ease of illustration, only one bi-directional arrow is shown in FIG. 4, but not only one bus or type of bus.
The processor 100 may be an integrated circuit chip with signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in the processor 100 or by instructions in the form of software. The processor 100 may be a general-purpose processor, including a central processing unit (Central Processing Unit, abbreviated as CPU), a network processor (Network Processor, abbreviated as NP), etc.; but may also be a digital signal Processor (DIGITAL SIGNAL Processor, DSP), application Specific Integrated Circuit (ASIC), field-Programmable gate array (FPGA) or other Programmable logic device, discrete gate or transistor logic device, discrete hardware components. The disclosed methods, steps, and logic blocks in the embodiments of the present invention may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present invention may be embodied directly in the execution of a hardware decoding processor, or in the execution of a combination of hardware and software modules in a decoding processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in the memory 101, and the processor 100 reads the information in the memory 101, and in combination with its hardware, performs the steps of the method of the foregoing embodiment, for example:
Responding to a blacklist object query request sent by a terminal, and judging timeliness of first structured blacklist data, wherein the first structured blacklist data is used for indicating structured blacklist data in a local cache of a target application server, and the structured blacklist data is used for indicating a finite state set of original blacklist data; if the first structured blacklist data fails, consistency judgment is carried out on the first structured blacklist data and second structured blacklist data, wherein the second structured blacklist data is used for indicating structured blacklist data in a distributed cache of the distributed system; if the first structured blacklist data is consistent with the second structured blacklist data, performing state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data; and if the matching is successful, intercepting the blacklist object to be queried.
In the method, when blacklist object inquiry is carried out in a distributed system, whether structured blacklist data in a local cache is invalid is judged first, if yes, whether the structured blacklist data in the distributed cache is consistent with the structured blacklist data in the local cache is judged, if yes, the original blacklist data is unchanged, state matching of the blacklist object to be inquired can still be carried out through the structured blacklist data in the local cache, if matching is successful, the blacklist object to be inquired can be intercepted quickly, repeated inquiry of a database is not needed, and therefore occupation of system resources is reduced. The structured blacklist data is a finite state set, and the matching efficiency can still be ensured when the massive blacklist data are processed.
The method further comprises the following steps: responding to the change of original blacklist data in a target database, and carrying out finite state data structure conversion and serialization processing on the changed original blacklist data through a preset finite automaton determining algorithm to obtain original structured blacklist data; and storing the original structured blacklist data into a distributed cache to obtain second structured blacklist data, and marking the second structured blacklist data to obtain a distributed cache mark, wherein the distributed cache mark is used for indicating the latest second structured blacklist data in the distributed cache.
The method further comprises the following steps: acquiring second structured blacklist data and a distributed cache mark in a distributed cache through all application servers in the distributed system; all application servers respectively perform deserialization processing on the obtained structured blacklist data, and store the structured blacklist data subjected to deserialization processing and the obtained distributed cache marks into local caches corresponding to the application servers; and generating timeliness marks of the structured blacklist data in the local caches of all the application servers to obtain local cache marks respectively corresponding to all the application servers.
The method further comprises the following steps: if the first structured blacklist data fails and the first structured blacklist data is inconsistent with the second structured blacklist data, the structured blacklist data in the local cache is emptied; acquiring the latest structured blacklist data and a distributed cache mark in a distributed cache, and storing the acquired structured blacklist data and the distributed cache mark in a local cache to obtain the latest first structured blacklist data and the distributed cache mark in the local cache; and generating a timeliness mark of the latest first structured blacklist data to obtain the latest local cache mark.
The method further comprises the following steps: and if the first structured blacklist data fails and the first structured blacklist data is consistent with the second structured blacklist data, performing timeliness extension on the local cache mark in the local cache of the target application server to obtain the latest local cache mark.
The performing the timeliness judgment on the first structured blacklist data includes: acquiring a local cache mark of a target application server, wherein the local cache mark is used for indicating the storage time of the latest structured blacklist data to the local cache of the target application server; judging whether the first structured blacklist data is invalid or not according to the preset cache invalidation time and storage time.
If the first structured blacklist data fails, performing consistency judgment on the first structured blacklist data and the second structured blacklist data, including: if the first structured blacklist data fails, a distributed cache mark in the distributed cache is obtained, and the distributed cache mark in the distributed cache and the distributed cache mark in the local cache are subjected to consistency comparison to judge whether the first structured blacklist data and the second structured blacklist data are consistent, and the distributed cache mark in the local cache and the first structured blacklist are simultaneously stored.
The performing state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data includes: performing character division on the blacklist object to be inquired, and performing character-by-character state matching from the first structured blacklist data; if the state of the last character in the blacklist object to be queried, which is matched in the first structured blacklist data, is an ending state, the matching is successful.
The present embodiment also provides a machine-readable storage medium storing machine-executable instructions that, when invoked and executed by a processor, cause the processor to implement the above-described method of blocking a blacklist object, for example:
Responding to a blacklist object query request sent by a terminal, and judging timeliness of first structured blacklist data, wherein the first structured blacklist data is used for indicating structured blacklist data in a local cache of a target application server, and the structured blacklist data is used for indicating a finite state set of original blacklist data; if the first structured blacklist data fails, consistency judgment is carried out on the first structured blacklist data and second structured blacklist data, wherein the second structured blacklist data is used for indicating structured blacklist data in a distributed cache of the distributed system; if the first structured blacklist data is consistent with the second structured blacklist data, performing state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data; and if the matching is successful, intercepting the blacklist object to be queried.
In the method, when blacklist object inquiry is carried out in a distributed system, whether structured blacklist data in a local cache is invalid is judged first, if yes, whether the structured blacklist data in the distributed cache is consistent with the structured blacklist data in the local cache is judged, if yes, the original blacklist data is unchanged, state matching of the blacklist object to be inquired can still be carried out through the structured blacklist data in the local cache, if matching is successful, the blacklist object to be inquired can be intercepted quickly, repeated inquiry of a database is not needed, and therefore occupation of system resources is reduced. The structured blacklist data is a finite state set, and the matching efficiency can still be ensured when the massive blacklist data are processed.
The method further comprises the following steps: responding to the change of original blacklist data in a target database, and carrying out finite state data structure conversion and serialization processing on the changed original blacklist data through a preset finite automaton determining algorithm to obtain original structured blacklist data; and storing the original structured blacklist data into a distributed cache to obtain second structured blacklist data, and marking the second structured blacklist data to obtain a distributed cache mark, wherein the distributed cache mark is used for indicating the latest second structured blacklist data in the distributed cache.
The method further comprises the following steps: acquiring second structured blacklist data and a distributed cache mark in a distributed cache through all application servers in the distributed system; all application servers respectively perform deserialization processing on the obtained structured blacklist data, and store the structured blacklist data subjected to deserialization processing and the obtained distributed cache marks into local caches corresponding to the application servers; and generating timeliness marks of the structured blacklist data in the local caches of all the application servers to obtain local cache marks respectively corresponding to all the application servers.
The method further comprises the following steps: if the first structured blacklist data fails and the first structured blacklist data is inconsistent with the second structured blacklist data, the structured blacklist data in the local cache is emptied; acquiring the latest structured blacklist data and a distributed cache mark in a distributed cache, and storing the acquired structured blacklist data and the distributed cache mark in a local cache to obtain the latest first structured blacklist data and the distributed cache mark in the local cache; and generating a timeliness mark of the latest first structured blacklist data to obtain the latest local cache mark.
The method further comprises the following steps: and if the first structured blacklist data fails and the first structured blacklist data is consistent with the second structured blacklist data, performing timeliness extension on the local cache mark in the local cache of the target application server to obtain the latest local cache mark.
The performing the timeliness judgment on the first structured blacklist data includes: acquiring a local cache mark of a target application server, wherein the local cache mark is used for indicating the storage time of the latest structured blacklist data to the local cache of the target application server; judging whether the first structured blacklist data is invalid or not according to the preset cache invalidation time and storage time.
If the first structured blacklist data fails, performing consistency judgment on the first structured blacklist data and the second structured blacklist data, including: if the first structured blacklist data fails, a distributed cache mark in the distributed cache is obtained, and the distributed cache mark in the distributed cache and the distributed cache mark in the local cache are subjected to consistency comparison to judge whether the first structured blacklist data and the second structured blacklist data are consistent, and the distributed cache mark in the local cache and the first structured blacklist are simultaneously stored.
The performing state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data includes: performing character division on the blacklist object to be inquired, and performing character-by-character state matching from the first structured blacklist data; if the state of the last character in the blacklist object to be queried, which is matched in the first structured blacklist data, is an ending state, the matching is successful.
The method, the device, the electronic device and the computer program product of the storage medium for intercepting the blacklist object provided by the embodiment of the invention comprise a computer readable storage medium storing program codes, and the instructions included in the program codes can be used for executing the method described in the method embodiment, and specific implementation can be referred to the method embodiment and will not be repeated here.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described system and apparatus may refer to corresponding procedures in the foregoing method embodiments, which are not described herein again.
In addition, in the description of embodiments of the present invention, unless explicitly stated and limited otherwise, the terms "mounted," "connected," and "connected" are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; can be directly connected or indirectly connected through an intermediate medium, and can be communication between two elements. The specific meaning of the above terms in the present invention will be understood by those skilled in the art in specific cases.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In the description of the present invention, it should be noted that the directions or positional relationships indicated by the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc. are based on the directions or positional relationships shown in the drawings, are merely for convenience of describing the present invention and simplifying the description, and do not indicate or imply that the devices or elements referred to must have a specific orientation, be configured and operated in a specific orientation, and thus should not be construed as limiting the present invention. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
Finally, it should be noted that: the above examples are only specific embodiments of the present invention for illustrating the technical solution of the present invention, but not for limiting the scope of the present invention, and although the present invention has been described in detail with reference to the foregoing examples, it will be understood by those skilled in the art that the present invention is not limited thereto: any person skilled in the art may modify or easily conceive of the technical solution described in the foregoing embodiments, or perform equivalent substitution of some of the technical features, while remaining within the technical scope of the present disclosure; such modifications, changes or substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention, and are intended to be included in the scope of the present invention. Therefore, the protection scope of the invention is subject to the protection scope of the claims.
Claims (11)
1. The method for intercepting the blacklist object is applied to a target application server in a distributed system, and is characterized in that the target application server is an application server indicated by a blacklist query request sent by a terminal, and the distributed system comprises a plurality of application servers, and the method comprises the following steps:
responding to a blacklist object query request sent by a terminal, performing timeliness judgment on first structured blacklist data, wherein the first structured blacklist data is used for indicating structured blacklist data in a local cache of a target application server, the structured blacklist data is used for indicating a finite state set of original blacklist data, the finite state set comprises character fragments and character states corresponding to the character fragments, each character fragment corresponds to one character state and is used for indicating whether the character fragment is in an end state or not;
If the first structured blacklist data fails, consistency judgment is carried out on the first structured blacklist data and second structured blacklist data, wherein the second structured blacklist data is used for indicating structured blacklist data in a distributed cache of the distributed system;
If the first structured blacklist data is consistent with the second structured blacklist data, performing state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data;
And if the matching is successful, intercepting the blacklist object to be queried.
2. The method according to claim 1, wherein the method further comprises:
responding to the change of original blacklist data in a target database, and carrying out finite state data structure conversion and serialization processing on the changed original blacklist data through a preset finite automaton determining algorithm to obtain original structured blacklist data;
And storing the original structured blacklist data into a distributed cache to obtain second structured blacklist data, and marking the second structured blacklist data to obtain a distributed cache mark, wherein the distributed cache mark is used for indicating the latest second structured blacklist data in the distributed cache.
3. The method according to claim 1, wherein the method further comprises:
acquiring second structured blacklist data and a distributed cache mark in a distributed cache through all application servers in the distributed system;
all application servers respectively perform deserialization processing on the obtained structured blacklist data, and store the structured blacklist data subjected to deserialization processing and the obtained distributed cache marks into local caches corresponding to the application servers;
And generating timeliness marks of the structured blacklist data in the local caches of all the application servers to obtain local cache marks respectively corresponding to all the application servers.
4. The method according to claim 1, wherein the method further comprises:
If the first structured blacklist data fails and the first structured blacklist data is inconsistent with the second structured blacklist data, the structured blacklist data in the local cache is emptied;
Acquiring the latest structured blacklist data and a distributed cache mark in a distributed cache, and storing the acquired structured blacklist data and the distributed cache mark in a local cache to obtain the latest first structured blacklist data and the distributed cache mark in the local cache;
And generating the timeliness mark of the latest first structured blacklist data to obtain the latest local cache mark.
5. The method according to claim 1, wherein the method further comprises:
and if the first structured blacklist data fails and the first structured blacklist data is consistent with the second structured blacklist data, performing timeliness extension on the local cache mark in the local cache of the target application server to obtain the latest local cache mark.
6. The method of claim 1, wherein the performing the timeliness determination on the first structured blacklist data comprises:
acquiring a local cache mark of the target application server, wherein the local cache mark is used for indicating the storage time of the latest structured blacklist data to be stored in the local cache of the target application server;
Judging whether the first structured blacklist data is invalid or not according to the preset cache invalidation time and the storage time.
7. The method of claim 1, wherein if the first structured blacklist data fails, performing consistency determination on the first structured blacklist data and the second structured blacklist data comprises:
If the first structured blacklist data fails, a distributed cache mark in a distributed cache is obtained, and the distributed cache mark in the distributed cache and the distributed cache mark in the local cache are subjected to consistency comparison to judge whether the first structured blacklist data and the second structured blacklist data are consistent or not, wherein the distributed cache mark in the local cache and the first structured blacklist are stored simultaneously.
8. The method according to claim 1, wherein the performing, by the first structured blacklist data, state matching on the blacklist object to be queried indicated by the blacklist object querying request, includes:
performing character division on the blacklist object to be inquired, and performing character-by-character state matching from the first structured blacklist data;
and if the state of the last character in the blacklist object to be queried, which is matched in the first structured blacklist data, is an ending state, the matching is successful.
9. An interception device of a blacklist object, which is applied to a target application server in a distributed system, wherein the target application server is an application server indicated by a blacklist query request sent by a terminal, and the distributed system comprises a plurality of application servers, and the device comprises:
The response module is used for responding to a blacklist object query request sent by the terminal and judging timeliness of first structured blacklist data, wherein the first structured blacklist data is used for indicating structured blacklist data in a local cache of the target application server, the structured blacklist data is used for indicating a finite state set of original blacklist data, the finite state set comprises character fragments and character states corresponding to the character fragments, each character fragment corresponds to one character state and is used for indicating whether the character fragment is in an ending state or not;
The judging module is used for judging consistency of the first structured blacklist data and second structured blacklist data if the first structured blacklist data fails, wherein the second structured blacklist data is used for indicating structured blacklist data in a distributed cache of the distributed system;
the matching module is used for carrying out state matching on the blacklist object to be queried indicated by the blacklist object query request through the first structured blacklist data if the first structured blacklist data is not invalid;
And the interception module is used for intercepting the blacklist object to be inquired if the matching is successful.
10. An electronic device comprising a processor and a memory, the memory storing machine executable instructions executable by the processor, the processor executing the machine executable instructions to implement the method of blocking blacklisted objects of any one of claims 1-8.
11. A machine-readable storage medium storing machine-executable instructions which, when invoked and executed by a processor, cause the processor to implement the method of blocking blacklist objects of any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211292696.0A CN115913646B (en) | 2022-10-21 | 2022-10-21 | Method and device for intercepting blacklist object, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211292696.0A CN115913646B (en) | 2022-10-21 | 2022-10-21 | Method and device for intercepting blacklist object, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115913646A CN115913646A (en) | 2023-04-04 |
| CN115913646B true CN115913646B (en) | 2024-06-04 |
Family
ID=86486273
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211292696.0A Active CN115913646B (en) | 2022-10-21 | 2022-10-21 | Method and device for intercepting blacklist object, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115913646B (en) |
Citations (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106021468A (en) * | 2016-05-17 | 2016-10-12 | 上海携程商务有限公司 | Updating method and system for distributed caches and local caches |
| CN107231395A (en) * | 2016-03-25 | 2017-10-03 | 阿里巴巴集团控股有限公司 | Date storage method, device and system |
| CN108429777A (en) * | 2017-02-15 | 2018-08-21 | 腾讯科技（北京）有限公司 | Data updating method based on cache and server |
| CN110909025A (en) * | 2018-09-17 | 2020-03-24 | 深圳市优必选科技有限公司 | Database query method, query device and terminal |
| CN111221862A (en) * | 2019-12-31 | 2020-06-02 | 五八有限公司 | Request processing method and device |
| CN111241134A (en) * | 2019-12-31 | 2020-06-05 | 五八有限公司 | Data processing method and device |
| CN111414383A (en) * | 2020-02-21 | 2020-07-14 | 车智互联（北京）科技有限公司 | Data request method, data processing system and computing device |
| CN111464615A (en) * | 2020-03-30 | 2020-07-28 | 北京达佳互联信息技术有限公司 | Request processing method, device, server and storage medium |
| CN112040429A (en) * | 2020-07-28 | 2020-12-04 | 南京云中云信息技术有限公司 | Short message management system and method based on distributed storage |
| CN112749198A (en) * | 2021-01-21 | 2021-05-04 | 中信银行股份有限公司 | Multi-level data caching method and device based on version number |
| CN113010552A (en) * | 2021-03-02 | 2021-06-22 | 腾讯科技（深圳）有限公司 | Data processing method, system, computer readable medium and electronic device |
| EP3869345A1 (en) * | 2020-02-21 | 2021-08-25 | NXP USA, Inc. | Data processing system implemented having a distributed cache |
| CN113360528A (en) * | 2020-03-06 | 2021-09-07 | 北京沃东天骏信息技术有限公司 | Data query method and device based on multi-level cache |
| CN113986921A (en) * | 2021-10-27 | 2022-01-28 | 中国工商银行股份有限公司 | Blacklist query method, system, electronic equipment and storage medium |
| CN114048234A (en) * | 2021-10-19 | 2022-02-15 | 车主邦（北京）科技有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN114398381A (en) * | 2021-12-22 | 2022-04-26 | 北京京东拓先科技有限公司 | Diagnosis and treatment data processing method and device |
| CN114706890A (en) * | 2022-04-11 | 2022-07-05 | 曙光网络科技有限公司 | Multi-stage data query method and device, electronic equipment and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9880936B2 (en) * | 2014-10-21 | 2018-01-30 | Sybase, Inc. | Distributed cache framework |
| US10944842B2 (en) * | 2016-05-27 | 2021-03-09 | Home Box Office, Inc. | Cached data repurposing |
-
2022
- 2022-10-21 CN CN202211292696.0A patent/CN115913646B/en active Active
Patent Citations (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107231395A (en) * | 2016-03-25 | 2017-10-03 | 阿里巴巴集团控股有限公司 | Date storage method, device and system |
| CN106021468A (en) * | 2016-05-17 | 2016-10-12 | 上海携程商务有限公司 | Updating method and system for distributed caches and local caches |
| CN108429777A (en) * | 2017-02-15 | 2018-08-21 | 腾讯科技（北京）有限公司 | Data updating method based on cache and server |
| CN110909025A (en) * | 2018-09-17 | 2020-03-24 | 深圳市优必选科技有限公司 | Database query method, query device and terminal |
| CN111221862A (en) * | 2019-12-31 | 2020-06-02 | 五八有限公司 | Request processing method and device |
| CN111241134A (en) * | 2019-12-31 | 2020-06-05 | 五八有限公司 | Data processing method and device |
| EP3869345A1 (en) * | 2020-02-21 | 2021-08-25 | NXP USA, Inc. | Data processing system implemented having a distributed cache |
| CN111414383A (en) * | 2020-02-21 | 2020-07-14 | 车智互联（北京）科技有限公司 | Data request method, data processing system and computing device |
| CN113360528A (en) * | 2020-03-06 | 2021-09-07 | 北京沃东天骏信息技术有限公司 | Data query method and device based on multi-level cache |
| CN111464615A (en) * | 2020-03-30 | 2020-07-28 | 北京达佳互联信息技术有限公司 | Request processing method, device, server and storage medium |
| CN112040429A (en) * | 2020-07-28 | 2020-12-04 | 南京云中云信息技术有限公司 | Short message management system and method based on distributed storage |
| CN112749198A (en) * | 2021-01-21 | 2021-05-04 | 中信银行股份有限公司 | Multi-level data caching method and device based on version number |
| CN113010552A (en) * | 2021-03-02 | 2021-06-22 | 腾讯科技（深圳）有限公司 | Data processing method, system, computer readable medium and electronic device |
| CN114048234A (en) * | 2021-10-19 | 2022-02-15 | 车主邦（北京）科技有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN113986921A (en) * | 2021-10-27 | 2022-01-28 | 中国工商银行股份有限公司 | Blacklist query method, system, electronic equipment and storage medium |
| CN114398381A (en) * | 2021-12-22 | 2022-04-26 | 北京京东拓先科技有限公司 | Diagnosis and treatment data processing method and device |
| CN114706890A (en) * | 2022-04-11 | 2022-07-05 | 曙光网络科技有限公司 | Multi-stage data query method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115913646A (en) | 2023-04-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112615907B (en) | Data synchronization system and method | |
| CN108595505B (en) | Data query method and device | |
| CN110968356B (en) | Method and device for acquiring configuration information | |
| CN111159233B (en) | Distributed caching method, system, computer equipment and storage medium | |
| CN113886743B (en) | Method, device and system for refreshing cache resources | |
| CN111104594A (en) | Market quotation pushing method and device | |
| US9973440B2 (en) | Resource notification method, device and system | |
| CN113452780A (en) | Access request processing method, device, equipment and medium for client | |
| US10664349B2 (en) | Method and device for file storage | |
| CN112069384A (en) | Buried point data processing method, server and readable storage medium | |
| CN110674427B (en) | Method, device, equipment and storage medium for responding to webpage access request | |
| CN111866123B (en) | Data storage method and device based on block chain | |
| CN115913646B (en) | Method and device for intercepting blacklist object, electronic equipment and storage medium | |
| CN106959975B (en) | Transcoding resource cache processing method, device and equipment | |
| CN111767481A (en) | Access processing method, device, equipment and storage medium | |
| CN111367921A (en) | Data object refreshing method and device | |
| CN112783909B (en) | Data updating method, device, terminal equipment and storage medium | |
| CN113411364B (en) | Resource acquisition method and device and server | |
| CN114637969A (en) | Target object authentication method and device | |
| CN111367860A (en) | File refreshing method and device | |
| CN114816219A (en) | Data writing and reading method and device and data reading and writing system | |
| CN112000618A (en) | File change management method, device, equipment and storage medium for cluster nodes | |
| CN113672248A (en) | Patch acquisition method, device, server and storage medium | |
| CN110944037A (en) | Method, computer device and storage medium for client cache change configuration | |
| CN114449044B (en) | CDN cache verification method and device and electronic equipment |
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 |