CN108268662A - Social graph generation method, electronic device and storage medium based on the H5 pages - Google Patents
Social graph generation method, electronic device and storage medium based on the H5 pages Download PDFInfo
- Publication number
- CN108268662A CN108268662A CN201810144076.XA CN201810144076A CN108268662A CN 108268662 A CN108268662 A CN 108268662A CN 201810144076 A CN201810144076 A CN 201810144076A CN 108268662 A CN108268662 A CN 108268662A
- Authority
- CN
- China
- Prior art keywords
- data
- pages
- relation information
- social graph
- temporary
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/367—Ontology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
-
- G—PHYSICS
- G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
- G09B—EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS
- G09B29/00—Maps; Plans; Charts; Diagrams, e.g. route diagram
Abstract
The invention discloses a kind of social graph generation methods based on the H5 pages, belong to network technique field.A kind of social graph generation method based on the H5 pages, includes the following steps：S1, reception and the temporary H5 pages are propagated in the data to temporary data table generated；S2, data are preserved by activity ID classification into corresponding temporary table；S3, the relation information included in data is obtained successively from temporary table；S4, the validity for judging the relation information obtained, if performing effectively S6, if performing S5 in vain；S5, the data comprising the relation information are transferred to from temporary table in data log tables；S6, the data comprising the relation information are transferred to from temporary table in corresponding effectively list；S7, the data in effective list, the generation H5 pages propagate figure.The present invention can help the publisher of the H5 pages preferably to monitor the communication effect of the H5 pages, intuitively grasp activity progress.
Description
Technical field
The present invention relates to network technique fields, are related to a kind of social graph generation method based on the H5 pages, electronic device
And storage medium.
Background technology
With the arrival in mobile Internet epoch, consumer attention is transferred to mobile terminal from traditional PC.Using wechat as
After the social media of representative grows up, the attention of most consumers is attracted in social media." the note of consumer
Anticipate power where, marketing will channel where ".So in the mobile Internet epoch, the marketing activity of enterprise have greatly under line to
The trend shifted on line realizes Brand Marketing by internet and social circle, customer service, obtains the targets such as client.
What marketing activity was relatively common on line is propagated by wechat, relies primarily on the sides such as the spontaneous forwarding of push, client
Formula is propagated, and the content of push or forwarding is usually H5 loose-leafs.Now, there is a large amount of H5 pages circulation daily in wechat friend
Friend's circle, we can see the information much needed by H5 loose-leafs.But during H5 madness is propagated, not
Link monitoring some processing so that the publisher of H5 loose-leafs activity propagate during, can not learn in time activity into
Exhibition state.
Invention content
The technical problem to be solved by the present invention is in order to overcome, publisher can not during the H5 pages are propagated in the prior art
The state of progress of activity is learnt in time, it is proposed that a kind of social graph generation method, electronic device and storage based on the H5 pages
Medium by increasing link monitoring in H5 page communication processes, realizes the function of automatically generating corresponding social graph so that hair
Cloth person grasps the propagation progress of the H5 pages in time.
The present invention is to solve above-mentioned technical problem by following technical proposals：
A kind of social graph generation method based on the H5 pages, includes the following steps：
S1, the data that the propagation of the H5 pages generates are received, and are kept in successively into temporary data table by the generation time of data,
Activity ID and relation information are included at least in the data；
S2, successively by the data in temporary data table press it includes movable ID classification preserve to corresponding temporary table
In, the data in each temporary table are ranked up by its time generated；
S3, the relation information included in data is obtained successively by the sequence of data from temporary table；
S4, the validity for judging the relation information obtained, perform S6, if performing S5 in vain if effectively；
S5, the data comprising the relation information are transferred to from the temporary table in data log tables；
S6, the data comprising the relation information are transferred to from the temporary table in corresponding effectively list；
S7, the data in effective list, generation is propagated with the corresponding H5 pages of each activity ID to be schemed.
Preferably, the S2 include it is following step by step：
First data in S21, acquisition temporary data table are as current data；
S22, the movable ID included in current data is obtained；
S23, the temporary table named with the movable ID included in current data is judged whether, if then directly performing
S25, if otherwise performing S24；
S24, the temporary table of movable ID names for creating one to be included in current data；
S25, the current data is preserved in the temporary table of movable ID names included into current data；
S26, judge whether the current data is the last one data in the temporary data table, if otherwise performing
S21。
Preferably, data are obtained from temporary table simultaneously by more front end applications in the S3, the acquisition data
Process include it is following step by step：
S31, the request process for receiving the acquisition data that more front end applications are sent；
S32, multiple request process for obtaining data enter in redis cache lists the value for attempting setting locking key, if
It puts successful request process and performs S33, be not provided with successful request process and repeat S32；
S33, the data to rank the first in temporary table are obtained；
S34, the value of locking key is deleted to discharge lock.
Preferably, the value of the locking key is set as the time-out time of lock, and the time-out time is working as the value of setting locking key
The preceding time is plus the effective time of lock.
Preferably, the H5 pages are equipped with forwarding and pass round relational interface, and the forwarding passes round relational interface for recording
The relation information generated in H5 page communication processes.
Preferably, include in the relation information disseminator in H5 page single communication processes and participator and
Expression is pushed to the identification information in the push direction of participator from disseminator.
Preferably, the S4 include it is following step by step：
S41, judge whether include the pass identical with the relation information of acquisition in effective list in existing data
It is information, if the relation information for then judging to obtain is invalid, if otherwise performing S42；
S42, judge in existing data whether to include in effective list with the relation information obtained for directly instead
The relation information of relationship is pushed away, if the relation information for then judging to obtain is invalid, if otherwise performing S43；
S43, the relation information for judging whether to include and obtain in existing data in effective list are reversed between being
The relation information of relationship is pushed away, if the relation information for then judging to obtain is invalid, if otherwise performing S44；
S44, judge whether the participator included in the relation information obtained is empty, if then judging to obtain described
Relation information is invalid, if the relation information for otherwise judging to obtain is effective.
Preferably, the propagation figure in the S7 is loop-free tree-structures link figure.
A kind of electronic device, including memory and processor, being stored on the memory can be performed by the processor
Based on the H5 pages social graph generation system, it is described based on the H5 pages social graph generation system include：
Data reception module propagates the data generated, and keep in successively by the generation time of data for receiving the H5 pages
Into temporary data table, activity ID and relation information are included at least in the data；
Classification and ordination module, for successively by the data in temporary data table press it includes movable ID classification preserve to phase
In the temporary table answered, the data in each temporary table are ranked up by its time generated；
Interception module, for obtaining the relation information included in data successively by the sequence of data from temporary table；
Effective judgement module, for judging the validity of the relation information obtained；
Data distribution module, for the data for including invalid relation information to be transferred to data from the temporary table
In log tables, the data for including effective relation information are transferred to from the temporary table in corresponding effectively list；
Figure generation module is propagated, for the data generation in effective list and the corresponding H5 pages of each activity ID
Propagate figure.
A kind of computer readable storage medium, the computer readable storage medium memory contain the social activity based on the H5 pages
Collection of illustrative plates generates system, and the social graph generation system based on the H5 pages can be performed by least one processor, so that institute
State the step of at least one processor performs the social graph generation method based on the H5 pages as described in any one of aforementioned.
The positive effect of the present invention is：The present invention is by recording the data generated in the propagation of the H5 pages, Ran Hougen
Valid data are filtered out according to the relation information in data, it is loop-free, top-down to be based ultimately upon the generation of these valid data
Propagate figure, the publisher of the H5 pages to be helped preferably to monitor the communication effect of the H5 pages, intuitively grasp activity progress.
Description of the drawings
Fig. 1 shows the hardware structure schematic diagram of one embodiment of electronic device of the present invention；
Fig. 2 shows the program moulds of social graph generation one embodiment of system based on the H5 pages in electronic device of the present invention
Block schematic diagram；
Fig. 3 shows the flow chart of the social graph generation method embodiment one the present invention is based on the H5 pages；
Fig. 4 shows the flow chart of the social graph generation method embodiment two the present invention is based on the H5 pages；
Fig. 5 shows the flow chart of the social graph generation method embodiment three the present invention is based on the H5 pages；
Fig. 6 shows the flow chart of the social graph generation method example IV the present invention is based on the H5 pages.
Specific embodiment
It is further illustrated the present invention below by the mode of embodiment, but does not therefore limit the present invention to the reality
It applies among a range.
First, the present invention proposes a kind of electronic device.
As shown in fig.1, it is the hardware structure schematic diagram of one embodiment of electronic device of the present invention.It is described in the present embodiment
Electronic device 2 be it is a kind of can be automatic to carry out numerical computations and/or information processing according to the instruction for being previously set or storing
Equipment.For example, it may be smart mobile phone, tablet computer, laptop, desktop computer, rack-mount server, blade type take
Business device, tower server or the Cabinet-type server (server set formed including independent server or multiple servers
Group) etc..As shown in the figure, the electronic device 2 includes at least, but be not limited to, connection storage can be in communication with each other by system bus
Device 21, processor 22, network interface 23 and the social graph generation system 20 based on the H5 pages.Wherein：
The memory 21 includes at least a type of computer readable storage medium, and the readable storage medium storing program for executing includes
Flash memory, hard disk, multimedia card, card-type memory (for example, SD or DX memories etc.), random access storage device (RAM), it is static with
Machine accesses memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), may be programmed only
Read memory (PROM), magnetic storage, disk, CD etc..In some embodiments, the memory 21 can be the electricity
The internal storage unit of sub-device 2, such as the hard disk or memory of the electronic device 2.In further embodiments, the memory
21 can also be the plug-in type hard disk being equipped on the External memory equipment of the electronic device 2, such as the electronic device 2, intelligence
Storage card (Smart Media Card, SMC), secure digital (Secure Digital, SD) card, flash card (Flash Card)
Deng.Certainly, the memory 21 can also both include the internal storage unit of the electronic device 2 or be set including its external storage
It is standby.In the present embodiment, the memory 21 is installed on the operating system and types of applications of the electronic device 2 commonly used in storage
Software, such as described program code of social graph generation system 20 based on the H5 pages etc..In addition, the memory 21 may be used also
For temporarily storing the Various types of data that has exported or will export.
The processor 22 can be in some embodiments central processing unit (Central Processing Unit,
CPU), controller, microcontroller, microprocessor or other data processing chips.The processor 22 is commonly used in the control electricity
The overall operation of sub-device 2, such as perform and carry out data interaction or communicate relevant control and processing with the electronic device 2
Deng.In the present embodiment, the processor 22 is used to run the program code stored in the memory 21 or processing data, example
The generation system 20 of the social graph based on the H5 pages as described in running.
The network interface 23 may include radio network interface or wired network interface, which is commonly used in
Communication connection is established between the electronic device 2 and other electronic devices.For example, the network interface 23 is used to incite somebody to action by network
The electronic device 2 is connected with exterior terminal, between the electronic device 2 and exterior terminal establish data transmission channel and
Communication connection etc..The network can be intranet (Intranet), internet (Internet), global system for mobile telecommunications system
Unite (Global System of Mobile communication, GSM), wideband code division multiple access (Wideband Code
Division Multiple Access, WCDMA), 4G networks, 5G networks, bluetooth (Bluetooth), Wi-Fi etc. is wireless or has
Gauze network.
It should be pointed out that Fig. 1 illustrates only the electronic device 2 with component 21-23, it should be understood that not
It is required that implement all components shown, the more or less component of the implementation that can be substituted.
In the present embodiment, being stored in the social graph generation system 20 of described in memory 21 based on the H5 pages can be with
One or more program module is divided into, one or more of program modules are stored in memory 21, and can
It is performed by one or more processors (the present embodiment is processor 22), to complete the present invention.
For example, the program module Fig. 2 shows social graph generation 20 1 embodiment of system based on the H5 pages is shown
It is intended to, in the embodiment, the social graph generation system 20 based on the H5 pages can be divided into data reception module
201st, classification and ordination module 202, interception module 203, Effective judgement module 204, data distribution module 205 and propagation figure generation
Module 206.Wherein, the so-called program module of the present invention is the series of computation machine program instruction for referring to complete specific function
Section generates the holding in the electronic device 2 of system 20 than program more suitable for describing the social graph based on the H5 pages
Row process.The concrete function that will specifically introduce the program module 201-206 is described below.
The data reception module 201 be used for receive the H5 pages propagate generate data, by data generation time successively
It keeps in into temporary data table, activity ID and relation information is included at least in the data.
The H5 pages, which are often propagated, once all can correspondingly generate a data, once data generation will be sent to temporarily
In tables of data, temporary data table is kept in data by the priority for receiving data, i.e., rear to receive before the data first received are temporarily stored in
To data be temporarily stored in after, the operation principle of temporary data table described here is similar to storehouse, and since data are once generating
It is sent, thus the data in temporary data table are really what is be ranked up by the generation time of data.
The activity ID is the unique identifier of the H5 pages, also corresponds to the title of the H5 pages, is recorded in the H5 pages
In code；Each H5 pages are corresponding different activities and generate, and are correspondingly assigned different movable ID.Each H5
The page is transmitted primary (push is primary) all can be in the data of generation, this data is automatically recorded by wechat end, and conduct
The movable ID of the H5 Page Names is naturally also the part in data.
The relation information is to pass round relational interface by forwarding to obtain, this interface is increased in H5 page animations
In its code, the forwarding passes round relational interface for recording disseminator and participator that the H5 pages are propagated each time, with
And representing to be pushed to the identification information in the push direction of participator from disseminator, these information are referred to as relation information.
The classification and ordination module 202 for successively by the data in temporary data table press it includes movable ID classify protect
It deposits into corresponding temporary table, the data in each temporary table are ranked up by its time generated.
Due to being the evidence of fetching successively from front to back that puts in order by data in temporary data table when classification, because
It is naturally also the generation time auto arrangement from front to back by data when this data is saved to each corresponding temporary table.
The interception module 203 is believed for obtaining the relationship included in data successively by the sequence of data from temporary table
Breath.
The Effective judgement module 204, for judging the validity of the relation information obtained.
The data distribution module 205, the data for that will include invalid relation information turn from the temporary table
It moves in data log tables, the data for including effective relation information is transferred to corresponding effectively row from the temporary table
In table.
The invalid relation information refers specifically to following several respects：
1) there is the direct anti-relation information for pushing away relationship each other, it is invalid to generate the relation information in posterior data.
For example it is exactly：Generate the preceding data record H5 pages by A be pushed to B generation a relation information (i.e. A pushes away B's
Relation information)；Generate the posterior data record H5 pages by B be pushed to A generation a relation information (i.e. B pushes away the relationship of A
Information)；It is formd referred to here as the two relation informations and directly counter pushes away relationship；Since A pushes away the relation information of B in preceding, the pass
It is to generate posterior B and push away the relation information of A to be judged as in vain after information is judged as effectively.
2) the reversed relation information for pushing away relationship between occurring, the relation information in the data finally generated is invalid.Citing
For be exactly：Three datas so sequentially occurring by the generation time of data；First data has recorded the H5 pages and is pushed by A
The relation information (i.e. A pushes away the relation information of B) generated to B；The Article 2 data record H5 pages are pushed to C by B and generate
A relation information (i.e. B pushes away the relation information of C)；The Article 3 data record H5 pages are pushed to a pass of A generations by C
It is information (i.e. C pushes away the relation information of A)；This three data forms cycle, and (data of signified formation cycle here can be with
More than three, but at least three), push away relationship referred to here as reversed between the relation information in first and third data is formd
(relation information in two data of head and the tail in recycling is reversed between foring to push away relationship)；In this case, the first data
The relation information that middle A pushes away B is judged as effectively, and C pushes away the relation information of A and is judged as in vain in third data.
3) there is the relation information repeated, it is invalid to generate posterior relation information.There are at least two datas
The relation information that the H5 pages are pushed to B generations by A is had recorded, only generation time is different, in this case, in the first data
The relation information that A pushes away B is judged as effectively, and the relation information that the A in data later pushes away B is judged as in vain.
4) there is participator for empty relation information, which is judged as in vain.Do not have in this relation information
The information of participator is recorded, typically caused by system fault, is judged as in vain once there is this relation information.
More than four kinds be judged as that invalid relation information is merely illustrative, however not excluded that also have other invalid situations；It is moreover, each
The judgement of kind invalid situation does not have specific tandem, can judge simultaneously, can also carry out the arrangement of sequencing, but nothing
Judged by using which kind of form, be as a result the same, as long as several invalid situation one kind, i.e. relation information occurs only
Meet any one in several invalid situations, which is all judged as in vain.
The data generation that figure generation module 206 is propagated in effective list is corresponding with each activity ID
The H5 pages propagate figure.
Each effectively list corresponds to an activity ID, thus the data in each effectively list can generate a correspondence one
The propagation figure of a activity ID.
The propagation figure may be used tree-structures link figure and be presented, but be not excluded for also other appearance forms.Pass through
Figure is propagated, the publisher of the H5 pages can be intuitive to see the progress of activity, and propagation figure contains all this H5 pages of participations
The disseminator and participator that face is propagated, also present the direction of propagation of the H5 pages between each disseminator and each participator.
Temporary data table described in the present embodiment, temporary table, effective list are all present in database, as database
A part, by the way that database is carried out subregion acquisition, each area is used to store the data of different phase.
Secondly, the present invention proposes a kind of social graph generation method based on the H5 pages.
In embodiment one, as shown in figure 3, the social graph generation method based on the H5 pages includes following step
Suddenly：
S1, the data that the propagation of the H5 pages generates are received, and are kept in successively into temporary data table by the generation time of data,
Activity ID and relation information are included at least in the data.
The activity ID is the unique identifier of the H5 pages, also corresponds to the title of the H5 pages, is recorded in the H5 pages
In code；Each H5 pages are corresponding different activities and generate, and are correspondingly assigned different movable ID.Each H5
The page is transmitted primary (push is primary) all can be in the data of generation, this data is automatically recorded by wechat end, and conduct
The movable ID of the H5 Page Names is naturally also the part in data.
The relation information is to pass round relational interface by forwarding to obtain, this interface is set in H5 page animations
In its code, the forwarding passes round relational interface for recording disseminator and participator that the H5 pages are propagated each time, with
And representing to be pushed to the identification information in the push direction of participator from disseminator, these information are referred to as relation information.
S2, successively by the data in temporary data table press it includes movable ID classification preserve to corresponding temporary table
In, the data in each temporary table are ranked up by its time generated.
Here data are preserved into corresponding temporary table, in particular to preserve data to the activity included with the data
ID name temporary table in, i.e. each activity ID can correspond to there are one temporary table.
S3, the relation information included in data is obtained successively by the sequence of data from temporary table.
It fetches evidence by sequence of the data in temporary table, is further intercepted after obtaining data successively from front to back first
The relation information included in the data.
S4, the validity for judging the relation information obtained, perform S6, if performing S5 in vain if effectively.
What is invalid to the relation information, is specifically illustrated in the embodiment of previous electronic device, details are not described herein again.
S5, the data comprising the relation information are transferred to from the temporary table in data log tables.
The data log tables (i.e. data logging table) are the note of system or certain softwares to certain completed processing
Record, so that as reference, log tables are for recording invalid data here in the future, although data are judged in vain, after ensureing
Continuous to trace, error correction or restore certain data, these invalid data also need to stay shelves, therefore here turn invalid data
It moves in data log tables.
S6, the data comprising the relation information are transferred to from the temporary table in corresponding effectively list.
Corresponding each activity ID is described here that data are transferred to phase there are one the effective list named with activity ID
In the effective list answered, just refer to data being transferred in the effective list named with the movable ID included in the data.
S7, the data in effective list, generation is propagated with the corresponding H5 pages of each activity ID to be schemed.
Here figure is propagated in the relation information generation mainly in data, and the progress of tree-structures link figure specifically can be used in propagation figure
It presents, but is not excluded for also other appearance forms.
Shown on propagation figure the H5 pages every time propagate involved in disseminator and participator, disseminator described here and point
The person of enjoying be for propagation each time, this time in disseminator be participator in the last time, two roles are
In continuous variation；Specifically, when the H5 pages are pushed to B by A, in this propagation, A is disseminator, and B is participator；It
Afterwards, which is pushed outward towards C by B again, then in this propagation, B is disseminator, and C is participator；Here B is for A
It is participator, and is disseminator for C.
The H5 pages are constantly from top to bottom being propagated, and A is pushed to B, and B is pushed to C, and B has gone out twice, but are schemed propagating
Upper B is only shown once, is connected between A and B using A to the arrow of B, is connected again using B to the arrow of C between B and C, false
If C continues to push the H5 pages to other people, then connected down with arrow continuation, since invalid data is removed, meeting
It forms a loop-free, top-down tree-structures link and propagates figure.
The publisher of the H5 pages can be intuitive to see the progress of activity by the propagation figure, preferably monitor H5 pages
The communication effect in face.
In embodiment two, on the basis of embodiment one, as shown in figure 4, the step S2 specifically includes following point
Step：
First data in S21, acquisition temporary data table are as current data；
S22, the movable ID included in current data is obtained；
S23, the temporary table named with the movable ID included in current data is judged whether, if then directly performing
S25, if otherwise performing S24；
S24, the temporary table of movable ID names for creating one to be included in current data；
S25, the current data is preserved in the temporary table of movable ID names included into current data；
S26, judge whether the current data is the last one data in the temporary data table, if otherwise performing
S21。
In the present embodiment, the concrete operation step that data are preserved according to movable ID classification is given.Need what is particularly pointed out
Be, the temporary table of corresponding each activity ID be not prior built in advance in the database, but be related to according to the data received
Movable ID created, if be not received by the data for being related to a certain activity ID, will not create corresponding interim
List；In addition, each corresponding temporary tables of activity ID are only founded once, only detect do not have when getting a data
The establishment of temporary table can be just performed during the temporary table named with the movable ID included in the data.
It,, can be by more in the validity for judging relation information on the basis of embodiment one in embodiment three
Front end applications are performed simultaneously, to improve the whole speed of service.At this point, to prevent dirty data reading, misreading, the work(of lock is increased
Can, although there is more front end applications acquisition request data, the same time only allows a front end applications to obtain data.Such as figure
Shown in 5, it is described obtain data process include it is following step by step：
S31, the request process for receiving the acquisition data that more front end applications are sent.
S32, multiple request process for obtaining data enter in redis cache lists the value for attempting setting locking key, if
It puts successful request process and performs S33, be not provided with successful request process and repeat S32.
The value of locking key described here be specially lock time-out time, the time-out time be setting locking key value it is current when
Between plus lock effective time.
S33, the data to rank the first in temporary table are obtained.
S34, the value of locking key is deleted to discharge lock.
In the present embodiment, the request process for the acquisition data that front end applications are sent will not be entered directly into temporary table
Data are obtained, but are introduced into the value that redis cache lists go setting locking key, due to the characteristic of redis cache lists, same
Time can only be set successfully there are one request process, other request process then continue to attempt to the value of setting locking key.
In simple terms, exactly when the value of locking key has existed, any request process is impossible to set the value of locking key,
Only locking key could successfully be set the value of the locking key by another request process after being released or failing, thus locking key value
Through existing period, each request process can go the value for attempting to set locking key repeatedly, but will not all succeed.
It is that the value of locking key is deleted after the acquisition of data is completed in a request that the locking key, which is released,；The locking key failure
When referring to that locking time has been more than the value of the locking key of setting, the value of locking key can be deleted by the latter request process, so that
The latter request can obtain data from temporary table.
In example IV, on the basis of embodiment one, as shown in fig. 6, the S4 judges the relationship obtained
The validity of information specifically include it is following step by step：
S41, judge whether include the pass identical with the relation information of acquisition in effective list in existing data
It is information, if the relation information for then judging to obtain is invalid, if otherwise performing S42；
S42, judge in existing data whether to include in effective list with the relation information obtained for directly instead
The relation information of relationship is pushed away, if the relation information for then judging to obtain is invalid, if otherwise performing S43；
S43, the relation information for judging whether to include and obtain in existing data in effective list are reversed between being
The relation information of relationship is pushed away, if the relation information for then judging to obtain is invalid, if otherwise performing S44；
S44, judge whether the participator included in the relation information obtained is empty, if then judging to obtain described
Relation information is invalid, if the relation information for otherwise judging to obtain is effective.
The present embodiment is only a kind of judgment step designed according to four kinds of invalid situations of aforementioned list, which can
With according to invalid situation increase or decrease do it is suitably modified, those skilled in the art it should be appreciated that it is various similar modification all
Within protection scope of the present invention.
Validity of the judgment step successively to judge relation information in order involved in the present embodiment, people in the art
Member it should be appreciated that the Rule of judgment in each step can be arranged arbitrarily, Rule of judgment it is various in tandem all in the present invention
Protection domain within.
Rule of judgment in the present embodiment involved in each judgment step can also be carried out at the same time judgement, specifically, judging have
Whether include in existing data in effect list it is identical with the relation information obtained, counter push away relationship to be direct or be indirect
The anti-relation information for pushing away relationship judges whether the participator included in the relation information obtained is empty, if meeting it
In any one Rule of judgment (as long as occurring one is), then the relation information for judging to obtain is invalid.This field skill
Art personnel it should be appreciated that this judgment mode also within protection scope of the present invention.
In addition, a kind of computer readable storage medium of the present invention, the computer readable storage medium memory are contained based on H5
The social graph generation system 20 of the page, social graph generation system 20 that should be based on the H5 pages can be by one or more processors
During execution, realize above-mentioned based on the social graph generation method of the H5 pages or the operation of electronic device.
Although specific embodiments of the present invention have been described above, it will be appreciated by those of skill in the art that this is only
For example, protection scope of the present invention is to be defined by the appended claims.Those skilled in the art without departing substantially from
Under the premise of the principle and substance of the present invention, many changes and modifications may be made, but these change and
Modification each falls within protection scope of the present invention.
Claims (10)
1. a kind of social graph generation method based on the H5 pages, which is characterized in that include the following steps：
S1, the data that the propagation of the H5 pages generates are received, and is kept in successively into temporary data table by the generation time of data, it is described
Activity ID and relation information are included at least in data；
S2, successively by the data in temporary data table press it includes movable ID classification preserve in corresponding temporary table, often
Data in a temporary table are ranked up by its time generated；
S3, the relation information included in data is obtained successively by the sequence of data from temporary table；
S4, the validity for judging the relation information obtained, perform S6, if performing S5 in vain if effectively；
S5, the data comprising the relation information are transferred to from the temporary table in data log tables；
S6, the data comprising the relation information are transferred to from the temporary table in corresponding effectively list；
S7, the data in effective list, generation is propagated with the corresponding H5 pages of each activity ID to be schemed.
2. the social graph generation method according to claim 1 based on the H5 pages, which is characterized in that the S2 include with
Under step by step：
First data in S21, acquisition temporary data table are as current data；
S22, the movable ID included in current data is obtained；
S23, the temporary table named with the movable ID included in current data is judged whether, if then directly performing S25,
If otherwise perform S24；
S24, the temporary table of movable ID names for creating one to be included in current data；
S25, the current data is preserved in the temporary table of movable ID names included into current data；
S26, judge whether the current data is the last one data in the temporary data table, if otherwise performing S21.
3. the social graph generation method according to claim 1 based on the H5 pages, which is characterized in that by more in the S3
Platform front end applications obtain data from temporary table simultaneously, the process for obtaining data include it is following step by step：
S31, the request process for receiving the acquisition data that more front end applications are sent；
S32, multiple request process for obtaining data enter in redis cache lists the value for attempting setting locking key, are arranged to
The request process of work(performs S33, is not provided with successful request process and repeats S32；
S33, the data to rank the first in temporary table are obtained；
S34, the value of locking key is deleted to discharge lock.
4. the social graph generation method according to claim 3 based on the H5 pages, which is characterized in that the value of the locking key
The time-out time of lock is set as, the time-out time is effective time of the current time plus lock for the value for setting locking key.
5. the social graph generation method according to claim 1 based on the H5 pages, which is characterized in that on the H5 pages
Relational interface is passed round equipped with forwarding, the forwarding passes round relational interface for recording the relationship generated in H5 page communication processes letter
Breath.
6. the social graph generation method according to claim 5 based on the H5 pages, which is characterized in that the relation information
In include disseminator in H5 page single communication processes and participator and represent to be pushed to pushing away for participator from disseminator
Send the identification information in direction.
7. the social graph generation method according to claim 6 based on the H5 pages, which is characterized in that the S4 include with
Under step by step：
S41, judge that whether including the relationship identical with the relation information of acquisition in effective list in existing data believes
Breath, if the relation information for then judging to obtain is invalid, if otherwise performing S42；
S42, the relation information that judges in existing data whether to include in effective list and obtain push away pass to be directly counter
The relation information of system, if the relation information for then judging to obtain is invalid, if otherwise performing S43；
S43, the relation information for judging whether to include and obtain in existing data in effective list are reversed between being to push away pass
The relation information of system, if the relation information for then judging to obtain is invalid, if otherwise performing S44；
S44, judge whether the participator included in the relation information obtained is empty, if then judging the relationship obtained
Information is invalid, if the relation information for otherwise judging to obtain is effective.
8. the social graph generation method according to claim 1 based on the H5 pages, which is characterized in that the biography in the S7
It is loop-free tree-structures link figure to broadcast figure.
9. a kind of electronic device, including memory and processor, which is characterized in that being stored on the memory can be by the place
The generation system of the social graph based on the H5 pages that device performs is managed, the social graph generation system based on the H5 pages includes：
Data reception module propagates the data generated, and kept in successively to facing by the generation time of data for receiving the H5 pages
When tables of data in, in the data include at least activity ID and relation information；
Classification and ordination module, for successively by the data in temporary data table press it includes movable ID classification preserve to corresponding
In temporary table, the data in each temporary table are ranked up by its time generated；
Interception module, for obtaining the relation information included in data successively by the sequence of data from temporary table；
Effective judgement module, for judging the validity of the relation information obtained；
Data distribution module, for the data for including invalid relation information to be transferred to data log from the temporary table
In table, the data for including effective relation information are transferred to from the temporary table in corresponding effectively list；
Figure generation module is propagated, is propagated for the data generation in effective list and the corresponding H5 pages of each activity ID
Figure.
10. a kind of computer readable storage medium, which is characterized in that the computer readable storage medium memory is contained based on H5
The social graph generation system of the page, the social graph generation system based on the H5 pages can be held by least one processor
Row, so that at least one processor performs the social graph based on the H5 pages as described in any one of claim 1-8
The step of generation method.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810144076.XA CN108268662B (en) | 2018-02-09 | 2018-02-09 | Social graph generation method based on H5 page, electronic device and storage medium |
| PCT/CN2018/083078 WO2019153493A1 (en) | 2018-02-09 | 2018-04-13 | H5 page-based social media map generation method, electronic device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810144076.XA CN108268662B (en) | 2018-02-09 | 2018-02-09 | Social graph generation method based on H5 page, electronic device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108268662A true CN108268662A (en) | 2018-07-10 |
| CN108268662B CN108268662B (en) | 2020-11-10 |
Family
ID=62774040
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810144076.XA Active CN108268662B (en) | 2018-02-09 | 2018-02-09 | Social graph generation method based on H5 page, electronic device and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN108268662B (en) |
| WO (1) | WO2019153493A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111125588A (en) * | 2018-10-30 | 2020-05-08 | 北京国双科技有限公司 | Propagation effect graph drawing and evaluating method and device, storage medium and processor |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103885993A (en) * | 2012-12-24 | 2014-06-25 | 北大方正集团有限公司 | Public opinion monitoring method and device for microblog |
| CN104850549A (en) * | 2014-02-13 | 2015-08-19 | 夷希数码科技(上海)有限公司 | Method for monitoring public opinions on Internet |
| CN105701100A (en) * | 2014-11-26 | 2016-06-22 | 上海高研明鉴信息技术有限公司 | Automatic recording method, device and system of internet information forwarding process |
| CN106533926A (en) * | 2016-12-27 | 2017-03-22 | 武汉斗鱼网络科技有限公司 | Webpage information dissemination method and device |
| US20170286558A1 (en) * | 2016-04-01 | 2017-10-05 | Buzzfeed, Inc. | Tracking Internet Sharing Using Augmented URLs |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101754097B (en) * | 2008-11-27 | 2013-04-17 | 华为技术有限公司 | Advertisement forwarding method, device and system |
| CN106227551B (en) * | 2016-08-05 | 2019-09-20 | 互动派科技股份有限公司 | A kind of marketing program designing system and method based on H5 technology |
-
2018
- 2018-02-09 CN CN201810144076.XA patent/CN108268662B/en active Active
- 2018-04-13 WO PCT/CN2018/083078 patent/WO2019153493A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103885993A (en) * | 2012-12-24 | 2014-06-25 | 北大方正集团有限公司 | Public opinion monitoring method and device for microblog |
| CN104850549A (en) * | 2014-02-13 | 2015-08-19 | 夷希数码科技(上海)有限公司 | Method for monitoring public opinions on Internet |
| CN105701100A (en) * | 2014-11-26 | 2016-06-22 | 上海高研明鉴信息技术有限公司 | Automatic recording method, device and system of internet information forwarding process |
| US20170286558A1 (en) * | 2016-04-01 | 2017-10-05 | Buzzfeed, Inc. | Tracking Internet Sharing Using Augmented URLs |
| CN106533926A (en) * | 2016-12-27 | 2017-03-22 | 武汉斗鱼网络科技有限公司 | Webpage information dissemination method and device |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111125588A (en) * | 2018-10-30 | 2020-05-08 | 北京国双科技有限公司 | Propagation effect graph drawing and evaluating method and device, storage medium and processor |
| CN111125588B (en) * | 2018-10-30 | 2023-04-07 | 北京国双科技有限公司 | Method and device for drawing and evaluating propagation effect graph, storage medium and processor |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2019153493A1 (en) | 2019-08-15 |
| CN108268662B (en) | 2020-11-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101651576B (en) | Alarm information processing method and system | |
| CN108388479A (en) | Postpone information push method, device, computer equipment and storage medium | |
| CN109299157B (en) | Data export method and device for distributed big single table | |
| CN104504147B (en) | A kind of resource coordination method of data-base cluster, apparatus and system | |
| CN102521712A (en) | Process instance data processing method and device | |
| CN110807064A (en) | Data recovery device in RAC distributed database cluster system | |
| CN110288190A (en) | Event notification method, event notification server, storage medium and device | |
| CN103019891A (en) | Method and system for restoring deleted file | |
| CN107483381A (en) | The monitoring method and device of interlock account | |
| CN104618304A (en) | Data processing method and data processing system | |
| CN107423942A (en) | A kind of method and device of work flow | |
| CN112737800A (en) | Service node fault positioning method, call chain generation method and server | |
| CN103235811A (en) | Data storage method and device | |
| CN110400080A (en) | Examination data monitoring method, device, computer equipment and storage medium | |
| CN115237857A (en) | Log processing method and device, computer equipment and storage medium | |
| CN106572137A (en) | Distributed service resource management method and apparatus | |
| US20110264991A1 (en) | Method and System for Management of Electronic Mail Communication | |
| CN103973486B (en) | A kind of Log Administration System based on B/S structures | |
| CN108376110A (en) | A kind of automatic testing method, system and terminal device | |
| CN108268662A (en) | Social graph generation method, electronic device and storage medium based on the H5 pages | |
| CN110209736A (en) | Device, method and the storage medium of block chain data processing | |
| CN107729182A (en) | The method and device of data storage and access | |
| CN108664322A (en) | Data processing method and system | |
| CN109766313A (en) | Geological project data processing method, device and computer equipment | |
| CN109254880A (en) | A kind of method and device handling database delay machine |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |