CN111628859A - Method and device for auditing short message text based on distributed high concurrency condition - Google Patents
Method and device for auditing short message text based on distributed high concurrency condition Download PDFInfo
- Publication number
- CN111628859A CN111628859A CN202010503170.7A CN202010503170A CN111628859A CN 111628859 A CN111628859 A CN 111628859A CN 202010503170 A CN202010503170 A CN 202010503170A CN 111628859 A CN111628859 A CN 111628859A
- Authority
- CN
- China
- Prior art keywords
- short message
- auditing
- short
- audit
- distributed
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- 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)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Power Engineering (AREA)
- Computer Security & Cryptography (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the technical field of short message text auditing, in particular to a method and a device for auditing short message texts under distributed high concurrency conditions, wherein when the method and the device are used for manual auditing, short message records in a database are asynchronously updated, and a page directly returns to audit the next short message without waiting; the task is processed in a grading way, one large task is divided into a plurality of subtasks, and the subtasks update the database information in batches and quantitatively, so that the database cannot be blocked; the decomposition rule and the message queue level can be customized, different types of short messages enter the message queues of different levels, and the short messages cannot be blocked in the message queues; and receiving the audit short message and carrying out audit processing, and transversely expanding the capacity in a mode of adding a server when meeting the performance bottleneck so as to improve the processing capacity.
Description
Technical Field
The invention relates to the technical field of short message text auditing, in particular to a method and a device for auditing a short message text based on a distributed high concurrency condition.
Background
At present, a short message operator needs to check the content of the short message before sending the short message, and only the short message which is legally compliant can be sent. Usually, a large number of short message requests are submitted to the system in a short time, and a large number of short messages enter a manual review stage on the basis of system pre-review. The mass short messages need to be put in a warehouse and then displayed on a page for auditing, and a mass of data is read and updated simultaneously during auditing, so that the system can possibly generate a blocking phenomenon, and the short message sending is blocked in an auditing stage.
Therefore, the invention provides a method and a device for auditing the short message text based on a distributed high concurrency condition, which can solve the defects.
Introduction of related knowledge points in the prior art:
distributed: is an optimization means adopted for solving the capacity and performance bottleneck problem of a single physical server. The problem that this field needs to solve is very many, on the technical layer of difference, includes again: distributed file systems, distributed caches, distributed databases, distributed computing, etc., some nouns such as Hadoop, zookeeper, MQ, etc. are related to the distribution. In concept, there are two forms of distributed implementation: horizontal expansion: when one machine can not hold the flow, the flow is equally divided to all servers by adding the machine, and all machines can provide equivalent service; and (3) vertical splitting: when the front end has various query requirements, one machine can not carry on the stock, and different requirements can be distributed to different machines, such as a machine A for processing a request of residual ticket query and a machine B for processing a request of payment.
High concurrency: relative to distributed, high concurrency is a convergence of the problem being solved, which reflects how much at the same time: such as online live services, are watched by tens of thousands of people at the same time. High concurrency can be solved through a distributed technology, and concurrent traffic cannot be distributed to different physical servers. But in addition to this, there are many other optimization means: for example, using a cache system to place all, static content into a CDN, etc.; multithreading may also be used to maximize the service capacity of a server. Short message sending often receives a large number of short messages submitted by customers in a short time, for example, when a merchant carries out sales promotion, a large number of sales promotion short messages are sent in a short time, which causes a large number of audit short messages to be put in storage. The invention adopts a distributed message system to receive and verify submitted short messages, the database stores the short messages in different databases and different tables, and the distributed cache stores the content of the verified short messages.
MD5 value: namely, Message-Digest Algorithm 5, is used to ensure the integrity and consistency of the information transmission. Is one of the hash algorithms (also known as digest algorithm and hash algorithm) widely used by computers, and the mainstream programming language is generally realized by MD 5. The operation of data (such as Chinese characters) into another fixed length value is the basic principle of the hash algorithm, and the precursors of MD5 include MD2, MD3 and MD 4. The MD5 algorithm has the characteristics of 1, compressibility, and fixed length of the calculated MD5 value of data with any length. 2. Easy to calculate, the MD5 value is easy to calculate from the original data. 3. Modification resistance, namely, the obtained MD5 value is greatly different when the original data is modified by only 1 byte. 4. Strong collision resistance, knowing the original data and its MD5 value, it is very difficult to find a data (i.e. counterfeit data) with the same MD5 value.
hashcode: each object in Java has a hash code, and Java can identify an object by the hash code.
Bond: keys (keys) in databases, also known as keywords, are an important concept in relational models, which are logical structures and not physical parts of databases.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a method and a device for auditing short message texts based on a distributed high concurrency condition, and solves the problem of low efficiency in the prior art.
In order to solve the problems, the invention discloses a method for auditing short message texts under distributed high concurrency conditions, which comprises three steps of short message receiving, manual auditing and system auditing,
s1 short message receiving: receiving a short message request sent by a user by adopting a distributed system, calculating a short message abstract according to a short message text and an account number, and calculating fragmentation information of data storage according to a mobile phone number to be sent; counting short messages with the same short message abstract by using a distributed cache, and warehousing data in a multithreading asynchronous and timed batch mode;
s2 manual review: after the manual page is audited, the database is not directly updated, and audit results and short message summaries are generated into audit task information which is sent to a message queue;
and S3 system audit: matching the number of short messages to be sent under the task to be audited with queues to be processed with different priorities, decomposing the audit task into a plurality of subtasks according to configuration, sending the subtasks to corresponding queues, storing audit results in a distributed cache, and finally circularly consuming the subtask to update database information and sending the short messages to a short message gateway.
As a priority, the method for calculating the short message digest in S1 is as follows: firstly, the short message summary is spliced according to the account number and the short message text, and then the MD5 value is taken from the short message summary.
The step S1 of calculating the short message abstract as a priority, comparing the short message abstract as a cache key with an audit result of local cache of the system, and if the audit result exists in the cache, sending the short message to a short message gateway; if the audit result does not exist, counting the short message abstracts in the distributed cache by taking the short message abstracts as keys, and adding 1 to the counter when short messages with the same abstracts are encountered.
Preferably, the method for calculating the fragmentation information according to the mobile phone number in S1 is as follows: the absolute value of the hash code of the mobile phone number is divided by the number of the fragments to obtain the remainder.
In order to solve the problems, the invention discloses a device for auditing short message texts under distributed high concurrency conditions, which comprises three modules of short message receiving, manual auditing and system auditing,
a short message receiving module: the method is suitable for a distributed system to receive a short message request sent by a user, calculate a short message abstract according to a short message text and an account number, and calculate fragment information of data storage according to a mobile phone number to be sent; counting short messages with the same short message abstract by using a distributed cache, and warehousing data in a multithreading asynchronous and timed batch mode;
a manual auditing module: the system is suitable for manual review, and auditing task information generated by a manual page review result and a short message abstract is sent to a message queue;
a system auditing module: the method is suitable for matching the queues to be processed with different priorities according to the number of short messages to be sent under the task to be audited, decomposing the audit task into a plurality of subtasks according to the configuration, sending the subtasks to the corresponding queues, and finally circularly consuming the subtasks to update the database information and send the short messages to the short message gateway.
To solve the above problem, the present invention also discloses a computing device, comprising:
one or more processors;
a memory; and
one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for performing any of the methods according to the described methods.
To solve the above problem, the present invention also discloses a computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computing device, cause the computing device to perform any of the methods according to the invention.
Due to the adoption of the technical scheme, the invention has the following beneficial effects: when the method is adopted for manual review, the database short message records are asynchronously updated, and the page directly returns to review the next short message without waiting; the task is processed in a grading way, one large task is divided into a plurality of subtasks, and the subtasks update the database information in batches and quantitatively, so that the database cannot be blocked; the decomposition rule and the message queue level can be customized, different types of short messages enter the message queues of different levels, and the short messages cannot be blocked in the message queues; and receiving the audit short message and carrying out audit processing, and transversely expanding the capacity in a mode of adding a server when meeting the performance bottleneck so as to improve the processing capacity.
Drawings
FIG. 1 is a schematic flow diagram of the present invention;
FIG. 2 is a screenshot of a web page of an embodiment of the invention.
Detailed Description
The embodiments of the invention will be described in detail below with reference to the drawings, but the invention can be implemented in many different ways as defined and covered by the claims.
The invention discloses a method for auditing short message texts under distributed high concurrency conditions, which comprises three steps of short message receiving, manual auditing and system auditing,
s1 short message receiving: and a distributed system is adopted to receive a short message request sent by a user, an abstract of the short message, namely an MD5 value, is calculated according to the short message text and a customer account, and fragment information of data storage is calculated according to a mobile phone number to be sent. Counting short messages with the same short message abstract by using a distributed cache, and warehousing data in a multithreading asynchronous and timed batch mode;
s2 manual review: after the manual page is audited, the database is not directly updated, and audit results and short message summaries are generated into audit task information which is sent to a message queue;
and S3 system audit: and matching the number of short messages to be sent under the task to be audited with queues to be processed with different priorities, and decomposing the audit task into a plurality of subtasks according to configuration and sending the subtasks to corresponding queues. And finally, circularly consuming the subtask to update the database information and sending the short message to the short message gateway.
Further, the method for calculating the short message digest in S1 is as follows: firstly, the short message summary is spliced according to the account number and the short message text, and then the MD5 value is taken from the short message summary.
Further, after the short message abstract is calculated in S1, the short message abstract is used as a cache key to be compared with an audit result of a local cache of the system, and if the audit result exists in the cache, the short message is sent to the short message gateway; if the audit result does not exist, counting the short message abstracts in the distributed cache by taking the short message abstracts as keys, and adding 1 to the counter when short messages with the same abstracts are encountered.
Further, the method for calculating the fragmentation information according to the mobile phone number in S1 is as follows: the absolute value of the hash code of the mobile phone number is divided by the number of the fragments to obtain the remainder.
The invention also discloses a device for auditing the short message text based on the distributed high concurrency condition, which comprises three modules of short message receiving, manual auditing and system auditing,
a short message receiving module: the method is suitable for a distributed system to receive a short message request sent by a user, calculate a short message abstract according to a short message text and an account number, and calculate fragment information of data storage according to a mobile phone number to be sent; counting short messages with the same short message abstract by using a distributed cache, and warehousing data in a multithreading asynchronous and timed batch mode;
a manual auditing module: the system is suitable for manual review, and auditing task information generated by a manual page review result and a short message abstract is sent to a message queue;
a system auditing module: the method is suitable for matching the queues to be processed with different priorities according to the number of short messages to be sent under the task to be audited, decomposing the audit task into a plurality of subtasks according to the configuration, sending the subtasks to the corresponding queues, and finally circularly consuming the subtasks to update the database information and send the short messages to the short message gateway.
The invention also discloses a computing device, comprising:
one or more processors;
a memory; and
one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for performing any of the methods according to the described methods.
Also disclosed is a computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computing device, cause the computing device to perform any of the methods described.
As shown in fig. 1, the specific steps are as follows:
s1, a distributed system receives a short message text, calculates a short message abstract according to an account number and the short message text, and obtains an MD5 value after the default account number and the short message text are spliced; the short message abstract is used as a cache key and is compared with an audit result of local cache of the system, and if the audit result exists in the cache, the short message is sent to a short message gateway; if the audit result does not exist, counting the short message abstracts in the distributed cache by taking the short message abstracts as keys, and adding 1 to the counter when short messages with the same abstracts are encountered; calculating fragment information according to the mobile phone number: dividing the absolute value of hash code of the mobile phone number by the number of the fragments to obtain a remainder; the request short message text, the short message abstract and the fragment information are stored into a database in batch at regular time;
s2, inquiring database information by a page, and displaying a short message text to be checked; manually checking the short message text, wherein the checking result is divided into pass and reject; the system generates an audit task through the audit result and the short message abstract, sends the audit task to the message queue, directly returns the audit result to the page for the next audit without updating the audit result through the short message record of the database;
s3, synchronizing the auditing results to local caches of all systems (obtaining cache invalidation time of different levels according to the number of short messages sent under the task and corresponding hot loading settings, wherein the larger the number is, the longer the invalidation time is); and decomposing the audit task into a plurality of subtasks according to preset decomposition rules (such as the number of short messages, the priority level of an account, the content importance of the short message and the like), wherein each subtask contains different fragment information, and sending the subtasks to queues with different priorities. And circularly consuming the subtasks, reading a certain number of short message records from the database according to the fragment information, sending the short message records to the short message gateway, updating the audit state, sending the subtask messages back to the message queue after the updating is finished, and waiting for processing again until the updating of the database short message records is finished. And after the database is updated, deleting the count in the distributed cache.
Example (b):
account number: c778899;
short message text: [ ZT ] your good, 0003;
the mobile phone number is as follows: 13866123001
The method comprises the following steps:
(1) when receiving a short message, firstly splicing the short message into a short message abstract according to the account number and the short message text as follows:
c778899 [ ZT ], your good, 0003;
then taking the MD5 value: group _ digest ═ E4A5AA12110D7917664769270F3E 2269;
(2) the short message summary group _ digest is not hit in a local cache, the group _ digest is stored in a distributed cache redis as a key, the value is 1, and the value is +1 when the same short message is received again;
(3) calculating fragment information Math.abs (13866123001'. hashCode ()% 20 searching ═ 13 of the mobile phone;
(4) inserting a short message summary group _ digest into a task table, and inserting short message texts and fragmentation information searching into the short message table;
(5) displaying a page and manually auditing; (as shown in FIG. 2)
(6) Sending the audit result and the short message abstract to
mq { "account": C778899"," account SmsType ": 1", "audioTesult": 1"," audioTime ": 1588766617000", "content": ZT "",
0003","createTime":1588764921000,"groupDigest":"E4A5AA12110D7917664769270F3E2269","keyWord":","state":2,"submitTime":1588764921000,"submitType":4,"sysUser":"shufeng","version":"casAudit-9dc86f908f9111ea8517fa163e4ff529"}
(7) according to the group _ digest count of the distributed cache redis, split into sub-tasks sent to mq { "accountSmsType":1, "audioCache": 1, "audioTime": 1588766617000, "count":0, "groupDate": E4A5AA12110D7917664769270F3E2269"," sysUser ": shuwing" }, "audioResult": 1, "audioTime": 1588766617000, "groupDate": E4A5AA12110D7917664769270F3E2269"," sharing ":1," sysUser ": thus," sharing ": and" desktop ": 2005061935210ek0v8b3 sjvppisc": 01"," desktop 5401 "and" Tortc "task" }
There is only one mobile phone number, so send to level 1 queue TaskFirst, sharing: -1 represents searching all fragments. And synchronizing the auditing results to local caches of the systems.
(8) And circularly consuming the subtask search database above, sending the short message to the gateway, and updating the short message sending state. And after the database is updated, deleting the count in the distributed cache.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (7)
1. A method for auditing short message texts based on distributed high concurrency conditions is characterized by comprising three steps of short message receiving, manual auditing and system auditing,
s1 short message receiving: receiving a short message request sent by a user by adopting a distributed system, calculating a short message abstract according to a short message text and an account number, and calculating fragmentation information of data storage according to a mobile phone number to be sent; counting short messages with the same short message abstract by using a distributed cache, and warehousing data in a multithreading asynchronous and timed batch mode;
s2 manual review: after the manual page is audited, the database is not directly updated, and audit results and short message summaries are generated into audit task information which is sent to a message queue;
and S3 system audit: matching the number of short messages to be sent under the task to be audited with queues to be processed with different priorities, decomposing the audit task into a plurality of subtasks according to configuration, sending the subtasks to corresponding queues, storing audit results in a distributed cache, and finally circularly consuming the subtask to update database information and sending the short messages to a short message gateway.
2. The method for auditing short message texts based on the distributed high concurrency condition according to claim 1, wherein the method for calculating the short message abstract at S1 is as follows: firstly, the short message summary is spliced according to the account number and the short message text, and then the MD5 value is taken from the short message summary.
3. The method for auditing short message texts under distributed high concurrency conditions according to claim 2, wherein after the short message abstract is calculated by S1, the short message abstract is used as a cache key to be compared with an audit result of a local cache of a system, and if the audit result exists in the cache, a short message is sent to a short message gateway; if the audit result does not exist, counting the short message abstracts in the distributed cache by taking the short message abstracts as keys, and adding 1 to the counter when short messages with the same abstracts are encountered.
4. The method for auditing short message texts based on the distributed high concurrency condition according to claim 3, wherein the method for S1 to calculate the fragmentation information according to the mobile phone number is as follows: the absolute value of the hash code of the mobile phone number is divided by the number of the fragments to obtain the remainder.
5. A device for auditing short message texts based on a distributed high concurrency condition comprises: comprises three modules of short message receiving, manual checking and system checking,
a short message receiving module: the method is suitable for a distributed system to receive a short message request sent by a user, calculate a short message abstract according to a short message text and an account number, and calculate fragment information of data storage according to a mobile phone number to be sent; counting short messages with the same short message abstract by using a distributed cache, and warehousing data in a multithreading asynchronous and timed batch mode;
a manual auditing module: the system is suitable for manual review, and auditing task information generated by a manual page review result and a short message abstract is sent to a message queue;
a system auditing module: the method is suitable for matching the queues to be processed with different priorities according to the number of short messages to be sent under the task to be audited, decomposing the audit task into a plurality of subtasks according to the configuration, sending the subtasks to the corresponding queues, and finally circularly consuming the subtasks to update the database information and send the short messages to the short message gateway.
6. A computing device, comprising:
one or more processors;
a memory; and
one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs comprising instructions for performing any of the methods of claims 1-4.
7. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computing device, cause the computing device to perform any of the methods of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010503170.7A CN111628859B (en) | 2020-06-05 | 2020-06-05 | Method and device for auditing short message text based on distributed high concurrency condition |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010503170.7A CN111628859B (en) | 2020-06-05 | 2020-06-05 | Method and device for auditing short message text based on distributed high concurrency condition |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111628859A true CN111628859A (en) | 2020-09-04 |
| CN111628859B CN111628859B (en) | 2021-01-05 |
Family
ID=72260286
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010503170.7A Active CN111628859B (en) | 2020-06-05 | 2020-06-05 | Method and device for auditing short message text based on distributed high concurrency condition |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111628859B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113095647A (en) * | 2021-04-01 | 2021-07-09 | 中国汽车技术研究中心有限公司 | Vehicle inspection system |
| CN114003609A (en) * | 2021-12-29 | 2022-02-01 | 飞狐信息技术（天津）有限公司 | Method and device for monitoring number of to-be-examined data |
| CN117041893A (en) * | 2023-10-10 | 2023-11-10 | 江西掌中无限网络科技股份有限公司 | Method and system for sending international short message by using cloud computing technology |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1995016967A1 (en) * | 1993-12-13 | 1995-06-22 | Cray Research, Inc. | Message facility for massively parallel processing systems |
| CN101257671A (en) * | 2007-07-06 | 2008-09-03 | 浙江大学 | Method for real time filtering large scale rubbish SMS based on content |
| CN102096703A (en) * | 2010-12-29 | 2011-06-15 | 北京新媒传信科技有限公司 | Filtering method and equipment of short messages |
| CN106102027A (en) * | 2016-06-12 | 2016-11-09 | 西南医科大学 | Note based on MapReduce batch submits method to |
| CN109685454A (en) * | 2018-12-13 | 2019-04-26 | 平安医疗健康管理股份有限公司 | Data checking method, device, equipment and storage medium |
| CN109831751A (en) * | 2019-01-04 | 2019-05-31 | 上海创蓝文化传播有限公司 | A kind of short message content air control system and method based on natural language processing |
| CN110109660A (en) * | 2019-05-07 | 2019-08-09 | 杭州艾塔科技有限公司 | A kind of monitoring short message touching reaches the system and method for effect |
| CN110263054A (en) * | 2019-05-30 | 2019-09-20 | 世纪龙信息网络有限责任公司 | Auditing system, checking method, device and the computer equipment of SQL work order |
-
2020
- 2020-06-05 CN CN202010503170.7A patent/CN111628859B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1995016967A1 (en) * | 1993-12-13 | 1995-06-22 | Cray Research, Inc. | Message facility for massively parallel processing systems |
| CN101257671A (en) * | 2007-07-06 | 2008-09-03 | 浙江大学 | Method for real time filtering large scale rubbish SMS based on content |
| CN102096703A (en) * | 2010-12-29 | 2011-06-15 | 北京新媒传信科技有限公司 | Filtering method and equipment of short messages |
| CN106102027A (en) * | 2016-06-12 | 2016-11-09 | 西南医科大学 | Note based on MapReduce batch submits method to |
| CN109685454A (en) * | 2018-12-13 | 2019-04-26 | 平安医疗健康管理股份有限公司 | Data checking method, device, equipment and storage medium |
| CN109831751A (en) * | 2019-01-04 | 2019-05-31 | 上海创蓝文化传播有限公司 | A kind of short message content air control system and method based on natural language processing |
| CN110109660A (en) * | 2019-05-07 | 2019-08-09 | 杭州艾塔科技有限公司 | A kind of monitoring short message touching reaches the system and method for effect |
| CN110263054A (en) * | 2019-05-30 | 2019-09-20 | 世纪龙信息网络有限责任公司 | Auditing system, checking method, device and the computer equipment of SQL work order |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113095647A (en) * | 2021-04-01 | 2021-07-09 | 中国汽车技术研究中心有限公司 | Vehicle inspection system |
| CN113095647B (en) * | 2021-04-01 | 2023-01-06 | 中国汽车技术研究中心有限公司 | Vehicle inspection system |
| CN114003609A (en) * | 2021-12-29 | 2022-02-01 | 飞狐信息技术（天津）有限公司 | Method and device for monitoring number of to-be-examined data |
| CN114003609B (en) * | 2021-12-29 | 2022-04-26 | 飞狐信息技术（天津）有限公司 | Method and device for monitoring number of to-be-examined data |
| CN117041893A (en) * | 2023-10-10 | 2023-11-10 | 江西掌中无限网络科技股份有限公司 | Method and system for sending international short message by using cloud computing technology |
| CN117041893B (en) * | 2023-10-10 | 2024-01-12 | 江西掌中无限网络科技股份有限公司 | Method and system for sending international short message by using cloud computing technology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111628859B (en) | 2021-01-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111628859B (en) | Method and device for auditing short message text based on distributed high concurrency condition | |
| US9948531B2 (en) | Predictive prefetching to reduce document generation times | |
| US8965914B2 (en) | Grouping identity records to generate candidate lists to use in an entity and relationship resolution process | |
| US9223867B2 (en) | Methods and systems for data processing | |
| US20150213116A1 (en) | Method and systems for flexible and scalable databases | |
| US8280917B1 (en) | Batching content management operations to facilitate efficient database interactions | |
| CN108984553B (en) | Caching method and device | |
| US20090144357A1 (en) | Use of template messages to optimize a software messaging system | |
| CN108647357B (en) | Data query method and device | |
| CN107357794B (en) | Method and device for optimizing data storage structure of key value database | |
| CN107329963A (en) | Accelerate the method and apparatus of web page access | |
| CN110909022A (en) | Data query method and device | |
| US20140095644A1 (en) | Processing of write requests in application server clusters | |
| CN115757406A (en) | Data storage method and device, electronic equipment and storage medium | |
| CN111753019A (en) | Data partitioning method and device applied to data warehouse | |
| US7693905B2 (en) | System and method for optimizing event predicate processing | |
| CN109344327B (en) | Method and apparatus for generating information | |
| CN110765131A (en) | Data compression method and device for goods source data, computer equipment and storage medium | |
| CN114003659A (en) | Data synchronization method, data synchronization device, electronic equipment, storage medium and program product | |
| CN113868687A (en) | Task processing progress management method and device | |
| CN112612790A (en) | Card number configuration method, device, equipment and computer storage medium | |
| CN112214497A (en) | Label processing method and device and computer system | |
| CN111651475B (en) | Information generation method and device, electronic equipment and computer readable medium | |
| CN109101440B (en) | Method for processing trace data concurrent request based on JVM (Java virtual machine) cache | |
| CN109710673B (en) | Work processing method, device, equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 201600 building 19, 68 Zhongchuang Road, Songjiang District, Shanghai Patentee after: Shanghai Chuangyan Yunzhi Information Technology Co.,Ltd. Address before: 201600 building 19, 68 Zhongchuang Road, Songjiang District, Shanghai Patentee before: SHANGHAI CHUANGLAN CULTURE COMMUNICATION Co.,Ltd. |