CN115277618A - Data processing system for message sending - Google Patents
Data processing system for message sending Download PDFInfo
- Publication number
- CN115277618A CN115277618A CN202210878373.3A CN202210878373A CN115277618A CN 115277618 A CN115277618 A CN 115277618A CN 202210878373 A CN202210878373 A CN 202210878373A CN 115277618 A CN115277618 A CN 115277618A
- Authority
- CN
- China
- Prior art keywords
- user
- target
- original
- list
- app
- 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
- 238000012545 processing Methods 0.000 title claims abstract description 20
- 239000013256 coordination polymer Substances 0.000 claims description 17
- 238000000034 method Methods 0.000 claims description 12
- 230000005540 biological transmission Effects 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 6
- 230000008569 process Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000003064 k means clustering Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 239000002904 solvent Substances 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Images
Classifications
-
- 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)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The application provides a data processing system for message sending, which obtains an original user ID which does not receive a target message in a first mode from original user IDs and sends the target message to the original user ID which does not receive the target message in a second mode, so that each original user ID is not omitted when the target message is sent, and the target message is sent more accurately; in addition, the target message is sent to the original user ID which meets the key condition set by the third-party server in the original user ID in a third mode, so that user resources are saved; the user IDs corresponding to the APPs and exceeding the preset threshold are independently stored in the database, and clustering processing is carried out on the rest of the APPs to form a priority list mode, and the user IDs in different priority lists can also be subjected to parallel processing, so that timeliness of processing the user IDs can be guaranteed, and time resources of users are saved.
Description
Technical Field
The present application relates to the field of message processing technologies, and in particular, to a data processing system for message transmission.
Background
In the prior art, when a certain APP needs to send a message to a user corresponding to the APP, the message is often sent through a connection channel between the APP itself and the user, when a connection channel between the user and the APP is in an online state, the user can receive the message sent by the APP, however, when the connection channel between the user and the APP is in an offline state, the user cannot receive the message sent by the APP, and therefore the situation that the user is not informed of important messages may be caused.
Disclosure of Invention
Aiming at the technical problems, the technical scheme adopted by the invention is as follows:
a data processing system for messaging, the system comprising: database SK = (SK)1，SK2，...，SKr，...，SKs)，SKrIs the r-th database, r has a value from 1 to s, s is the number of databases, SKrMiddle jth APP List Pj＝(Pj1，Pj2，...，Pjg，...，Pjzj)，PjgFor the g-th user ID in the jth APP, y takes values from 1 to gj, gj is the number of user IDs in the jth APP, j takes values from 1 to nr, nr is the number of APP lists included in the r-th database, and when the computer program is executed by the processor, the following steps are implemented:
s100, according to PjAcquiring a target user ID list AP = (AP)1，AP2，...，APi，...，APm)，APiThe value of i is 1 to m for the ith target user, m is the number of the target users, and the ID of the target user is the user in the off-line state recorded in the database in the pre-observation time period before the target message is issued;
s200, according to PjAcquiring an intermediate user ID list BP = (BP)1，BP2，....，BPt，...，BPk)，BPtIs PjThe value of t is 1 to t of the middle t intermediate user IDk, k is PjThe number of intermediate user IDs is the number of user IDs in an online state recorded in a database in a pre-observation time period before target information is issued;
s300, acquiring a key user ID list CP = (CP) according to BP1，CP2，...，CPf，...，CPd)，CPfF is the f-th key user ID, the value of f is 1 to d, d is the number of the key user IDs, and the key user IDs are the user IDs which are not successful in issuing target messages to the key user IDs in the BP;
s400, acquiring an end user ID list ZP = (ZP) according to the AP and the CP1，ZP2，...，ZPb，...，ZPv)，ZPbB is a b-th end user ID list, the value of b is 1 to v, v is the number of end user IDs, and the end user IDs are user IDs needing to send target messages through a short message channel;
s500, judging whether the short message sending condition is met or not according to the ZP, and if the short message sending condition is met, carrying out short message channel alignment on the ZPbAnd issuing the target message.
The application has at least the following technical effects: the method comprises the steps of obtaining an original user ID corresponding to an original user in a first state within a preset time period and an original user ID corresponding to an original user in a second state within the preset time period, obtaining the original user ID which does not receive a target message in the first state in the original user ID of the first state through a first mode based on the original user ID corresponding to the original user in the second state within the preset time period, and sending a target message to the original user ID which does not receive the target message through a second mode, so that the target message is issued without omitting each original user ID, and the target message is issued more accurately; in addition, the target message is sent to the original user ID which meets the key condition set by the third-party server in the original user ID in a third mode, so that user resources are saved;
by separately storing the user IDs, exceeding the preset threshold, corresponding to the APPs in the database and clustering the rest of the APPs, the priority list is formed, and the user IDs in different priority lists can be processed in parallel, so that the timeliness of processing the user IDs can be ensured, and the time resource of the user is saved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a flowchart illustrating a computer program executed by a data processing system based on message sending according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, 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 application.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or server that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The embodiment of the application provides a medicineA data processing system for message delivery, the system comprising: APP set P, processor and memory storing a computer program, the P = { P = { P = }1，P2，...，Pj，...，Pn}，Pj＝(Pj1，Pj2，...，Pjr，...，Pjsj)，Pjr＝(Pjr1，Pjr2，...，Pjrg，...，Pjrzr)，PjrgFor the g original user ID of the r APP in the jth APP list, j takes values from 1 to n, n is the number of APP lists, r takes values from 1 to sj, sj is the number of APPs in the jth APP list, g takes values from 1 to zr, and zr is the number of original user IDs in the r APP, when the computer program is executed by the processor, the following steps are implemented:
s100, from PjrGet the target user ID list AP = (AP)1，AP2，...，APi，...，APm)，APiAnd for the ith target user ID, the value of i is 1 to m, m is the number of the target user IDs, and the target user ID is the original user ID corresponding to the original user in the first state in a preset time period.
Specifically, the original user ID is a unique identity of the original user, and the P isjrThe field(s) of (1) may include an original ID corresponding to the original user ID, and a person skilled in the art may set the original ID according to actual requirements, the electronic device corresponding to the original user ID, and the third-party server corresponding to the electronic device.
The electronic device of embodiments of the present invention exists in a variety of forms, including but not limited to:
(1) Mobile communication devices, which are characterized by mobile communication capabilities and are primarily targeted at providing voice and data communications. Such terminals include: smart phones (e.g., iphones), multimedia phones, functional phones, and low-end phones, among others.
(2) The ultra-mobile personal computer equipment belongs to the category of personal computers, has calculation and processing functions and generally has the characteristic of mobile internet access. Such terminals include PDA, MID, and UMPC devices, such as ipads.
(3) Portable entertainment devices such devices may display and play multimedia content. Such devices include audio and video players (e.g., ipods), handheld game consoles, electronic books, as well as smart toys and portable car navigation devices.
(4) The server is similar to a general computer architecture, but has higher requirements on processing capacity, stability, reliability, safety, expandability, manageability and the like because of the need of providing high-reliability service.
(5) And other electronic equipment with a data interaction function. Further, to PjrThe state of the original user ID is updated as necessary.
Preferably, P is paired every 10msjrThe state of the user ID is monitored once, and when the state is monitored to be PjrWhen the state of the original user ID changes, the changed state is updated, and P is updatedjrAnd deleting the storage record corresponding to the last state.
Specifically, those skilled in the art may set the pre-period according to actual situations, which is not described herein.
Further, the first state is that the original user corresponding to the original user ID is in an offline state.
Further, the offline state may be understood as that the target user and the APP message issuing channel are in a disconnected state, the target message sent by the APP issuing channel cannot be received, and there is no target user ID connected with the third-party server.
The method in S100 further comprises the following steps:
s110, traverse PjObtain FP = (FP)1，FP2，...，FPe，...，FPh)，FeIs PjThe value of e is 1 to h, h is the user ID connected with the third party serverjThe number of user IDs to which the third party server is connected.
Specifically, the user ID connected to the pre-third-party server may be understood as a user ID that can receive the APP target message through the third-party server.
S120, traversing F based on the target overrun condition set by the third-party server, and acquiring DP = (DP)1，DP2，...，DPx，...，DPq)，DPxAnd F, setting the value of x to q for the xth user ID meeting the target condition set by the third-party server in the F, wherein q is the number of the user IDs meeting the target condition set by the third-party server in the F.
Specifically, the user ID meeting the target overrun condition set by the third-party server issues the target message in a third manner.
Further, the third mode is different from the first mode and the second mode.
Further, the target condition of the third-party server comprises the first target condition and/or the second target condition, and when any target condition is not met, the target message is not sent by the third mode.
Further, the first target condition is that a target message sent to the current mobile terminal within a time threshold does not exceed a preset sending target message threshold, and the second target condition is that the target message does not have limiting words, such as words of testing and the like.
Preferably, the time threshold is 24h.
S130, according to PjAnd DP, acquiring the AP.
In particular, the amount of the solvent to be used,
s200, slave PjrGet intermediate user ID list BP = (BP)1，BP2，....，BPt，...，BPk)，BPtIs PjThe value of t is 1 to k, and k is PjThe number of the intermediate user IDs is the original user ID corresponding to the original user in the second state within the preset time period.
Specifically, the online state may be understood as that the user and the APP message issuing channel are in a connected state, and may receive a target message sent by the APP issuing channel.
S300, BP is paired through a first modetIssuing a target message, and acquiring a key user ID list CP = (CP)1，CP2，...，CPf，...，CPd)，CPfAnd f is the f-th key user ID, the value of f is 1 to d, d is the number of the key user IDs, and the key user IDs are the intermediate user IDs corresponding to the intermediate users which do not receive the target message.
Specifically, S300 includes the following steps:
s310, monitoring the time of the data in the BP when the target message is sent, and acquiring the user ID which is in the first state in the midway of sending the target message to the key user ID in the BP in a first mode.
Specifically, the user ID which is in the first state midway during the process of issuing the target message to the key user ID in the BP by the first method may be understood as that, in the process of sending the message, the monitored second state is updated to the intermediate user ID in the first state in real time.
S320, monitoring the data in the BP in real time when the target message is sent, sending the target message in a first mode to the intermediate user ID which is always in the second state in the BP, and acquiring the intermediate user ID which does not receive the feedback message.
Specifically, the feedback message is sent by the APP side to the CP.
S330, adding the user ID which is in the first state in the midway of sending the target message to the key user ID in the BP by the first mode and the intermediate user ID which does not receive the feedback message to obtain the CP.
S400, acquiring an end user ID list ZP = (ZP) according to the AP and the CP1，ZP2，...，ZPb，...，ZPv)，ZPbAnd b is a b-th end user ID list, the value of b is 1 to v, v is the number of the end user IDs, and the end user IDs are the user IDs needing to send the target message in the second mode.
S500, when ZPbWhen the corresponding target message issuing condition meets the key condition, the prompt message is sent to the ZP in a second modebAnd the content of the prompt message is consistent with that of the target message.
In particular, the critical conditions comprise a first critical condition and/or a second critical condition.
Further, the first key condition is a threshold of transmission quantity, and the second key condition is a threshold of transmission resources.
Further, the skilled person can set the threshold value v of the number of transmissions according to the need0When v < v0If so, the sending condition is met; the technical personnel in the field can set a sending resource threshold value according to the requirements, and when the used resource of the ZP down-sending target message through a third channel is less than the sending resource threshold value, the sending condition is met.
And further, when the target condition is judged not to be met, early warning is carried out on the display device, and a user is prompted.
Based on S100 to S500, acquiring an original user ID corresponding to an original user in a first state within a preset time period and an original user ID corresponding to an original user in a second state within the preset time period, acquiring the original user ID which does not receive a target message in the first state based on the original user ID corresponding to the original user in the second state within the preset time period, and sending the target message to the original user ID which does not receive the target message in a second mode, so that the target message is issued without omitting each original user ID, and the target message is issued more accurately; in addition, the target message is sent to the original user ID which meets the key condition set by the third-party server in the original user ID through the third mode, so that the user resource is saved.
Before S100, the following steps are also included:
s10, obtaining an original APP list RP = (RP)1，RP2，...，RPc，...，RPu)，
RPcwFor the w-th user ID in the c-th target APP, the values of c are from 1 to u, u is the number of target APPs, and the values of w are from 1 to u
The number of original user IDs in the c-th original APP.
Specifically, u = s1+ s2+.. + sj +.. + sn.
S20, obtaining the original APP with the ID request quantity of each classified query user larger than or equal to a preset threshold value from the RP, and independently storing the original APP to the PjIn (1).
In particular, different PjCan simultaneously inquire the state of the original user ID, namely different PjIn between are states of parallel processing.
S30, clustering original APPs except the APPs with the user ID query quantity smaller than a preset threshold value in each category of the RP, and constructing a priority list SH = (SH)1，SH2，SH3) And stored in the same PjIn (SH)1Is a first priority set list, SH2Is a second priority set list, SH3As a third priority set list.
Specifically, in the embodiment of the present invention, the first priority set list is a high priority list, the second priority set list is a medium priority set list, the third priority set list is a low priority set list, and the initial states of SH1, SH2, and SH3 are all empty sets.
Further, the statuses of the target users in the first priority list, the second priority list and the third priority list may be detected at the same time, which may be understood as parallel processing of the first priority list, the second priority list and the third priority list.
Further, those skilled in the art know that any method for clustering the original APP falls within the scope of the present invention.
Preferably, in the embodiment of the present invention, the priority list SH is constructed using a k-means clustering algorithm.
Specifically, a target APP list formed by the original APPs with the query user ID request amount per category < the preset threshold in the RP is vectorized to obtain FP = (FP)1，FP2，...，FPɑ，...，FPε)，FPɑFor the first target APP, the value of a is 1 to epsilon, and epsilon is the number of target APPs, and those skilled in the art know that any method for performing normalization processing on the target APPs falls within the scope of the present invention.
Further, three priority lists need to be divided, so that 3 points are created as initial centroids, and the values of any initial centroid are different.
Further, FP is calculatedɑEuclidean distance FP to each initial centroidou ɑ。
Further, FP is obtainedɑMinimum Euclidean distance to initial centroid FPou0 ɑWill FPɑDistribution to FPou0 ɑIn the priority list of the corresponding initial centroids; setting alpha = alpha +1, if alpha < epsilon, repeating the steps, otherwise, obtaining 3 priority lists.
The advantage of using k-means for processing is that the implementation is simple, the number of parameters to be adjusted is small, and the clustering effect is guaranteed while the clustering speed is high.
In the steps S10-S30, the user IDs corresponding to the APPs and exceeding the preset threshold are separately stored in the database, and the rest of the APPs are clustered to form the priority list, and the user IDs in different priority lists can be processed in parallel, so that the timeliness of processing the user IDs can be ensured, and the time resource of the user can be saved.
Although some specific embodiments of the present application have been described in detail by way of illustration, it should be understood by those skilled in the art that the above illustration is only for purposes of illustration and is not intended to limit the scope of the present application. Those skilled in the art will also appreciate that various modifications might be made to the embodiments without departing from the scope and spirit of the present application. The scope of the disclosure of the present application is defined by the appended claims.
Claims (9)
1. A data processing system for messaging, the system comprising: APP set P, processor and memory storing a computer program, the P = { P = { P = }1，P2，...，Pj，...，Pn}，Pj＝(Pj1，Pj2，...，Pjr，...，Pjsj)，Pjr＝(Pjr1，Pjr2，...，Pjrg，...，Pjrzr)，PjrgFor the g original user ID of the r APP in the jth APP list, j takes values from 1 to n, n is the number of APP lists, r takes values from 1 to sj, sj is the number of APPs in the jth APP list, g takes values from 1 to zr, and zr is the number of original user IDs in the r APP, when the computer program is executed by the processor, the following steps are implemented:
s100, from PjrGet target user ID list AP = (AP)1，AP2，...，APi，...，APm)，APiFor the ith target user ID, the value of i is 1 to m, m is the number of the target user IDs, and the target user IDs are the original user IDs corresponding to the original users in the first state within a preset time period;
s200, slave PjrIn-process acquisition intermediate user ID list BP = (BP)1，BP2，....，BPt，...，BPk)，BPtIs PjThe value of t is 1 to k, and k is PjThe number of the intermediate user IDs is the original user ID corresponding to the original user in the second state within the preset time period;
s300, BP is paired through a first modetIssuing a target message, and acquiring a key user ID list CP = (CP)1，CP2，...，CPf，...，CPd)，CPfF is the f key user ID, the values of f are 1 to d, and d is key purposeThe number of the user IDs is equal to the number of the key user IDs corresponding to the intermediate users which do not receive the target message;
s400, acquiring an end user ID list ZP = (ZP) according to the AP and the CP1，ZP2，...，ZPb，...，ZPv)，ZPbB is a value from 1 to v of a b-th end user ID list, v is the number of end user IDs, and the end user IDs are user IDs needing to issue target messages through a second mode;
s500, treating as ZPbWhen the corresponding target message issuing condition meets the key condition, the prompt message is sent to the ZP in a second modebAnd the content of the prompt message is consistent with that of the target message.
2. The system of claim 1, further comprising, before S100, the steps of:
s10, obtaining an original APP list RP = (RP)1，RP2，...，RPc，...，RPu)，RPc＝(RPc1，RPc2，...，RPcw，...，
)，RPcwFor the w-th user ID in the c-th target APP, the value of c is 1 to u, u is the number of the target APPs, and the value of w is 1 to u
The number of original user IDs in the c original APP;
s20, obtaining the original APP with the user ID request quantity of each type of inquiry being larger than a preset threshold value from the RP, and storing the original APP to the P independentlyjPerforming the following steps;
s30, clustering original APPs except the APPs with the user ID query quantity larger than a preset threshold value in each type of RP, and constructing a priority list SH = (SH)1，SH2，SH3) And stored in the same PjIn (SH)1Is a first priority set list, SH2Is a second priority set list, SH3Is a third priority set list.
3. The system of claim 1, wherein the first manner is different from the second manner.
4. The system of claim 1, wherein the first state is that an original user corresponding to an original user ID is in an offline state, and the second state is that the original user ID corresponds to the original user in a second state.
5. The system according to claim 1, further comprising, in S100, the steps of:
s110, traverse PjObtain FP = (FP)1，FP2，...，FPe，...，FPh)，FeIs PjThe value of e is 1 to h, h is the user ID connected with the third party serverjThe number of user IDs connected to the third-party server;
s120, traversing F based on the target overrun condition set by the third-party server, and acquiring DP = (DP)1，DP2，...，DPx，...，DPq)，DPxThe value of x is 1 to q, and q is the number of the user IDs which meet the target condition set by the third-party server in the F;
s130, according to PjAnd DP, acquiring the AP.
6. The system of claim 5,
7. the system of claim 5, wherein the target condition of the third party server comprises a first target condition and/or a second target condition; the first target condition is that a target message sent to the current mobile terminal within a time threshold does not exceed a preset sending target message threshold, and the second target condition is that the target message does not contain limiting words.
8. The system according to claim 1, wherein in S500, the key condition comprises a first key condition and/or a second key condition; the first key condition is a transmission number threshold, and the second key condition is a transmission resource threshold.
9. The system according to claim 1, wherein in S500, when it is determined that the target condition is not met, a warning is given on a display device to prompt a user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210878373.3A CN115277618B (en) | 2022-07-25 | 2022-07-25 | Data processing system for message transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210878373.3A CN115277618B (en) | 2022-07-25 | 2022-07-25 | Data processing system for message transmission |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115277618A true CN115277618A (en) | 2022-11-01 |
| CN115277618B CN115277618B (en) | 2024-01-30 |
Family
ID=83769453
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210878373.3A Active CN115277618B (en) | 2022-07-25 | 2022-07-25 | Data processing system for message transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115277618B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060129643A1 (en) * | 2002-12-18 | 2006-06-15 | Nielson Peter D | Instant messaging and presence services |
| US20100325470A1 (en) * | 2008-07-04 | 2010-12-23 | 3Rd Brand Pte. Ltd. | Extended Messaging Platform |
| CN106161190A (en) * | 2015-04-02 | 2016-11-23 | 北大方正集团有限公司 | Point-to-point instant communicating method |
| WO2018094572A1 (en) * | 2016-11-22 | 2018-05-31 | 深圳前海达闼云端智能科技有限公司 | Information viewing method, device and equipment |
| CN108667899A (en) * | 2018-03-29 | 2018-10-16 | 挂号网（杭州）科技有限公司 | Multiple terminals message synchronization and isolation instant communication method and system |
| CN114006938A (en) * | 2021-09-24 | 2022-02-01 | 深圳市佳创视讯技术股份有限公司 | Message routing issuing method, device, equipment and storage medium of distributed cluster |
| CN114186053A (en) * | 2022-02-17 | 2022-03-15 | 中科雨辰科技有限公司 | Sending method for event message |
| CN114461595A (en) * | 2022-01-28 | 2022-05-10 | 杭州网易云音乐科技有限公司 | Method, device, medium and electronic equipment for sending message |
| CN114500422A (en) * | 2022-01-18 | 2022-05-13 | 上海广亿信息技术有限公司 | Manjobinstant messaging method based on internet technology application and framework thereof |
-
2022
- 2022-07-25 CN CN202210878373.3A patent/CN115277618B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060129643A1 (en) * | 2002-12-18 | 2006-06-15 | Nielson Peter D | Instant messaging and presence services |
| US20100325470A1 (en) * | 2008-07-04 | 2010-12-23 | 3Rd Brand Pte. Ltd. | Extended Messaging Platform |
| CN106161190A (en) * | 2015-04-02 | 2016-11-23 | 北大方正集团有限公司 | Point-to-point instant communicating method |
| WO2018094572A1 (en) * | 2016-11-22 | 2018-05-31 | 深圳前海达闼云端智能科技有限公司 | Information viewing method, device and equipment |
| CN108667899A (en) * | 2018-03-29 | 2018-10-16 | 挂号网（杭州）科技有限公司 | Multiple terminals message synchronization and isolation instant communication method and system |
| CN114006938A (en) * | 2021-09-24 | 2022-02-01 | 深圳市佳创视讯技术股份有限公司 | Message routing issuing method, device, equipment and storage medium of distributed cluster |
| CN114500422A (en) * | 2022-01-18 | 2022-05-13 | 上海广亿信息技术有限公司 | Manjobinstant messaging method based on internet technology application and framework thereof |
| CN114461595A (en) * | 2022-01-28 | 2022-05-10 | 杭州网易云音乐科技有限公司 | Method, device, medium and electronic equipment for sending message |
| CN114186053A (en) * | 2022-02-17 | 2022-03-15 | 中科雨辰科技有限公司 | Sending method for event message |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115277618B (en) | 2024-01-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20090164574A1 (en) | System and method for identifying transient friends | |
| US20140195682A1 (en) | Method, server and computer storage medium for logging in | |
| CN106611133B (en) | Risk identification method and equipment | |
| WO2014194642A1 (en) | Systems and methods for matching users | |
| CN110046901B (en) | Credibility verification method, system, device and equipment of alliance chain | |
| CN110909225B (en) | Social group determination method, device, equipment and computer storage medium | |
| CN114339755A (en) | Registration verification method and device, electronic equipment and computer readable storage medium | |
| CN114186053A (en) | Sending method for event message | |
| CN115001747A (en) | Device control method, device, electronic device and storage medium | |
| CN115277618A (en) | Data processing system for message sending | |
| CN112468465B (en) | Guarantee derivation-based terminal account identity authentication method and system in zero trust environment | |
| CN113680074A (en) | Business information pushing method and device, electronic equipment and readable medium | |
| CN112559217A (en) | Message reliability consumption idempotent processing method and processing device | |
| US10872121B2 (en) | Systems and methods for matching users | |
| CN116939566A (en) | Bluetooth connection method and device and terminal equipment | |
| CN113891323B (en) | WiFi-based user tag acquisition system | |
| CN107124330B (en) | Data downloading control method and system | |
| CN104811365B (en) | Message delivery method, system and server based on real-time communication social group | |
| CN112929348B (en) | Information processing method and device, electronic equipment and computer readable storage medium | |
| CN113099453A (en) | Authentication method, device and equipment for access server and readable storage medium | |
| CN113890753A (en) | Digital identity management method, device, system, computer equipment and storage medium | |
| CN112181766A (en) | Early warning method based on application software, computer equipment and storage medium | |
| CN113254839A (en) | Layer-by-layer message distribution method, electronic client and medium | |
| CN112702743A (en) | Network data monitoring and protecting method based on artificial intelligence | |
| CN107885618B (en) | Data monitoring method, device, equipment and storage medium based on network game |
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 |