WO2019153493A1

WO2019153493A1 - H5 page-based social media map generation method, electronic device, and storage medium

Info

Publication number: WO2019153493A1
Application number: PCT/CN2018/083078
Authority: WO
Inventors: 邵立伟
Original assignee: 平安科技（深圳）有限公司
Priority date: 2018-02-09
Filing date: 2018-04-13
Publication date: 2019-08-15
Also published as: CN108268662B; CN108268662A

Abstract

Disclosed is a method based on H5 pages for generating social media maps, comprising the following steps: S1, receiving and provisionally storing to a temporary data table data produced by H5 page propagation; S2, sorting the data on the basis of activity IDs and storing same to corresponding temporary lists; S3, from the temporary lists, sequentially obtaining relationship information contained in the data; S4, determining the validity of the obtained relationship information and, when valid, executing S6, when invalid, executing S5; S5, transferring the data containing the relationship information from the temporary lists to a data log table; S6, transferring the data containing the relationship information from the temporary lists to corresponding valid lists; S7, generating an H5 page propagation map on the basis of the data in the valid lists. The present invention assists publishers of H5 pages in better monitoring and controlling the effects of H5 page propagation, providing by means of direct observation a grasp of the development of any trend.

Description

Social graph generation method, electronic device and storage medium based on H5 page

The present application claims the priority of the Chinese patent application entitled "H5 page-based social graph generation method, electronic device and storage medium", which is filed on February 9, 2018, with the application number 201810144076.X. The entire content is incorporated herein by reference.

Technical field

The present application relates to the field of network technologies, and relates to a social graph generation method, an electronic device, and a storage medium based on an H5 page.

Background technique

With the advent of the mobile Internet era, consumer attention has shifted from traditional PCs to mobile phones. After the development of social media represented by WeChat, the attention of the vast majority of consumers was drawn to social media. "Where is the consumer's attention? Where is the marketing channel?" Therefore, in the era of mobile Internet, corporate marketing activities have a tendency to shift from offline to online, with the help of the Internet and social circles to achieve brand marketing, customer service, and customer acquisition.

Online marketing activities are more common through WeChat communication, mainly relying on push, customer spontaneous forwarding, etc. The content pushed or forwarded is usually the H5 activity page. Now, every day, a lot of H5 pages are circulating in the WeChat circle of friends. We can see a lot of information needed through the H5 event page. However, in the process of H5 crazy communication, there is no some processing of link monitoring, so that the publisher of the H5 activity page cannot know the progress status of the activity in time during the activity propagation.

Summary of the invention

The technical problem to be solved by the present application is to overcome the state in which the publisher in the prior art cannot know the progress status of the activity during the H5 page propagation, and proposes a social graph generation method, an electronic device and a storage medium based on the H5 page. Link monitoring is added during the H5 page propagation process, and the function of automatically generating the corresponding social graph is realized, so that the publisher can timely grasp the progress of the propagation of the H5 page.

The present application solves the above technical problems by the following technical solutions:

A method for generating a social graph based on an H5 page, comprising the following steps:

S1: Receive data generated by the H5 page propagation, and temporarily store the data in the temporary data table according to the data generation time, where the data includes at least an activity ID and relationship information;

S2. The data in the temporary data table is sequentially classified into the corresponding temporary list according to the activity IDs it contains, and the data in each of the temporary lists is sorted according to the time when the generated data is generated;

S3. Acquire, in order from the temporary list, the relationship information included in the data according to the sorting of the data;

S4, determining the validity of the acquired relationship information, if it is valid, executing S6; if not, executing S5;

S5. Transfer data including the relationship information from the temporary list to a data log table.

S6. Transfer data including the relationship information from the temporary list to a corresponding valid list.

S7. Generate an H5 page propagation map corresponding to each activity ID according to the data in the valid list.

An electronic device includes a memory and a processor, and the memory stores an H5 page-based social graph generation system executable by the processor, the H5 page-based social graph generation system comprising:

a data receiving module, configured to receive data generated by the H5 page propagation, and temporarily store the data in the temporary data table according to the data generation time, where the data includes at least an activity ID and relationship information;

a sorting and sorting module, configured to sequentially save the data in the temporary data table into a corresponding temporary list according to the activity IDs it contains, and the data in each of the temporary lists is sorted according to the time of the generation;

An intercepting module, configured to sequentially obtain relationship information included in the data according to the sorting of the data in the temporary list;

a validity determining module, configured to determine validity of the acquired relationship information;

a data distribution module, configured to transfer data including invalid relationship information from the temporary list to a data log table, and transfer data including valid relationship information from the temporary list to a corresponding valid list;

A propagation map generation module is configured to generate an H5 page propagation map corresponding to each activity ID according to the data in the valid list.

A computer readable storage medium having an H5 page-based social graph generation system stored therein, the H5 page-based social graph generation system being executable by at least one processor to implement the following steps :

The positive progress of the present application is that the present application records the data generated in the H5 page propagation, and then filters out the valid data according to the relationship information in the data, and finally generates a loop-free, top-down propagation map based on the valid data. To help publishers of H5 pages better monitor the spread of H5 pages and visualize the progress of the event.

DRAWINGS

1 is a schematic diagram showing the hardware architecture of an embodiment of an electronic device of the present application;

2 is a schematic diagram showing a program module of an embodiment of an H5 page-based social graph generation system in an electronic device of the present application;

FIG. 3 is a flowchart of Embodiment 1 of a social graph generation method based on an H5 page of the present application;

4 is a flowchart of Embodiment 2 of a social graph generation method based on an H5 page of the present application;

FIG. 5 is a flowchart of Embodiment 3 of a method for generating a social graph based on an H5 page according to the present application;

FIG. 6 is a flowchart of Embodiment 4 of a social graph generation method based on an H5 page of the present application.

Detailed ways

The present application is further illustrated by the following examples, but is not intended to limit the scope of the embodiments.

First of all, the present application proposes an electronic device.

1 is a schematic diagram of a hardware architecture of an embodiment of an electronic device of the present application. In the embodiment, the electronic device 2 is an apparatus capable of automatically performing numerical calculation and/or information processing in accordance with an instruction set or stored in advance. For example, it can be a smartphone, a tablet, a laptop, a desktop computer, a rack server, a blade server, a tower server, or a rack server (including a stand-alone server, or a server cluster composed of multiple servers). As shown, the electronic device 2 includes at least, but not limited to, a memory 21, a processor 22, a network interface 23, and an H5 page-based social graph generation system 20 that are communicably coupled to one another via a system bus. among them:

The memory 21 includes at least one type of computer readable storage medium including a flash memory, a hard disk, a multimedia card, a card type memory (eg, SD or DX memory, etc.), a random access memory (RAM), Static Random Access Memory (SRAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), Programmable Read Only Memory (PROM), magnetic memory, magnetic disk, optical disk, and the like. In some embodiments, the memory 21 may be an internal storage unit of the electronic device 2, such as a hard disk or a memory of the electronic device 2. In other embodiments, the memory 21 may also be an external storage device of the electronic device 2, such as a plug-in hard disk equipped on the electronic device 2, a smart memory card (SMC), and a secure digital device. (Secure Digital, SD) card, flash card, etc. Of course, the memory 21 can also include both the internal storage unit of the electronic device 2 and its external storage device. In this embodiment, the memory 21 is generally used to store an operating system installed on the electronic device 2 and various types of application software, such as program code of the H5 page-based social graph generation system 20, and the like. Further, the memory 21 can also be used to temporarily store various types of data that have been output or are to be output.

The processor 22 may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data processing chip in some embodiments. The processor 22 is typically used to control the overall operation of the electronic device 2, such as performing control and processing associated with data interaction or communication with the electronic device 2. In this embodiment, the processor 22 is configured to run program code or process data stored in the memory 21, such as running the H5 page-based social graph generation system 20 and the like.

