CN108536544B - Consumption method, device, server and medium based on database message queue - Google Patents
Consumption method, device, server and medium based on database message queue Download PDFInfo
- Publication number
- CN108536544B CN108536544B CN201810235207.5A CN201810235207A CN108536544B CN 108536544 B CN108536544 B CN 108536544B CN 201810235207 A CN201810235207 A CN 201810235207A CN 108536544 B CN108536544 B CN 108536544B
- Authority
- CN
- China
- Prior art keywords
- message
- message queue
- field
- sub
- queue
- 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
Images
Classifications
-
- 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
Abstract
The embodiment of the invention provides a consumption method, a device, a server and a medium based on a database message queue, wherein the method comprises the steps of starting a plurality of independent consumption processes; and controlling each consuming process to read one sub message queue at a time from a message queue data table stored in the database, wherein each sub message queue comprises a plurality of messages, each message has a unique message Identification (ID), and sets formed by the message IDs contained in each sub message queue are not intersected. The embodiment of the invention uses the database as the message queue service, is convenient to deploy and has lower maintenance cost; although the prior art also uses a database as a queue, the prior art does not support a multi-process consumption queue, only can process a single process, and has limited application scenes.
Description
Technical Field
The invention relates to server operation and maintenance of the Internet and the mobile Internet, in particular to a consumption method, a consumption device, a consumption server and a consumption medium based on a database message queue.
Background
In everyday applications, it is often encountered to use message queue services to asynchronously process some business logic, and generally a separate message queue service, such as MemcacheQ, is chosen to be used.
Although the existing technical scheme can meet daily business application, the inventor of the application finds that the technical scheme in the prior art has the following problems in the actual use process:
1. the message queue service needs to be deployed independently, the configuration is complex, and the operation and maintenance cost is increased.
2. When the method is actually applied in an enterprise, the process of applying for resources and waiting for allocation is often needed, and the time cost is increased.
Disclosure of Invention
The embodiment of the invention provides a consumption method, a consumption device and a consumption server based on a database message queue, and aims to reduce operation and maintenance cost and time cost.
In one aspect, an embodiment of the present invention provides a consumption method based on a database message queue, including: starting a plurality of independent consuming processes; and controlling each consuming process to read one sub message queue at a time from a message queue data table stored in the database, wherein each sub message queue comprises a plurality of messages, each message has a unique message Identification (ID), and sets formed by the message IDs contained in each sub message queue are not intersected.
Optionally, the message queue data table includes a message identification ID field, where the message ID field is a self-increment field; and the message IDs of the plurality of messages included in each sub-message queue are successively incremented.
Optionally, the message queue data table includes a message identification ID field, where the message ID field is a self-increment field; the controlling each consuming process to read one sub message queue at a time from the message queue data table stored in the database includes: if N consumption processes exist, the message ID corresponding to the message read by the consumption process with the control number N meets the following formula: and ID mod N is N, wherein N and N are positive integers, and N is more than or equal to 0 and less than or equal to N-1.
Optionally, the message queue data table further includes a message execution time field, and the controlling of each consuming process reads one sub-message queue at a time from the message queue data table stored in the database includes: controlling each consumption process to inquire each message in the sub message queue to be read, and aiming at the current message: and judging whether the execution time field of the message is matched with the current time, if so, reading the message, otherwise, not reading the message.
In another aspect, an embodiment of the present invention provides a consumption device based on a database message queue, including: a starting unit for starting a plurality of independent consuming processes; and the control unit is used for controlling each consuming process to read one sub message queue at a time from the message queue data table stored in the database, each sub message queue comprises a plurality of messages, each message has a unique message Identification (ID), and no intersection exists among sets formed by the message IDs contained in each sub message queue.
Optionally, the message queue data table includes a message identification ID field, where the message ID field is a self-increment field; and the message IDs of the plurality of messages included in each sub-message queue are successively incremented.
Optionally, the message queue data table includes a message identification ID field, where the message ID field is a self-increment field; the control unit is specifically configured to: if N consumption processes exist, the message ID corresponding to the message read by the consumption process with the control number N meets the following formula: and ID mod N is N, wherein N and N are positive integers, and N is more than or equal to 0 and less than or equal to N-1.
Optionally, the message queue data table further includes a message execution time field, and the control unit is further configured to: controlling each consumption process to inquire each message in the sub message queue to be read, and aiming at the current message: and judging whether the execution time field of the message is matched with the current time, if so, reading the message, otherwise, not reading the message.
In yet another aspect, an embodiment of the present invention provides a server, which includes any one of the above consumption devices based on a database message queue.
In a final aspect, an embodiment of the present invention provides a computer-readable storage medium, which stores computer program codes for implementing any one of the methods described above.
The technical scheme has the following beneficial effects: the embodiment of the invention uses the database as the message queue service, is convenient to deploy and has lower maintenance cost; although the prior art also uses a database as a queue, the prior art does not support a multi-process consumption queue, only can process a single process, and has limited application scenes; the prior art can only read all message processes from the queue in sequence, but cannot read the messages according to conditions, and the embodiment of the invention supports reading according to conditions when the queue is consumed. At present, other existing message queues do not support reading according to conditions, for example, a message queue for sending short messages in a group mode stores A, B mobile phone numbers and short message contents of two activities to receive short messages, and a traditional queue can only read the short messages in sequence. The queue designed by the embodiment of the invention can support reading the message of the activity A in the morning for sending and reading the message of the activity B in the afternoon for sending. The query is carried out according to the condition, the meaning is that other queue services do not support, and the application scene is richer.
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 is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is an overall flow diagram of a database message queue based consumption method of an embodiment of the invention;
FIG. 2 is a diagram of a prior art consuming process reading one message at a time from a message queue data table for consumption;
FIG. 3 is a multi-process consumption architecture diagram of an embodiment of the present invention;
FIG. 4 is a logical functional block diagram of a database message queue based consuming device of an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. 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.
Example 1:
FIG. 1 is an overall flow diagram of a database message queue based consumption method of an embodiment of the invention. As shown in fig. 1, the method includes: step 110, starting a plurality of independent consuming processes; and step 120, controlling each consuming process to read one sub message queue at a time from the message queue data table stored in the database, wherein each sub message queue comprises a plurality of messages, each message has a unique message Identification (ID), and sets formed by the message IDs contained in each sub message queue have no intersection. The message queue contains a plurality of messages, and the consuming process reads the messages to perform subsequent operations. Therefore, multi-process reading consumption based on the database can be realized, the burden of the database is reduced, and repeated consumption of the message queue can be avoided.
Optionally, the message queue data table includes a message identification ID field, where the message ID field is a self-increment field; and the message IDs of the plurality of messages included in each sub-message queue are successively incremented. The message IDs are continuously incremented, which means that the message IDs are continuously increased in sequence without interruption.
Optionally, the message queue data table includes a message identification ID field, where the message ID field is a self-increment field; the controlling each consuming process to read one sub message queue at a time from the message queue data table stored in the database includes: if N consumption processes exist, the message ID corresponding to the message read by the consumption process with the control number N meets the following formula: and ID mod N is N, wherein N and N are positive integers, and N is more than or equal to 0 and less than or equal to N-1.
Optionally, the message queue data table further includes a message execution time field, and the controlling of each consuming process reads one sub-message queue at a time from the message queue data table stored in the database includes: controlling each consumption process to inquire each message in the sub message queue to be read, and aiming at the current message: and judging whether the execution time field of the message is matched with the current time, if so, reading the message, otherwise, not reading the message.
The following is a more detailed description:
the embodiment of the invention uses the database which is simple to deploy and maintain as the message queue, thereby not only supporting consumption according to conditions and multiple processes, but also reducing the additional operation and maintenance cost. The embodiment of the present invention first establishes a message queue data table for storing message queue data, the message queue data table optionally comprising the following fields: message ID, message name, message content, message execution time (i.e., message read time). Secondly, starting a plurality of message queue consuming processes according to needs, and reading messages from the message queue data table. The embodiment of the invention uses the database as the queue, and has wider application scenes. Wherein, the message ID is a number accumulated from 1, and is a self-increment field, and the message name is a specific mark of the message expressed by characters. A message queue is a collection, and a particular one of the collection is called a message. The message queue is stored in a data table, the data table is stored in a database, and the message queue is realized by relying on the data table.
(1) Multi-process consumption
As shown in fig. 2, if the consuming process reads a message from the message queue data table for consumption each time, and deletes the message from the data table after the processing is finished, the following two problems may be caused; firstly, a consumption process frequently reads and writes a data table to influence the performance of a database; and secondly, the message queue is consumed repeatedly, for example, the consuming process A reads the message with the ID of 100 and does not finish the processing, and the consuming process B also reads the message with the ID of 100 from the data table.
The technical scheme of the embodiment of the invention solves the defects when the data table is used as a message queue through the following technical means. In order to solve the first problem, the embodiment of the present invention reads a plurality of messages at a time, processes the read messages in a recycling manner, and deletes the messages from the data table after all the messages are processed. Therefore, the reading and writing times of the data table can be reduced, and the pressure on the database is reduced. Aiming at the second problem, the ID field in the message queue data table in the embodiment of the invention is a self-increment field, a plurality of consuming processes are numbered, and the consuming processes with different numbers only read the ID in the specified range.
As an example, refer to the multi-process consumption structure diagram shown in FIG. 3 (taking three consumption process processes as an example):
assuming that a total of N consuming processes, the message ID range read by the consuming process number N (N is more than or equal to 0 and less than or equal to N-1) satisfies the following formula:
ID mod N＝n
for example, a certain message queue corresponds to 3 consuming processes (the number of the consuming processes is self-defined according to specific services, and is only an example here), the numbers of the consuming processes are respectively 0, 1 and 2, then the consuming process 0 only reads messages with the message ID divided by 3 and the remainder of 0, that is, messages with the message IDs of 3, 6, 9 and the like, which are analogized in sequence, and these messages form a first sub message queue; the consumption process 1 only reads the messages with the message ID divided by 3 and the remainder of 1, namely the messages with the message IDs of 1, 4, 7 and the like which are analogized in turn, and the messages form a second sub-message queue; consuming process 2 reads messages with the rest of 2, namely messages with message IDs of 2, 5, 8 and the like, which form a third sub-message queue, by dividing the message ID by 3. There is no intersection between the message ID sets of the three sub-message queues, that is, there is no identical message ID.
Examples of related SQL are as follows:
SELECT*FROM table WHERE`id`>last_id AND mod(`id`,5)＝index ORDER BY`id`ASC LIMIT 0,10
last _ ID is the last message ID in the last reading result; index is the current consuming process number.
(2) Temporal policy support
The existing message queue service can only read and consume in sequence, and delete the message after reading, and does not support reading according to conditions. In practical application, some message queues need to be consumed within a specific time period, for example, after an administrator reviews information, a private letter needs to be sent to a user, and since the operation of sending the private letter is time-consuming, the message queues are often used for sending the private letter. In order to avoid harassment of the user, private letter sending operation is required to be carried out in a non-rest time period of the user, so that private letters of the type need to be read and consumed/read in a specific time, and other types of private letters in the message queue need to be read and consumed in real time.
In this scenario, a general message queue service does not support conditional reading, and since the embodiment of the present invention employs a data table to store a message queue, a consuming process can query/read a message execution meeting a current time according to a message execution time field in a message queue data table.
Examples of related SQL are as follows:
SELECT*FROM table WHERE`id`>last_id AND time_sign IN(0,1)AND mod(`id`,5)＝index ORDER BY`id`ASC LIMIT 0,10
the time _ sign field represents a predefined policy, defaults to 0, representing no temporal policy.
This SQL statement reads a message queue with no time policy or a time policy of 1, and no message queue with a time policy of 2 or other types will be read. The time policy includes a message execution/reading time period.
For example, the microblog topics have many scenes needing to send private letters, writing the private letters to be sent in all the scenes into a queue is a relatively efficient implementation manner, and developers of different services only need to write the private letter file to be sent and the sender and the receiver of the message into the queue as message contents and consume the messages in a unified manner by a consumption process. Some services have a requirement on sending time period for sending private letters, for example, the requirement on sending the active private letter in the daytime, and the traditional message queue service cannot meet the requirement on reading the message according to conditions. The message queue based on the database of the embodiment of the invention naturally supports conditional query, and can very conveniently meet business requirements.
The main advantages of the above technical solutions of the embodiments of the present invention include:
the embodiment of the invention uses the database as the message queue service, is convenient to deploy and has lower maintenance cost;
although the prior art also uses a database as a queue, the prior art does not support a multi-process consumption queue, only can process a single process, and has limited application scenes;
the prior art can only read all message processes from the queue in sequence, but cannot read the messages according to conditions, and the embodiment of the invention supports reading according to conditions when the queue is consumed.
Example 2:
FIG. 4 is a logical functional block diagram of a database message queue based consuming device of an embodiment of the present invention. As shown in fig. 4, the consuming apparatus includes: a starting unit 210 for starting a plurality of independent consuming processes; a control unit 220, configured to control each consuming process to read one sub-message queue at a time from a message queue data table stored in the database, where each sub-message queue includes multiple messages, each message has a unique message identification ID, and there is no intersection between sets of message IDs included in each sub-message queue.
Optionally, the message queue data table includes a message identification ID field, where the message ID field is a self-increment field; and the message IDs of the plurality of messages included in each sub-message queue are successively incremented.
Optionally, the message queue data table includes a message identification ID field, where the message ID field is a self-increment field; the control unit 220 may be specifically configured to: if N consumption processes exist, the message ID corresponding to the message read by the consumption process with the control number N meets the following formula: and ID mod N is N, wherein N and N are positive integers, and N is more than or equal to 0 and less than or equal to N-1.
Optionally, the message queue data table further includes a message execution time field, and the control unit 220 is further configured to: controlling each consumption process to inquire each message in the sub message queue to be read, and aiming at the current message: and judging whether the execution time field of the message is matched with the current time, if so, reading the message, otherwise, not reading the message.
The working method and principle of the device are described in detail in embodiment 1, and therefore are not described herein again.
In addition, an embodiment of the present invention provides a server, which includes any one of the consumption devices based on the database message queue. The server may be a script server that communicatively interacts with a database server (on which a database containing message queue data tables is stored), the script server controlling each individual consuming process to read a sub-message queue containing a plurality of messages at a time from the database stored on the database server. And the query according to the time condition can be realized, and only the message of which the execution time field is consistent with the current time is read.
In a final aspect, an embodiment of the present invention provides a computer-readable storage medium, which stores computer program codes for implementing any one of the methods in embodiment 1 above.
The main advantages of the above technical solutions of the embodiments of the present invention include:
the embodiment of the invention uses the database as the message queue service, is convenient to deploy and has lower maintenance cost; the embodiment of the invention supports the starting of a plurality of processes for consumption when the database is used as the message queue, solves the problem of repeated consumption during multi-process consumption, improves the queue processing speed and enlarges the application scene; embodiments of the present invention support conditional reads while consuming a queue.
Those of skill in the art will further appreciate that the various illustrative logical blocks, units, and steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate the interchangeability of hardware and software, various illustrative components, elements, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design requirements of the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present embodiments.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may be stored in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. For example, a storage medium may be coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC, which may be located in a user terminal. In the alternative, the processor and the storage medium may reside in different components in a user terminal.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are merely exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (8)
1. A consumption method based on a database message queue, comprising:
starting a plurality of independent consuming processes;
controlling each consuming process to read one sub message queue at a time from a message queue data table stored in a database, wherein each sub message queue comprises a plurality of messages, each message has a unique message Identification (ID), and sets formed by the message IDs contained in each sub message queue do not have intersection;
wherein, the message queue data table further includes a message execution time field, and the controlling of each consuming process reads one sub-message queue at a time from the message queue data table stored in the database includes: controlling each consumption process to inquire each message in the sub message queue to be read, and aiming at the current message: and judging whether the execution time field of the message is matched with the current time, if so, reading the message, otherwise, not reading the message.
2. The method of claim 1, wherein the message queue data table includes a message Identification (ID) field, wherein the message ID field is a self-increment field; and the message IDs of the plurality of messages included in each sub-message queue are successively incremented.
3. The method of claim 1, wherein the message queue data table includes a message Identification (ID) field, wherein the message ID field is a self-increment field; the controlling each consuming process to read one sub message queue at a time from the message queue data table stored in the database includes:
if N consumption processes exist, the message ID corresponding to the message read by the consumption process with the control number N meets the following formula: and ID mod N is N, wherein N and N are positive integers, and N is more than or equal to 0 and less than or equal to N-1.
4. A database message queue-based consumption device, comprising:
a starting unit for starting a plurality of independent consuming processes;
the control unit is used for controlling each consumption process to read one sub message queue at a time from a message queue data table stored in the database, each sub message queue comprises a plurality of messages, each message has a unique message Identification (ID), and no intersection exists among sets formed by the message IDs contained in each sub message queue;
wherein, the message queue data table further includes a message execution time field, and the control unit is further configured to: controlling each consumption process to inquire each message in the sub message queue to be read, and aiming at the current message: and judging whether the execution time field of the message is matched with the current time, if so, reading the message, otherwise, not reading the message.
5. The apparatus of claim 4, wherein the message queue data table includes a message Identification (ID) field, and wherein the message ID field is a self-increment field; and the message IDs of the plurality of messages included in each sub-message queue are successively incremented.
6. The apparatus of claim 4, wherein the message queue data table includes a message Identification (ID) field, and wherein the message ID field is a self-increment field; the control unit is specifically configured to: if N consumption processes exist, the message ID corresponding to the message read by the consumption process with the control number N meets the following formula: and ID mod N is N, wherein N and N are positive integers, and N is more than or equal to 0 and less than or equal to N-1.
7. A server, comprising a database message queue based consuming device according to any of claims 4-6.
8. A computer-readable storage medium, characterized in that it stores corresponding computer program code for implementing the method according to any one of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810235207.5A CN108536544B (en) | 2018-03-21 | 2018-03-21 | Consumption method, device, server and medium based on database message queue |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810235207.5A CN108536544B (en) | 2018-03-21 | 2018-03-21 | Consumption method, device, server and medium based on database message queue |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108536544A CN108536544A (en) | 2018-09-14 |
| CN108536544B true CN108536544B (en) | 2021-06-25 |
Family
ID=63485035
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810235207.5A Active CN108536544B (en) | 2018-03-21 | 2018-03-21 | Consumption method, device, server and medium based on database message queue |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108536544B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109271417B (en) * | 2018-11-23 | 2022-04-22 | 福建榕基软件股份有限公司 | Database-based lightweight message queue implementation method and storage device |
| CN112685191B (en) * | 2019-10-18 | 2023-09-22 | 北京京东振世信息技术有限公司 | Message processing method and device |
| CN111552575B (en) * | 2019-12-31 | 2023-09-12 | 远景智能国际私人投资有限公司 | Message consumption method, device and equipment based on message queue |
| CN113194125A (en) * | 2021-04-19 | 2021-07-30 | 天津市滨海新区环境创新研究院 | Packet loss retransmission method and system based on Internet of things platform |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102129443A (en) * | 2010-12-30 | 2011-07-20 | 中国民航信息网络股份有限公司 | Real-time data transmission channel and method based on USAS (Univac Standard Airline Systems) host |
| CN102831014A (en) * | 2012-07-30 | 2012-12-19 | 华中科技大学 | Method for prompting IO (input/output) parallelism and reducing small IO delay by utilizing multiple request queues |
| CN102004743B (en) * | 2009-09-02 | 2013-08-14 | 中国银联股份有限公司 | System and method for copying data among heterogeneous databases |
| CN103677988A (en) * | 2013-12-11 | 2014-03-26 | 北京爱唯光石信息技术有限公司 | Multi-process communication method and system for software system |
| CN105701257A (en) * | 2016-03-31 | 2016-06-22 | 北京奇虎科技有限公司 | Data processing method and device |
| CN107025142A (en) * | 2016-01-29 | 2017-08-08 | 华为技术有限公司 | A kind of cross-thread message delivery method, device and electronic equipment |
Family Cites Families (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040059744A1 (en) * | 2002-09-19 | 2004-03-25 | Cedars-Sinai Medical Center | Data repository system |
| CN101097527B (en) * | 2006-06-27 | 2011-11-30 | 中国银联股份有限公司 | Flowpath scheduling method and system of application progress |
| US8869169B2 (en) * | 2007-04-30 | 2014-10-21 | Accenture Global Services Limited | Alternately processing messages |
| JP5181184B2 (en) * | 2008-03-28 | 2013-04-10 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Apparatus and method for executing agent |
| CN103207806B (en) * | 2012-01-12 | 2016-05-04 | 阿里巴巴集团控股有限公司 | A kind of method and system thereof that sends message |
| CN103856393B (en) * | 2013-07-09 | 2017-11-03 | 上海携程商务有限公司 | Distributed message middleware system and its operation method based on database |
| US20170147652A1 (en) * | 2015-11-19 | 2017-05-25 | Institute For Information Industry | Search servers, end devices, and search methods for use in a distributed network |
| US10204130B2 (en) * | 2016-03-23 | 2019-02-12 | International Business Machines Corporation | Transactional table truncation for concurrent transactions |
| CN106100967A (en) * | 2016-05-24 | 2016-11-09 | 微梦创科网络科技（中国）有限公司 | A kind of method and device sending message |
| US20170357708A1 (en) * | 2016-06-13 | 2017-12-14 | Joviandata, Inc. | Apparatus and method for processing multi-dimensional queries in a shared nothing system through tree reduction |
| CN107766393B (en) * | 2016-08-22 | 2021-12-14 | 中国移动通信集团内蒙古有限公司 | Information processing method based on database, client and server |
| CN106789741B (en) * | 2016-12-26 | 2020-02-18 | 北京奇虎科技有限公司 | Consumption method and device of message queue |
| CN107196848B (en) * | 2017-05-09 | 2018-09-04 | 腾讯科技（深圳）有限公司 | Information push method and device |
-
2018
- 2018-03-21 CN CN201810235207.5A patent/CN108536544B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102004743B (en) * | 2009-09-02 | 2013-08-14 | 中国银联股份有限公司 | System and method for copying data among heterogeneous databases |
| CN102129443A (en) * | 2010-12-30 | 2011-07-20 | 中国民航信息网络股份有限公司 | Real-time data transmission channel and method based on USAS (Univac Standard Airline Systems) host |
| CN102831014A (en) * | 2012-07-30 | 2012-12-19 | 华中科技大学 | Method for prompting IO (input/output) parallelism and reducing small IO delay by utilizing multiple request queues |
| CN103677988A (en) * | 2013-12-11 | 2014-03-26 | 北京爱唯光石信息技术有限公司 | Multi-process communication method and system for software system |
| CN107025142A (en) * | 2016-01-29 | 2017-08-08 | 华为技术有限公司 | A kind of cross-thread message delivery method, device and electronic equipment |
| CN105701257A (en) * | 2016-03-31 | 2016-06-22 | 北京奇虎科技有限公司 | Data processing method and device |
Non-Patent Citations (2)
| Title |
|---|
| "协同信息处理系统中信息流转过程的设计";郑刚 等;《计算机工程与设计》;20031231;第24卷(第12期);第28-30页 * |
| "基于软总线的ICT融合通信服务器体系结构研究";林浒 等;《小型微型计算机系统》;20151130;第36卷(第11期);第2536-2539页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108536544A (en) | 2018-09-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108536544B (en) | Consumption method, device, server and medium based on database message queue | |
| CN111917863B (en) | Message pushing method and device, television equipment and computer storage medium | |
| US20060288037A1 (en) | Queued system event notification and maintenance | |
| CN108390933B (en) | Message distribution method, device, server and storage medium | |
| CN109842621A (en) | A kind of method and terminal reducing token storage quantity | |
| CN110334086A (en) | Data duplicate removal method, device, computer equipment and storage medium | |
| CN108304272B (en) | Data IO request processing method and device | |
| CN110555068A (en) | Data export method and device | |
| CN106021512A (en) | Page refresh method and apparatus | |
| CN111210340A (en) | Automatic task processing method and device, server and storage medium | |
| CN103842960A (en) | Method and apparatus for inter-widget communication | |
| CN110069506A (en) | Maintaining method, device and the server of business datum | |
| CN109067864B (en) | Notification message pushing method and device and electronic equipment | |
| CN103905661A (en) | Message forwarding method and cloud server | |
| CN108428182B (en) | Development platform device, method for acquiring policy number, and computer-readable storage medium | |
| CN111078384A (en) | Method and device for migrating core data, computer equipment and storage medium | |
| CN114402313A (en) | Label updating method and device, electronic equipment and storage medium | |
| CN107124353B (en) | Message processing method and device, computer device and storage medium | |
| US20150120607A1 (en) | System and method for customer event email consolidation and delivery | |
| CN112966005B (en) | Timing message sending method, device, computer equipment and storage medium | |
| CN111901416B (en) | System and method for solving data impact of big data platform | |
| CN113672488A (en) | Log text processing method and device | |
| CN109587353B (en) | Method, device and storage medium for identifying short message number attribution information | |
| CN111274203B (en) | System and method for storing telephone bill | |
| CN113824763B (en) | Message pushing method, device, computer 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |