CN112347147A

CN112347147A - Information pushing method and device based on user association relationship and electronic equipment

Info

Publication number: CN112347147A
Application number: CN202011169123.XA
Authority: CN
Inventors: 张春山; 王伟
Original assignee: Beijing Qibao Xinan Technology Co ltd
Current assignee: Beijing Qibao Xinan Technology Co ltd
Priority date: 2020-10-28
Filing date: 2020-10-28
Publication date: 2021-02-09

Abstract

The disclosure relates to an information pushing method and device based on user association relationship, electronic equipment and a computer readable medium. The method comprises the following steps: acquiring a user identifier of a target user; determining an incidence relation hierarchy and an incidence relation category; retrieving in a graphic database based on the user identifier of the target user, the incidence relation hierarchy and the incidence relation category to obtain a plurality of incidence users and the incidence relation categories corresponding to the incidence users; respectively generating promotion information for the plurality of associated users based on the association relationship categories; and sending the promotion information to the corresponding associated user. The information pushing method and device based on the user incidence relation, the electronic equipment and the computer readable medium can quickly and effectively extract the incidence relation among users, generate personalized promotion information based on the incidence relation for promotion, and improve the user satisfaction.

Description

Information pushing method and device based on user association relationship and electronic equipment

Technical Field

The present disclosure relates to the field of computer information processing, and in particular, to an information pushing method and apparatus based on a user association relationship, an electronic device, and a computer readable medium.

Background

When the users carry out advertisement information promotion or finance information and mutual aid information related to the users, the auxiliary users determine that the associated users related to the users are an effective measure, and the mode can help the users to improve the information promotion efficiency and increase the interaction frequency among the users.

The storage and complex query calculation of the association relationship between users are realized by utilizing a relational database (such as mysql) + a cache (such as redis), so that the hierarchy of the relationship chain is greatly limited, and the calculation and the update writing operation of the multi-hierarchy relationship can hardly be completed in real time. However, as the business is expanded and the user quantity is increased, the database pressure is increased, the interface speed is reduced, the algorithm is complex, and the expansion and the maintenance are difficult. The query efficiency is obviously reduced when the storage magnitude reaches five million by being limited by the storage magnitude of mysql, the scheme is not supposed to support the type of service for a long time, and even if the database is divided into tables or other high-performance relational databases are replaced, the pressure is only relieved, and the service cannot be stably provided for a long time.

Therefore, a new information pushing method, device, electronic device and computer readable medium based on the user association relationship are needed.

The above information disclosed in this background section is only for enhancement of understanding of the background of the disclosure and therefore it may contain information that does not constitute prior art that is already known to a person of ordinary skill in the art.

Disclosure of Invention

In view of this, the present disclosure provides an information pushing method and apparatus based on user association, an electronic device, and a computer readable medium, which can quickly and effectively extract the association between users, generate personalized promotion information based on the association for promotion, and improve user satisfaction.

Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.

According to an aspect of the present disclosure, an information pushing method based on a user association relationship is provided, where the method includes: acquiring a user identifier of a target user; determining an incidence relation hierarchy and an incidence relation category; retrieving in a graphic database based on the user identifier of the target user, the incidence relation hierarchy and the incidence relation category to obtain a plurality of incidence users and the incidence relation categories corresponding to the incidence users; respectively generating promotion information for the plurality of associated users based on the association relationship categories; and sending the promotion information to the corresponding associated user.

Optionally, the method further comprises: generating the graphic database through the user association relation in the relational database; and/or updating the graphic database in real time through a user access request.

Optionally, generating the graph database through a user association relationship in a relational database includes: acquiring a plurality of first users in the relational database; sequentially extracting the user identification of the first user in the relational database; extracting a user association relation related to the first user in the relational database; and taking the first user as a node, and taking the user association relationship as an edge to generate the graph database.