The network interface 23 may comprise a wireless network interface or a wired network interface, which is typically used to establish a communication connection between the electronic device 2 and other electronic devices. For example, the network interface 23 is configured to connect the electronic device 2 to an external terminal through a network, establish a data transmission channel, a communication connection, and the like between the electronic device 2 and an external terminal. The network may be an intranet, an Internet, a Global System of Mobile communication (GSM), a Wideband Code Division Multiple Access (WCDMA), a 4G network, or a 5G network. Wireless or wired networks such as network, Bluetooth, Wi-Fi, etc.

It is to be noted that Figure 1 shows only the electronic device 2 having the components 21-23, but it should be understood that not all illustrated components may be implemented and that more or fewer components may be implemented instead.

In the present embodiment, the H5 page-based social graph generation system 20 stored in the memory 21 may be divided into one or more program modules, the one or more program modules being stored in the memory 21, and It can be performed by one or more processors (the processor 22 in this embodiment) to complete the application.

For example, FIG. 2 shows a schematic diagram of a program module of the H5 page-based social graph generation system 20, in which the H5 page-based social graph generation system 20 can be divided into data receiving modules 201. The sorting module 202, the intercepting module 203, the validity determining module 204, the data distributing module 205, and the propagation map generating module 206. Wherein, the program module referred to in the present application refers to a series of computer program instruction segments capable of performing a specific function. The following description will specifically describe the specific functions of the program modules 201-206.

The data receiving module 201 is configured to receive data generated by the H5 page propagation, and temporarily store the data in the temporary data table according to the data generation time, where the data includes at least an activity ID and relationship information.

Each time the H5 page is transmitted, data will be generated once. Once the data is generated, it will be sent to the temporary data table. The temporary data table temporarily stores the data according to the received data, that is, before the data received first exists. After the received data is temporarily stored, the temporary data table described here works like a stack, and since the data is sent as soon as it is generated, the data in the temporary data table is actually sorted according to the data generation time. .

The activity ID is a unique identifier of the H5 page, and is also equivalent to the name of the H5 page, and is recorded in the code of the H5 page; each H5 page is generated corresponding to different activities, and correspondingly allocated differently. Activity ID. Each time the H5 page is propagated once (pushed once), the data is generated. This data is automatically recorded by the WeChat, and the activity ID as the name of the H5 page is naturally part of the data.

The relationship information is obtained by forwarding a circulation relationship interface, which is added in the code when the H5 page is created, and the forwarding and routing relationship interface is used to record the communicator and the sharer of each propagation of the H5 page, and The identification information indicating the direction of the push from the communicator to the sharer, which is collectively referred to as relationship information.

The sorting and sorting module 202 is configured to sequentially save the data in the temporary data table into the corresponding temporary list according to the activity IDs it contains, and the data in each of the temporary lists is sorted according to the time of its generation.

Since the data is sorted in the order of the data in the temporary data table, the data is saved to the corresponding temporary list, and the data is automatically arranged from the time of the arrival.

The intercepting module 203 is configured to sequentially acquire relationship information included in the data according to the sorting of data from the temporary list.

The validity determining module 204 is configured to determine validity of the acquired relationship information.

The data distribution module 205 is configured to transfer data including invalid relationship information from the temporary list to a data log table, and transfer data including valid relationship information from the temporary list to a corresponding valid list. in.

The invalid relationship information specifically refers to the following aspects:

1) There is relationship information that is mutually direct reverse relationship, and the relationship information generated in the subsequent data is invalid. For example, the generated data records a relationship information generated by the A5 push-to-B from the A5 page (ie, the relationship information of the A push B); the generated data records the H5 page that is pushed by B to the A. A relationship information (that is, B pushes the relationship information of A); here, the two relationship information forms a direct reverse relationship; since the relationship information of A push B is in front, the relationship information is judged to be valid, and then generated. The relationship information of B push A is judged to be invalid.

