CN115589590A - System, method, electronic equipment and storage medium for efficiently filtering short message blacklist - Google Patents
System, method, electronic equipment and storage medium for efficiently filtering short message blacklist Download PDFInfo
- Publication number
- CN115589590A CN115589590A CN202211327941.7A CN202211327941A CN115589590A CN 115589590 A CN115589590 A CN 115589590A CN 202211327941 A CN202211327941 A CN 202211327941A CN 115589590 A CN115589590 A CN 115589590A
- Authority
- CN
- China
- Prior art keywords
- blacklist
- batch
- batch data
- sent
- sending
- 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.)
- Pending
Links
- 238000001914 filtration Methods 0.000 title claims abstract description 44
- 238000000034 method Methods 0.000 title claims abstract description 43
- 238000012545 processing Methods 0.000 claims description 15
- 230000001680 brushing effect Effects 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 6
- 238000010586 diagram Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000001174 ascending effect Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 230000002123 temporal effect Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/12—Detection or prevention of fraud
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/12—Messaging; Mailboxes; Announcements
- H04W4/14—Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention discloses a system, a method, electronic equipment and a storage medium for efficiently filtering a short message blacklist, wherein the method for efficiently filtering the short message blacklist comprises the following steps: constructing a blacklist service rule, and generating an ordered minimized blacklist set based on the blacklist service rule; after receiving a batch short message sending request, sorting the service of the batch sending request according to a sorting rule to form batch data to be sent; carrying out asynchronous multitasking on the to-be-sent batch data to obtain actual sending batch data; and sending the actual sending batch data to an operator short message gateway. The method for efficiently filtering the short message blacklist solves the problem of low efficiency when the short message sending platform filters the blacklist in the prior art.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a system and a method for efficiently filtering a short message blacklist, electronic equipment and a storage medium.
Background
Along with the intensive treatment of harassing short messages by related departments, each large short message sending service platform needs to ensure the timeliness of short message sending of customers on one hand and also needs to ensure that the customers do not generate complaints on the other hand; in order to ensure that a large amount of customer complaints are not generated during short message sending, currently, each large short message service platform company accumulates a large amount of blacklist information such as channels, services, regions and the like, and filters out blacklist numbers and then sends the blacklist numbers during service sending, but because the short message service has a very high timeliness requirement, for example, a mobile phone terminal needs to be touched within 5 seconds when part of short message verification code scenes require to send, and when a large amount of short messages need to be sent, each sending number needs to be filtered by a blacklist, and the quantity of blacklist data is very large, so that a large amount of time is consumed when the short messages are filtered by the blacklist, and the sending efficiency and the timeliness of touching are seriously influenced.
A problem that efficiency of a short message sending platform is low when a blacklist is filtered is urgently needed to be solved.
Disclosure of Invention
The embodiment of the invention aims to provide a system, a method, electronic equipment and a storage medium for efficiently filtering a short message blacklist, which are used for solving the problem of low efficiency when a short message sending platform filters the blacklist in the prior art.
In order to achieve the above object, an embodiment of the present invention provides a method for efficiently filtering a short message blacklist, where the method specifically includes:
building a blacklist service rule, and generating an ordered minimized blacklist set based on the blacklist service rule;
after receiving a batch short message sending request, sorting the service of the batch sending request according to a sorting rule to form batch data to be sent;
asynchronous multitasking is carried out on the batch data to be sent to obtain actual sending batch data;
and sending the actual sending batch data to an operator short message gateway.
On the basis of the technical scheme, the invention can be further improved as follows:
further, the blacklist service rule is constructed, and an ordered minimized blacklist set is generated based on the blacklist service rule, wherein the ordered minimized blacklist set comprises the blacklist service rule;
and brushing the minimized blacklist set into a server for filtering blacklist nodes.
Further, the receiving of the batch short message sending requests and the sorting of the services of the batch sending requests according to the sorting rules form batch data to be sent, including;
and processing each service in each batch in the sorted to-be-sent batch data according to the minimized blacklist service rule to form a set of each batch.
Further, the obtaining actual sending batch data after performing asynchronous multitasking on the batch data to be sent includes:
when the to-be-sent batch data exist in the minimized blacklist set cached locally, discarding the to-be-sent batch data;
and when the batch data to be sent does not exist in the minimized blacklist set cached locally, storing the batch data to be sent into a message queue for actually sending the batch data.
A system for efficiently filtering a short message blacklist comprises:
the building module is used for building a blacklist service rule and generating an ordered minimized blacklist set based on the blacklist service rule;
the sorting module is used for sorting the services of the batch sending requests according to the sorting rules to form to-be-sent batch data after receiving the batch short message sending requests;
the processing module is used for performing asynchronous multitasking on the batch data to be sent to obtain actual sending batch data;
and the sending module is used for sending the actual sending batch data to an operator short message gateway.
Further, the system for efficiently filtering the short message blacklist further comprises a brushing module:
the brushing-in module is further used for brushing the minimized blacklist set into a server for filtering blacklist nodes.
Further, the sorting module is further configured to:
and processing each service in each batch in the sorted to-be-sent batch data according to the minimized blacklist service rule to form a set of each batch.
Further, the processing module is further configured to:
when the to-be-sent batch data exists in the minimized blacklist set cached locally, discarding the to-be-sent batch data;
and when the batch data to be sent does not exist in the minimized blacklist set cached locally, storing the batch data to be sent into a message queue for actually sending the batch data.
An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method when executing the computer program.
A non-transitory computer readable medium, having stored thereon a computer program which, when executed by a processor, implements the steps of the method.
The embodiment of the invention has the following advantages:
the method for efficiently filtering the short message blacklist comprises the steps of constructing a blacklist service rule, and generating an ordered minimized blacklist set based on the blacklist service rule; after receiving a batch short message sending request, sorting the service of the batch sending request according to a sorting rule to form batch data to be sent; carrying out asynchronous multitasking on the to-be-sent batch data to obtain actual sending batch data; sending the actual sending batch data to an operator short message gateway; the problem of among the prior art short message sending platform efficiency lower when filtering the blacklist is solved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below. It should be apparent that the drawings in the following description are merely exemplary and that other implementation drawings may be derived from the provided drawings by those of ordinary skill in the art without inventive effort.
The structures, ratios, sizes, and the like shown in the present specification are only used for matching with the contents disclosed in the specification, so as to be understood and read by those skilled in the art, and are not used to limit the conditions that the present invention can be implemented, so that the present invention has no technical significance, and any structural modifications, changes in the ratio relationship, or adjustments of the sizes, without affecting the effects and the achievable by the present invention, should still fall within the range that the technical contents disclosed in the present invention can cover.
FIG. 1 is a flowchart of a method for efficiently filtering a blacklist of short messages according to the present invention;
FIG. 2 is a flowchart of a method for efficiently filtering a blacklist of short messages according to the present invention;
FIG. 3 is a flow chart of a method for efficiently filtering a blacklist of short messages according to the present invention;
FIG. 4 is a flowchart of a method for efficiently filtering a blacklist of short messages according to the present invention;
FIG. 5 is a block diagram of a system for efficiently filtering a blacklist of short messages according to the present invention;
fig. 6 is a schematic structural diagram of an electronic device according to the present invention.
Wherein the reference numerals are:
Detailed Description
The present invention is described in terms of particular embodiments, other advantages and features of the invention will become apparent to those skilled in the art from the following disclosure, and it is to be understood that the described embodiments are merely exemplary of the invention and that it is not intended to limit the invention to the particular embodiments disclosed. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Examples
Fig. 1-4 are flowcharts illustrating an embodiment of a method for efficiently filtering a short message blacklist according to the present invention, and as shown in fig. 1, the method for efficiently filtering a short message blacklist according to the embodiment of the present invention includes the following steps:
s101, building a blacklist service rule, and generating an ordered minimized blacklist set based on the blacklist service rule;
specifically, the minimized blacklist set is brushed to a server for filtering blacklist nodes.
The blacklist business rules include: a blacklist number, a blacklist service, a combination rule of a blacklist area.
According to the blacklist business rule, all minimization rules are generated in advance, for example: mobile phone number + service type, mobile phone number + region, mobile phone number + service type + region. The set of minimization rules is equivalent to blacklist traffic rules. And after the minimum rule set is generated, sequencing all the minimum rules in the set, and finally generating an ordered minimum blacklist set.
The number of the generated minimized blacklist rule sets is 100, and in case of less than one, each minimized blacklist rule is not more than 50 bytes on average. The capacity of 100 ten thousand pieces of data does not exceed 50M. Because the memory of the computer server is generally above grade G at present, in order to reduce network call overhead, centralized cache such as redis which needs network overhead is not used, and the contrast operation speed of a service set and a blacklist set is improved, the sorted minimized blacklist set data is brushed on each filtered blacklist node server.
S102, after receiving the batch short message sending request, sorting the service of the batch sending request according to a sorting rule to form to-be-sent batch data;
specifically, each service in each batch in the sorted to-be-sent batch data is processed according to the minimized blacklist service rule to form a set of each batch.
The service transmission rule includes: recipient number, type of service sent, and area of sending, etc.
After the front-end WEB page or the API interface receives the batch short message sending request, the back-end service sorting program firstly sorts the service of the batch sending request into a plurality of batches according to a certain rule, for example, sorts a small batch according to every 10 services. And processing each service data in each batch according to the blacklist set rule (without sorting) after sorting to form a set of each batch.
Since the amount of service data is extremely large, more than ten million levels often occur after the rule data is generated, and therefore, local storage is not recommended. In the scheme, MQ is adopted for frequent storage, and convenience in operation is provided for multi-task consumption in 3.3.
An MQ (Message Queue) Message Queue is a kind of data structure in the basic data structure, first-in first-out. The method is generally used for solving the problems of application decoupling, asynchronous messages, flow peak clipping and the like, and realizes a high-performance, high-availability, scalable and final consistency framework.
The MQ message queue is a data structure of first-in first-out in the basic data structure. Refers to placing data (messages) to be transmitted in a queue, using a queue mechanism to effect message delivery-a producer generates and places messages in a queue, which are then processed by a consumer. The consumer can pull the message to the designated queue or subscribe to the corresponding queue, and the MQ server side pushes the message to the corresponding queue.
The message queue middleware is an important component in a distributed system, mainly solves the problems of application decoupling, asynchronous messages, flow cutting and the like, and realizes a high-performance, high-availability, scalable and final consistency framework. [2]
Decoupling: one service needs a plurality of modules to be realized together, or one message has a plurality of systems to be correspondingly processed, only after the main service is completed, one MQ is sent, and the other modules consume the MQ message, so that the service can be realized, and the coupling between the modules is reduced.
Asynchronous: after the execution of the main service is finished, the subordinate service is asynchronously executed through the MQ, so that the response time of the service is shortened, and the user experience is improved.
Peak clipping: under the condition of high concurrency, the service is processed asynchronously, the service processing capacity in the peak period is provided, and the system paralysis is avoided.
S103, carrying out asynchronous multitasking on batch data to be sent to obtain actual sending batch data;
specifically, when the to-be-sent batch data exists in the minimized blacklist set cached locally, the to-be-sent batch data is discarded;
and when the batch data to be sent does not exist in the minimized blacklist set cached locally, storing the batch data to be sent into a message queue for actually sending the batch data.
The whole treatment process comprises the following steps:
1. and the plurality of filtering service nodes concurrently consume the service data in the data MQ to be sent.
2. And each filtering service node takes the batch data in the data MQ to be sent and compares the batch data with the local cache data, and because the cache data are sorted in advance, the data can be quickly searched and compared by using a binary search method when each piece of data is compared.
3. When each filtering service node executes service data filtering, if data is found in the locally cached blacklist rule set, the service data is discarded, otherwise, the service data is stored in the MQ which is actually sent.
Binary Search is also called Binary Search (Binary Search), which is a Search method with higher efficiency. However, binary search requires that the linear table must adopt a sequential storage structure, and the elements in the table are arranged in order according to the keywords.
Firstly, supposing that elements in the table are arranged in an ascending order, comparing a keyword recorded in the middle position of the table with a search keyword, and if the keyword and the search keyword are equal, successfully searching; otherwise, the table is divided into a front sub-table and a rear sub-table by using the middle position record, if the key word of the middle position record is larger than the search key word, the front sub-table is further searched, and if not, the rear sub-table is further searched. The above process is repeated until a record is found that satisfies the condition, such that the lookup is successful, or until a sub-table does not exist, at which point the lookup is unsuccessful.
1. A sequential storage structure must be employed.
2. Must be ordered by key size.
Calculating the formula: a < log2n < b (a, b, n ∈ Z +)
When the sequence table has n keys:
when the search fails, the keywords are compared for at least a times; when the search is successful, the maximum number of times the keyword is compared is b.
Note that: a, b and n are positive integers.
The basic idea of binary search is to divide n elements into two parts which are approximately equal, take a [ n/2] to compare with x, if x = a [ n/2], find x, and terminate the algorithm; if x < a [ n/2], then only the left half of array a is searched for x, and if x > a [ n/2], then only the right half of array a is searched for x.
The time complexity is the number of while loops.
There are a total of n elements in the array,
followed gradually by n, n/2, n/4.. N/2^ k (the remaining number of elements to operate next), where k is the number of cycles
Since after n/2^ k is rounded > =1
I.e. n/2^ k =1
One can get k = log2n, (base 2, logarithm of n)
The time complexity can be expressed as O (h) = O (log 2 n)
The following provides a piece of pseudo code for a binary search implementation:
BinarySearch(max,min,des)
mid-<(max+min)/2
while(min<＝max)
mid＝(min+max)/2
if mid＝des then
return mid
elseif mid>des then
max＝mid-1
else
min＝mid+1
return max
the binary search method is also called as binary search method, fully utilizes the order relation among elements, adopts a divide-and-conquer strategy and can complete the search task by using O (log n) under the worst condition. The basic idea is as follows: (assuming the array elements are in ascending order) dividing the n elements into two halves with approximately the same number, taking a [ n/2] to compare with x to be searched, if x = a [ n/2], finding x, and terminating the algorithm; if x < a [ n/2], we simply continue to search for x in the left half of array a; if x > a [ n/2], we simply continue to search for x in the right half of array a.
4. And the plurality of sending service nodes concurrently send the consumption data from the actual MQ and send the consumption data to the operator short message gateway.
Defining: t (n) is time complexity of filtering service data, M is total number of services, K1 is total number of service blacklists, K2 is total number of channel blacklists, K3 is total number of regional blacklists, S is network overhead duration of requesting redis once, B is duration of comparing one service blacklist once, T is duration of comparing one channel blacklist once, and D is duration of comparing one regional blacklist once.
Time complexity in filtering of the prior art:
T(n1)＝M*S+M*B*K1+M*T*K2+M*D*K3＝M*(S+B*K1+T*K2+D*K3)
the actual complexity of the invention in filtering is:
and (4) conclusion: from the formula, B log can be seen 2 K1 is less than B < X > K1, T log 2 K2 is less than T < x > K2, D log 2 K3 is smaller than D.multidot.K 3, so that T (n 1) > T (n 2) and the larger the number of K1, K2, K3, the larger the value of T (n 1) -T (n 2). Namely: the temporal complexity of T (n 1) is greater than that of T (n 2).
According to 1000 ten thousand service data and 10 ten thousand blacklist numbers (wherein, 2 ten thousand service blacklists, 5 ten thousand channel blacklists and 3 ten thousand regional blacklists), then: m is 10000000, K1=200000, K2=50000, K3=30000, and assuming S =0.01ms, B =0.000001ms, T =0.000001ms, D =0.000002ms, the same configured server starts a filtering service node to measure the comparison of the present invention and the prior art in terms of processing efficiency.
T(n1)＝10000000*0.01ms+10000000*0.00001ms*20000+10000000*0.00001ms*50000+10000000*0.000002ms*30000＝1400000ms＝1400S
T(n2)＝10000000*0.000001*log 2 20000+10000000*0.000001*log 2 50000+10000000*0.000002*log 2 30000≈530ms
T (n 1)/T (n 2) =1400000/530 ≈ 2642, i.e., under the above sample, the newly invented method is 2642 times faster than the past method.
S104, sending the actual sending batch data to an operator short message gateway;
the method for efficiently filtering the short message blacklist generates an ordered minimized blacklist set in advance according to rules, and the ordered minimized blacklist set is flushed into a local cache of a filtering service node in advance, for example, the ordered minimized blacklist set is flushed into a JVM cache; in the filtering service node, a binary search method is adopted to directly filter data locally, so that the data traversal times are greatly reduced. After the method for efficiently filtering the short message blacklist is used on the short message industry system platform, the efficiency of filtering the blacklist can be greatly shortened under the condition of sending large-volume services, and the sending efficiency of the whole short message platform in unit time is effectively improved.
FIG. 5 is a flow chart of a system for efficiently filtering a blacklist of short messages according to an embodiment of the present invention; as shown in fig. 5, a system for efficiently filtering a short message blacklist according to an embodiment of the present invention includes the following steps:
the building module 10 is configured to build a blacklist service rule, and generate an ordered minimized blacklist set based on the blacklist service rule;
the sorting module 20 is configured to, after receiving the batch short message sending request, sort the service of the batch sending request according to a sorting rule to form batch data to be sent;
the sorting module 20 is further configured to:
and processing each service in each batch in the sorted to-be-sent batch data according to the minimized blacklist service rule to form a set of each batch.
The processing module 30 is configured to perform asynchronous multitasking on the to-be-sent batch data to obtain actual sent batch data;
the processing module 30 is further configured to:
when the to-be-sent batch data exist in the minimized blacklist set cached locally, discarding the to-be-sent batch data;
and when the batch data to be sent does not exist in the minimized blacklist set cached locally, storing the batch data to be sent into a message queue for actually sending the batch data.
And the sending module 40 is configured to send the actual sending batch data to an operator short message gateway.
The system for efficiently filtering the short message blacklist further comprises a brushing-in module 50:
the brushing module 50 is further configured to brush the minimized blacklist set onto a server for filtering blacklist nodes.
Fig. 6 is a schematic structural diagram of an entity of an electronic device 60 according to an embodiment of the present invention, and as shown in fig. 6, the electronic device 60 includes: a processor 601 (processor), a memory 602 (memory), and a bus 603;
the processor 601 and the memory 602 complete communication with each other through the bus 603;
The present embodiments provide a non-transitory computer readable medium storing computer instructions that cause a computer to perform the methods provided by the above method embodiments, for example, including: building a blacklist service rule, and generating an ordered minimized blacklist set based on the blacklist service rule; after receiving a batch short message sending request, sorting the service of the batch sending request according to a sorting rule to form batch data to be sent; carrying out asynchronous multitasking on the to-be-sent batch data to obtain actual sending batch data; and sending the actual sending batch data to an operator short message gateway.
Those of ordinary skill in the art will understand that: all or part of the steps for implementing the method embodiments may be implemented by hardware related to program instructions, and the program may be stored in a computer readable medium, and when executed, the program performs the steps including the method embodiments; and the aforementioned media include: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment may be implemented by software plus a necessary general hardware platform, and may also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods of the various embodiments or some parts of the embodiments.
Although the invention has been described in detail above with reference to a general description and specific examples, it will be apparent to one skilled in the art that modifications or improvements may be made thereto based on the invention. Accordingly, such modifications and improvements are intended to be within the scope of the invention as claimed.
Claims (10)
1. A method for efficiently filtering a short message blacklist is characterized by specifically comprising the following steps:
building a blacklist service rule, and generating an ordered minimized blacklist set based on the blacklist service rule;
after receiving a batch short message sending request, sorting the service of the batch sending request according to a sorting rule to form batch data to be sent;
carrying out asynchronous multitasking on the to-be-sent batch data to obtain actual sending batch data;
and sending the actual sending batch data to an operator short message gateway.
2. The method of claim 1, wherein the building of blacklist service rules generates an ordered minimized blacklist set based on the blacklist service rules, including;
and brushing the minimized blacklist set on a server for filtering blacklist nodes.
3. The method for efficiently filtering the short message blacklist according to claim 1, wherein the receiving of the batch short message sending requests, the sorting of the services of the batch sending requests according to the sorting rules to form the batch data to be sent comprises;
and processing each service in each batch in the sorted to-be-sent batch data according to the minimized blacklist service rule to form a set of each batch.
4. The method as claimed in claim 2, wherein said performing asynchronous multitasking on the to-be-sent batch data to obtain actual sent batch data comprises:
when the to-be-sent batch data exist in the minimized blacklist set cached locally, discarding the to-be-sent batch data;
and when the batch data to be sent does not exist in the minimized blacklist set cached locally, storing the batch data to be sent into a message queue for actually sending the batch data.
5. A system for efficiently filtering a blacklist of short messages is characterized by comprising:
the building module is used for building a blacklist service rule and generating an ordered minimized blacklist set based on the blacklist service rule;
the sorting module is used for sorting the services of the batch sending requests according to the sorting rules to form to-be-sent batch data after receiving the batch short message sending requests;
the processing module is used for performing asynchronous multitasking on the batch data to be sent to obtain actual sending batch data;
and the sending module is used for sending the actual sending batch data to an operator short message gateway.
6. The system of claim 5, wherein the system further comprises a refresh module:
the input module is used for brushing the minimized blacklist set into a server for filtering blacklist nodes.
7. The system of claim 6, wherein the sorting module is further configured to:
and processing each service in each batch in the sorted to-be-sent batch data according to the minimized blacklist service rule to form a set of each batch.
8. The system of claim 7, wherein the processing module is further configured to:
when the to-be-sent batch data exist in the minimized blacklist set cached locally, discarding the to-be-sent batch data;
and when the batch data to be sent does not exist in the minimized blacklist set cached locally, storing the batch data to be sent into a message queue for actually sending the batch data.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method according to any of claims 1 to 4 are implemented by the processor when executing the computer program.
10. A non-transitory computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211327941.7A CN115589590A (en) | 2022-10-27 | 2022-10-27 | System, method, electronic equipment and storage medium for efficiently filtering short message blacklist |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211327941.7A CN115589590A (en) | 2022-10-27 | 2022-10-27 | System, method, electronic equipment and storage medium for efficiently filtering short message blacklist |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115589590A true CN115589590A (en) | 2023-01-10 |
Family
ID=84781398
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211327941.7A Pending CN115589590A (en) | 2022-10-27 | 2022-10-27 | System, method, electronic equipment and storage medium for efficiently filtering short message blacklist |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115589590A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101876989A (en) * | 2009-12-07 | 2010-11-03 | 公安部交通管理科学研究所 | High-speed matching method of mass blacklists containing wildcards |
| CN105589973A (en) * | 2016-01-17 | 2016-05-18 | 浙江维融电子科技股份有限公司 | Efficient blacklist search method |
| WO2017193997A1 (en) * | 2016-05-12 | 2017-11-16 | 中兴通讯股份有限公司 | Short message filtering method and system |
| CN110888729A (en) * | 2019-12-05 | 2020-03-17 | 深圳市七星石科技有限公司 | Asynchronous multitask processing system based on task event |
| CN113360595A (en) * | 2021-05-26 | 2021-09-07 | 招商华软信息有限公司 | Parameter loading method and device in blacklist parameter file |
-
2022
- 2022-10-27 CN CN202211327941.7A patent/CN115589590A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101876989A (en) * | 2009-12-07 | 2010-11-03 | 公安部交通管理科学研究所 | High-speed matching method of mass blacklists containing wildcards |
| CN105589973A (en) * | 2016-01-17 | 2016-05-18 | 浙江维融电子科技股份有限公司 | Efficient blacklist search method |
| WO2017193997A1 (en) * | 2016-05-12 | 2017-11-16 | 中兴通讯股份有限公司 | Short message filtering method and system |
| CN110888729A (en) * | 2019-12-05 | 2020-03-17 | 深圳市七星石科技有限公司 | Asynchronous multitask processing system based on task event |
| CN113360595A (en) * | 2021-05-26 | 2021-09-07 | 招商华软信息有限公司 | Parameter loading method and device in blacklist parameter file |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10454864B2 (en) | Delivering messages from message sources to subscribing recipients | |
| CN109299164B (en) | Data query method, computer readable storage medium and terminal equipment | |
| EP3742306A1 (en) | Data query method, apparatus and device | |
| CN110990372A (en) | Dimensional data processing method and device and data query method and device | |
| CN111722918A (en) | Service identification code generation method and device, storage medium and electronic equipment | |
| CN114091704B (en) | Alarm suppression method and device | |
| CN112150023A (en) | Task allocation method, device and storage medium | |
| Gamarnik et al. | A lower bound on the queueing delay in resource constrained load balancing | |
| CN110633302B (en) | Method and device for processing massive structured data | |
| CN115589590A (en) | System, method, electronic equipment and storage medium for efficiently filtering short message blacklist | |
| CN104834728B (en) | A kind of method for pushing and device for subscribing to video | |
| CN111949678A (en) | Method and device for processing non-accumulation indexes across time windows | |
| CN113590322A (en) | Data processing method and device | |
| CN114064803A (en) | Data synchronization method and device | |
| CN110879818B (en) | Method, device, medium and electronic equipment for acquiring data | |
| US10185729B2 (en) | Index creation method and system | |
| CN110019671B (en) | Method and system for processing real-time message | |
| CN113783912A (en) | Request distribution method, device and storage medium | |
| CN111290927A (en) | Data monitoring method and device | |
| CN112214290B (en) | Log information processing method, edge node, center node and system | |
| Zhou et al. | NISU: a novel index structure on uncertain data in large-scale publish/subscribe systems | |
| CN110908972B (en) | Log data preprocessing method and device, electronic equipment and storage medium | |
| CN115567584A (en) | Processing method and device of subscription theme, electronic equipment and readable storage medium | |
| CN116974745A (en) | Implementation method of graph mining algorithm and computer equipment | |
| CN117609335A (en) | Data statistics method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20230110 |