Optionally, taking the first user as a point, and taking the user association relationship as an edge to generate the graph database, including: extracting a user identification of the first user; determining whether the same user exists in the graphic database based on the user identification; when the same user exists in the graph database, adding the incidence relation of the user as an edge into an existing node; and when the same user does not exist in the graph database, establishing nodes and edges according to the user association relation corresponding to the first user.

Optionally, updating the graphic database in real time through a user access request includes: acquiring a user access request, wherein the user access request comprises an inviting user and an invited user; extracting a project name from a page corresponding to the user access request; determining an association category based on the item name; and updating the graphic database according to the inviting user, the invited user and the corresponding association relationship types.

Optionally, updating the image database according to the inviting user, the invited user, and the corresponding association relationship category thereof, includes: acquiring an incidence relation hierarchy; and updating the graphic database according to the inviting user, the invited user, the corresponding incidence relation categories and the incidence relation hierarchies.

Optionally, retrieving in a graph database based on the user identifier of the target user, the association relationship hierarchy, and the association relationship category, and acquiring a plurality of association users and association relationship categories corresponding thereto, include: determining a target node in a graph database based on the user identification; extracting all nodes having edge connection relation with the user identification according to the incidence relation hierarchy; removing nodes which do not meet the association relationship category; acquiring user identifications of the rest nodes; extracting the plurality of associated users based on the user identification.

Optionally, extracting the plurality of associated users based on the user identifier includes: acquiring category weight corresponding to a preset incidence relation category and hierarchy weight corresponding to the incidence relation hierarchy; determining association scores for the plurality of associated users based on the category weights, the hierarchy weights; sequentially ranking the plurality of associated users based on the association scores.

Optionally, respectively generating promotion information for the multiple associated users based on the association relationship categories includes: acquiring promotion data to be promoted and user characteristics of the plurality of associated users; generating information parameters according to the incidence relation categories and the relation characteristics; and filling parameters in the promotion data to be promoted according to the information parameters to generate the promotion information.

Optionally, sending the promotion information to the corresponding associated user includes: the plurality of associated users are sequentially displayed at the user side of the target user; and extracting at least part of the associated users according to the operation instructions of the users to send the promotion information.

According to an aspect of the present disclosure, an information pushing apparatus based on a user association relationship is provided, the apparatus including: the identification module is used for acquiring the user identification of the target user; the parameter module is used for determining the association relationship hierarchy and the association relationship category; the retrieval module is used for retrieving in a graphic database based on the user identification of the target user, the incidence relation hierarchy and the incidence relation category to obtain a plurality of incidence users and the corresponding incidence relation categories; the information module is used for respectively generating promotion information for the plurality of associated users based on the association relation categories; and the sending module is used for sending the promotion information to the corresponding associated user.

Optionally, the method further comprises: the import module is used for generating the graphic database through the user incidence relation in the relational database; and/or the updating module is used for updating the graphic database in real time through a user access request.

Optionally, the importing module includes: a user unit for obtaining a plurality of first users in the relational database; the extracting unit is used for sequentially extracting the user identification of the first user in the relational database; extracting a user association relation related to the first user in the relational database; and the importing unit is used for taking the first user as a node and taking the user association relationship as an edge to generate the graph database.

Optionally, the importing unit is further configured to extract a user identifier of the first user; determining whether the same user exists in the graphic database based on the user identification; when the same user exists in the graph database, adding the incidence relation of the user as an edge into an existing node; and when the same user does not exist in the graph database, establishing nodes and edges according to the user association relation corresponding to the first user.

Optionally, the update module includes: the request unit is used for acquiring a user access request, wherein the user access request comprises an inviting user and an invited user; the project unit is used for extracting a project name from a page corresponding to the user access request; the category unit is used for determining an association relationship category based on the item name; and the updating unit is used for updating the graphic database according to the inviting user, the invited user and the corresponding association relationship types.

