CN109587198A - Graph text information method for pushing and device - Google Patents
Graph text information method for pushing and device Download PDFInfo
- Publication number
- CN109587198A CN109587198A CN201710909118.XA CN201710909118A CN109587198A CN 109587198 A CN109587198 A CN 109587198A CN 201710909118 A CN201710909118 A CN 201710909118A CN 109587198 A CN109587198 A CN 109587198A
- Authority
- CN
- China
- Prior art keywords
- text information
- forwarding
- graph text
- user
- push
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/55—Push-based network services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/07—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail characterised by the inclusion of specific contents
- H04L51/10—Multimedia information
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a kind of method for pushing of graph text information, comprising: when receive push user to currently wait push graph text information push request when, obtain with it is described push user push history graph text information it is corresponding at least one forward chain;In each forwarding chain, determine that the number of forwarding child node is more than each destination node of preset threshold;The graph text information currently to be pushed is pushed to the corresponding forwarding user of each destination node.In method for pushing disclosed by the invention, when treating push graph text information and being pushed, by determining the history graph text information of user's push, and at least one forwarding chain of the characterization history graph text information forward-path is obtained;And the destination node with more child node in each forwarding chain is analyzed, graph text information is pushed to these users, improves the pushing efficiency of graph text information by the corresponding user for forwarding user as to have more transfer amount of the destination node.
Description
Technical field
The present invention relates to Internet technical field, in particular to a kind of graph text information method for pushing, device, storage medium and
Processor.
Background technique
With the rapid development of mobile Internet, it is used widely by the various social medias of representative of wechat.User
Public platform is established on the web frame made by H5 technology or establishes the product page, and product is introduced towards the public.
And by the forwarding capability of social media, product is pushed to more public, and then play the propaganda function to product.
During product is forwarded push, the graph text information of product is sent to one in the form of a link first
Then a little target users are forwarded in circle of friends or wechat group by target user.Existing general random selectes some user's conducts
Target user, and in the user selected at random may include the lower user of some transfer amounts, these user's bring picture and text letter
The transfer amount of breath is lower, to reduce the whole pushing efficiency to graph text information.
Summary of the invention
In view of the above problems, it proposes on the present invention overcomes the above problem or at least be partially solved in order to provide one kind
The method for pushing of the graph text information of problem is stated, graph text information is preferentially pushed to the user that can bring more transfer amount, is promoted
To the whole pushing efficiency of graph text information.
The present invention provides a kind of method for pushing of graph text information, comprising:
User is pushed to currently when pushing the push request of graph text information, acquisition is pushed away with the push user when receiving
At least one corresponding forwarding chain of the history graph text information sent;
In each forwarding chain, determine that the number of forwarding child node is more than each destination node of preset threshold;
The graph text information currently to be pushed is pushed to the corresponding forwarding user of each destination node.
Above-mentioned method, it is preferred that the acquisition and the history graph text information of the push user push are corresponding extremely
A forwarding chain includes: less
Obtain the uniform resource position mark URL that the history graph text information generates in each repeating process;
Parse the ID identification information for including in each URL, the ID identification information include current forwarding User ID, when
Upper the one of forward hair family forwards User ID and currently forwards level;
According to the ID identification information, determine that the chain type between each forwarding user for forwarding the history graph text information is closed
System, to form forwarding chain corresponding with the history graph text information.
Above-mentioned method, it is preferred that the URL packet for obtaining the history graph text information and being generated in each repeating process
It includes:
In the case where obtaining application program authorization, call the monitoring program in the application program to the history picture and text
The repeating process of information is monitored;
When monitoring that forwarding user is forwarded the history graph text information, obtains and generated in current repeating process
URL。
Above-mentioned method, it is preferred that the number of the determining forwarding child node is more than each destination node of preset threshold
Include:
Traverse each of each forwarding chain node;
For each of forwarding chain node, all child node quantity under the node branch are counted;
It is more than the node of preset threshold as destination node using child node quantity.
Above-mentioned method, it is preferred that further include:
To the corresponding reward for forwarding user to send predetermined form of each destination node.
A kind of driving means of graph text information, comprising:
Acquiring unit, for when receive push user to currently wait push graph text information push request when, obtain with
At least one corresponding forwarding chain of the history graph text information of the push user push;
Determination unit, in each forwarding chain, determining that the number of forwarding child node is more than each of preset threshold
A destination node;
Push unit, for the graph text information currently to be pushed to be pushed to the corresponding forwarding of each destination node
User.
Above-mentioned device, it is preferred that the acquiring unit includes:
Subelement is obtained, the unified resource positioning generated in each repeating process for obtaining the history graph text information
Accord with URL;
Parsing subunit, for parsing the ID identification information for including in each URL, the ID identification information includes working as
Upper the one of forward hair User ID, currently forwarding user forwards User ID and currently forwards level;
Subelement is determined, for determining each forwarding for forwarding the history graph text information according to the ID identification information
Chain relationship between user, to form forwarding chain corresponding with the history graph text information.
Above-mentioned device, it is preferred that further include:
Transmission unit, for sending the reward of predetermined form to the corresponding forwarding user of each destination node.
A kind of storage medium, the storage medium include the program of storage, wherein described program executes above-mentioned graph text information
Method for pushing.
A kind of processor, which is characterized in that the processor is for running program, wherein described program executes when running
The method for pushing of above-mentioned graph text information.
By above-mentioned technical proposal, the method for pushing of graph text information provided by the invention, when receiving push user to working as
When the preceding push wait push graph text information is requested, obtain corresponding at least with the history graph text information of the push user push
One forwarding chain;In each forwarding chain, determine that the number of forwarding child node is more than each destination node of preset threshold;
The graph text information currently to be pushed is pushed to the corresponding forwarding user of each destination node.Push provided by the invention
Method, when user needs to push new graph text information, firstly, determine the history graph text information that user pushed in the past,
And obtain at least one forwarding chain corresponding with the history graph text information;Then analyzing has more sub- section in each forwarding chain
The destination node of point, the corresponding user for forwarding user that can as bring more transfer amount of the destination node, user is needed
The graph text information to be pushed is pushed to above-mentioned user, can be promoted to need the graph text information pushed to bring more transfer amount
The pushing efficiency of graph text information.
The above description is only an overview of the technical scheme of the present invention, in order to better understand the technical means of the present invention,
And it can be implemented in accordance with the contents of the specification, and in order to allow above and other objects of the present invention, feature and advantage can
It is clearer and more comprehensible, the followings are specific embodiments of the present invention.
Detailed description of the invention
By reading the following detailed description of the preferred embodiment, various other advantages and benefits are common for this field
Technical staff will become clear.The drawings are only for the purpose of illustrating a preferred embodiment, and is not considered as to the present invention
Limitation.And throughout the drawings, the same reference numbers will be used to refer to the same parts.In the accompanying drawings:
Fig. 1 shows the method flow diagram of the method for pushing of graph text information provided by the invention;
Fig. 2 shows the another method flow diagrams of the method for pushing of graph text information provided by the invention;
Fig. 3 shows the another method flow diagram of the method for pushing of graph text information provided by the invention;
Fig. 4 shows the instance graph in the method for pushing of graph text information provided by the invention;
Fig. 5 shows the structural schematic diagram of the driving means of graph text information provided by the invention;
Fig. 6 shows the another structural schematic diagram of the driving means of graph text information provided by the invention.
Specific embodiment
Exemplary embodiments of the present disclosure are described in more detail below with reference to accompanying drawings.Although showing the disclosure in attached drawing
Exemplary embodiment, it being understood, however, that may be realized in various forms the disclosure without should be by embodiments set forth here
It is limited.On the contrary, these embodiments are provided to facilitate a more thoroughly understanding of the present invention, and can be by the scope of the present disclosure
It is fully disclosed to those skilled in the art.
The present invention provides a kind of method for pushing of graph text information, the method can be applied in mobile terminal, be executed
Main body can be processor in mobile terminal, and the mobile terminal can be the handheld devices such as mobile phone, PAD.Fig. 1 shows this hair
The method flow diagram of the method for pushing of the graph text information of bright offer, specifically includes step:
S101: when receive push user to currently wait push graph text information push request when, obtain with the push
At least one corresponding forwarding chain of the history graph text information of user's push;
In method provided by the invention, the graph text information of user's push can all form difference in each repeating process
Forwarding chain, in this method, when user needs to push new graph text information, obtain the history picture and text letter pushed in the past
Cease corresponding each forwarding chain.
S102: in each forwarding chain, determine that the number of forwarding child node is more than each target section of preset threshold
Point;
It include multiple nodes in each forwarding chain, each node is one corresponding in method provided by the invention
User is forwarded, in each forwarding chain, since each node, subsequent forward node is all the child node of the node.
In the present invention, determine that the number of child node is more than each destination node of preset threshold.
S103: the graph text information currently to be pushed is pushed to the corresponding forwarding user of each destination node.
In the present invention, for the destination node with more child node, show that the corresponding forwarding user of destination node brings
Transfer amount it is big, graph text information to be pushed is pushed to the corresponding forwarding user of the destination node.
In the method for pushing of graph text information provided by the invention, when user needs to push new graph text information,
Determine first the user push history graph text information, history graph text information in continuous repeating process, can generate it is a plurality of and its
Corresponding forwarding chain, the forwarding chain describe the forwarding relationship between each forwarding user.The present invention passes through in forwarding chain
The child node quantity of each node is analyzed, to determine that child node quantity is more than multiple destination nodes of preset threshold, this hair
For forwarding each of chain node in bright, all forward node after the node are the child node of the node, sub- section
Transfer amount brought by the point more corresponding forwarding user of the bright node of multilist is bigger, and therefore, user is currently pushed
New graph text information pushed to the corresponding forwarding user of above-mentioned each destination node, can be brought for new graph text information
More transfer amounts, and then improve the pushing efficiency to new graph text information.
In the method for pushing of graph text information provided by the invention, the history graph text information of acquisition can be certain of user's push
One graph text information is also possible to multiple graph text informations that user pushed in the past, determines from above-mentioned each history graph text information
The forwarding user of more transfer amount can be brought.
In the method for pushing of graph text information provided by the invention, the graph text information can be user in wechat public platform
The article delivered is also possible to the product web page of user's foundation, preferably can be a variety of involved in social media
The network information.It is more can be directed to wechat, QQ, microblogging in social media etc. for the method for pushing of graph text information provided by the invention
Kind has the APP of forwarding capability.
It with reference to Fig. 2, shows in the present invention, the acquisition is corresponding with the history graph text information of the push user push
At least one forwarding chain process, specifically include step:
S201: the uniform resource position mark URL that the history graph text information generates in each repeating process is obtained;
It is practical that the corresponding web page interlinkage of graph text information is forwarded during graph text information is forwarded, turn every time
The uniform resource position mark URL for having graph text information is all recorded during hair.
S202: the ID identification information for including in each URL of parsing, the ID identification information include current forwarding user
Upper the one of ID, currently forwarding user forwards User ID and currently forwards level;
In the present invention during graph text information forwards each time, in current repeating process in the URL of graph text information
The ID of current forwarding user, and the ID of the current previous forwarding user for forwarding user is added, and records current forwarding level.This
In invention, the ID identification information for including in each URL is parsed, is used in the ID mark comprising above-mentioned current forwarding
Family ID, the current upper forwarding User ID and current forwarding level for forwarding user.
S203: it according to the ID identification information, determines between each forwarding user for forwarding the history graph text information
Chain relationship, to form forwarding chain corresponding with the history graph text information.
In the present invention, to each forwarding ID recorded in ID identification information, lookup connection is carried out, finally determines each forwarding
Chain relationship between user, so as to form the forwarding chain between each forwarding user.
In the present invention, for the graph text information of each push, record is corresponding with graph text information push process
Each forwarding chain provides analysis foundation for the push of subsequent graph text information, history graph text information repeating process can be brought
The forwarding user of more transfer amount effectively promotes the pushing efficiency of new graph text information as target customers.
In the method for pushing of graph text information provided by the invention, for the URL of the forwarding of picture and text each time, inserted in the URL
Enter three parameters, and the URL for being inserted into parameter is added in http request and is sent to system and stores.
In the present invention, it is inserted into parameter fopenid in URL, characterizes the User ID of upper forwarding graph text information;Insertion ginseng
Number openid characterizes the User ID of current forwarding graph text information, is inserted into parameter level, characterization forwarding level, the i.e. graph text information
It is every to add 1 by the level of a retransmitting paramater level by forwarding several times on a certain forwarding chain.
By the way that parameter is added in URL, graph text information can be spliced into forwarded over by the parameter ID in each URL
Forwarding chain in journey records the forwarding relationship between each forwarding user.
With reference to Fig. 3, show in the present invention, it is described to obtain what the history graph text information generated in each repeating process
The process of URL, specifically includes step:
S301: in the case where obtaining application program authorization, the monitoring program in the application program is called to go through to described
The repeating process of history graph text information is monitored;
S302: it when monitoring that forwarding user is forwarded the history graph text information, obtains in current repeating process
The URL of generation.
In the method for pushing of graph text information provided by the invention, the authorization of application program is obtained, by calling application program
In monitoring program, the forwarding each time of graph text information can be monitored.For example, picture and text are forwarded in wechat
In the process, under the premise of obtaining wechat authorization, the JSSDK in wechat can be called to carry out script monitoring, to realize to user
Reading text and graph information forwards the behavior of graph text information.
In the method for pushing of graph text information provided by the invention, the number of the determining forwarding child node is more than preset threshold
The detailed process of each destination node include:
Traverse each of each forwarding chain node;
For each of forwarding chain node, all child node quantity under the node branch are counted;
It is more than the node of preset threshold as destination node using child node quantity.
With Fig. 4 for a specific example, the above process is illustrated:
In Fig. 4, user has issued graph text information, as user A1, B1, C1, after seeing graph text information, to graph text information
It is forwarded, then as initially originator is turned, in the forwarding URL of A1, the id information for currently turning originator A1 is added, forwards level
It is recorded as 1.User A2, A3 forward graph text information, then after the graph text information for seeing A1 forwarding in the forwarding of A2
The ID for currently turning originator A2 is added in URL, and currently turns the previous ID for turning originator A1 of originator A2, forwarding level is recorded as 2.?
The ID for currently turning originator A3 is added in the forwarding URL of A3, and currently turns the previous ID for turning originator A3 of originator, forwarding level is 2.
At this point, since forwarding user A1, after A1, generating two forwarding branches, A1-A2, A1- for the forwarding chain of graph text information
A3, A2, A3, are the child node of A1, and in Fig. 4, A2, A3, A4, A8 calculate the child node for being A1.
Meanwhile user B1, C1 also forward graph text information, such as set, user's bring transfer amount is more than 2,
Meet push request, then when new graph text information is forwarded, to the corresponding each forwarding of history graph text information in Fig. 4
Chain carries out analysis and finds, node A5, A3, A1, C1, bring transfer amount are all satisfied requirement, then is node A5, A3, A1, C1 distribution
New graph text information is preferentially pushed to the corresponding forwarding user of the high node of weight by higher push weight.Promote push effect
Rate.
Certainly, it in method for pushing provided by the invention, can also be weighed according to the practical bring transfer amount of each user
The distribution of weight, such as in Fig. 4, although there are many child node of A1 user, its practical bring transfer amount only has A2, and
A3, in method provided by the invention, A1 has most child nodes, can preferentially be pushed to A1 or preferentially be pushed to reality
Border transfer amount biggish A3 and A5.According to the process actually pushed in method for pushing provided by the invention, it can freely adjust and push away
Send strategy.
In the method for pushing of graph text information provided by the invention, it can also be used to the corresponding forwarding of each destination node
The reward of family transmission predetermined form.The reward can be the Bonus Reward of red packet form, and encourage for the integral of integrated form
It encourages.
It is corresponding with the method for pushing of graph text information that Fig. 1 is provided, as shown in figure 5, additionally providing a kind of graph text information
Driving means, comprising:
Acquiring unit 401, for when receive push user to currently wait push graph text information push request when, obtain
At least one forwarding chain corresponding with the history graph text information of the push user push;
Determination unit 402, in each forwarding chain, determining that the number of forwarding child node is more than preset threshold
Each destination node;
Push unit 403, it is corresponding for the graph text information currently to be pushed to be pushed to each destination node
Forward user.
In the driving means of graph text information provided by the invention, when user needs to push new graph text information,
Determine first the user push history graph text information, history graph text information in continuous repeating process, can generate it is a plurality of and its
Corresponding forwarding chain, the forwarding chain describe the forwarding relationship between each forwarding user.The present invention passes through in forwarding chain
The child node quantity of each node is analyzed, to determine that child node quantity is more than multiple destination nodes of preset threshold, this hair
For forwarding each of chain node in bright, all forward node after the node are the child node of the node, sub- section
Transfer amount brought by the point more corresponding forwarding user of the bright node of multilist is bigger, and therefore, user is currently pushed
New graph text information pushed to the corresponding forwarding user of above-mentioned each destination node, can be brought for new graph text information
More transfer amounts, and then improve the pushing efficiency to new graph text information.
On the basis of Fig. 5, as shown in fig. 6, showing the another detailed of graph text information driving means provided by the invention
Structural schematic diagram, the acquiring unit 401 include:
Obtain subelement 404, the unified resource generated in each repeating process for obtaining the history graph text information
Finger URL URL;
Parsing subunit 405, for parsing the ID identification information for including in each URL, the ID identification information packet
It includes current forwarding User ID, the upper forwarding User ID of current forwarding user and currently forwards level;
Subelement 406 is determined, for determining each turn for forwarding the history graph text information according to the ID identification information
Chain relationship between hair family, to form forwarding chain corresponding with the history graph text information.
In described device, further includes:
Transmission unit 407, for sending the reward of predetermined form to the corresponding forwarding user of each destination node.
The driving means of the graph text information includes processor and memory, and above-mentioned acquiring unit, determination unit, push are single
Member, obtain subelement, parsing subunit, determine subelement and transmission unit etc. as program unit storage in memory,
Above procedure unit stored in memory is executed by processor to realize corresponding function.
Include kernel in processor, is gone in memory to transfer corresponding program unit by kernel.Kernel can be set one
Or more, graph text information is sent to the user that can bring more transfer amount by adjusting kernel parameter, is promoted to picture and text
The pushing efficiency of information.
Memory may include the non-volatile memory in computer-readable medium, random access memory (RAM) and/
Or the forms such as Nonvolatile memory, if read-only memory (ROM) or flash memory (flash RAM), memory include that at least one is deposited
Store up chip.
The embodiment of the invention provides a kind of storage mediums, are stored thereon with program, real when which is executed by processor
The method for pushing of the existing graph text information.
The embodiment of the invention provides a kind of processor, the processor is for running program, wherein described program operation
The method for pushing of graph text information described in Shi Zhihang.
The embodiment of the invention provides a kind of equipment, equipment include processor, memory and storage on a memory and can
The program run on a processor, processor perform the steps of a kind of method for pushing of graph text information, packet when executing program
It includes:
User is pushed to currently when pushing the push request of graph text information, acquisition is pushed away with the push user when receiving
At least one corresponding forwarding chain of the history graph text information sent;
In each forwarding chain, determine that the number of forwarding child node is more than each destination node of preset threshold;
The graph text information currently to be pushed is pushed to the corresponding forwarding user of each destination node.
Above-mentioned method, the acquisition at least one turn corresponding with the history graph text information of the push user push
Sending out chain includes:
Obtain the uniform resource position mark URL that the history graph text information generates in each repeating process;
Parse the ID identification information for including in each URL, the ID identification information include current forwarding User ID, when
Upper the one of forward hair family forwards User ID and currently forwards level;
According to the ID identification information, determine that the chain type between each forwarding user for forwarding the history graph text information is closed
System, to form forwarding chain corresponding with the history graph text information.
Above-mentioned method, the URL that the acquisition history graph text information generates in each repeating process include:
In the case where obtaining application program authorization, call the monitoring program in the application program to the history picture and text
The repeating process of information is monitored;
When monitoring that forwarding user is forwarded the history graph text information, obtains and generated in current repeating process
URL。
Above-mentioned method, the number of the determining forwarding child node are more than that each destination node of preset threshold includes:
Traverse each of each forwarding chain node;
For each of forwarding chain node, all child node quantity under the node branch are counted;
It is more than the node of preset threshold as destination node using child node quantity.
Above-mentioned method, further includes:
To the corresponding reward for forwarding user to send predetermined form of each destination node.
.Equipment herein can be server, PC, PAD, mobile phone etc..
Present invention also provides a kind of computer program products, when executing on data processing equipment, are adapted for carrying out just
A kind of program of beginningization there are as below methods step: method for pushing of graph text information, comprising:
User is pushed to currently when pushing the push request of graph text information, acquisition is pushed away with the push user when receiving
At least one corresponding forwarding chain of the history graph text information sent;
In each forwarding chain, determine that the number of forwarding child node is more than each destination node of preset threshold;
The graph text information currently to be pushed is pushed to the corresponding forwarding user of each destination node.
Above-mentioned method, the acquisition at least one turn corresponding with the history graph text information of the push user push
Sending out chain includes:
Obtain the uniform resource position mark URL that the history graph text information generates in each repeating process;
Parse the ID identification information for including in each URL, the ID identification information include current forwarding User ID, when
Upper the one of forward hair family forwards User ID and currently forwards level;
According to the ID identification information, determine that the chain type between each forwarding user for forwarding the history graph text information is closed
System, to form forwarding chain corresponding with the history graph text information.
Above-mentioned method, the URL that the acquisition history graph text information generates in each repeating process include:
In the case where obtaining application program authorization, call the monitoring program in the application program to the history picture and text
The repeating process of information is monitored;
When monitoring that forwarding user is forwarded the history graph text information, obtains and generated in current repeating process
URL。
Above-mentioned method, the number of the determining forwarding child node are more than that each destination node of preset threshold includes:
Traverse each of each forwarding chain node;
For each of forwarding chain node, all child node quantity under the node branch are counted;
It is more than the node of preset threshold as destination node using child node quantity.
Above-mentioned method, further includes:
To the corresponding reward for forwarding user to send predetermined form of each destination node.
It should be understood by those skilled in the art that, embodiments herein can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the application
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the application, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The application is referring to method, the process of equipment (system) and computer program product according to the embodiment of the present application
Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs
Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real
The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
In a typical configuration, calculating equipment includes one or more processors (CPU), input/output interface, net
Network interface and memory.
Memory may include the non-volatile memory in computer-readable medium, random access memory (RAM) and/
Or the forms such as Nonvolatile memory, such as read-only memory (ROM) or flash memory (flash RAM).Memory is computer-readable Jie
The example of matter.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by any method
Or technology come realize information store.Information can be computer readable instructions, data structure, the module of program or other data.
The example of the storage medium of computer includes, but are not limited to phase change memory (PRAM), static random access memory (SRAM), moves
State random access memory (DRAM), other kinds of random access memory (RAM), read-only memory (ROM), electric erasable
Programmable read only memory (EEPROM), flash memory or other memory techniques, read-only disc read only memory (CD-ROM) (CD-ROM),
Digital versatile disc (DVD) or other optical storage, magnetic cassettes, tape magnetic disk storage or other magnetic storage devices
Or any other non-transmission medium, can be used for storage can be accessed by a computing device information.As defined in this article, it calculates
Machine readable medium does not include temporary computer readable media (transitory media), such as the data-signal and carrier wave of modulation.
It should also be noted that, the terms "include", "comprise" or its any other variant are intended to nonexcludability
It include so that the process, method, commodity or the equipment that include a series of elements not only include those elements, but also to wrap
Include other elements that are not explicitly listed, or further include for this process, method, commodity or equipment intrinsic want
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including element
There is also other identical elements in process, method, commodity or equipment.
It will be understood by those skilled in the art that embodiments herein can provide as method, system or computer program product.
Therefore, complete hardware embodiment, complete software embodiment or embodiment combining software and hardware aspects can be used in the application
Form.It is deposited moreover, the application can be used to can be used in the computer that one or more wherein includes computer usable program code
The shape for the computer program product implemented on storage media (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.)
Formula.
The above is only embodiments herein, are not intended to limit this application.To those skilled in the art,
Various changes and changes are possible in this application.It is all within the spirit and principles of the present application made by any modification, equivalent replacement,
Improve etc., it should be included within the scope of the claims of this application.
Claims (10)
1. a kind of method for pushing of graph text information characterized by comprising
User is pushed to currently when pushing the push request of graph text information, acquisition is pushed with the push user when receiving
At least one corresponding forwarding chain of history graph text information;
In each forwarding chain, determine that the number of forwarding child node is more than each destination node of preset threshold;
The graph text information currently to be pushed is pushed to the corresponding forwarding user of each destination node.
2. the method according to claim 1, wherein the history picture and text of the acquisition and the push user push
Information it is corresponding at least one forwarding chain include:
Obtain the uniform resource position mark URL that the history graph text information generates in each repeating process;
The ID identification information for including in each URL is parsed, the ID identification information includes current forwarding User ID, works as forward
Upper the one of hair family forwards User ID and currently forwards level;
According to the ID identification information, the chain relationship between each forwarding user for forwarding the history graph text information is determined,
To form forwarding chain corresponding with the history graph text information.
3. according to the method described in claim 2, it is characterized in that, described obtain the history graph text information forwarded over every time
The URL generated in journey includes:
In the case where obtaining application program authorization, call the monitoring program in the application program to the history graph text information
Repeating process be monitored;
When monitoring that forwarding user is forwarded the history graph text information, the URL generated in current repeating process is obtained.
4. the method according to claim 1, wherein the number of the determining forwarding child node is more than preset threshold
Each destination node include:
Traverse each of each forwarding chain node;
For each of forwarding chain node, all child node quantity under the node branch are counted;
It is more than the node of preset threshold as destination node using child node quantity.
5. the method according to claim 1, wherein further include:
To the corresponding reward for forwarding user to send predetermined form of each destination node.
6. a kind of driving means of graph text information characterized by comprising
Acquiring unit, for when receive push user to currently wait push graph text information push request when, obtain with it is described
Push at least one corresponding forwarding chain of history graph text information of user's push;
Determination unit, in each forwarding chain, determining that the number of forwarding child node is more than each mesh of preset threshold
Mark node;
Push unit is used for the graph text information currently to be pushed to be pushed to the corresponding forwarding of each destination node
Family.
7. device according to claim 6, which is characterized in that the acquiring unit includes:
Obtain subelement, the uniform resource locator generated in each repeating process for obtaining the history graph text information
URL;
Parsing subunit, for parsing the ID identification information for including in each URL, the ID identification information includes working as forward
Upper the one of hair User ID, currently forwarding user forwards User ID and currently forwards level;
Subelement is determined, for determining each forwarding user for forwarding the history graph text information according to the ID identification information
Between chain relationship, to form corresponding with history graph text information forwarding chain.
8. device according to claim 6, which is characterized in that further include:
Transmission unit, for sending the reward of predetermined form to the corresponding forwarding user of each destination node.
9. a kind of storage medium, which is characterized in that the storage medium includes the program of storage, wherein described program executes special
Benefit require any one of 1 to 5 described in graph text information method for pushing.
10. a kind of processor, which is characterized in that the processor is for running program, wherein right of execution when described program is run
Benefit require any one of 1 to 5 described in graph text information method for pushing.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710909118.XA CN109587198B (en) | 2017-09-29 | 2017-09-29 | Image-text information pushing method and device |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710909118.XA CN109587198B (en) | 2017-09-29 | 2017-09-29 | Image-text information pushing method and device |
Publications (2)
Publication Number | Publication Date |
---|---|
CN109587198A true CN109587198A (en) | 2019-04-05 |
CN109587198B CN109587198B (en) | 2021-11-19 |
Family
ID=65919011
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710909118.XA Active CN109587198B (en) | 2017-09-29 | 2017-09-29 | Image-text information pushing method and device |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN109587198B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110781439A (en) * | 2019-10-30 | 2020-02-11 | 秒针信息技术有限公司 | Method, device, equipment and storage medium for determining multistage forwarding relation |
CN113723991A (en) * | 2021-08-10 | 2021-11-30 | 上海原圈网络科技有限公司 | Marketing article influence analysis processing method and device |
Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080126523A1 (en) * | 2006-09-22 | 2008-05-29 | Microsoft Corporation | Hierarchical clustering of large-scale networks |
CN102111424A (en) * | 2009-12-28 | 2011-06-29 | 腾讯科技(深圳)有限公司 | Method and system for pushing information through SNS network node relation chain |
CN102498694A (en) * | 2009-09-14 | 2012-06-13 | 日本电气株式会社 | Communication system, forwarding node, path management server, communication method, and program |
US20130019291A1 (en) * | 2010-03-17 | 2013-01-17 | Huawei Technologies Co., Ltd. | Service opening method and system, and service opening server |
CN104137520A (en) * | 2014-01-10 | 2014-11-05 | 华为技术有限公司 | Message pushing method and device |
US20150052099A1 (en) * | 2013-08-19 | 2015-02-19 | Business Objects Software Ltd | Displaying historical data associated with data values within business intelligence reports |
CN105701100A (en) * | 2014-11-26 | 2016-06-22 | 上海高研明鉴信息技术有限公司 | Automatic recording method, device and system of internet information forwarding process |
US20160283951A1 (en) * | 2015-03-27 | 2016-09-29 | International Business Machines Corporation | Transforming social media re-shares to track referrer history and identify influencers |
CN106612298A (en) * | 2015-10-22 | 2017-05-03 | 中国科学院声学研究所 | Content delivery method and content delivery system based on large-scale network nodes |
-
2017
- 2017-09-29 CN CN201710909118.XA patent/CN109587198B/en active Active
Patent Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080126523A1 (en) * | 2006-09-22 | 2008-05-29 | Microsoft Corporation | Hierarchical clustering of large-scale networks |
CN102498694A (en) * | 2009-09-14 | 2012-06-13 | 日本电气株式会社 | Communication system, forwarding node, path management server, communication method, and program |
CN102111424A (en) * | 2009-12-28 | 2011-06-29 | 腾讯科技(深圳)有限公司 | Method and system for pushing information through SNS network node relation chain |
US20130019291A1 (en) * | 2010-03-17 | 2013-01-17 | Huawei Technologies Co., Ltd. | Service opening method and system, and service opening server |
US20150052099A1 (en) * | 2013-08-19 | 2015-02-19 | Business Objects Software Ltd | Displaying historical data associated with data values within business intelligence reports |
CN104137520A (en) * | 2014-01-10 | 2014-11-05 | 华为技术有限公司 | Message pushing method and device |
CN105701100A (en) * | 2014-11-26 | 2016-06-22 | 上海高研明鉴信息技术有限公司 | Automatic recording method, device and system of internet information forwarding process |
US20160283951A1 (en) * | 2015-03-27 | 2016-09-29 | International Business Machines Corporation | Transforming social media re-shares to track referrer history and identify influencers |
CN106612298A (en) * | 2015-10-22 | 2017-05-03 | 中国科学院声学研究所 | Content delivery method and content delivery system based on large-scale network nodes |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110781439A (en) * | 2019-10-30 | 2020-02-11 | 秒针信息技术有限公司 | Method, device, equipment and storage medium for determining multistage forwarding relation |
CN113723991A (en) * | 2021-08-10 | 2021-11-30 | 上海原圈网络科技有限公司 | Marketing article influence analysis processing method and device |
CN113723991B (en) * | 2021-08-10 | 2024-04-19 | 上海原圈网络科技有限公司 | Marketing article influence analysis processing method and device |
Also Published As
Publication number | Publication date |
---|---|
CN109587198B (en) | 2021-11-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105446750B (en) | The method and apparatus that WebApp starting runs, generates image file | |
CN106656920B (en) | Processing method, device, storage medium and the processor of HTTP service | |
CN109582872A (en) | A kind of information-pushing method, device, electronic equipment and storage medium | |
CN107832275A (en) | The generation method of intelligent Contract ID, apparatus and system in block chain | |
CN109800005A (en) | A kind of hot update method of client and device | |
AU2015362076A1 (en) | Notifications on mobile devices | |
CN110058989A (en) | User behavior Intention Anticipation method and apparatus | |
CN103747436A (en) | Application program downloading method and device | |
CN109948074A (en) | Website data interconnection method, device, storage medium, processor and electronic equipment | |
CN109460546A (en) | List generation method, device and electronic equipment | |
CN109598171A (en) | A kind of data processing method based on two dimensional code, apparatus and system | |
CN104869135B (en) | The method and terminal of data interaction | |
CN110110516A (en) | Log recording method, apparatus and system | |
CN109587198A (en) | Graph text information method for pushing and device | |
CN109614159A (en) | Plan target distribution, introduction method and device | |
CN106909567A (en) | Data processing method and device | |
CN109598526A (en) | The analysis method and device of media contribution | |
JP2019096060A (en) | Api billing system, api billing management method, and api billing program | |
CN110769064A (en) | System, method and equipment for offline message pushing | |
CN109995787A (en) | A kind of data processing method and relevant device | |
CN106776614A (en) | The display methods and device of sharing platform | |
CN110019178A (en) | The correlating method and device of data | |
CN110020074A (en) | Determine the method and device of webpage turnover rate | |
CN103326957A (en) | Browser and method for controlling flow of browser | |
US9247559B2 (en) | Dynamically delayed delivery of content in a network |
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 | ||
CB02 | Change of applicant information |
Address after: 100080 No. 401, 4th Floor, Haitai Building, 229 North Fourth Ring Road, Haidian District, Beijing Applicant after: Beijing Guoshuang Technology Co.,Ltd. Address before: 100086 Beijing city Haidian District Shuangyushu Area No. 76 Zhichun Road cuigongfandian 8 layer A Applicant before: Beijing Guoshuang Technology Co.,Ltd. |
|
CB02 | Change of applicant information | ||
GR01 | Patent grant | ||
GR01 | Patent grant |