2) The relationship information of the indirect reverse relationship occurs, and the relationship information in the last generated data is invalid. For example, three pieces of data appear in the order in which the data is generated; the first piece of data records a relationship information generated by the A page being pushed by A to B (ie, the relationship information of A push B); the second data record A relationship information generated by B to be sent to C by C (ie, B push C relationship information); the third data records a relationship information generated by C5 to be sent to A by C (ie, C push A relationship information) These three data form a loop (there are more than three, but at least three, of the data forming the loop here), which is said to form an indirect reverse relationship between the relationship information in the first and third pieces of data ( That is, the relationship information in the first two data in the loop forms an indirect reverse relationship; in this case, the relationship information of A push B in the first data is judged to be valid, and the relationship between C and A in the third data The information is judged to be invalid.

3) Duplicate relationship information appears, and the resulting relationship information is invalid. That is, at least two data records have generated the relationship information generated by the H5 page being pushed by A to B, and only the time is different. In this case, the relationship information of the A push B in the first data is determined to be valid, and the subsequent data is determined. The relationship information of the A push B in the middle is judged to be invalid.

4) There is a relationship information that the sharer is empty, and the relationship information is judged to be invalid. The information of the sharer is not recorded in the relationship information, and is usually caused by a system error. Once the relationship information appears, it is judged to be invalid.

The above four kinds of relationship information that are judged to be invalid are only examples, and there are other invalid cases; and the judgment of various invalid cases has no specific order, and can be judged at the same time, or sequentially arranged, but regardless of In which form is used for the judgment, the results are the same. As long as one type of invalidity occurs, the relationship information is judged to be invalid as long as it meets any of several invalid conditions.

The propagation map generation module 206 is configured to generate an H5 page propagation map corresponding to each activity ID according to data in the valid list.

Each valid list corresponds to an activity ID, so the data in each valid list can generate a propagation map corresponding to an activity ID.

The propagation map can be rendered using a tree link map, but other forms of presentation are not excluded. By propagating the map, the publisher of the H5 page can visually see the progress of the activity. The communication map contains all the communicators and sharers involved in the H5 page propagation, and also presents the H5 page among the communicators and the sharers. The direction of communication between.

The temporary data table, the temporary list, and the valid list in the embodiment are all present in the database, that is, part of the database, and each area is used to store data of different stages by partitioning the database.

Secondly, the present application proposes a social graph generation method based on an H5 page.

In the first embodiment, as shown in FIG. 3, the H5 page-based social graph generation method includes the following steps:

S1: Receive data generated by H5 page propagation, and temporarily store the data in the temporary data table according to the data generation time, where the data includes at least an activity ID and relationship information.

The relationship information is obtained by forwarding a forwarding relationship interface, which is set in the code when the H5 page is created, and the forwarding and routing relationship interface is used to record the communicator and the sharer of each propagation of the H5 page, and The identification information indicating the direction of the push from the communicator to the sharer, which is collectively referred to as relationship information.

S2. The data in the temporary data table is sequentially sorted into the corresponding temporary list according to the activity IDs it contains, and the data in each of the temporary lists is sorted according to the time of its generation.

Here, the data is saved to the corresponding temporary list, specifically, the data is saved to a temporary list named by the activity ID included in the data, that is, each activity ID corresponds to a temporary list.

S3. Acquire, according to the sorting of data in the temporary list, the relationship information included in the data.

First, according to the sorting of the data in the temporary list, the data is taken in order from the going to the back, and after acquiring the data, the relationship information contained in the data is further intercepted.

S4. Determine the validity of the acquired relationship information. If it is valid, execute S6. If it is invalid, execute S5.

The relationship information is invalid, and has been specifically clarified in the embodiment of the previous electronic device, and details are not described herein again.

S5. Transfer data including the relationship information from the temporary list to the data log table.