Optionally, the updating unit is further configured to obtain an association relationship hierarchy; and updating the graphic database according to the inviting user, the invited user, the corresponding incidence relation categories and the incidence relation hierarchies.

Optionally, the retrieving module includes: the node unit is used for determining a target node in a graph database based on the user identification; the acquisition unit is used for extracting all nodes with edge connection relation with the user identification according to the incidence relation hierarchy; the eliminating unit is used for eliminating the nodes which do not meet the association relationship category; the association unit is used for acquiring the user identifiers of the rest nodes; extracting the plurality of associated users based on the user identification.

Optionally, the association unit is further configured to obtain a category weight corresponding to a preset association relationship category and a hierarchy weight corresponding to the association relationship hierarchy; determining association scores for the plurality of associated users based on the category weights, the hierarchy weights; sequentially ranking the plurality of associated users based on the association scores.

Optionally, the information module includes: the characteristic unit is used for acquiring promotion data to be promoted and user characteristics of the plurality of associated users; the parameter unit is used for generating information parameters according to the association relationship category and the relationship characteristics; and the information unit is used for filling parameters in the promotion data to be promoted according to the information parameters to generate the promotion information.

Optionally, the sending module includes: the display unit is used for sequentially displaying the plurality of associated users on the user side of the target user; and the sending unit is used for extracting at least part of the associated users according to the operation instructions of the users so as to send the promotion information.

According to an aspect of the present disclosure, an electronic device is provided, the electronic device including: one or more processors; storage means for storing one or more programs; when executed by one or more processors, cause the one or more processors to implement a method as above.

According to an aspect of the disclosure, a computer-readable medium is proposed, on which a computer program is stored, which program, when being executed by a processor, carries out the method as above.

According to the information pushing method and device based on the user association relationship, the electronic equipment and the computer readable medium, the user identification of the target user is obtained; determining an incidence relation hierarchy and an incidence relation category; retrieving in a graphic database based on the user identifier of the target user, the incidence relation hierarchy and the incidence relation category to obtain a plurality of incidence users and the incidence relation categories corresponding to the incidence users; respectively generating promotion information for the plurality of associated users based on the association relationship categories; the method of sending the promotion information to the corresponding associated users can quickly and effectively extract the association relationship between the users, and generates personalized promotion information for promotion based on the association relationship, thereby improving the satisfaction degree of the users.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

The above and other objects, features and advantages of the present disclosure will become more apparent by describing in detail exemplary embodiments thereof with reference to the attached drawings. The drawings described below are merely some embodiments of the present disclosure, and other drawings may be derived from those drawings by those of ordinary skill in the art without inventive effort.

Fig. 1 is a system block diagram illustrating an information push method and apparatus based on user association according to an exemplary embodiment.

Fig. 2 is a flowchart illustrating an information push method based on a user association relationship according to an exemplary embodiment.

Fig. 3 is a flowchart illustrating an information push method based on a user association relationship according to another exemplary embodiment.

Fig. 4 is a flowchart illustrating an information push method based on a user association relationship according to another exemplary embodiment.

Fig. 5 is a block diagram illustrating an information pushing apparatus based on user association according to an exemplary embodiment.

Fig. 6 is a block diagram illustrating an information push apparatus based on a user association relationship according to another exemplary embodiment.

FIG. 7 is a block diagram illustrating an electronic device in accordance with an example embodiment.

FIG. 8 is a block diagram illustrating a computer-readable medium in accordance with an example embodiment.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The same reference numerals denote the same or similar parts in the drawings, and thus, a repetitive description thereof will be omitted.

Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known methods, devices, implementations, or operations have not been shown or described in detail to avoid obscuring aspects of the disclosure.

The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.

The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the contents and operations/steps, nor do they necessarily have to be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.

It will be understood that, although the terms first, second, third, etc. may be used herein to describe various components, these components should not be limited by these terms. These terms are used to distinguish one element from another. Thus, a first component discussed below may be termed a second component without departing from the teachings of the disclosed concept. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.

