CN115277618B - Data processing system for message transmission - Google Patents

Data processing system for message transmission Download PDF

Info

Publication number
CN115277618B
CN115277618B CN202210878373.3A CN202210878373A CN115277618B CN 115277618 B CN115277618 B CN 115277618B CN 202210878373 A CN202210878373 A CN 202210878373A CN 115277618 B CN115277618 B CN 115277618B
Authority
CN
China
Prior art keywords
user
target
original
app
list
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
Application number
CN202210878373.3A
Other languages
Chinese (zh)
Other versions
CN115277618A (en
Inventor
陈建斌
叶新江
彭雷
刘汉兴
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Merit Interactive Co Ltd
Original Assignee
Merit Interactive Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Merit Interactive Co Ltd filed Critical Merit Interactive Co Ltd
Priority to CN202210878373.3A priority Critical patent/CN115277618B/en
Publication of CN115277618A publication Critical patent/CN115277618A/en
Application granted granted Critical
Publication of CN115277618B publication Critical patent/CN115277618B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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 Transfer Between Computers (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The application provides a data processing system for message transmission, which is used for transmitting a target message to original user IDs which do not receive the target message in a first mode by acquiring the original user IDs in the original user IDs, and transmitting the target message to the original user IDs which do not receive the target message in a second mode, so that each original user ID is not missed by the target message transmission, and the target message transmission is more accurate; in addition, as for the original user ID which accords with the key conditions set by the third-party server in the original user ID, the target message is sent in a third mode, so that user resources are saved; the user IDs corresponding to the APP are stored in the database independently and are clustered to form a priority list, and the user IDs in different priority lists can be processed in parallel, so that timeliness of processing the user IDs can be guaranteed, and time resources of the user can be saved.

Description

Data processing system for message transmission
Technical Field
The present application relates to the field of message processing technologies, and in particular, to a data processing system for sending a message.
Background
In the prior art, when a certain APP needs to send a message to a corresponding user, the message is often sent through a connection channel between the APP and the user, when a connection channel between the user and the APP is in an on-line 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 off-line state, the user cannot receive the message sent by the APP, so that the situation that the user is not informed of important messages is possibly caused.
Disclosure of Invention
Aiming at the technical problems, the invention adopts the following technical scheme:
a data processing system for messaging, the system comprising: database SK, processor and memoryMemory storing a computer program, the database Sk= (SK) 1 ，SK 2 ，...，SK r ，...，SK s )，SK r For the r-th database, the value of r is 1 to s, s is the number of databases, SK r J th APP list P in (a) j ＝(P j1 ，P j2 ，...，P jg ，...，P jzj )，P jg For the g-th user ID in the j-th APP, the value of y is 1 to gj, gj is the number of user IDs in the j-th APP, the value of j is 1 to nr, nr is the number of APP lists included in the r-th database, when the computer program is executed by the processor, the following steps are implemented:
s100 according to P j Acquisition of target user ID list ap= (AP 1 ，AP 2 ，...，AP i ，...，AP m )，AP i For the ith target user, i is 1 to m, m is the number of the target users, and the ID of the target user is the user with the offline state recorded in the database in the pre-observation time period before the target message is issued;
s200, according to P j Acquiring an intermediate user ID list bp= (BP 1 ，BP 2 ，....，BP t ，...，BP k )，BP t Is P j T-th intermediate user ID of (1) to (k), where k is P j The number of the intermediate user IDs is the number of the user IDs with online states recorded in the database in a pre-observation time period before the target message is issued;
s300, acquiring a key user ID list CP= (CP) according to BP 1 ，CP 2 ，...，CP f ，...，CP d )，CP f The f-th key user ID is the value of f from 1 to d, d is the number of the key user IDs, and the key user IDs are the user IDs which do not successfully issue the target message to the key user IDs in the BP;
s400, acquiring an end user ID list ZP= (ZP) according to the AP and the CP 1 ，ZP 2 ，...，ZP b ，...，ZP v )，ZP b For the b-th end user ID list, b has a value of 1 to v, v being the number of end user IDs, the end useThe user ID is the user ID which needs to send the target message through the short message channel;
s500, judging whether the short message sending condition is met according to the ZP, and when the short message sending condition is met, carrying out short message channel on the ZP b And issuing the target message.
The application has the following technical effects: acquiring an original user ID corresponding to an original user in a first state in a preset time period and an original user ID corresponding to an original user in a second state in the preset time period, acquiring an original user ID which does not receive a target message in the original user ID in the first state in a first mode based on the original user ID corresponding to the original user in the second state in the preset time period, and transmitting the target message to the original user ID which does not receive the target message in the second mode, so that each original user ID is not missed in the target message transmission, and the target message transmission is more accurate; in addition, as for the original user ID which accords with the key conditions set by the third-party server in the original user ID, the target message is sent in a third mode, so that user resources are saved;
the user IDs corresponding to the APP are stored in the database independently and clustered to form a priority list, and the user IDs in different priority lists can be processed in parallel, so that timeliness of processing the user IDs can be ensured, and time resources of the user can be saved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a data processing system executing a computer program based on messaging provided in an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise 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 or inherent to such process, method, article, or apparatus, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
An embodiment of the present application provides a data processing system for sending a message, where the system includes: APP set P, processor and memory storing computer program, said p= { P 1 ，P 2 ，...，P j ，...，P n }，P j ＝(P j1 ，P j2 ，...，P jr ，...，P jsj )，P jr ＝(P jr1 ，P jr2 ，...，P jrg ，...，P jrzr )，P jrg For the g original user ID of the r APP in the j th APP list, the value of j is 1 to n, n is the number of the APP list, the value of r is 1 to sj, sj is the number of the APP in the j th APP list, the value of g is 1 to zr, zr is the number of the original user ID in the r th APP, when the computer program is executed by a processor, the following steps are realized:
s100, from P jr Obtain target user ID list Ap= (AP) 1 ，AP 2 ，...，AP i ，...，AP m )，AP i And the value of i is 1 to m, m is the number of target user IDs, and the target user IDs are original user IDs corresponding to the original users 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 jr The field of (2) 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, where the original user ID corresponds to an electronic device, and where the electronic device corresponds to a third party server.
The electronic device of the 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 functionality and are aimed at providing voice, data communication. Such terminals include: smart phones (e.g., iPhone), multimedia phones, functional phones, and low-end phones, etc.
(2) Ultra mobile personal computer equipment, which belongs to the category of personal computers, has the functions of calculation and processing and generally has the characteristic of mobile internet surfing. Such terminals include PDA, MID and UMPC devices, etc., such as iPad.
(3) Portable entertainment devices such devices can display and play multimedia content. Such devices include audio, video players (e.g., iPod), palm game consoles, electronic books, and smart toys and portable car navigation devices.
(4) The server is similar to a general computer architecture in that the server is provided with high-reliability services, and therefore, the server has high requirements on processing capacity, stability, reliability, safety, expandability, manageability and the like.
(5) Other electronic devices with data interaction functions. Further, for P jr The status of the original user ID is updated according to the update.
Preferably, every 10ms P jr The state of the user ID in the network is monitored once, when P is monitored jr Update the state of the original user ID when the state of the original user ID changes, and update P jr And deleting the storage record corresponding to the last state.
Specifically, the skilled person can set the pre-period according to the actual situation, 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 is disconnected from the APP message distribution channel, the target message sent by the APP message distribution channel is not received, and there is no target user ID connected to the third party server.
The step S100 further includes the steps of:
s110, traversing P jr Obtain Fp= (FP) 1 ，FP 2 ，...，FP e ，...，FP h )，FP e Is P jr The e-th user ID connected with the third-party server, the e is 1 to h, and h is P jr The number of user IDs connected to the third party server.
In particular, the user ID of the pre-third party server connection may be understood as the user ID of the APP target message that may be received by the third party server.
S120, traversing FP based on target overrun conditions set by the third-party server to obtain DP= (DP) 1 ，DP 2 ，...，DP x ，...，DP q )，DP x And (3) for the x-th user ID meeting the target condition set by the third-party server in the FP, wherein the value of x is 1 to q, and q is the number of the user IDs meeting the target condition set by the third-party server in the FP.
Specifically, for the user ID meeting the target overrun condition set by the third party server, the target message is issued in the third mode.
Further, the third mode is different from the first mode and the second mode.
Further, the target conditions of the third party server include a first target condition and/or a second target condition, and when any target condition is not met, the target message is not sent in the third mode.
Further, the first target condition is that the target message sent to the current mobile terminal within the time threshold does not exceed the preset sending target message threshold, and the second target condition is that the target message does not have limited words, such as words of test and the like.
Preferably, the time threshold is 24h.
S130, according to P jr And DP, obtain AP.
In particular, the method comprises the steps of,
s200, from P jr Obtain intermediate user ID list Bp= (BP) 1 ，BP 2 ，....，BP t ，...，BP k )，BP t Is P j T-th intermediate user ID of (1) to (k), where k is P j The number of the intermediate user IDs is the number of the original user IDs corresponding to the original user in the second state in the preset time period.
Specifically, the online state can be understood as that the user and the APP message issuing channel are in a connection state, and the target message sent by the APP issuing channel can be received.
S300, for BP by the first mode t Issuing a target message, and acquiring a key user ID list CP= (CP) 1 ，CP 2 ，...，CP f ，...，CP d )，CP f And 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:
and S310, monitoring time of the data in the BP when the target message is sent, and acquiring the user ID in a first state in the middle of sending the target message to the key user ID in the BP in a first mode.
Specifically, the user ID in the first state midway in the sending of the target message to the key user ID in the BP by the first mode may be understood as an intermediate user ID in which the second state monitored in real time is updated to the first state in the process of sending the message.
S320, monitoring data in the BP in real time when the target message is transmitted, and transmitting the target message in a first mode of the intermediate user ID which is always in the second state in the BP, so as to acquire 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 in the first state in the middle of the sending of the target message to the key user ID in the BP in the first mode and the intermediate user ID without receiving the feedback message, and obtaining the CP.
S400, acquiring an end user ID list ZP= (ZP) according to the AP and the CP 1 ，ZP 2 ，...，ZP b ，...，ZP v )，ZP b For the b-th end user ID list, b has a value of 1 to v, where v is the number of end user IDs that need to send the targeted message in the second manner.
S500, when ZP b When the corresponding target message issuing condition meets the key condition, sending the prompt message to the ZP in a second mode b The prompt message content is consistent with the target message content.
In particular, the critical conditions comprise a first critical condition and/or a second critical condition.
Further, the first key condition is a transmission number threshold, and the second key condition is a transmission resource threshold.
Further, the transmission number threshold v can be set by those skilled in the art according to the need 0 When v < v 0 When the transmission condition is met; the person skilled in the art can set the transmission resource threshold according to the requirement, and when the usage resource of the ZP issued target message through the third channel is less than the transmission resource threshold, the transmission condition is met.
Further, when the target condition is judged not to be met, early warning is carried out on the display device, and the user is prompted.
Based on S100 to S500, obtaining an original user ID corresponding to an original user in a first state in a preset time period and an original user ID corresponding to an original user in a second state in the preset time period, obtaining an original user ID which does not receive a target message in a first mode from among the user IDs in the first state based on the original user ID corresponding to the original user in the second state in the preset time period, and sending the target message to the original user ID which does not receive the target message in the second mode, so that each original user ID is not missed by the target message and the target message is sent more accurately; in addition, for the original user ID which accords with the key conditions set by the third-party server in the original user ID, the target message is sent through the third mode, so that the user resources are saved.
The method further comprises the following steps before S100:
s10, acquiring an original APP list RP= (RP) 1 ，RP 2 ，...，RP c ，...，RP u )，RP c ＝(RP c1 ，RP c2 ，...，RP cw ，...，RP cφc )，RP cw For the w-th user ID in the c-th target APP, the value of c is 1 to u, u is the number of target APP, the value of w is 1 to phi c, and phi c is the number of original user IDs in the c-th original APP.
Specifically, u=s1+s2+ & gt.
S20, acquiring original APP with ID request amount of each query user greater than or equal to a preset threshold value from RP, and independently storing the original APP to P j Is a kind of medium.
Specifically, different P j Can simultaneously query the state of the original user ID, namely different P j The state of parallel processing is in between.
S30, clustering original APP except for each variety of inquiry user ID request quantity smaller than a preset threshold value in RP to construct a priority list SH= (SH) 1 ，SH 2 ，SH 3 ) And stored at the same P j In (3), SH 1 For the first priority set list, SH 2 For the second priority set list, SH 3 A list of third priority sets.
Specifically, in the embodiment of the present invention, the first priority list is a high priority list, the second priority list is a medium priority list, the third priority list is a low priority list, and the initial states of SH1, SH2 and SH3 are all empty sets.
Further, the states of the target users in the first priority list, the second priority list and the third priority list can be detected at the same time, which can be understood that the first priority list, the second priority list and the third priority list can be processed in parallel.
Further, those skilled in the art know that any method for clustering the original APP falls within the protection scope of the present invention.
Preferably, in an embodiment of the present invention, the priority list SH is constructed using a k-means clustering algorithm.
Specifically, vectorizing a target APP list formed by original APP with each query user ID request quantity less than a preset threshold value in RP to obtain FP= (FP) 1 ，FP 2 ，...，FP ɑ ，...，FP ε )，FP ɑ For the alpha-th target APP, the value of alpha is 1 to epsilon, epsilon is the number of target APP, and any method for carrying out standardization processing on the target APP is known by the skilled in the art and falls into the protection scope of the invention.
Further, it is necessary to divide into three priority lists, and thus, 3 points are created as initial centroids, and the value between any initial centroids is different.
Further, calculate FP ɑ Euclidean distance FP to each initial centroid ou ɑ 。
Further, obtain FP ɑ Minimum Euclidean distance FP to initial centroid ou0 ɑ FP is to ɑ Distribution to FP ou0 ɑ The priority list of the corresponding initial centroid; setting alpha=alpha+1, if alpha < epsilon, repeating the steps, otherwise,resulting in 3 priority lists.
The k-means is used for processing, so that the method has the advantages of simplicity in implementation, few adjustment parameters and high clustering speed, and the clustering effect is guaranteed.
Above, in the steps S10-S30, the user IDs corresponding to the APPs are stored in the database separately, and the rest APPs are clustered to form a priority list, and the user IDs in different priority lists can be processed in parallel, which can ensure timeliness of processing the user IDs and save time resources of the user.
Although some specific embodiments of the present application have been described in detail by way of example, it should be understood by those skilled in the art that the above examples are for illustration only and are 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 present disclosure 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 computer program, said p= { P 1 ，P 2 ，...，P j ，...，P n }，P j ＝(P j1 ，P j2 ，...，P jr ，...，P jsj )，P jr ＝(P jr1 ，P jr2 ，...，P jrg ，...，P jrzr )，P jrg For the g original user ID of the r APP in the j th APP list, the value of j is 1 to n, n is the number of the APP list, the value of r is 1 to sj, sj is the number of the APP in the j th APP list, the value of g is 1 to zr, zr is the number of the original user ID in the r th APP, when the computer program is executed by a processor, the following steps are realized:
s100, from P jr Obtain target user ID list Ap= (AP) 1 ，AP 2 ，...，AP i ，...，AP m )，AP i For the i-th target user ID, iThe value of the target user ID is 1 to m, m is the number of target user IDs, and the target user IDs are original user IDs corresponding to the original users in the first state in a preset time period;
s200, from P jr Obtain intermediate user ID list Bp= (BP) 1 ，BP 2 ，....，BP t ，...，BP k )，BP t Is P j T-th intermediate user ID of (1) to (k), where k is P j The number of the intermediate user IDs is the number of the original user IDs corresponding to the original users in the second state in a preset time period;
s300, for BP by the first mode t Issuing a target message, and acquiring a key user ID list CP= (CP) 1 ，CP 2 ，...，CP f ，...，CP d )，CP f The f-th key user ID is the value of f from 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;
s400, acquiring an end user ID list ZP= (ZP) according to the AP and the CP 1 ，ZP 2 ，...，ZP b ，...，ZP v )，ZP b 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 a second mode;
s500, when ZP b When the corresponding target message issuing condition meets the key condition, sending the prompt message to the ZP in a second mode b The prompt message content is consistent with the target message content.
2. The system of claim 1, further comprising the step of, prior to S100:
s10, acquiring an original APP list RP= (RP) 1 ，RP 2 ，...，RP c ，...，RP u )， RP cw For the w-th user ID in the c-th target APP, c takes on values of 1 to u, u is the number of target APP, and w takes on values of 1 to +.>The number of original user IDs in the c-th original APP;
s20, acquiring original APP with each category of inquiry user ID request quantity greater than a preset threshold value from RP, and independently storing the original APP to P j In (a) and (b);
s30, clustering original APP except APP with each kind of query user ID request amount larger than a preset threshold value in RP to construct a priority list SH= (SH) 1 ，SH 2 ，SH 3 ) And stored at the same P j In (3), SH 1 For the first priority set list, SH 2 For the second priority set list, SH 3 A list of third priority sets.
3. The system of claim 1, wherein the first mode is different from the second mode.
4. The system of claim 1, wherein the first state is an offline state of an original user corresponding to an original user ID, and the second state is an online state of the original user corresponding to the original user ID.
5. The system according to claim 1, characterized in that in S100, it further comprises the steps of:
s110, traversing P jr Obtain Fp= (FP) 1 ，FP 2 ，...，FP e ，...，FP h )，FP e Is P jr The e-th user ID connected with the third-party server, the e is 1 to h, and h is P jr The number of user IDs connected to the third party server;
s120, traversing FP based on target overrun conditions set by the third-party server to obtain DP= (DP) 1 ，DP 2 ，...，DP x ，...，DP q )，DP x The method comprises the steps that (1) the value of x is 1 to q for the user ID, in the FP, of the xth user ID which accords with the target condition set by the third party server, and q is the number of the user IDs, in the FP, of the target condition set by the third party server;
s130, according to P jr And DP, obtain AP.
6. The system of claim 5, wherein the system further comprises a controller configured to control the controller,
7. the system of claim 5, wherein the target conditions of the third party server include a first target condition and/or a second target condition; the first target condition is that the target message sent to the current mobile terminal within the time threshold does not exceed the preset sending target message threshold, and the second target condition is that the target message does not have a limiting word.
8. The system according to claim 1, wherein in S500, the key conditions comprise 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 key condition is not met, the warning is performed on the display device, and the user is prompted.
CN202210878373.3A 2022-07-25 2022-07-25 Data processing system for message transmission Active CN115277618B (en)

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 CN115277618A (en) 2022-11-01
CN115277618B true 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 (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1729704B (en) * 2002-12-18 2012-05-16 诺基亚公司 Instant messaging and presence services
SG157991A1 (en) * 2008-07-04 2010-01-29 3Rd Brand Pte Ltd Company Regi Extended messaging platform

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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
CN115277618A (en) 2022-11-01

Similar Documents

Publication Publication Date Title
US8959234B2 (en) Method and system for providing online services corresponding to multiple mobile devices, server, mobile device, and computer program product
US20090164574A1 (en) System and method for identifying transient friends
CN112579754A (en) Intelligent robot conversation interaction method and device, and computer equipment
CN111523143A (en) Method and device for clustering private data of multiple parties
CN115277618B (en) Data processing system for message transmission
CN115001747A (en) Device control method, device, electronic device and storage medium
US20090077665A1 (en) Method and applications for detecting computer viruses
EP3328013A1 (en) Information processing method, device, system and computer storage medium
CN112559217A (en) Message reliability consumption idempotent processing method and processing device
US8346720B2 (en) Information update system, information update method, and computer-readable medium
CN109413663B (en) Information processing method and equipment
CN110764731A (en) Multimedia file playing control method, intelligent terminal and server
CN113891323A (en) WiFi-based user tag acquisition system
CN104811365B (en) Message delivery method, system and server based on real-time communication social group
CN110874310A (en) Terminal behavior monitoring method and device, electronic equipment and storage medium
CN113099453A (en) Authentication method, device and equipment for access server and readable storage medium
CN112929348B (en) Information processing method and device, electronic equipment and computer readable storage medium
CN110234073B (en) Positioning method, device and storage medium based on Bluetooth positioning
CN112181766B (en) Early warning method based on application software, computer equipment and storage medium
CN111611143B (en) Data processing method and device, electronic equipment and computer readable storage medium
CN109960525A (en) A kind of software recommendation method and server
CN114245481A (en) Automatic disconnection method and system for Bluetooth headset, Bluetooth headset and storage medium
CN113873003A (en) Data transmission control method and system between storage end and communication end in Internet of things
CN111563026B (en) Data processing method and device, electronic equipment and computer readable storage medium
CN113094506B (en) Early warning method based on relational graph, 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