CN113448725A - Data pushing method, device, terminal and storage medium - Google Patents
Data pushing method, device, terminal and storage medium Download PDFInfo
- Publication number
- CN113448725A CN113448725A CN202110587408.3A CN202110587408A CN113448725A CN 113448725 A CN113448725 A CN 113448725A CN 202110587408 A CN202110587408 A CN 202110587408A CN 113448725 A CN113448725 A CN 113448725A
- Authority
- CN
- China
- Prior art keywords
- data
- pushing
- current data
- queue
- source terminal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a data pushing method, a data pushing device, a terminal and a storage medium, wherein the data pushing method comprises the following steps: the node receives the current data and acquires the identification information of a data source terminal corresponding to the current data; the node places the current data into a push queue corresponding to the identification information; and pushing the current data by a pushing queue. The current data are classified based on the data source terminal so that the data of the same data source terminal are distributed to the same pushing column for processing, and disorder of data pushing is avoided.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a method, an apparatus, a terminal, and a storage medium for pushing data.
Background
Under the background of the era of big data, with the rapid development of cities, various data information layers are endless, and in the era of information explosion, how a user can quickly and clearly obtain data information of all concerned aspects is more and more important.
For example, in a trunking service push scenario, a user data source terminal device may report data information to a GCS server (gpscoleciting system) at regular time, and then the server may push the data information to a monitoring subscriber. However, in the prior art, since the server belongs to the clustered service, the data push process of the server generally selects an idle secondary push queue to push data to the subscriber. Therefore, data information reported successively by the same data source terminal may be processed by different pushing queues, so that data reported earlier is still queued for processing, and data uploaded later is pushed to a subscriber, thereby causing data pushing disorder.
Therefore, the prior art needs to be improved.
Disclosure of Invention
In order to solve the problem that data information successively reported by the same data source terminal may be processed by different push queues to cause data push disorder in the prior art, the invention provides a data push method, a data push device, a data push terminal and a storage medium, which classify data so as to distribute the data of the same data source terminal to the same push queue for processing, and avoid the data push disorder.
The invention is realized by the following technical scheme:
in a first aspect, the present invention provides a method for pushing data, including:
the node receives the current data and acquires the identification information of a data source terminal corresponding to the current data;
the node places the current data into a push queue corresponding to the identification information;
and pushing the current data by a pushing queue.
The source terminal equipment of the data is determined by receiving the current data and acquiring the corresponding identification information of the data source terminal of the current data, then the current data is put into the pushing queue corresponding to the identification information (data source terminal), namely, the data from the same data source terminal is guaranteed to be processed in one pushing queue, pushing disorder is avoided, meanwhile, the defects that pushing queues extruded by pushing queue data are idle and all data are too messy and have no orderliness and unreasonable pushing queue work are avoided by selecting the idle pushing queues for distribution during data distribution, and the orderliness of data distribution and the reasonability of pushing queue processing are guaranteed while the working efficiency is guaranteed.
In one embodiment of the present invention, the placing, by the node, the current data into a push queue corresponding to the identification information includes:
performing hash calculation on the identification information and taking a hash value of an integer;
calculating the quotient of the hash value and the total number of the pushed queues to obtain a remainder;
and placing the current data into a pushing queue corresponding to the remainder.
Calculating a remainder of a quotient of the hash value and the push queue total number by taking a hash value of the identification information, the hash value being an integer, and the remainder is obtained by calculating the quotient of the hash value and the total number of the push queues, and then the data is placed in the corresponding remainder push queues according to the remainder, because the identification information of different data source terminals is different, the hash value corresponding to the data source terminal is also unique, and by using the total number of push queues as a divisor, and then, based on remainder recommendation, all pushing queues are guaranteed to be allocated with data to be pushed from different data source terminals, idle waste of the pushing queues or backlog of the data to be pushed are avoided, and the orderliness of data allocation and the reasonability of pushing queue processing are further guaranteed while the working efficiency and the orderliness of data pushing are guaranteed.
In one embodiment of the present invention, the placing the current data into a push queue corresponding to the remainder comprises:
acquiring a queue number of a push queue corresponding to the node;
and putting the current data into a pushing queue corresponding to the data number matched with the remainder.
By obtaining the queue number of the pushing queue corresponding to the node, the pushing queue is convenient to be matched with the remainder and then correspondingly distribute the current data, so that the distribution process of the current data is simpler and more convenient, and the ordering of data pushing is further ensured.
In one embodiment of the present invention, the identification information is device ID information of the current data source terminal.
In one embodiment of the present invention, the receiving, by the node, current data and acquiring identification information of a data source terminal corresponding to the current data includes:
the GCS node receives the current data of the data source terminal;
and acquiring the equipment ID information of the corresponding data source terminal based on the current data.
In one embodiment of the present invention, the pushing queue pushing the current data includes:
pushing and queuing to obtain a subscription end corresponding to the data source terminal;
and pushing and queuing to send the current data to the corresponding subscriber.
And pushing the current data to a corresponding subscriber by performing data processing through the pushing queue.
In one embodiment of the present invention, the pushing queue further pushes the current data, including:
and when historical data to be pushed exist in the pushing queue, sequentially pushing the current data and the historical data according to a receiving sequence.
Through carrying out the pushing treatment in sequence according to the receiving sequence when setting the historical data to be pushed in the same pushing queue, the disordered data pushing in the same pushing queue is avoided, and the orderliness of data pushing is further ensured.
In a second aspect, the present invention further provides a data pushing apparatus, including:
a data receiving module: the node is used for receiving the current data and acquiring the identification information of the data source terminal corresponding to the current data;
a data distribution module: the node is used for placing the current data into a pushing queue corresponding to the identification information;
the data pushing module: and the data pushing queue is used for pushing the current data.
In a third aspect, the present invention also provides a terminal comprising a memory, and one or more programs, wherein the one or more programs are stored in the memory, and the one or more programs configured to be executed by the one or more processors comprise instructions for performing the method according to any of the above 1-7.
In a fourth aspect, the present invention also provides a computer-readable storage medium, wherein instructions, when executed by a processor of an electronic device, enable the electronic device to perform the method as described in any of the above 1-7.
The invention has the beneficial effects that:
the invention determines the source terminal equipment of the data by receiving the data and acquiring the identification information of the data source terminal corresponding to the current data through a data pushing method, a data pushing device, a terminal and a storage medium, and then puts the current data into the pushing queue corresponding to the identification information (the data source terminal), namely, the data from the same data source terminal are all processed in one pushing queue, thereby avoiding pushing disorder, simultaneously avoiding the defects that the pushing queue extruded by the pushing queue data is idle, all data pushing is too messy and has no orderliness and the pushing queue is unreasonable in work, ensuring the orderliness of data distribution and the reasonability of pushing queue processing, and simultaneously ensuring the working efficiency.
Drawings
FIG. 1 is a schematic structural diagram of an embodiment of a data pushing method according to the present invention;
FIG. 2 is a schematic diagram of the structure of step S100 in the data pushing method of FIG. 1 according to the present invention;
FIG. 3 is a schematic diagram of a step S200 of the data pushing method of FIG. 1 according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a step S300 of the data pushing method of FIG. 1 according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a module connection structure of the data pushing apparatus according to the present invention;
fig. 6 is a schematic structural diagram of a data push terminal according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, 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 some, but not all, embodiments of the present invention.
In the prior art, user terminal equipment (data source terminal) can report its own GPS point location to a GCS server (GPSCollecting System) at regular time, and then the GCS server can push the position information of the equipment to a monitoring subscriber. Due to the requirement of load balancing, the GCS server belongs to a cluster service, and each reporting request of the device may be processed by a different GCS node in the cluster and broadcast to other GCS nodes in the cluster, so as to push device location information to the monitoring subscriber mounted on the node. The GCS node does not directly push the GPS broadcast event from the cluster to a related monitoring subscriber because the pushing process delays the processing of the subsequent event, and in order to realize higher concurrency, the GCS node can deliver the broadcast message to a secondary queue unit in the process for processing after receiving the message and then continues to process the next cluster message; at present, the mode that the secondary queue unit is selected to process push is mainly to select an idle secondary queue unit to process the current GPS message, which may cause GPS push for the same device to be out of order, that is, the last point of the device is still backlogged in the queue a for waiting processing, and the next point of the device may be rapidly processed by the queue B. Therefore, the invention provides a data pushing method, a data pushing device, a data pushing terminal and a data pushing storage medium, which avoid data pushing disorder by classifying data so as to distribute the data of the same data source terminal to the same pushing column for processing. Specific embodiments are described below:
exemplary method
Referring to fig. 1, the present invention provides a data pushing method, including:
step S100: the node receives the current data and acquires the identification information of the data source terminal corresponding to the current data.
Specifically, the current data is current data transmitted by a data source terminal in real time, the current data can be pushed after secondary arrangement is performed on initial data needing to be pushed and transmitted through a subsequent processing step, final data needing to be pushed and transmitted can also be acquired by the data source terminal, the data source terminal can be various acquisition devices corresponding to data types, data exchange is performed between the data source terminal and the acquisition devices through a server, the current data can be weather data, temperature data, air quality data and the like, and in the implementation scheme of the city, the data is GPS point location data and is acquired through the GPS data acquisition devices.
Further, the identification information of the data source terminal may be a device number, a device code, and the like of the data source terminal, and in this embodiment, the identification information is device ID information of the data source terminal. Specifically, the server may obtain the data according to the source of the data after receiving the data, or may carry the device ID information in the data source in the data, and the server obtains the data by extracting the device ID information in the data.
Specifically, referring to fig. 2, on the basis of the above embodiment, the step S100 further includes:
step S101: the GCS node receives the current data of the data source terminal;
step S102: and acquiring the equipment ID information of the corresponding data source terminal based on the current data.
Specifically, the server includes a plurality of GCS nodes, each GCS node includes a plurality of secondary queues (the secondary queues are push queues in this embodiment), each GCS node is configured to process various different cluster information, and a processing device or a processing item type of each GCS node may be allocated by presetting. And in a GCS node, there will be a plurality of secondary queue units (push queues) working in parallel, and their task is to push the data (in this embodiment, GPS location information) to the relevant monitoring subscriber mounted on the current node, specifically, the push target address of the subscriber can be obtained when the subscriber subscribes, and by attaching address information to the current data when sending out the current data, or by corresponding the address information of the subscriber to the data source terminal, a correspondence relationship or address link between the subscriber and the data source terminal is established, the target address information of the subscriber can be carried in the current data, and the address information is obtained and pushed by the secondary queue units, or the correspondence relationship can be obtained in any one of the above processing steps to obtain the address information, and then attaching address information to the current data, acquiring the address information through the secondary queuing unit, and pushing the address information, wherein the address information can be specifically set according to actual conditions, and the invention is not particularly limited.
Step S200: and the node places the current data into a pushing queue corresponding to the identification information.
Specifically, the node places the current data into the push queues corresponding to the identification information, and is mainly used for placing the data with the same data source terminal into the same push queues, that is, the data transmitted by the same data source terminal are all distributed into the same push queue to be processed, so that the disorder of pushing is avoided.
Specifically, referring to fig. 3, on the basis of the above embodiment, the step S200 further includes:
step S201: performing hash calculation on the identification information and taking a hash value of an integer;
step S202: calculating the quotient of the hash value and the total number of the pushed queues to obtain a remainder;
step S203: and placing the current data into a pushing queue corresponding to the remainder.
Specifically, the Hash value obtained by calculating the device ID information of the same data source terminal through the Hash algorithm is invariable, therefore, the remainders after each Hash residue taking are the same, so that the same equipment can be ensured to enter the same queue, the GCS server can be ensured to orderly push data in a cluster environment, particularly, in this embodiment, the data is GPS location information, and the location point at each time that needs to be reported by the real-time GPS location push service needs to be pushed to the client according to the reporting time, for example, i need to go from a point a to a point B, the position movement is seen on the map and is certainly the sequence from A to B, but in our cluster environment, due to the influence of the network, the host performance and the like, different pushing queuing processing efficiencies cause data pushing out of order, and the situation from B to A can occur when the data is directly pushed to the client. Therefore, the positions reported by the same equipment are ensured to be the same queue in the same GCS service by taking the remainder, so that the positions are ensured to be the sequence from A to B, and the validity of data is ensured. Further, on the basis of the foregoing embodiment, the step S of placing the current data into a push queue corresponding to the remainder includes: acquiring a queue number of a push queue corresponding to the node; and putting the current data into a pushing queue corresponding to the data number matched with the remainder.
By obtaining the queue number of the pushing queue corresponding to the node, the pushing queue and the remainder are conveniently matched for distribution, so that the current data distribution process is simpler and more convenient, and the data pushing orderliness is further ensured.
Specifically, the queue number has no sorting meaning, and is only a specific distinguishing numbering number corresponding to the remainder, which may be an arabic number such as 0, 1, 2, 3, 4, or a roman number, or a custom character corresponding to the remainder, and the specific invention is not limited.
Specifically, it is assumed that a device with Id information of 3 reports current data to be pushed to a GCS node, and 4 push queues are provided in the GCS node, then the device Id information is hashed and remainder is taken from a total number (4) of the push queues to obtain a remainder 3, and then the current data is placed into a push queue with queue number of 3 for pushing, and as long as the total number of the push queues in the GCS node is not changed, the device only places the push queue with queue number of 3 into the push queue, and pushes the push queue to a subscriber through the push queue, thereby ensuring push ordering. When the total number of the pushed queues changes, the newly received data of the data source terminal can be placed in the corresponding queue according to the changed remainder, and the adjustment can be specifically performed according to the actual situation.
In other embodiments of the present invention, the node may also calculate the remainder only when the current data from the data source terminal is received for the first time or calculate the remainder when the total number of the push queues of the node changes, and the current data received in real time may detect which push queue the historical data of the same data source terminal was placed in before for push processing, and then place the current data into the corresponding push queue for processing based on the push path of the historical data. Through seeking identification information's hash value to it is the integer to go hash value, is convenient for calculate hash value with the remainder of the quotient of propelling movement queue total number, and through calculating it will according to the remainder after hash value and the quotient of propelling movement queue total number obtain the remainder data are placed and are corresponded remainder propelling movement queue, through using propelling movement queue total number is the divisor, then recommends based on the remainder and has guaranteed that all propelling movement queues can both be distributed to the data of treating the propelling movement, avoids the idle waste of propelling movement queue, has further guaranteed the regularity of data distribution and the rationality of propelling movement queue processing and has guaranteed work efficiency and data push's orderliness simultaneously.
Step S300: and pushing the current data by a pushing queue.
Further, on the basis of the above implementation, referring to fig. 4, the step S300 includes:
step S301: pushing and queuing to obtain a subscription end corresponding to the data source terminal;
step S302: and pushing and queuing to send the current data to the corresponding subscriber.
And pushing the current data to a corresponding subscriber by performing data processing through the pushing queue.
Specifically, when historical data to be pushed exists in a pushing queue, the current data and the historical data are sequentially pushed according to a receiving sequence. Historical data to be pushed in the same pushing queue and the current data are processed according to the receiving sequence in sequence, so that disordered data pushing in the same pushing queue is avoided, and the data pushing sequence is further ensured.
Specifically, the historical data is data that is to be pushed to the subscriber and is queued to be placed in a push queue before the current data is received by the data source terminal, and the historical data may be data from different data source terminals (one push queue may process data from multiple data source terminals), or may be data from the same data source terminal, and is pushed in chronological order.
Specifically, the subscribers are mounted on the GCS node, and the data is sent to different subscribers by the push queue by acquiring the device ID of the subscriber, or identifying an account number, a push path, and the like, and then the subscriber terminal receives the data.
The data pushing method comprises the steps of determining source equipment of data by receiving current data and acquiring identification information of a corresponding data source terminal, then putting the current data into a pushing queue corresponding to the identification information (data source terminal), namely ensuring that the data from the same data source terminal are processed in one pushing queue, avoiding pushing disorder, and simultaneously avoiding the defects that pushing queues extruded by pushing queue data are idle, all data pushing is too messy and has no orderliness and pushing queue work is unreasonable, and ensuring the orderliness of data distribution and the reasonability of pushing queue processing and simultaneously ensuring the working efficiency.
It should be understood that the steps in the above-described flowcharts are shown in order as indicated by the arrows, but the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in the figures may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternately with other steps or at least some of the sub-steps or stages of other steps.
Exemplary devices
Referring to fig. 5, the present invention also provides a data pushing apparatus, including:
the data receiving module 100: the node is used for receiving the current data and acquiring the identification information of the data source terminal corresponding to the current data;
the data distribution module 200: the node is used for placing the current data into a pushing queue corresponding to the identification information;
the data push module 300: and the data pushing module is used for pushing the current data by a pushing queue.
In one embodiment of the present invention, the data receiving module 100 specifically includes:
the GCS node is used for receiving the current data of the data source terminal; and the equipment ID information is used for acquiring the corresponding data source terminal based on the current data.
In one embodiment of the present invention, the data distribution module 200 further comprises:
a hash module: a hash value used for carrying out hash calculation on the identification information and taking an integer;
a remainder calculation module: the quotient of the hash value and the total number of the push queues is calculated to obtain a remainder;
placing a module: for placing the current data into a push queue corresponding to the remainder.
In one embodiment of the present invention, the placement module is specifically configured to obtain a queue number of a push queue corresponding to the node; and putting the current data into a pushing queue corresponding to the data number matched with the remainder.
In one embodiment of the present invention, the data pushing module 300 further includes:
a subscriber acquisition module: the subscription end is used for pushing the queue to obtain the current data;
the data pushing submodule comprises: for push queuing to send the current data to the corresponding subscribers.
In the above embodiments, the data pushing device determines the source device of the data by receiving the current data and acquiring the identification information of the corresponding data source terminal, and then puts the current data into the pushing queue corresponding to the identification information (data source terminal), i.e. it is ensured that the data from the same data source terminal are all processed in one pushing queue, thereby avoiding pushing disorder, and avoiding the defects that the pushing queue extruded by the pushing queue data is idle and all data pushing is too messy and has no orderliness, and the pushing queue is unreasonable in work, thereby ensuring the orderliness of data distribution and the reasonability of pushing queue processing, and simultaneously ensuring the working efficiency.
For specific limitations of the information push data push device, reference may be made to the above limitations of the data push method, which is not described herein again. The modules in the data pushing device can be wholly or partially implemented by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
Based on the above embodiments, the present invention further provides a terminal, and a schematic block diagram thereof may be as shown in fig. 6. The intelligent terminal comprises a processor, a memory, a network interface and a display screen which are connected through a system bus. Wherein the processor of the terminal is configured to provide computing and control capabilities. The memory of the terminal comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the terminal is used for connecting and communicating with an external terminal through a network. The computer program is executed by a processor to implement a method of data pushing. The display screen at the terminal can be a liquid crystal display screen or an electronic ink display screen, and can also comprise a temperature sensor of the intelligent terminal, wherein the temperature sensor of the intelligent terminal is arranged in the intelligent terminal in advance and used for detecting the current operating temperature of the internal equipment.
It will be understood by those skilled in the art that the block diagram shown in fig. 6 is only a block diagram of a part of the structure related to the solution of the present invention, and does not constitute a limitation to the intelligent terminal to which the solution of the present invention is applied, and a specific intelligent terminal may include more or less components than those shown in the figure, or combine some components, or have a different arrangement of components.
In one embodiment, a terminal is provided that includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured for execution by the one or more processors to perform the one or more programs includes instructions for:
the node receives the current data and acquires the identification information of a data source terminal corresponding to the current data;
the node places the current data into a push queue corresponding to the identification information;
and pushing the current data by a pushing queue.
In one embodiment of the present invention, the instruction for the node to receive the current data and obtain the identification information of the data source terminal corresponding to the current data includes:
the GCS node receives the current data of the data source terminal;
and acquiring the equipment ID information of the corresponding data source terminal based on the current data.
In one embodiment of the present invention, the instructing, by the node, to place the current data into a push queue corresponding to the identification information includes:
performing hash calculation on the identification information and taking a hash value of an integer;
calculating the quotient of the hash value and the total number of the pushed queues to obtain a remainder;
and placing the current data into a pushing queue corresponding to the remainder.
In one embodiment of the present invention, the placing the current data into a push queue instruction corresponding to the remainder further comprises:
acquiring a queue number of a push queue corresponding to the node;
and putting the current data into a pushing queue corresponding to the data number matched with the remainder.
In one embodiment of the present invention, the instructing, by the push queue, to push the current data further includes:
pushing and queuing to obtain a subscription end corresponding to the data source terminal;
and pushing and queuing to send the current data to the corresponding subscriber.
In the above embodiment, the computer-readable storage medium realizes the purpose of pushing data in order through the computer program stored in the computer-readable storage medium, and classifies the data so as to distribute the data of the same data source terminal to the same pushing column for processing, thereby avoiding disorder of data pushing.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, databases, or other media used in embodiments provided herein may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM). The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
It should be understood that all other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without any inventive step are within the scope of the present invention.
Claims (10)
1. A method of data push, comprising:
the node receives the current data and acquires the identification information of a data source terminal corresponding to the current data;
the node places the current data into a push queue corresponding to the identification information;
and pushing the current data by a pushing queue.
2. The method of claim 1, wherein the node placing the current data into a push queue corresponding to the identification information comprises:
performing hash calculation on the identification information and taking a hash value of an integer;
calculating the quotient of the hash value and the total number of the pushed queues to obtain a remainder;
and placing the current data into a pushing queue corresponding to the remainder.
3. The method of data pushing according to claim 2, wherein said placing the current data into a push queue corresponding to the remainder comprises:
acquiring a queue number of a push queue corresponding to the node;
and putting the current data into a pushing queue corresponding to the data number matched with the remainder.
4. The method according to claim 1 or 2, wherein the identification information is device ID information of the current data source terminal.
5. The method of claim 4, wherein the receiving, by the node, the current data and acquiring the identification information of the data source terminal corresponding to the current data comprises:
the GCS node receives the current data of the data source terminal;
and acquiring the equipment ID information of the corresponding data source terminal based on the current data.
6. The method of claim 1 or 5, wherein the pushing queue pushes the current data, including:
pushing and queuing to obtain a subscription end corresponding to the data source terminal;
and the push queue sends the current data to the corresponding subscriber.
7. The method of claim 6, wherein the pushing queue pushes the current data further comprising:
and when historical data to be pushed exist in the pushing queue, sequentially pushing the current data and the historical data according to a receiving sequence.
8. A data pushing apparatus, comprising:
a data receiving module: the node is used for receiving the current data and acquiring the identification information of the data source terminal corresponding to the current data;
a data distribution module: the node is used for placing the current data into a pushing queue corresponding to the identification information;
the data pushing module: and the data pushing queue is used for pushing the current data.
9. A terminal comprising a memory, and one or more programs, wherein the one or more programs are stored in the memory, and wherein the one or more programs being configured to be executed by the one or more processors comprises instructions for performing the method of any of claims 1-7.
10. A computer-readable storage medium, wherein instructions in the storage medium, when executed by a processor of an electronic device, enable the electronic device to perform the method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110587408.3A CN113448725A (en) | 2021-05-27 | 2021-05-27 | Data pushing method, device, terminal and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110587408.3A CN113448725A (en) | 2021-05-27 | 2021-05-27 | Data pushing method, device, terminal and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113448725A true CN113448725A (en) | 2021-09-28 |
Family
ID=77810242
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110587408.3A Pending CN113448725A (en) | 2021-05-27 | 2021-05-27 | Data pushing method, device, terminal and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113448725A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103986787A (en) * | 2014-06-05 | 2014-08-13 | 合一网络技术(北京)有限公司 | Method and system for automatically obtaining updating of video |
| CN106656863A (en) * | 2016-12-31 | 2017-05-10 | 广东欧珀移动通信有限公司 | Business monitoring method and apparatus, and computer device |
| CN107465595A (en) * | 2017-07-25 | 2017-12-12 | 腾讯科技（深圳）有限公司 | Equipment message control method for playing back, device, message playback equipment and storage medium |
| CN109788053A (en) * | 2019-01-04 | 2019-05-21 | 深圳壹账通智能科技有限公司 | Method of data synchronization and system |
| CN109815028A (en) * | 2018-12-27 | 2019-05-28 | 北京摩拜科技有限公司 | Data synchronous system, method, apparatus and computer storage medium |
| CN111131074A (en) * | 2018-10-31 | 2020-05-08 | 中移（杭州）信息技术有限公司 | Data processing method, device, system, server and readable storage medium |
| US10691359B1 (en) * | 2012-06-11 | 2020-06-23 | Solace Systems, Inc. | Messaging delivery system with last message queue |
| CN112637046A (en) * | 2020-12-18 | 2021-04-09 | 北京房天下嘉居网络技术有限公司 | Message pushing method and routing device |
-
2021
- 2021-05-27 CN CN202110587408.3A patent/CN113448725A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10691359B1 (en) * | 2012-06-11 | 2020-06-23 | Solace Systems, Inc. | Messaging delivery system with last message queue |
| CN103986787A (en) * | 2014-06-05 | 2014-08-13 | 合一网络技术(北京)有限公司 | Method and system for automatically obtaining updating of video |
| CN106656863A (en) * | 2016-12-31 | 2017-05-10 | 广东欧珀移动通信有限公司 | Business monitoring method and apparatus, and computer device |
| CN107465595A (en) * | 2017-07-25 | 2017-12-12 | 腾讯科技（深圳）有限公司 | Equipment message control method for playing back, device, message playback equipment and storage medium |
| CN111131074A (en) * | 2018-10-31 | 2020-05-08 | 中移（杭州）信息技术有限公司 | Data processing method, device, system, server and readable storage medium |
| CN109815028A (en) * | 2018-12-27 | 2019-05-28 | 北京摩拜科技有限公司 | Data synchronous system, method, apparatus and computer storage medium |
| CN109788053A (en) * | 2019-01-04 | 2019-05-21 | 深圳壹账通智能科技有限公司 | Method of data synchronization and system |
| CN112637046A (en) * | 2020-12-18 | 2021-04-09 | 北京房天下嘉居网络技术有限公司 | Message pushing method and routing device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110297711B (en) | Batch data processing method, device, computer equipment and storage medium | |
| CN107832126B (en) | Thread adjusting method and terminal thereof | |
| CN108446172B (en) | Data calling method and device, computer equipment and storage medium | |
| CN111651285A (en) | Batch business data processing method and device, computer equipment and storage medium | |
| CN111813573B (en) | Communication method of management platform and robot software and related equipment thereof | |
| CN110599148B (en) | Cluster data processing method and device, computer cluster and readable storage medium | |
| CN108241539B (en) | Interactive big data query method and device based on distributed system, storage medium and terminal equipment | |
| CN104750690A (en) | Query processing method, device and system | |
| CN111159233B (en) | Distributed caching method, system, computer equipment and storage medium | |
| CN113742109B (en) | Third party service docking method, device, equipment and storage medium | |
| CN108881651B (en) | Data processing method, device and equipment of call platform and storage medium | |
| CN110659272A (en) | Data cleaning method and system | |
| CN112396480B (en) | Order business data processing method, system, computer equipment and storage medium | |
| CN113672284A (en) | Instruction execution method, system, electronic equipment and storage medium | |
| CN113448725A (en) | Data pushing method, device, terminal and storage medium | |
| CN110839061B (en) | Data distribution method, device and storage medium | |
| CN115904729A (en) | Method, device, system, equipment and medium for connection allocation | |
| CN115242718B (en) | Cluster current limiting method, device, equipment and medium | |
| CN115658292A (en) | Resource scheduling method, device, computer equipment and storage medium | |
| CN112860763B (en) | Real-time streaming data processing method and device, computer equipment and storage medium | |
| CN112035760B (en) | Task allocation method and computer equipment | |
| CN113268327A (en) | Transaction request processing method and device and electronic equipment | |
| CN113596105A (en) | Content acquisition method, edge node and computer-readable storage medium | |
| CN112541038A (en) | Time series data management method, system, computing device and storage medium | |
| CN112019442B (en) | Data distribution method, system, equipment and medium based on bounded consistency Hash algorithm |
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 |