It is to be understood by those skilled in the art that the drawings are merely schematic representations of exemplary embodiments, and that the blocks or processes shown in the drawings are not necessarily required to practice the present disclosure and are, therefore, not intended to limit the scope of the present disclosure.

As shown in fig. 1, the system architecture 10 may include

terminal devices

101, 102, 103, a network 104, and a server 105. The network 104 serves as a medium for providing communication links between the

terminal devices

101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

The user may use the

terminal devices

101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The

terminal devices

101, 102, 103 may have various communication client applications installed thereon, such as a financial services application, a shopping application, a web browser application, an instant messaging tool, a mailbox client, social platform software, and the like.

The

terminal devices

101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 105 may be a server that provides various services, such as a background management server that supports financial services websites browsed by the user using the

terminal apparatuses

101, 102, and 103. The background management server may analyze the received user data, and feed back the processing result to the administrator of the financial service website and/or the

terminal device

101, 102, 103.

The server 105 may, for example, obtain a user identification of the target user; server 105 may, for example, determine an association hierarchy and an association category; the server 105 may retrieve, for example, in a graph database, based on the user identifier of the target user, the association relationship hierarchy, and the association relationship category, and obtain a plurality of association users and their corresponding association relationship categories; the server 105 may generate promotion information for the plurality of associated users, respectively, based on the association relationship categories, for example; the server 105 may, for example, send the promotional information to its corresponding associated user.

The server 105 may also generate the graphical database, for example, by user association in a relational database.

The server 105 may also update the graphic database in real time, for example, by a user access request.

The server 105 may be a server of one entity, and may be composed of a plurality of servers, for example, a part of the server 105 may be, for example, a graphic database system in the present disclosure, and a part of the server 105 may be, for example, a data query system in the present disclosure. It should be noted that the information pushing method based on the user association provided by the embodiment of the present disclosure may be executed by the server 105, and accordingly, an information pushing apparatus based on the user association may be disposed in the server 105. And the web page end provided for the user to browse the financial service platform is generally positioned in the

terminal equipment

101, 102 and 103.

Fig. 2 is a flowchart illustrating an information push method based on a user association relationship according to an exemplary embodiment. The information push method 20 based on the user association relationship at least includes steps S202 to S210.

As shown in fig. 2, in S202, the user identification of the target user is acquired. In an application scenario, in the application platform provided by the present embodiment, when the user a wants to forward a certain type of information, the user a can send an application by clicking a "send" or "forward" button, and the background obtains the user identifier of the user a after receiving the application, where the user identifier may be a registration name, a mobile phone number, an identification number, and the like of the user a.

In another application scenario, in the background of the application platform provided in this manner, when the administrator has a need to extract the associated user, the administrator may select one user from the user list as a target user, and the background server extracts the user identifier of the user.

In S204, an association relationship hierarchy and an association relationship category are determined. The user or the administrator can specify the range of the associated users, in the graphic database, the user nodes can have different levels of connection relations, a plurality of first users directly associated with the user A can be first-level association relations of the user A, and a plurality of second users directly associated with the first users can be second-level association relations of the user A. By analogy, in a graphical database, there may be associated users that have multiple levels of association with user A. In this step it may be specified which level or levels of users to acquire. It may be specified, for example, to obtain a user having an intra-2-tier association with user a.

In the graphic database, the association relationship between the users also has a category, and the category of the association relationship represents the category of the relationship between the users, and more specifically, the association relationship between the user a and the user B is "friend", the association relationship between the user a and the user C is "fund", the association relationship between the user a and the user D is "invite", and the like. In this step, it may also be specified to obtain the user having an "invite" relationship with user a.