The data log table (ie, the data log table) is a record of some processing done by the system or some software for future reference, where the log table is used to record invalid data, although the data is invalidated, but the data is invalid. In order to ensure that some data can be traced, corrected or restored in the future, these invalid data also need to be archived, so the invalid data is transferred to the data log table here.

Corresponding to each activity ID, there is a valid list named after the activity ID. Transferring the data to the corresponding valid list here means transferring the data to a valid list named with the activity ID contained in the data.

Here, the propagation map is mainly generated according to the relationship information in the data, and the propagation map can be represented by a tree link diagram, but other forms of presentation are not excluded.

The propagator map shows the communicators and sharers involved in each H5 page's communication. The communicators and sharers described here are relative to each communication. The communicator in this time is the last share. The two roles are constantly changing; specifically, when the H5 page is pushed from A to B, in this communication, A is the communicator and B is the sharer; after that, the H5 page is pushed by B again. Given C, in this communication, B is the communicator, C is the sharer; here B is a sharer with respect to A, and a communicator relative to C.

The H5 page is constantly being propagated from top to bottom. A is pushed to B, B is pushed to C, and B is played twice, but B is only displayed once on the propagation map, and A to B is used between A and B. The arrows are connected, and the arrow connecting B to C is used between B and C. If C continues to push the H5 page to other people, the arrow continues to be connected downward. Since the invalid data is removed, a form is formed. A cyclic, top-down tree link propagation map.

The publisher of the H5 page can visually see the progress of the activity through the propagation map, and better monitor the propagation effect of the H5 page.

In the second embodiment, based on the first embodiment, as shown in FIG. 4, the step S2 specifically includes the following sub-steps:

S21. Obtain the first data in the temporary data table as current data.

S22. Obtain an activity ID included in current data.

S23, determining whether there is a temporary list named by the activity ID included in the current data, if yes, directly executing S25, if otherwise executing S24;

S24. Create a temporary list named with an activity ID included in the current data;

S25. Save the current data to a temporary list named by an activity ID included in the current data.

S26. Determine whether the current data is the last data in the temporary data table, if otherwise, execute S21.

In this embodiment, specific operational steps for storing data according to the activity ID classification are given. It should be specially pointed out that the temporary list corresponding to each activity ID is not pre-built in the database, but is created according to the activity ID involved in the received data, if no data related to an activity ID is received. , the corresponding temporary list will not be created; in addition, the temporary list corresponding to each activity ID is only created once, and will only be executed when a temporary list named after the activity ID contained in the data is detected when a data is acquired. The creation of a temporary list.

In the third embodiment, based on the first embodiment, when determining the validity of the relationship information, multiple front-end applications can be simultaneously executed to improve the overall running speed. At this time, in order to prevent data from being dirty and misread, the function of the lock is added, that is, although there are multiple front-end applications requesting data acquisition, only one front-end application is allowed to acquire data at the same time. As shown in FIG. 5, the process of acquiring data includes the following sub-steps:

S31. Receive a request process for acquiring data sent by multiple front-end applications.

S32. The request process for acquiring the data enters the redis cache list and attempts to set a value of the lock key. The successful request process is executed in S33, and the unsuccessful request process is repeatedly executed in S32.

The value of the lock key here is specifically the timeout period of the lock, and the timeout time is the current time of setting the value of the lock key plus the effective time of the lock.

S33. Obtain the data ranked first in the temporary list.

S34. Delete the value of the lock key to release the lock.

In this embodiment, the request process for acquiring data sent by the front-end application does not directly enter the temporary list to obtain data, but first enters the redis cache list to set the value of the lock key. Due to the characteristics of the redis cache list, at the same time Only one request process is set successfully, and other request processes continue to try to set the value of the lock key.

In short, when the value of the lock key already exists, it is impossible for any request process to set the value of the lock key. Only when the lock key is released or expired can the value of the lock key be successfully set by another request process. While the value of the lock key already exists, each request process will repeatedly try to set the value of the lock key, but will not succeed.