In S206, a search is performed in a graphic database based on the user identifier of the target user, the association relationship hierarchy, and the association relationship category, and a plurality of association users and their corresponding association relationship categories are obtained. Graph Database (GDB) is a real-time, reliable, online Database service that supports the Property Graph model for handling highly connected data queries and storage. Traditional relational databases are very inefficient for queries beyond 3 degrees, but the graph databases can easily cope with the various complex storage and query scenarios of social networks. The graphic database is one of non-relational databases, is particularly suitable for relational chain services, can calculate a user's relational chain more timely and efficiently by writing and updating project information, user information, invitation relations and contribution relations in a quasi-real-time asynchronous manner through an interface, has a small influence on query speed due to data volume increase in a database storage mode, and can use a GDB storage relational chain without limit only by expanding corresponding hardware.

In one embodiment, may include: determining a target node in a graph database based on the user identification; extracting all nodes having edge connection relation with the user identification according to the incidence relation hierarchy; removing nodes which do not meet the association relationship category; acquiring user identifications of the rest nodes; extracting the plurality of associated users based on the user identification.

Wherein extracting the plurality of associated users based on the user identification comprises: acquiring category weight corresponding to a preset incidence relation category and hierarchy weight corresponding to the incidence relation hierarchy; determining association scores for the plurality of associated users based on the category weights, the hierarchy weights; sequentially ranking the plurality of associated users based on the association scores.

In S208, promotion information is generated for each of the plurality of associated users based on the association relationship category. The method comprises the following steps: acquiring promotion data to be promoted and user characteristics of the plurality of associated users; generating information parameters according to the incidence relation categories and the relation characteristics; and filling parameters in the promotion data to be promoted according to the information parameters to generate the promotion information.

For example, the data to be promoted by the user a may be an advertisement of a certain perfume product, and according to the user characteristics, the user B associated with the user a is a woman, the user C is a man, and the user D is a business person. A certain product of the perfume product that is suitable for women can be promoted for user B, a product for men can be promoted for user C, and further, a commercial gift package of the perfume product can be promoted for user D, etc., according to the user characteristics.

In S210, the promotion information is sent to the corresponding associated user. The method comprises the following steps: the plurality of associated users are sequentially displayed at the user side of the target user; and extracting at least part of the associated users according to the operation instructions of the users to send the promotion information.

According to the information pushing method based on the user association relationship, the user identification of the target user is obtained; determining an incidence relation hierarchy and an incidence relation category; retrieving in a graphic database based on the user identifier of the target user, the incidence relation hierarchy and the incidence relation category to obtain a plurality of incidence users and the incidence relation categories corresponding to the incidence users; respectively generating promotion information for the plurality of associated users based on the association relationship categories; the method of sending the promotion information to the corresponding associated users can quickly and effectively extract the association relationship between the users, and generates personalized promotion information for promotion based on the association relationship, thereby improving the satisfaction degree of the users.

It should be clearly understood that this disclosure describes how to make and use particular examples, but the principles of this disclosure are not limited to any details of these examples. Rather, these principles can be applied to many other embodiments based on the teachings of the present disclosure.

Fig. 3 is a flowchart illustrating an information push method based on a user association relationship according to another exemplary embodiment. The flow 30 shown in fig. 3 is a detailed description of "generating the graph database by using the user association relationship in the relational database".

As shown in fig. 3, in S302, a plurality of first users in the relational database are acquired.

In S304, the user identifiers of the first users in the relational database are sequentially extracted. In the relational database, the users are stored in the data table, and the user identifications can be read from the user table in sequence for sequential import.

In S306, the user association relation related to the first user in the relation database is extracted.

In S308, the first user is used as a node, and the graph database is generated by using the user association relationship as an edge. The method specifically comprises the following steps: extracting a user identification of the first user; determining whether the same user exists in the graphic database based on the user identification; when the same user exists in the graph database, adding the incidence relation of the user as an edge into an existing node; and when the same user does not exist in the graph database, establishing nodes and edges according to the user association relation corresponding to the first user.

In the process of importing the relational database into the graphic database, before each time of importing, whether the user exists in the graphic database needs to be judged, if yes, the associated user is directly added, and if not, the user can be newly built.

Fig. 4 is a flowchart illustrating an information push method based on a user association relationship according to another exemplary embodiment. The flow 40 shown in fig. 4 is a detailed description of "updating the graphic database in real time by a user access request".

As shown in fig. 4, in S402, a user access request is obtained, where the user access request includes an inviting user and an invited user. After the graphical database is built, new user data may be gradually added as the user uses it. User B may be added to the graphical database as an associated user of user a, for example, when user a invites user B to perform some operation.

In S404, the item name is extracted from the page corresponding to the user access request. The page of the access request submitted by user a may be, for example, a "finance" page.

In S406, an association category is determined based on the item name. An association between user a and user B may be determined to be a "cash" relationship based on the cash page.

In S408, the graphic database is updated according to the inviting user, the invited user, and the corresponding association relationship categories. The method comprises the following steps: acquiring an incidence relation hierarchy; and updating the graphic database according to the inviting user, the invited user, the corresponding incidence relation categories and the incidence relation hierarchies. Furthermore, a point-edge writing and reading interface of a relation chain can be developed in the graphic database, and the point-edge writing and reading interface can be written into the graphic database in a quasi-real-time manner by using an asynchronous task;

according to the scheme disclosed by the invention, the query function of the associated user can be realized by utilizing the graphic database, the relationship between the query speed of the graphic database and the data size is not large, the expansion can be realized only by modifying the query statement, the expansibility is strong, and the maintenance is convenient.

Those skilled in the art will appreciate that all or part of the steps implementing the above embodiments are implemented as computer programs executed by a CPU. When executed by the CPU, performs the functions defined by the above-described methods provided by the present disclosure. The program may be stored in a computer readable storage medium, which may be a read-only memory, a magnetic or optical disk, or the like.

Furthermore, it should be noted that the above-mentioned figures are only schematic illustrations of the processes involved in the methods according to exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.

The following are embodiments of the disclosed apparatus that may be used to perform embodiments of the disclosed methods. For details not disclosed in the embodiments of the apparatus of the present disclosure, refer to the embodiments of the method of the present disclosure.

Fig. 5 is a block diagram illustrating an information pushing apparatus based on user association according to an exemplary embodiment. As shown in fig. 5, the information pushing apparatus 50 based on the user association relationship includes: an identification module 502, a parameter module 504, a retrieval module 506, an information module 508, and a sending module 510.

The identification module 502 is configured to obtain a user identification of a target user;

the parameter module 504 is configured to determine an association hierarchy and an association category;

the retrieval module 506 is configured to retrieve, in a graph database, the user identifier of the target user, the association relationship hierarchy, and the association relationship category, and obtain a plurality of association users and association relationship categories corresponding to the association users; the retrieving module 506 includes: the node unit is used for determining a target node in a graph database based on the user identification; the acquisition unit is used for extracting all nodes with edge connection relation with the user identification according to the incidence relation hierarchy; the eliminating unit is used for eliminating the nodes which do not meet the association relationship category; the association unit is used for acquiring the user identifiers of the rest nodes; extracting the plurality of associated users based on the user identification.

The information module 508 is configured to generate promotion information for the multiple associated users based on the association relationship categories, respectively; the information module 508 includes: the characteristic unit is used for acquiring promotion data to be promoted and user characteristics of the plurality of associated users; the parameter unit is used for generating information parameters according to the association relationship category and the relationship characteristics; and the information unit is used for filling parameters in the promotion data to be promoted according to the information parameters to generate the promotion information.

The sending module 510 is configured to send the promotion information to the corresponding associated user. The sending module 510 includes: the display unit is used for sequentially displaying the plurality of associated users on the user side of the target user; and the sending unit is used for extracting at least part of the associated users according to the operation instructions of the users so as to send the promotion information.