The lock key is released after the acquisition of a request completion data is deleted; the lock key failure means that the lock time exceeds the value of the set lock key, and the value of the lock key can be requested by the latter The process is deleted, which in turn allows the latter request to retrieve data from the temporary list.

In the fourth embodiment, based on the first embodiment, as shown in FIG. 6, the validity of the acquired relationship information by the S4 specifically includes the following sub-steps:

S41, determining whether the existing data in the valid list contains the same relationship information as the acquired relationship information, and if so, determining that the acquired relationship information is invalid, if otherwise, executing S42;

S42, determining whether the data in the valid list contains the relationship information that is directly reversed relationship with the obtained relationship information, and if so, determining that the acquired relationship information is invalid, if otherwise, executing S43;

S43, determining whether the existing data in the valid list contains the relationship information of the obtained relationship information as an indirect reverse relationship, and if so, determining that the acquired relationship information is invalid, if otherwise, executing S44;

S44. Determine whether the sharer included in the obtained relationship information is empty. If yes, determine that the acquired relationship information is invalid, and if not, determine that the acquired relationship information is valid.

This embodiment is only a judging step designed according to the four invalid cases listed above, and the judging step can be appropriately modified according to the increase or decrease of the invalid situation, and those skilled in the art should know that various similar modifications are in this embodiment. Within the scope of protection of the application.

The judging step involved in the embodiment is to determine the validity of the relationship information in sequence, and those skilled in the art should know that the judging conditions in each step can be randomly arranged, and various pre-arrangements of the judging conditions are in the protection scope of the present application. within.

The determining conditions involved in the determining steps in this embodiment may also be determined at the same time. Specifically, it is determined whether the existing data in the valid list includes the same relationship information as the acquired relationship, and is a direct reverse relationship or an indirect relationship. The relation information of the relationship is reversed, or whether the sharer included in the acquired relationship information is empty, and if any one of the judgment conditions is satisfied (that is, as long as one is YES), the obtained relationship information is judged to be invalid. Those skilled in the art will appreciate that such a manner of judgment is also within the scope of the present application.

Moreover, the present application is a computer readable storage medium having stored therein an H5 page-based social graph generation system 20 that can be executed by one or more processors The operation of the above-described H5 page-based social graph generation method or electronic device is implemented.

While the invention has been described with respect to the specific embodiments of the present invention, it is understood that the scope of the invention is defined by the appended claims. A person skilled in the art can make various changes or modifications to these embodiments without departing from the spirit and scope of the present application, and such changes and modifications fall within the scope of the present application.

Claims

A method for generating a social graph based on an H5 page, comprising the following steps:

S1: Receive data generated by the H5 page propagation, and temporarily store the data in the temporary data table according to the data generation time, where the data includes at least an activity ID and relationship information;

S2. The data in the temporary data table is sequentially classified into the corresponding temporary list according to the activity IDs it contains, and the data in each of the temporary lists is sorted according to the time when the generated data is generated;

S3. Acquire, in order from the temporary list, the relationship information included in the data according to the sorting of the data;

S4, determining the validity of the acquired relationship information, if it is valid, executing S6; if not, executing S5;

S5. Transfer data including the relationship information from the temporary list to a data log table.

S6. Transfer data including the relationship information from the temporary list to a corresponding valid list.

S7. Generate an H5 page propagation map corresponding to each activity ID according to the data in the valid list.
The H5 page-based social graph generation method according to claim 1, wherein the S2 comprises the following sub-steps:

S21. Obtain the first data in the temporary data table as current data.

S22. Obtain an activity ID included in current data.

S23, determining whether there is a temporary list named by the activity ID included in the current data, if yes, directly executing S25, if otherwise executing S24;

S24. Create a temporary list named with an activity ID included in the current data;

S25. Save the current data to a temporary list named by an activity ID included in the current data.

S26. Determine whether the current data is the last data in the temporary data table, if otherwise, execute S21.