Fig. 6 is a block diagram illustrating an information push apparatus based on a user association relationship according to another exemplary embodiment. As shown in fig. 6, the information pushing apparatus 60 based on the user association relationship includes: an import module 602 and an update module 604.

The import module 602 is configured to generate the graph database according to the user association relationship in the relationship database; the import module 602 includes: a user unit for obtaining a plurality of first users in the relational database; the extracting unit is used for sequentially extracting the user identification of the first user in the relational database; extracting a user association relation related to the first user in the relational database; and the importing unit is used for taking the first user as a node and taking the user association relationship as an edge to generate the graph database. The import unit is further configured to extract a user identifier of the first user; determining whether the same user exists in the graphic database based on the user identification; when the same user exists in the graph database, adding the incidence relation of the user as an edge into an existing node; and when the same user does not exist in the graph database, establishing nodes and edges according to the user association relation corresponding to the first user.

The update module 604 is used to update the graphic database in real time through a user access request. The update module 604 includes: the request unit is used for acquiring a user access request, wherein the user access request comprises an inviting user and an invited user; the project unit is used for extracting a project name from a page corresponding to the user access request; the category unit is used for determining an association relationship category based on the item name; and the updating unit is used for updating the graphic database according to the inviting user, the invited user and the corresponding association relationship types. The updating unit is further used for acquiring an association relation hierarchy; and updating the graphic database according to the inviting user, the invited user, the corresponding incidence relation categories and the incidence relation hierarchies.

According to the information pushing device based on the user association relationship, the user identification of the target user is obtained; determining an incidence relation hierarchy and an incidence relation category; retrieving in a graphic database based on the user identifier of the target user, the incidence relation hierarchy and the incidence relation category to obtain a plurality of incidence users and the incidence relation categories corresponding to the incidence users; respectively generating promotion information for the plurality of associated users based on the association relationship categories; the method of sending the promotion information to the corresponding associated users can quickly and effectively extract the association relationship between the users, and generates personalized promotion information for promotion based on the association relationship, thereby improving the satisfaction degree of the users.

An electronic device 700 according to this embodiment of the disclosure is described below with reference to fig. 7. The electronic device 700 shown in fig. 7 is only an example and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.

As shown in fig. 7, electronic device 700 is embodied in the form of a general purpose computing device. The components of the electronic device 700 may include, but are not limited to: at least one processing unit 710, at least one memory unit 720, a bus 730 that connects the various system components (including the memory unit 720 and the processing unit 710), a display unit 740, and the like.

Wherein the storage unit stores program code that can be executed by the processing unit 710 to cause the processing unit 710 to perform the steps according to various exemplary embodiments of the present disclosure in the present specification. For example, the processing unit 710 may perform the steps as shown in fig. 2, 3, 4.

The memory unit 720 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM)7201 and/or a cache memory unit 7202, and may further include a read only memory unit (ROM) 7203.

The memory unit 720 may also include a program/utility 7204 having a set (at least one) of program modules 7205, such program modules 7205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.

Bus 730 may be any representation of one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

The electronic device 700 may also communicate with one or more external devices 700' (e.g., keyboard, pointing device, bluetooth device, etc.), such that a user can communicate with devices with which the electronic device 700 interacts, and/or any devices (e.g., router, modem, etc.) with which the electronic device 700 can communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 750. Also, the electronic device 700 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the internet) via the network adapter 760. The network adapter 760 may communicate with other modules of the electronic device 700 via the bus 730. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 700, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, as shown in fig. 8, the technical solution according to the embodiment of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, or a network device, etc.) to execute the above method according to the embodiment of the present disclosure.

The software product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The computer readable storage medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable storage medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).

The computer readable medium carries one or more programs which, when executed by a device, cause the computer readable medium to perform the functions of: acquiring a user identifier of a target user; determining an incidence relation hierarchy and an incidence relation category; retrieving in a graphic database based on the user identifier of the target user, the incidence relation hierarchy and the incidence relation category to obtain a plurality of incidence users and the incidence relation categories corresponding to the incidence users; respectively generating promotion information for the plurality of associated users based on the association relationship categories; and sending the promotion information to the corresponding associated user.

Those skilled in the art will appreciate that the modules described above may be distributed in the apparatus according to the description of the embodiments, or may be modified accordingly in one or more apparatuses unique from the embodiments. The modules of the above embodiments may be combined into one module, or further split into multiple sub-modules.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.

Exemplary embodiments of the present disclosure are specifically illustrated and described above. It is to be understood that the present disclosure is not limited to the precise arrangements, instrumentalities, or instrumentalities described herein; on the contrary, the disclosure is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims

1. An information push method based on user incidence relation is characterized by comprising the following steps:

acquiring a user identifier of a target user;

determining an incidence relation hierarchy and an incidence relation category;

retrieving in a graphic database based on the user identifier of the target user, the incidence relation hierarchy and the incidence relation category to obtain a plurality of incidence users and the incidence relation categories corresponding to the incidence users;

respectively generating promotion information for the plurality of associated users based on the association relationship categories;

and sending the promotion information to the corresponding associated user.

2. The method of claim 1, further comprising:

generating the graphic database through the user association relation in the relational database; and/or

And updating the graphic database in real time through a user access request.

3. The method of any of claims 1-2, wherein generating the graph database from user associations in a relational database comprises:

acquiring a plurality of first users in the relational database;

sequentially extracting the user identification of the first user in the relational database;

extracting a user association relation related to the first user in the relational database;

and taking the first user as a node, and taking the user association relationship as an edge to generate the graph database.

4. The method of any of claims 1-3, wherein generating the graphical database with the first user as a point and the user association as an edge comprises:

extracting a user identification of the first user;

determining whether the same user exists in the graphic database based on the user identification;

when the same user exists in the graph database, adding the incidence relation of the user as an edge into an existing node;

and when the same user does not exist in the graph database, establishing nodes and edges according to the user association relation corresponding to the first user.

5. The method of any of claims 1-4, wherein updating the graphical database in real-time via a user access request comprises:

acquiring a user access request, wherein the user access request comprises an inviting user and an invited user;

extracting a project name from a page corresponding to the user access request;

determining an association category based on the item name;

and updating the graphic database according to the inviting user, the invited user and the corresponding association relationship types.

6. The method of any of claims 1-5, wherein updating the image database according to the inviting user, the invited user, and their corresponding association categories comprises:

acquiring an incidence relation hierarchy;

and updating the graphic database according to the inviting user, the invited user, the corresponding incidence relation categories and the incidence relation hierarchies.

7. The method according to any one of claims 1-6, wherein retrieving in a graphical database based on the user identification of the target user, the association hierarchy, and the association category to obtain a plurality of associated users and their corresponding association categories comprises:

determining a target node in a graph database based on the user identification;

extracting all nodes having edge connection relation with the user identification according to the incidence relation hierarchy;

removing nodes which do not meet the association relationship category;

acquiring user identifications of the rest nodes;

extracting the plurality of associated users based on the user identification.

8. An information pushing device based on user incidence relation is characterized by comprising:

the identification module is used for acquiring the user identification of the target user;

the parameter module is used for determining the association relationship hierarchy and the association relationship category;

the retrieval module is used for retrieving in a graphic database based on the user identification of the target user, the incidence relation hierarchy and the incidence relation category to obtain a plurality of incidence users and the corresponding incidence relation categories;

the information module is used for respectively generating promotion information for the plurality of associated users based on the association relation categories;

and the sending module is used for sending the promotion information to the corresponding associated user.

9. An electronic device, comprising:

one or more processors;

storage means for storing one or more programs;

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.

10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-7.