WO2021129379A1 - 信息分享链的生成方法及装置、电子设备、存储介质 - Google Patents

信息分享链的生成方法及装置、电子设备、存储介质 Download PDF

Info

Publication number
WO2021129379A1
WO2021129379A1 PCT/CN2020/134562 CN2020134562W WO2021129379A1 WO 2021129379 A1 WO2021129379 A1 WO 2021129379A1 CN 2020134562 W CN2020134562 W CN 2020134562W WO 2021129379 A1 WO2021129379 A1 WO 2021129379A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
information
sharing
parent node
parent
Prior art date
Application number
PCT/CN2020/134562
Other languages
English (en)
French (fr)
Inventor
孙国建
杨艳艳
吴武桓
冯之龙
覃柏瑜
Original Assignee
京东数字科技控股股份有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 京东数字科技控股股份有限公司 filed Critical 京东数字科技控股股份有限公司
Priority to US17/757,831 priority Critical patent/US20230033804A1/en
Priority to EP20905783.5A priority patent/EP4050853A4/en
Publication of WO2021129379A1 publication Critical patent/WO2021129379A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9024—Graphs; Linked lists
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/21—Monitoring or handling of messages
    • H04L51/234—Monitoring or handling of messages for tracking messages
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/52—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail for supporting social networking services
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/535—Tracking the activity of the user
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/55—Push-based network services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/20—Services signaling; Auxiliary data signalling, i.e. transmitting data via a non-traffic channel
    • H04W4/21—Services signaling; Auxiliary data signalling, i.e. transmitting data via a non-traffic channel for social networking applications

Definitions

  • the present disclosure relates to the field of computer technology, and in particular to a method for generating an information sharing chain, a device for generating an information sharing chain, electronic equipment, and a computer-readable storage medium.
  • a method for generating an information sharing chain which includes: information sharing among multiple nodes in response to sharing information, and obtaining information about a parent node of a target node, where the parent node of the target node is sharing The shared information to the node of the target node; according to the information of the parent node of the target node, in a pre-established information sharing data table, the parent node of the target node is searched, and the parent nodes found are sequentially searched For the child node, search for the information of the previous parent node; according to the search result, generate the sharing chain of the shared information.
  • the method before acquiring the information of the parent node of the target node, the method further includes: if the target node triggers a preset event according to the shared information, executing the acquisition The step of describing the information of the parent node of the target node.
  • the preset event includes any one or more of the following situations: the time for the target node to browse the shared information exceeds a preset time; The shared information performs a specific interactive operation; the frequency of viewing the shared information by the target node exceeds a preset threshold; the target node shares the shared information with other nodes greater than the preset number.
  • the information sharing data table is established in the following manner: when the shared information reaches each node, the node where the shared information reaches is the current node, and the current node is recorded.
  • the recording the node identification, node sharing code, parent node identification, parent node sharing code, and identification of the sharing information of the current node includes: searching for the current node The node identifier of the previous node of the current node is used as the parent node identifier of the current node; the node sharing code of the previous node of the current node is searched as the parent node sharing code of the current node; and the parent node of the current node is The node sharing code plus one is used as the node sharing code of the current node.
  • the acquiring information of the parent node of the target node includes: acquiring the parent node identifier of the target node, the parent node sharing code, and the identifier of the sharing information; For the information of the parent node of the target node, search the previous parent node of the target node in the pre-established information sharing data table, and use the found parent node as the child node in turn to search for the information of the previous parent node , Including: searching the sharing record information of the shared information in the information sharing data table according to the identifier of the shared information; in the sharing record information of the shared information, according to the parent node identifier of the target node, The parent node shared code searches for the parent node of the target node, wherein the parent node identifier of the target node is the same as the node identifier of the parent node, and the parent node shared code of the target node is shared with the node of the parent node The code is the same; when the parent node
  • the method further includes: according to the attribute of the sharing chain, sending information to multiple nodes in the sharing chain.
  • the service information corresponding to the attribute is generated, the method further includes: according to the attribute of the sharing chain, sending information to multiple nodes in the sharing chain.
  • a device for generating an information sharing chain including: an information acquisition module configured to perform information sharing among multiple nodes in response to sharing information to acquire information about the parent node of the target node.
  • the parent node of the node is the node that shares the shared information to the target node;
  • the node search module is used to search for the target node in a pre-established information sharing data table according to the information of the parent node of the target node And use the found parent node as the child node in turn to find the information of the previous parent node;
  • the sharing chain generation module is used to generate the sharing chain of the shared information according to the search result.
  • the device for generating an information sharing chain further includes: a judging unit, configured to, before acquiring the information of the parent node of the target node, if the target node triggers For a preset event, the step of obtaining the information of the parent node of the target node is executed.
  • the preset event includes any one or more of the following situations: the time for the target node to browse the shared information exceeds a preset time; The shared information performs a specific interactive operation; the frequency of viewing the shared information by the target node exceeds a preset threshold; the target node shares the shared information with other nodes greater than the preset number.
  • the information sharing data table is established in the following manner: an information recording unit is configured to, when the shared information arrives at each node, take the node where the shared information arrives as the current The node records the node identification, node sharing code, parent node identification, parent node sharing code, and identification of the sharing information of the current node; a data table generating unit is used to generate a data table based on the node identification and node sharing of each node Code, parent node identification, parent node sharing code, and identification of the shared information to generate the information sharing data table.
  • the information recording unit includes: a first search subunit, configured to search for the node identifier of the previous node of the current node as the parent node identifier of the current node; and second The child unit search is used to search for the node sharing code of the previous node of the current node as the parent node sharing code of the current node; the node sharing code generates the child unit for using the parent node sharing code of the current node Add one as the node sharing code of the current node.
  • the information acquisition module includes: an information acquisition unit configured to acquire the parent node identifier, parent node sharing code, and identifier of the shared information of the target node;
  • the node search module includes: The information search unit is configured to search for the shared record information of the shared information in the information sharing data table according to the identifier of the shared information;
  • the parent node determination unit is configured to search the shared record information of the shared information in the shared information, Search for the parent node of the target node according to the parent node identification and parent node sharing code of the target node, wherein the parent node identification of the target node is the same as the node identification of the parent node, and the parent node of the target node
  • the sharing code is the same as the node sharing code of the parent node;
  • the sequential searching unit is used for when the parent node of the target node is found, the parent node is regarded as the child node, and the found parent node is the child node in turn , Continue to find the information of the previous
  • the sharing chain generating module includes: a sharing chain generating unit, configured to: when the information of the last parent node found is null, according to the target node and the parent node , And the found relationship between each child node and its parent node generates a sharing chain of the target information.
  • the device for generating an information sharing chain further includes: an information pushing module, which is configured to send information to the sharing chain according to the attributes of the sharing chain after the sharing chain of the sharing information is generated. Multiple nodes in the chain send service information corresponding to the attribute.
  • an electronic device including: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute by executing the executable instructions The method of any one of the above.
  • a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, the method described in any one of the above is implemented.
  • information sharing is performed among multiple nodes to obtain the information of the parent node of the target node.
  • the parent node of the target node is the node that shares the shared information to the target node.
  • the information is established in advance.
  • the parent node of the target node is searched, and the found parent node is used as the child node in turn, the information of the previous parent node is searched, and a sharing chain of shared information is generated according to the search result.
  • this exemplary embodiment proposes a new method for generating an information sharing chain.
  • the process depends on the parent node.
  • Information the generated information sharing chain has high accuracy; in addition, the generation algorithm of the information sharing chain in this exemplary embodiment has low complexity, the generation process is relatively simple, does not require high resource costs, and has relatively high High generation efficiency of information sharing chain.
  • Fig. 1 schematically shows a flow chart of a method for generating an information sharing chain in this exemplary embodiment
  • Fig. 2 schematically shows a sub-flow chart of a method for generating an information sharing chain in this exemplary embodiment
  • FIG. 3 schematically shows a schematic diagram of an information sharing process in this exemplary embodiment
  • FIG. 4 schematically shows a flowchart of another method for generating an information sharing chain in this exemplary embodiment
  • Fig. 5 schematically shows a structural block diagram of a device for generating an information sharing chain in this exemplary embodiment
  • Fig. 6 schematically shows an electronic device for implementing the above method in this exemplary embodiment
  • Fig. 7 schematically shows a computer-readable storage medium for implementing the above-mentioned method in this exemplary embodiment.
  • the exemplary embodiment of the present disclosure first provides a method for generating an information sharing chain, where the information may be product information in an e-commerce App (Application), such as product title, product link, or product QR code Pictures, etc., may also be user information in social apps, such as user business cards, or game information in game apps, which are not specifically limited in the present disclosure.
  • the application scenario of the method in this embodiment may be: when a user pushes product information to other users, determine the user chain of the product in the entire sharing process; or when a player shares game information with other players, determine the game in which the game information is shared Player chains, etc., to evaluate and analyze the shared information based on the generated information sharing chains.
  • the method for generating an information sharing chain may include the following steps S110 to S130:
  • Step S110 In response to sharing information, information sharing is performed among multiple nodes, and information of the parent node of the target node is obtained.
  • the parent node of the target node is the node that shares the shared information to the target node.
  • sharing information refers to information that can be transmitted and shared among multiple users, such as product links, product pictures, product QR codes, game links, or user business cards, and so on. Sharing information can be shared among multiple nodes. For example, user A can share the link of product 1 with user B, and user B can share the link of product 1 shared by user A with user C, so product 1 The link completes the sharing process among users A, B, and C.
  • the target node refers to a certain node among multiple nodes for information sharing. Through the analysis of the target node, the sharing path of sharing information can be determined. All nodes involved in this exemplary embodiment may be terminal devices related to the sharer or the shareee, such as a smart phone, a tablet computer, or a personal computer, and so on.
  • the parent node is the node that shares the shared information to the target node. For example, in the above sharing example, if the terminal device associated with user B is used as the target node, the terminal device associated with user A is the terminal device associated with user B If the terminal device associated with user C is used as the target node, the terminal device associated with user B is the parent node of user C.
  • the parent node may include a variety of information related to itself, such as the node's identification code, sharing code, and so on.
  • the target node may be any one of multiple nodes, or may be a node that meets a preset condition.
  • the method for generating the information sharing chain may further include:
  • the step of obtaining the information of the parent node of the target node is executed.
  • the preset event is the condition for judging which node among the multiple nodes is the target node.
  • a target node can be selected from multiple nodes, and the target node is used as the information sharing chain.
  • the end node of, traces upwards to determine the entire information sharing chain.
  • the preset event may include any one or more of the following situations:
  • the target node performs specific interactive operations on shared information
  • the target node shares the shared information with other nodes greater than the preset number.
  • This exemplary embodiment sets any one or more of the above (1) to (4). Assuming an event, in the sharing process, when a node performs the above-mentioned preset event on the shared information, it can be determined that the node is the target node. Specifically, when sharing information is important, users usually view it multiple times or browse it for a long time.
  • Step S120 according to the information of the parent node of the target node, search for the parent node of the target node in the pre-established information sharing data table, and sequentially use the found parent node as the child node to search for the information of the previous parent node.
  • the information sharing data table refers to a data table used to store information that has an association relationship with each sharing node during the information sharing process. It may include identification information of each node, or specific sharing information, etc., such as node ID (Identify, identity), the type of shared information, or the specific content of the shared information, etc.
  • node ID Identify, identity
  • the parent node of the target node can be obtained by searching in the data table, and then according to the information of the parent node, continue to trace upward, and the shared information can be found for the forward sharing process
  • the reverse path is the information sharing chain.
  • the above-mentioned information sharing data table is established in the following manner:
  • the node where the shared information reaches is the current node, and the node ID, node sharing code, parent node ID, parent node sharing code, and shared information ID of the current node are recorded;
  • an information sharing data table is generated.
  • the node identifier may be information that can reflect which node the current node is, such as the ID information of the node. Each node has a unique identifier that is different from other nodes.
  • the identification of the node can have multiple representation methods. Taking the terminal held by the user as the node as an example, the node can be the ID, code, or coordinates of the user terminal, and so on.
  • the node sharing code can be used in the sharing process to mark the serial number of all the nodes that are sharing.
  • the identity of the shared information refers to the information used to indicate which object is shared. It can have different identifications according to the different shared objects
  • the form can be in text form, such as product link, product description or product serial number, etc.; it can also be in image form, such as product screenshots or product QR codes, etc.
  • the above-mentioned recording of the node identification, node sharing code, parent node identification, parent node sharing code, and identification of shared information of the current node may include the following steps:
  • Table 1 schematically shows an information sharing data table in this exemplary embodiment, where SId represents the identification of each sharing node, SLinkId represents the sharing code of each sharing node, PId represents the parent node identification, and PLinkId represents the parent node sharing code , ItemCode represents the identification of shared information:
  • each sharing node can call the background interface during the sharing operation, generate a unique identification and sharing code for the node, and store it in the database, and the parent node of each node
  • the identification and the sharing code of the parent node can be determined by the identification and sharing code of the child nodes of the parent node.
  • the unique identifier "S1" and the sharing code "1" are generated, and the identifier "1001" of the shared information is stored in the database; when the shared information arrives When the S2 node is used, the unique identifier "S2" is generated, the identifier "1001" that records the sharing information is transmitted, and the node identifier "S1" of the parent node of the current node S2 is searched as the parent node identifier of the current node S2, and based on the sharing of the parent node S1 Code "1" plus 1 to get the sharing code "2" of the current node S2, and then store the unique identifier "S1" of the parent node S1 of the current node S2 and the sharing code "1” in the database; Establish information sharing data tables in the database.
  • node S3 is both the parent node of node S4 and the parent node of node S6, the parent node of node S4 in the information sharing data table
  • the node sharing code is different from the parent node sharing code of node S6, indicating that although the information sharing to these two nodes has passed through node S3, the path is quite different.
  • by recording the node identification, node sharing code, parent node identification, parent node sharing code, and sharing information identification of each node where the information arrives during the information sharing process it can be extracted from the information sharing data table The accurate path of information sharing.
  • step S130 a sharing chain for sharing information is generated according to the search result.
  • the search result refers to the found part or all of the shared nodes including the target node on the same shared path.
  • the information in this exemplary embodiment can be generated. Sharing chain.
  • the length of the chain in the sharing process of sharing information can be determined as needed, that is, the sharing information itself can be used as the starting node of the sharing chain, or the first-level sharing node can be used as the starting node of the sharing chain.
  • the starting node you can also use any sharing node in the sharing process as the starting node of the sharing chain, and so on.
  • the sharing process is from S1 to S10. If S9 is the target node, multiple sharing chains such as S1 to S9, S2 to S9, ..., S8 to S9 can be determined.
  • the sharing chain when a sharing chain for sharing information is generated, the sharing chain can be pushed to service terminals in other application scenarios as needed. For example, after a social sharing chain is generated, the sharing chain can be pushed to the social relationship Social service terminals for analysis and evaluation, etc. It is also possible to push the required services to all or part of the nodes in the sharing chain. For example, after the social sharing chain is generated, it will push other interested users to each node in the sharing chain, etc. This disclosure does not specifically limit this .
  • obtaining the information of the parent node of the target node may include:
  • Step S210 Obtain the parent node identifier, parent node sharing code, and shared information identifier of the target node;
  • step S120 may include the following steps:
  • Step S220 searching for the sharing record information of the shared information in the information sharing data table according to the identifier of the shared information
  • step S240 when the parent node of the target node is found, the parent node is regarded as the child node, and the found parent node is successively regarded as the child node, and the information of the previous parent node is continued to be searched.
  • the parent node identifier, parent node sharing code, and shared information identifier of the target node can be obtained.
  • the identifier of the shared information can determine whether the nodes performing information sharing are in the same sharing process, that is, whether each sharing node shares the same shared information. Considering that in the actual sharing process, there may be situations in which the same shared information is shared by different parent sharing nodes to the same child sharing node, or the same shared information is shared to different child sharing nodes.
  • node S3 shares information with both S4 and S6, and node S3 is both a child node of S2 and a child node of S1. Therefore, in this exemplary embodiment, the sharing record information can be found in the information sharing data table through the identification of the shared information, and the parent node identification and parent node sharing code of each node can be obtained in the sharing record information of the shared information, that is, it is determined to be in The sharing node in the same information sharing process, and find the parent node of the target node to accurately determine the only link for sharing information
  • step S130 may include:
  • a sharing chain of the target information is generated according to the relationship between the target node and the parent node, and each child node and its parent node found.
  • the target information is generated Sharing chain.
  • this exemplary embodiment in response to sharing information, information is shared among multiple nodes to obtain the information of the parent node of the target node.
  • the parent node of the target node is the node that shares the shared information to the target node.
  • the information of the parent node of the target node in the pre-established information sharing data table, find the previous parent node of the target node, and in turn use the found parent node as the child node, find the parent node information, and generate according to the search result Sharing chain of shared information.
  • this exemplary embodiment proposes a new method for generating an information sharing chain.
  • the process depends on the parent node.
  • Information the generated information sharing chain has high accuracy; in addition, the generation algorithm of the information sharing chain in this exemplary embodiment has low complexity, the generation process is relatively simple, does not require high resource costs, and has relatively high High generation efficiency of information sharing chain.
  • the method for generating the information sharing chain may further include the following steps:
  • the service information corresponding to the attributes is sent to multiple nodes in the sharing chain.
  • sharing chains of different attributes can be generated. For example, a sharing chain generated based on product information, a sharing chain generated based on game information, and so on. Based on this, according to the different attributes of the sharing chain, different service information can be pushed to each node in the sharing chain.
  • social services can be pushed to each node in the sharing chain, such as friend push, Chat services, etc.; after generating a sharing chain for e-commerce relationships, you can push product information or product-related services, such as commodity insurance services, to each node of the sharing chain; after generating a sharing chain for game relationships, you can send to the sharing chain Each node pushes game-related information, such as new gameplay or new activities in the game.
  • FIG. 4 shows an interaction flowchart of a method for generating an information sharing chain in this exemplary embodiment, which may specifically include the following steps: the user terminal 410 may be provided with a client or a small program for sharing, and step S411 is executed.
  • the user terminal 410 may be provided with a client or a small program for sharing
  • step S411 is executed.
  • different nodes may have different user terminals.
  • step S421 executes step S421, and in response to information sharing by each node, obtains the node of each node
  • the identification, node sharing code, parent node identification, parent node identification code, and identification of the shared information are stored in the information sharing data table; further, step S412 is executed in the user terminal 410, whether the target node triggers the pre-selection based on the shared information Set the event; if not, continue information sharing, and store each node information and sharing information in the information sharing data table, if yes, perform step S422 in the server 420, and perform step S422 based on the parent node information of the target node in the pre-established
  • the device 500 may include an information acquisition module 510 for information sharing among multiple nodes in response to sharing information, to acquire information about the parent node of the target node, and the parent node of the target node is for sharing information to the target.
  • the node of the node; the node search module 520 is used to find the parent node of the target node in the pre-established information sharing data table according to the information of the parent node of the target node, and in turn take the found parent node as the child node, and search Information of the previous parent node;
  • the sharing chain generating module 530 is used to generate a sharing chain of sharing information according to the search result.
  • the generating device of the information sharing chain may further include: a judging unit, configured to execute acquiring the target node if the target node triggers a preset event according to the shared information before acquiring the information of the parent node of the target node The step of the information of the parent node.
  • the preset event may include any one or more of the following situations: the time for the target node to browse the shared information exceeds a preset time; the target node performs a specific interactive operation on the shared information; the target node responds to the shared information The viewing frequency of exceeds a preset threshold; the target node shares the shared information with other nodes greater than the preset number.
  • the information sharing data table may be established in the following manner: an information recording unit is used for when the shared information arrives at each node, the node where the shared information arrives is the current node, and the node ID, Node sharing code, parent node identification, parent node sharing code and identification of shared information; data table generating unit, used for identification of node identification, node sharing code, parent node identification, parent node sharing code and shared information based on each node , Generate information sharing data table.
  • the information recording unit may include: a first search subunit, used to search for the node identifier of the previous node of the current node, as the parent node identifier of the current node; and a second search subunit, used to search The node sharing code of the previous node of the current node is used as the parent node sharing code of the current node; the node sharing code generation child unit is used to use the parent node sharing code of the current node plus one as the node sharing code of the current node.
  • the information acquisition module may include: an information acquisition unit for sharing information among multiple nodes in response to sharing information, and acquiring the parent node identifier, parent node sharing code, and shared information identifier of the target node ;
  • the node search module includes: an information search unit, which is used to search the sharing record information of the shared information in the information sharing data table according to the identification of the shared information; the parent node determination unit is used to share the information in the sharing record information of the shared information, according to the target The parent node ID and parent node sharing code of the node search for the parent node of the target node, where the parent node ID of the target node is the same as the node ID of the parent node, and the parent node sharing code of the target node is the same as the node sharing code of the parent node;
  • the search unit is used for when the parent node of the target node is found, the parent node is regarded as the child node, and the found parent node is successively regarded as the child node, and
  • the sharing chain generating module may include: a sharing chain generating unit, configured to, when the information of the last parent node found is null, according to the target node and the parent node, and each found child The relationship between the node and its parent node generates a sharing chain of target information.
  • the generating device of the information sharing chain may further include: an information pushing module, which is used to send and attribute attributes to multiple nodes in the sharing chain according to the attributes of the sharing chain after generating the sharing chain for sharing information. Corresponding service information.
  • Exemplary embodiments of the present disclosure also provide an electronic device capable of implementing the above method.
  • the electronic device 600 according to this exemplary embodiment of the present disclosure will be described below with reference to FIG. 6.
  • the electronic device 600 shown in FIG. 6 is only an example, and should not bring any limitation to the function and scope of use of the embodiments of the present disclosure.
  • the electronic device 600 is represented in the form of a general-purpose computing device.
  • the components of the electronic device 600 may include, but are not limited to: the aforementioned at least one processing unit 610, the aforementioned at least one storage unit 620, a bus 630 connecting different system components (including the storage unit 620 and the processing unit 610), and a display unit 640.
  • the storage unit 620 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 621 and/or a cache storage unit 622, and may further include a read-only storage unit (ROM) 623.
  • RAM random access storage unit
  • ROM read-only storage unit
  • the storage unit 620 may also include a program/utility tool 624 having a set of (at least one) program module 625.
  • program module 625 includes but is not limited to: an operating system, one or more application programs, other program modules, and program data, Each of these examples or some combination may include the implementation of a network environment.
  • the bus 630 may represent one or more of several types of bus structures, including a storage unit bus or a storage unit controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local area using any bus structure among multiple bus structures. bus.
  • the electronic device 600 may also communicate with one or more external devices 800 (such as keyboards, pointing devices, Bluetooth devices, etc.), and may also communicate with one or more devices that enable a user to interact with the electronic device 600, and/or communicate with Any device (such as a router, modem, etc.) that enables the electronic device 600 to communicate with one or more other computing devices. This communication can be performed through an input/output (I/O) interface 650.
  • the electronic device 600 may also communicate with one or more networks (for example, a local area network (LAN), a wide area network (WAN), and/or a public network, such as the Internet) through the network adapter 660.
  • networks for example, a local area network (LAN), a wide area network (WAN), and/or a public network, such as the Internet
  • the network adapter 660 communicates with other modules of the electronic device 600 through the bus 630. It should be understood that although not shown in the figure, other hardware and/or software modules can be used in conjunction with the electronic device 600, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives And data backup storage system, etc.
  • the example embodiments described here can be implemented by software, or can be implemented by combining software with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, U disk, mobile hard disk, etc.) or on the network , Including several instructions to make a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) execute the method according to the exemplary embodiment of the present disclosure.
  • a computing device which may be a personal computer, a server, a terminal device, or a network device, etc.
  • Exemplary embodiments of the present disclosure also provide a computer-readable storage medium on which is stored a program product capable of implementing the above-mentioned method of this specification.
  • various aspects of the present disclosure can also be implemented in the form of a program product, which includes program code.
  • the program product runs on a terminal device, the program code is used to make the terminal device execute the above-mentioned instructions in this specification.
  • the steps according to various exemplary embodiments of the present disclosure are described in the "Exemplary Methods" section.
  • a program product 700 for implementing the above method according to an exemplary embodiment of the present disclosure is described. It may adopt a portable compact disk read-only memory (CD-ROM) and include program codes, and may be used in a terminal Running on equipment, such as a personal computer.
  • CD-ROM compact disk read-only memory
  • the program product of the present disclosure is not limited thereto.
  • the readable storage medium can be any tangible medium that contains or stores a program, and the program can be used by or in combination with an instruction execution system, device, or device.
  • the program product can adopt any combination of one or more readable media.
  • the readable medium may be a readable signal medium or a readable storage medium.
  • the readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or a combination of any of the above. More specific examples (non-exhaustive list) of readable storage media include: electrical connections with one or more wires, portable disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable Type programmable read only memory (EPROM or flash memory), optical fiber, portable compact disk read only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the above.
  • the computer-readable signal medium may include a data signal propagated in baseband or as a part of a carrier wave, and readable program code is carried therein. This propagated data signal can take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • the readable signal medium may also be any readable medium other than a readable storage medium, and the readable medium may send, propagate, or transmit a program for use by or in combination with the instruction execution system, apparatus, or device.
  • the program code contained on the readable medium can be transmitted by any suitable medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.
  • the program code for performing the operations of the present disclosure can be written in any combination of one or more programming languages.
  • the programming languages include object-oriented programming languages—such as Java, C++, etc., as well as conventional procedural programming. Language-such as "C" language or similar programming language.
  • the program code can be executed entirely on the user's computing device, partly on the user's device, executed as an independent software package, partly on the user's computing device and partly executed on the remote computing device, or entirely on the remote computing device or server Executed on.
  • the remote computing device can be connected to a user computing device through any kind of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (for example, using Internet service providers). Business to connect via the Internet).
  • LAN local area network
  • WAN wide area network
  • Internet service providers for example, using Internet service providers
  • modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory.
  • the features and functions of two or more modules or units described above may be embodied in one module or unit.
  • the features and functions of a module or unit described above can be further divided into multiple modules or units to be embodied.

Abstract

本公开提供了一种信息分享链的生成方法、信息分享链的生成装置、电子设备及计算机可读存储介质，属于计算机技术领域。该方法包括：响应于分享信息在多个节点间进行信息分享，获取目标节点的父节点的信息，所述目标节点的父节点为分享所述分享信息至所述目标节点的节点；根据所述目标节点的父节点的信息，在预先建立的信息分享数据表中，查找所述目标节点的父节点，并依次以查找到的父节点为子节点，查找上一父节点的信息；根据查找结果，生成所述分享信息的分享链。本公开可以快速、准确的生成可追溯的分享信息的分享链。 (图1)

Description

信息分享链的生成方法及装置、电子设备、存储介质
相关申请的交叉引用
本公开要求于2019年12月23日提交的申请号为201911335770.0、名称为“信息分享链的生成方法及装置、电子设备、存储介质”的中国专利申请的优先权，该中国专利申请的全部内容通过引用全部并入本文。
技术领域
本公开涉及计算机技术领域，尤其涉及一种信息分享链的生成方法、信息分享链的生成装置、电子设备及计算机可读存储介质。
背景技术
随着计算机技术的发展，信息在互联网上的传递方式也越来越多样化，对信息进行转发、分享，已经成为当下用户进行信息沟通和交流的主要方式之一。但是，在实现本公开过程中，发明人发现当信息在多个用户之间进行分享传递时，不能对信息进行分享节点的合理追溯，导致难以根据各个分享节点的用户行为对分享信息进行有效评估。
因此，如何高效、准确的生成信息分享链是现有技术亟待解决的问题。
需要说明的是，在上述背景技术部分公开的信息仅用于加强对本公开的背景的理解，因此可以包括不构成对本领域普通技术人员已知的现有技术的信息。
发明内容
本公开提供了一种信息分享链的生成方法、信息分享链的生成装置、电子设备及计算机可读存储介质，进而至少在一定程度上克服现有技术不能有效追溯信息分享过程中的分享节点，以生成信息分享链的问题。
本公开的其他特性和优点将通过下面的详细描述变得显然，或部分地通过本公开的实践而习得。
根据本公开的一个方面，提供一种信息分享链的生成方法，包括：响应于分享信息在多个节点间进行信息分享，获取目标节点的父节点的信息，所述目标节点的父节点为分享所述分享信息至所述目标节点的节点；根据所述目标节点的父节点的信息，在预先建立的信息分享数据表中，查找所述目标节点的父节点，并依次以查找到的父节点为子节点，查找上一父节点的信息；根据查找结果，生成所述分享信息的分享链。
在本公开的一种示例性实施例中，在获取所述目标节点的父节点的信息之前，所述方法还包括：如果所述目标节点根据所述分享信息触发预设事件，则执行获取所述目标节点的父节点的信息的步骤。
在本公开的一种示例性实施例中，所述预设事件包括以下任意一种或多种情况：所 述目标节点浏览所述分享信息的时间超过一预设时间；所述目标节点对所述分享信息进行特定交互操作；所述目标节点对所述分享信息的查看频数超过一预设阈值；所述目标节点将所述分享信息分享给大于预设数量的其他节点。
在本公开的一种示例性实施例中，所述信息分享数据表通过以下方式建立：当所述分享信息到达每个节点时，以所述分享信息到达的节点为当前节点，记录所述当前节点的节点标识、节点分享码、父节点标识、父节点分享码以及所述分享信息的标识；基于所述每个节点的节点标识、节点分享码、父节点标识、父节点分享码以及所述分享信息的标识，生成所述信息分享数据表。
在本公开的一种示例性实施例中，所述记录所述当前节点的节点标识、节点分享码、父节点标识、父节点分享码以及所述分享信息的标识，包括：查找所述当前节点的上一节点的节点标识，作为所述当前节点的父节点标识；查找所述当前节点的上一节点的节点分享码，作为所述当前节点的父节点分享码；以所述当前节点的父节点分享码加一作为所述当前节点的节点分享码。
在本公开的一种示例性实施例中，所述获取目标节点的父节点的信息，包括：获取所述目标节点的父节点标识、父节点分享码以及所述分享信息的标识；所述根据所述目标节点的父节点的信息，在预先建立的信息分享数据表中，查找所述目标节点的上一父节点，并依次以查找到的父节点为子节点，查找上一父节点的信息，包括：根据所述分享信息的标识，在所述信息分享数据表中查找所述分享信息的分享记录信息；在所述分享信息的分享记录信息中，根据所述目标节点的父节点标识、父节点分享码查找所述目标节点的父节点，其中，所述目标节点的父节点标识和所述父节点的节点标识相同，所述目标节点的父节点分享码和所述父节点的节点分享码相同；当查找到所述目标节点的父节点后，将所述父节点作为子节点，依次以查找到的父节点为子节点，继续查找上一父节点的信息。
在本公开的一种示例性实施例中，所述根据查找结果，生成所述分享信息的分享链，包括：当查找到的上一父节点的信息为空值时，根据所述目标节点与所述父节点，以及查找到的每个子节点及其父节点的关系生成所述目标信息的分享链。
在本公开的一种示例性实施例中，在生成所述分享信息的分享链之后，所述方法还包括：根据所述分享链的属性，向所述分享链中的多个节点发送与所述属性对应的服务信息。
根据本公开的一个方面，提供一种信息分享链的生成装置，包括：信息获取模块，用于响应于分享信息在多个节点间进行信息分享，获取目标节点的父节点的信息，所述目标节点的父节点为分享所述分享信息至所述目标节点的节点；节点查找模块，用于根据所述目标节点的父节点的信息，在预先建立的信息分享数据表中，查找所述目标节点的父节点，并依次以查找到的父节点为子节点，查找上一父节点的信息；分享链生成模块，用于根据查找结果，生成所述分享信息的分享链。
在本公开的一种示例性实施例中，信息分享链的生成装置还包括：判断单元，用于 在获取所述目标节点的父节点的信息之前，如果所述目标节点根据所述分享信息触发预设事件，则执行获取所述目标节点的父节点的信息的步骤。
在本公开的一种示例性实施例中，所述预设事件包括以下任意一种或多种情况：所述目标节点浏览所述分享信息的时间超过一预设时间；所述目标节点对所述分享信息进行特定交互操作；所述目标节点对所述分享信息的查看频数超过一预设阈值；所述目标节点将所述分享信息分享给大于预设数量的其他节点。
在本公开的一种示例性实施例中，所述信息分享数据表通过以下方式建立：信息记录单元，用于当所述分享信息到达每个节点时，以所述分享信息到达的节点为当前节点，记录所述当前节点的节点标识、节点分享码、父节点标识、父节点分享码以及所述分享信息的标识；数据表生成单元，用于基于所述每个节点的节点标识、节点分享码、父节点标识、父节点分享码以及所述分享信息的标识，生成所述信息分享数据表。
在本公开的一种示例性实施例中，信息记录单元包括：第一查找子单元，用于查找所述当前节点的上一节点的节点标识，作为所述当前节点的父节点标识；第二查找子单元，用于查找所述当前节点的上一节点的节点分享码，作为所述当前节点的父节点分享码；节点分享码生成子单元，用于以所述当前节点的父节点分享码加一作为所述当前节点的节点分享码。
在本公开的一种示例性实施例中，信息获取模块包括：信息获取单元，用于获取所述目标节点的父节点标识、父节点分享码以及所述分享信息的标识；节点查找模块包括：信息查找单元，用于根据所述分享信息的标识，在所述信息分享数据表中查找所述分享信息的分享记录信息；父节点确定单元，用于在所述分享信息的分享记录信息中，根据所述目标节点的父节点标识、父节点分享码查找所述目标节点的父节点，其中，所述目标节点的父节点标识和所述父节点的节点标识相同，所述目标节点的父节点分享码和所述父节点的节点分享码相同；依次查找单元，用于当查找到所述目标节点的父节点后，将所述父节点作为子节点，依次以查找到的父节点为子节点，继续查找上一父节点的信息。
在本公开的一种示例性实施例中，分享链生成模块包括：分享链生成单元，用于当查找到的上一父节点的信息为空值时，根据所述目标节点与所述父节点，以及查找到的每个子节点及其父节点的关系生成所述目标信息的分享链。
在本公开的一种示例性实施例中，信息分享链的生成装置还包括：信息推送模块，用于在生成所述分享信息的分享链之后，根据所述分享链的属性，向所述分享链中的多个节点发送与所述属性对应的服务信息。
根据本公开的一个方面，提供一种电子设备，包括：处理器；以及存储器，用于存储所述处理器的可执行指令；其中，所述处理器配置为经由执行所述可执行指令来执行上述任意一项所述的方法。
根据本公开的一个方面，提供一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现上述任意一项所述的方法。
本公开的示例性实施例具有以下有益效果：
响应于分享信息在多个节点间进行信息分享，获取目标节点的父节点的信息，目标节点的父节点为分享分享信息至目标节点的节点，根据目标节点的父节点的信息，在预先建立的信息分享数据表中，查找目标节点的父节点，并依次以查找到的父节点为子节点，查找上一父节点的信息，根据查找结果，生成分享信息的分享链。一方面，本示例性实施例提出一种新的信息分享链的生成方法，通过获取目标节点的父节点信息，追溯与分享信息具有关联的其他节点，生成信息分享链，其过程依赖于父节点信息，使得生成的信息分享链具有较高的准确性；另外，本示例性实施例中信息分享链的生成算法的复杂度较低，生成过程较为简单，无需较高的资源成本，且具有较高的信息分享链的生成效率。
应当理解的是，以上的一般描述和后文的细节描述仅是示例性和解释性的，并不能限制本公开。
附图说明
此处的附图被并入说明书中并构成本说明书的一部分，示出了符合本公开的实施例，并与说明书一起用于解释本公开的原理。显而易见地，下面描述中的附图仅仅是本公开的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。
图1示意性示出本示例性实施例中一种信息分享链的生成方法的流程图；
图2示意性示出本示例性实施例中一种信息分享链的生成方法的子流程图；
图3示意性示出本示例性实施例中信息分享过程的示意图；
图4示意性示出本示例性实施例中另一种信息分享链的生成方法的流程图；
图5示意性示出本示例性实施例中一种信息分享链的生成装置的结构框图；
图6示意性示出本示例性实施例中一种用于实现上述方法的电子设备；
图7示意性示出本示例性实施例中一种用于实现上述方法的计算机可读存储介质。
具体实施方式
现在将参考附图更全面地描述示例实施方式。然而，示例实施方式能够以多种形式实施，且不应被理解为限于在此阐述的范例；相反，提供这些实施方式使得本公开将更加全面和完整，并将示例实施方式的构思全面地传达给本领域的技术人员。所描述的特征、结构或特性可以以任何合适的方式结合在一个或更多实施方式中。
本公开的示例性实施例首先提供了一种信息分享链的生成方法，其中，信息可以是电商类App(Application，应用程序)中的商品信息，例如商品标题、商品链接或商品二维码图片等，也可以是社交类App中的用户信息，例如用户名片，还可以是游戏类App中的游戏信息等，本公开对此不做具体限定。本实施例方法的应用场景可以是：用户在向其他用户推送商品信息时，确定商品在整个分享过程中的用户链；或者玩家在向其他玩家分 享游戏信息时，确定游戏信息所被分享的游戏玩家链等等，以根据生成的这些信息分享链对被分享的信息进行评估和分析。
下面结合附图1对本示例性实施例做进一步说明，如图1所示，信息分享链的生成方法可以包括以下步骤S110～S130：
步骤S110，响应于分享信息在多个节点间进行信息分享，获取目标节点的父节点的信息，目标节点的父节点为分享该分享信息至目标节点的节点。
其中，分享信息是指可以在多个用户之间进行信息传递与分享的信息，例如商品链接、商品图片、商品的二维码、游戏链接或用户名片等等。分享信息可以在多个节点间进行信息分享，例如用户A可以将商品1的链接分享给用户B，用户B接收到用户A分享的商品1的链接可以再将其分享给用户C，这样商品1的链接就完成了在用户A、B、C之间的分享过程。目标节点是指进行信息分享的多个节点中的其中某一个节点，通过对目标节点的分析，可以确定分享信息的分享路径。本示例性实施例中所涉及的所有节点可以是与分享者或被分享者相关的终端设备，例如智能手机、平板电脑或个人电脑等等。父节点即为分享分享信息至目标节点的节点，例如在上述分享的示例中，若将用户B所关联的终端设备作为目标节点，则用户A所关联的终端设备为用户B所关联的终端设备的父节点；若将用户C所关联的终端设备作为目标节点，则用户B所关联的终端设备为用户C的父节点。在本示例性实施例中，父节点可以包括多种与其自身相关的信息，例如节点的标识码、分享码等等。
需要说明的是，目标节点可以是多个节点中的任意某一节点，也可以是满足预设条件的节点。在一示例性实施例中，在获取目标节点的父节点的信息之前，信息分享链的生成方法还可以包括：
如果目标节点根据分享信息触发预设事件，则执行获取目标节点的父节点的信息的步骤。
其中，预设事件即为判断多个节点中哪一节点为目标节点的条件，本示例性实施例通过设置判断机制，可以从多个节点中选取一目标节点，以该目标节点为信息分享链的结束节点，向上追溯，确定整个信息分享链。
其中，预设事件可以包括以下任意一种或多种情况：
(1)目标节点浏览分享信息的时间超过一预设时间；
(2)目标节点对分享信息进行特定交互操作；
(3)目标节点对分享信息的查看频数超过一预设阈值；
(4)目标节点将分享信息分享给大于预设数量的其他节点。
在生成信息分享链时，首先需要确定从哪一节点开始向上追溯查找信息分享过程中的其他节点，而如何确定这一尾端节点是非常重要的，即如何确定目标节点。考虑到如果某一节点对分享信息执行了一些特殊操作，可以提高信息分享链在后续应用上的有效性，本示例性实施例设置了上述(1)～(4)任意一种或多种预设事件，在分享过程中，当某一节点对分享信息进行了上述预设事件时，可以确定该节点为目标节点。具体说明，当分享 信息比较重要时，通常用户会对其进行多次查看或长时间的浏览，因此可以设置上述预设事件(1)和(3)，其中，预设时间和预设阈值可以根据需要进行自定义设置，本公开对此不做具体限定。另外，在情况(2)中，特定交互操作是指节点对应的用户对分享信息进行了一些特殊操作，例如当分享信息为一商品链接时，则用户打开该链接，进行该商品的加购、收藏、购买等操作行为时可以被认为是特定交互操作；或者分享信息为一用户名片时，则节点对应的用户基于该用户名片，进行截图、图片保存、添加朋友等操作也可以被认为是特定交互操作等。而当分享信息对于被分享的用户来说，比较重要或用户自身比较偏爱时，可能会将其大量分享给其他用户，因此，当被分享的用户数量超过预设阈值时，可以将该节点作为目标节点等等。
步骤S120，根据目标节点的父节点的信息，在预先建立的信息分享数据表中，查找目标节点的父节点，并依次以查找到的父节点为子节点，查找上一父节点的信息。
其中，信息分享数据表是指用以存储信息分享过程中，与每一分享节点具有关联关系的信息的数据表，其可以包括每个节点的标识信息、或具体的分享信息等，例如节点ID(Identify，身份标识)、分享信息的类型或者分享信息的具体内容等等。通过步骤S110获取的目标节点的父节点的信息，在该数据表中查找，可以获取目标节点的父节点，再根据该父节点的信息，继续向上追溯，可以查找到分享信息进行正向分享过程的反向路径，即信息分享链。
在一示例性实施例中，上述信息分享数据表通过以下方式建立：
当分享信息到达每个节点时，以分享信息达到的节点为当前节点，记录当前节点的节点标识、节点分享码、父节点标识、父节点分享码以及分享信息的标识；
基于每个节点的节点标识、节点分享码、父节点标识、父节点分享码以及分享信息的标识，生成信息分享数据表。
其中，节点标识可以是能够反映当前节点为哪一节点的信息，例如节点的ID信息，每个节点都具有与其他节点所不相同的唯一标识，在本示例性实施例中，根据不同的应用场景，其节点的标识可以具有多种表示方法，以用户所持终端为节点为例，节点可以是用户终端的ID、编码或者坐标等等。节点分享码可以用于分享过程对进行分享的所有节点进行序号标记，分享信息的标识是指用以表示被分享的是哪一对象的信息，其根据被分享对象的不同，可以具有不同的标识形式，可以是文本形式，例如商品链接、商品描述或商品序号等；也可以是图片形式，例如商品截图或商品二维码等等。
在一示例性实施例中，上述记录当前节点的节点标识、节点分享码、父节点标识、父节点分享码以及分享信息的标识可以包括以下步骤：
查找当前节点的上一节点的节点标识，作为当前节点的父节点标识；
查找当前节点的上一节点的节点分享码，作为当前节点的父节点分享码；
以当前节点的父节点分享码加一作为当前节点的节点分享码。
表1示意性示出本示例性实施例中的一信息分享数据表，其中，SId表示各分享节点的标识，SLinkId表示各分享节点的分享码，PId表示父节点标识，PLinkId表示父节点分 享码，ItemCode表示分享信息的标识：
表1
SId PId ItemCode PlinkId SLinkId
S1 Null 1001 Null 1
S2 S1 1001 1 2
S3 S2 1001 2 3
S4 S3 1001 3 4
S5 S1 1001 1 5
S6 S3 1001 5 6
S7 S6 1001 6 7
信息分享数据表的建立过程可以是：每个分享节点在进行分享操作时，可以调用后台接口，为该节点生成唯一的标识和分享码，将其存储于数据库中，而每一节点的父节点标识和父节点分享码可以由该父节点的子节点的标识和分享码确定。举例说明，在上述示例中，当分享信息到达分享节点S1时，生成唯一标识“S1”以及分享码“1”，以及分享信息的标识“1001”，将其存储于数据库中；当分享信息到达S2节点时，生成唯一标识“S2”，传递记录分享信息的标识“1001”，查找当前节点S2的父节点的节点标识“S1”作为当前节点S2的父节点标识，并根据父节点S1的分享码“1”加1得到当前节点S2的分享码“2”，再将当前节点S2的父节点S1的唯一标识“S1”和分享码“1”存储于数据库中；以此类推，从而实现在数据库中建立信息分享数据表。基于本示例性实施例的方式建立的信息分享数据表，结合表1可以看出，虽然节点S3既是节点S4的父节点，也是节点S6的父节点，但在信息分享数据表中节点S4的父节点分享码与节点S6的父节点分享码却不相同，说明信息分享至这两个节点虽然都经过了节点S3，但路径却有较大差别。本示例性实施例通过在信息分享过程中，记录信息到达的每一个节点的节点标识、节点分享码、父节点标识、父节点分享码以及分享信息的标识，可以从信息分享数据表中抽取出信息分享的准确路径。
需要说明的是，在本示例性实施例中，包括但不限于使用redis、mysql等数据库，本公开对此不做具体限定。
步骤S130，根据查找结果，生成分享信息的分享链。
其中，查找结果是指在同一条分享路径上的包括目标节点在内的查找到的部分或所有的分享节点，根据查找到的部分或所有的分享节点，即可以生成本示例性实施例中的分享链。在本示例性实施例中，可以根据需要确定分享信息在分享过程中的链的长度，即可以以分享信息本身作为分享链的起始节点，也可以以第一级分享节点作为分享链的起始节点，还可以以分享过程中的任意分享节点作为分享链的起始节点等等。例如分享过程为从S1～S10，若S9为目标节点，可以确定S1～S9、S2～S9、……、S8～S9等多条分享链。
在本示例性实施例中，当生成分享信息的分享链后，可以根据需要将该分享链推送至 其他应用场景的服务终端，例如生成社交分享链后，将该分享链推送至可以对社交关系进行分析评估的社交服务终端等。也可以将需要的服务推送给分享链中的全部或部分节点，例如生成社交分享链后，向该分享链中的每一个节点推送感兴趣的其他用户等等，本公开对此不做具体限定。
在一示例性实施例中，步骤S110中，获取目标节点的父节点的信息，可以包括：
步骤S210，获取目标节点的父节点标识、父节点分享码以及分享信息的标识；
进一步的，步骤S120可以包括以下步骤：
步骤S220，根据分享信息的标识，在信息分享数据表中查找分享信息的分享记录信息；
步骤S230，在分享信息的分享记录信息中，根据目标节点的父节点标识、父节点分享码查找目标节点的父节点，其中，目标节点的父节点标识和父节点的节点标识相同，目标节点的父节点分享码和父节点的节点分享码相同；
步骤S240，当查找到目标节点的父节点后，将父节点作为子节点，依次以查找到的父节点为子节点，继续查找上一父节点的信息。
在本示例性实施例中，为了生成分享信息的分享链，在确定目标节点后，可以获取目标节点的父节点标识、父节点分享码以及分享信息的标识。其中，分享信息的标识可以确定进行信息分享的节点是否处于相同的分享过程中，即各分享节点是否分享同一分享信息。考虑到，在实际的分享过程中，可能会出现同一分享信息由不同的父分享节点分享给同一子分享节点，或者同一分享信息分享给不同的子分享节点的情况。如图3所示的信息分享过程示意图，其中“I”表示分享信息，S1～S6、A1～A2、B1～B3、M1～M2表示分享该分享信息的节点，根据图中的分享关系可以看出分享信息的分享链路可以包括“S1-S2-S3-S4-…”、“S1-S3-S6-S5-…”、“B1-B3-A1-A2-…”、“A1-A2-…”、“B1-B2-M1-M2-…”、“M1-M2-…”等等。其中，可以看出节点S3既给S4分享了信息，也给S6分享了信息，而节点S3既是S2的子节点，也是S1的子节点。因此，本示例性实施例可以通过分享信息的标识，在信息分享数据表中查找到分享记录信息，在分享信息的分享记录信息中，获取各节点父节点标识和父节点分享码，即确定处于相同的信息分享过程中的分享节点，并查找目标节点的父节点，以准确的确定分享信息的唯一链路。
结合上述表1，举例说明，以节点S5为目标节点，根据分享信息的标识“1001”确定分享链所分享的对象，获取S5的父节点标识S6以及父节点分享码6，获取节点S6的父节点标识S3以及父节点分享码5，获取节点S3的父节点标识S1以及父节点分享码1，进一步可以确定分享链为“S1-S3-S6-S5”；以S4为目标节点，获取S4的父节点标识S3以及父节点分享码3，获取S3的父节点标识S2和父节点分享码2，获取S2的父节点标识S1和父节点分享码1，得到分享链“S1-S2-S3-S4”。其中，可以看出，S6与S4虽然具有相同的父节点S3，但却是具有不同分享码的S3，因此可以生成两条不同的分享链。
在一示例性实施例中，上述步骤S130可以包括：
当查找到的上一父节点的信息为空值时，根据目标节点与父节点，以及查找到的每个子节点及其父节点的关系生成目标信息的分享链。
在本示例性实施例中，当查找到的上一父节点的信息为空值时，可以认为当前进行信息分享的分享路径中，已经到达分享的起始节点，例如分享信息本身，或者一级分享节点等。因此，可以确定分享链的起始节点，根据找到的目标节点与父节点的关系，以及查找到的每个子节点以及父节点的关系，即每个节点与上一节点的关系，生成目标信息的分享链。
基于上述说明，在本示例性实施例中，响应于分享信息在多个节点间进行信息分享，获取目标节点的父节点的信息，目标节点的父节点为分享分享信息至目标节点的节点，根据目标节点的父节点的信息，在预先建立的信息分享数据表中，查找目标节点的上一父节点，并依次以查找到的父节点为子节点，查找父节点的信息，根据查找结果，生成分享信息的分享链。一方面，本示例性实施例提出一种新的信息分享链的生成方法，通过获取目标节点的父节点信息，追溯与分享信息具有关联的其他节点，生成信息分享链，其过程依赖于父节点信息，使得生成的信息分享链具有较高的准确性；另外，本示例性实施例中信息分享链的生成算法的复杂度较低，生成过程较为简单，无需较高的资源成本，且具有较高的信息分享链的生成效率。
在一示例性实施例中，在生成分享信息的分享链之后，信息分享链的生成方法还可以包括以下步骤：
根据分享链的属性，向分享链中的多个节点发送与属性对应的服务信息。
在本示例性实施例中，不同的应用场景下，可以生成不同属性的分享链。例如基于商品信息所生成的分享链、基于游戏信息所生成的分享链等。基于此，可以根据分享链属性的不同，向分享链中的各个节点推送不同的服务信息，例如生成社交关系的分享链后，可以向该分享链中的各个节点推送社交服务，如好友推送、聊天服务等；生成电商关系的分享链后，可以向该分享链的各个节点推送商品信息或与商品相关的服务，如商品保险服务等；生成游戏关系的分享链后，可以向该分享链的各个节点推送与游戏相关的信息，如游戏内新玩法或新活动等。
图4示出了本示例性实施例中一种信息分享链的生成方法的交互流程图，具体可以包括以下步骤：用户终端410可以设有用于进行分享的客户端或小程序，执行步骤S411，进行信息分享，不同的节点可以具有不同的用户终端，此处仅为示意性说明，对用户终端的数量不做限定；服务器420执行步骤S421，响应于各节点进行信息分享，获取各节点的节点标识、节点分享码、父节点标识、父节点标识码以及分享信息的标识，并将其存储与信息分享数据表中；进一步的，在用户终端410执行步骤S412，目标节点是否根据分享信息触发预设事件；如果否，则继续进行信息分享，以及将各节点信息以及分享信息存储入信息分享数据表中，如果是，则在服务器420执行步骤S422，根据目标节点的父节点信息在预先建立的信息分享数据表中，查找目标节点的上一父节点，并依次以查找到的父节点为子节点，查找上一父节点的信息，并执行步骤S423，根据查找结果，生成分享信息的分享链；当生成各分享链后，可以在服务器420执行步骤S424，将分享链推送给其他应用服务器。
本公开的示例性实施例还提供了一种信息分享链的生成装置。参照图5，该装置500可以包括，信息获取模块510，用于响应于分享信息在多个节点间进行信息分享，获取目标节点的父节点的信息，目标节点的父节点为分享分享信息至目标节点的节点；节点查找模块520，用于根据目标节点的父节点的信息，在预先建立的信息分享数据表中，查找目标节点的父节点，并依次以查找到的父节点为子节点，查找上一父节点的信息；分享链生成模块530，用于根据查找结果，生成分享信息的分享链。
在一示例性实施例中，信息分享链的生成装置还可以包括：判断单元，用于在获取目标节点的父节点的信息之前，如果目标节点根据分享信息触发预设事件，则执行获取目标节点的父节点的信息的步骤。
在一示例性实施例中，预设事件可以包括以下任意一种或多种情况：目标节点浏览分享信息的时间超过一预设时间；目标节点对分享信息进行特定交互操作；目标节点对分享信息的查看频数超过一预设阈值；目标节点将分享信息分享给大于预设数量的其他节点。
在一示例性实施例中，信息分享数据表可以通过以下方式建立：信息记录单元，用于当分享信息到达每个节点时，以分享信息到达的节点为当前节点，记录当前节点的节点标识、节点分享码、父节点标识、父节点分享码以及分享信息的标识；数据表生成单元，用于基于每个节点的节点标识、节点分享码、父节点标识、父节点分享码以及分享信息的标识，生成信息分享数据表。
在一示例性实施例中，信息记录单元可以包括：第一查找子单元，用于查找当前节点的上一节点的节点标识，作为当前节点的父节点标识；第二查找子单元，用于查找当前节点的上一节点的节点分享码，作为当前节点的父节点分享码；节点分享码生成子单元，用于以当前节点的父节点分享码加一作为当前节点的节点分享码。
在一示例性实施例中，信息获取模块可以包括：信息获取单元，用于响应于分享信息在多个节点间进行信息分享，获取目标节点的父节点标识、父节点分享码以及分享信息的标识；节点查找模块包括：信息查找单元，用于根据分享信息的标识，在信息分享数据表中查找分享信息的分享记录信息；父节点确定单元，用于在分享信息的分享记录信息中，根据目标节点的父节点标识、父节点分享码查找目标节点的父节点，其中，目标节点的父节点标识和父节点的节点标识相同，目标节点的父节点分享码和父节点的节点分享码相同；依次查找单元，用于当查找到目标节点的父节点后，将父节点作为子节点，依次以查找到的父节点为子节点，继续查找上一父节点的信息。
在一示例性实施例中，分享链生成模块可以包括：分享链生成单元，用于当查找到的上一父节点的信息为空值时，根据目标节点与父节点，以及查找到的每个子节点及其父节点的关系生成目标信息的分享链。
在一示例性实施例中，信息分享链的生成装置还可以包括：信息推送模块，用于在生成分享信息的分享链之后，根据分享链的属性，向分享链中的多个节点发送与属性对应的服务信息。
上述装置中各模块/单元的具体细节在方法部分的实施例中已经详细说明，未披露的细 节内容可以参见方法部分的实施例内容，因此此处不再赘述。
本公开的示例性实施例还提供了一种能够实现上述方法的电子设备。
所属技术领域的技术人员能够理解，本公开的各个方面可以实现为系统、方法或程序产品。因此，本公开的各个方面可以具体实现为以下形式，即：完全的硬件实施方式、完全的软件实施方式(包括固件、微代码等)，或硬件和软件方面结合的实施方式，这里可以统称为“电路”、“模块”或“系统”。
下面参照图6来描述根据本公开的这种示例性实施例的电子设备600。图6显示的电子设备600仅仅是一个示例，不应对本公开实施例的功能和使用范围带来任何限制。
如图6所示，电子设备600以通用计算设备的形式表现。电子设备600的组件可以包括但不限于：上述至少一个处理单元610、上述至少一个存储单元620、连接不同系统组件(包括存储单元620和处理单元610)的总线630、显示单元640。
其中，存储单元存储有程序代码，程序代码可以被处理单元610执行，使得处理单元610执行本说明书上述“示例性方法”部分中描述的根据本公开各种示例性实施方式的步骤。例如，处理单元610可以执行图1所示的步骤S110～S130，也可以执行图2所示的步骤S210～S240等。
存储单元620可以包括易失性存储单元形式的可读介质，例如随机存取存储单元(RAM)621和/或高速缓存存储单元622，还可以进一步包括只读存储单元(ROM)623。
存储单元620还可以包括具有一组(至少一个)程序模块625的程序/实用工具624，这样的程序模块625包括但不限于：操作系统、一个或者多个应用程序、其它程序模块以及程序数据，这些示例中的每一个或某种组合中可能包括网络环境的实现。
总线630可以为表示几类总线结构中的一种或多种，包括存储单元总线或者存储单元控制器、外围总线、图形加速端口、处理单元或者使用多种总线结构中的任意总线结构的局域总线。
电子设备600也可以与一个或多个外部设备800(例如键盘、指向设备、蓝牙设备等)通信，还可与一个或者多个使得用户能与该电子设备600交互的设备通信，和/或与使得该电子设备600能与一个或多个其它计算设备进行通信的任何设备(例如路由器、调制解调器等等)通信。这种通信可以通过输入/输出(I/O)接口650进行。并且，电子设备600还可以通过网络适配器660与一个或者多个网络(例如局域网(LAN)，广域网(WAN)和/或公共网络，例如因特网)通信。如图所示，网络适配器660通过总线630与电子设备600的其它模块通信。应当明白，尽管图中未示出，可以结合电子设备600使用其它硬件和/或软件模块，包括但不限于：微代码、设备驱动器、冗余处理单元、外部磁盘驱动阵列、RAID系统、磁带驱动器以及数据备份存储系统等。
通过以上的实施方式的描述，本领域的技术人员易于理解，这里描述的示例实施方式可以通过软件实现，也可以通过软件结合必要的硬件的方式来实现。因此，根据本公开实施方式的技术方案可以以软件产品的形式体现出来，该软件产品可以存储在一个非易失性存储介质(可以是CD-ROM，U盘，移动硬盘等)中或网络上，包括若干指令以使得一台 计算设备(可以是个人计算机、服务器、终端装置、或者网络设备等)执行根据本公开示例性实施例的方法。
本公开的示例性实施例还提供了一种计算机可读存储介质，其上存储有能够实现本说明书上述方法的程序产品。在一些可能的实施方式中，本公开的各个方面还可以实现为一种程序产品的形式，其包括程序代码，当程序产品在终端设备上运行时，程序代码用于使终端设备执行本说明书上述“示例性方法”部分中描述的根据本公开各种示例性实施方式的步骤。
参考图7所示，描述了根据本公开的示例性实施例的用于实现上述方法的程序产品700，其可以采用便携式紧凑盘只读存储器(CD-ROM)并包括程序代码，并可以在终端设备，例如个人电脑上运行。然而，本公开的程序产品不限于此，在本文件中，可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、装置或者器件使用或者与其结合使用。
程序产品可以采用一个或多个可读介质的任意组合。可读介质可以是可读信号介质或者可读存储介质。可读存储介质例如可以为但不限于电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。可读存储介质的更具体的例子(非穷举的列表)包括：具有一个或多个导线的电连接、便携式盘、硬盘、随机存取存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。
计算机可读信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了可读程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。可读信号介质还可以是可读存储介质以外的任何可读介质，该可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。
可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于无线、有线、光缆、RF等等，或者上述的任意合适的组合。
可以以一种或多种程序设计语言的任意组合来编写用于执行本公开操作的程序代码，程序设计语言包括面向对象的程序设计语言—诸如Java、C++等，还包括常规的过程式程序设计语言—诸如“C”语言或类似的程序设计语言。程序代码可以完全地在用户计算设备上执行、部分地在用户设备上执行、作为一个独立的软件包执行、部分在用户计算设备上部分在远程计算设备上执行、或者完全在远程计算设备或服务器上执行。在涉及远程计算设备的情形中，远程计算设备可以通过任意种类的网络，包括局域网(LAN)或广域网(WAN)，连接到用户计算设备，或者，可以连接到外部计算设备(例如利用因特网服务提供商来通过因特网连接)。
此外，上述附图仅是根据本公开示例性实施例的方法所包括的处理的示意性说明，而不是限制目的。易于理解，上述附图所示的处理并不表明或限制这些处理的时间顺序。另外，也易于理解，这些处理可以是例如在多个模块中同步或异步执行的。
应当注意，尽管在上文详细描述中提及了用于动作执行的设备的若干模块或者单元，但是这种划分并非强制性的。实际上，根据本公开的示例性实施例，上文描述的两个或更多模块或者单元的特征和功能可以在一个模块或者单元中具体化。反之，上文描述的一个模块或者单元的特征和功能可以进一步划分为由多个模块或者单元来具体化。
本领域技术人员在考虑说明书及实践这里公开的发明后，将容易想到本公开的其他实施例。本申请旨在涵盖本公开的任何变型、用途或者适应性变化，这些变型、用途或者适应性变化遵循本公开的一般性原理并包括本公开未公开的本技术领域中的公知常识或惯用技术手段。说明书和实施例仅被视为示例性的，本公开的真正范围和精神由权利要求指出。
应当理解的是，本公开并不局限于上面已经描述并在附图中示出的精确结构，并且可以在不脱离其范围进行各种修改和改变。本公开的范围仅由所附的权利要求来限。

Claims (11)

  1. 一种信息分享链的生成方法，其特征在于，包括：
    响应于分享信息在多个节点间进行信息分享，获取目标节点的父节点的信息，所述目标节点的父节点为分享所述分享信息至所述目标节点的节点；
    根据所述目标节点的父节点的信息，在预先建立的信息分享数据表中，查找所述目标节点的父节点，并依次以查找到的父节点为子节点，查找上一父节点的信息；
    根据查找结果，生成所述分享信息的分享链。
  2. 根据权利要求1所述的方法，其特征在于，在获取所述目标节点的父节点的信息之前，所述方法还包括：
    如果所述目标节点根据所述分享信息触发预设事件，则执行获取所述目标节点的父节点的信息的步骤。
  3. 根据权利要求2所述的方法，其特征在于，所述预设事件包括以下任意一种或多种情况：
    所述目标节点浏览所述分享信息的时间超过一预设时间；
    所述目标节点对所述分享信息进行特定交互操作；
    所述目标节点对所述分享信息的查看频数超过一预设阈值；
    所述目标节点将所述分享信息分享给大于预设数量的其他节点。
  4. 根据权利要求1所述的方法，其特征在于，所述信息分享数据表通过以下方式建立：
    当所述分享信息到达每个节点时，以所述分享信息到达的节点为当前节点，记录所述当前节点的节点标识、节点分享码、父节点标识、父节点分享码以及所述分享信息的标识；
    基于所述每个节点的节点标识、节点分享码、父节点标识、父节点分享码以及所述分享信息的标识，生成所述信息分享数据表。
  5. 根据权利要求4所述的方法，其特征在于，所述记录所述当前节点的节点标识、节点分享码、父节点标识、父节点分享码以及所述分享信息的标识，包括：
    查找所述当前节点的上一节点的节点标识，作为所述当前节点的父节点标识；
    查找所述当前节点的上一节点的节点分享码，作为所述当前节点的父节点分享码；
    以所述当前节点的父节点分享码加一作为所述当前节点的节点分享码。
  6. 根据权利要求4所述的方法，其特征在于，所述获取目标节点的父节点的信息，包括：
    获取所述目标节点的父节点标识、父节点分享码以及所述分享信息的标识；
    所述根据所述目标节点的父节点的信息，在预先建立的信息分享数据表中，查找所述目标节点的父节点，并依次以查找到的父节点为子节点，查找上一父节点的信息，包括：
    根据所述分享信息的标识，在所述信息分享数据表中查找所述分享信息的分享记录信息；
    在所述分享信息的分享记录信息中，根据所述目标节点的父节点标识、父节点分享码查找所述目标节点的父节点，其中，所述目标节点的父节点标识和所述父节点的节点标识相同，所述目标节点的父节点分享码和所述父节点的节点分享码相同；
    当查找到所述目标节点的父节点后，将所述父节点作为子节点，依次以查找到的父节点为子节点，继续查找上一父节点的信息。
  7. 根据权利要求6所述的方法，其特征在于，所述根据查找结果，生成所述分享信息的分享链，包括：
    当查找到的上一父节点的信息为空值时，根据所述目标节点，以及查找到的每个子节点及其父节点的关系生成所述目标信息的分享链。
  8. 根据权利要求1所述的方法，其特征在于，在生成所述分享信息的分享链之后，所述方法还包括：
    根据所述分享链的属性，向所述分享链中的多个节点发送与所述属性对应的服务信息。
  9. 一种信息分享链的生成装置，其特征在于，包括：
    信息获取模块，用于响应于分享信息在多个节点间进行信息分享，获取目标节点的父节点的信息，所述目标节点的父节点为分享所述分享信息至所述目标节点的节点；
    节点查找模块，用于根据所述目标节点的父节点的信息，在预先建立的信息分享数据表中，查找所述目标节点的父节点，并依次以查找到的父节点为子节点，查找上一父节点的信息；
    分享链生成模块，用于根据查找结果，生成所述分享信息的分享链。
  10. 一种电子设备，其特征在于，包括：
    处理器；以及
    存储器，用于存储所述处理器的可执行指令；
    其中，所述处理器配置为经由执行所述可执行指令来执行权利要求1-8任一项所述的方法。
  11. 一种计算机可读存储介质，其上存储有计算机程序，其特征在于，所述计算机程序被处理器执行时实现权利要求1-8任一项所述的方法。
PCT/CN2020/134562 2019-12-23 2020-12-08 信息分享链的生成方法及装置、电子设备、存储介质 WO2021129379A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US17/757,831 US20230033804A1 (en) 2019-12-23 2020-12-08 Information sharing chain generation method and apparatus, electronic device, and storage medium
EP20905783.5A EP4050853A4 (en) 2019-12-23 2020-12-08 INFORMATION SHARING CHANNEL GENERATION METHOD AND APPARATUS AND STORAGE MEDIUM

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201911335770.0A CN110912809B (zh) 2019-12-23 2019-12-23 信息分享链的生成方法及装置、电子设备、存储介质
CN201911335770.0 2019-12-23

Publications (1)

Publication Number Publication Date
WO2021129379A1 true WO2021129379A1 (zh) 2021-07-01

Family

ID=69827159

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/134562 WO2021129379A1 (zh) 2019-12-23 2020-12-08 信息分享链的生成方法及装置、电子设备、存储介质

Country Status (4)

Country Link
US (1) US20230033804A1 (zh)
EP (1) EP4050853A4 (zh)
CN (1) CN110912809B (zh)
WO (1) WO2021129379A1 (zh)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110912809B (zh) * 2019-12-23 2021-09-17 京东数字科技控股有限公司 信息分享链的生成方法及装置、电子设备、存储介质
CN112347385A (zh) * 2020-09-25 2021-02-09 北京淇瑀信息科技有限公司 链接分享方法、装置及电子设备
CN112184319A (zh) * 2020-09-30 2021-01-05 北京绿善心星球网络科技开发有限公司 用户关系建立方法、装置、电子设备及可读存储介质
CN113641729B (zh) * 2021-08-16 2024-02-20 中国银行股份有限公司 热点知识确定方法、装置、服务器、介质及产品
CN114745421B (zh) * 2022-03-30 2023-10-10 北京奇艺世纪科技有限公司 裂变路径数据的记录方法、装置、服务器及存储介质

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7203701B1 (en) * 2002-02-20 2007-04-10 Trilogy Development Group, Inc. System and method for an interface to provide visualization and navigation of a directed graph
US20130311327A1 (en) * 2012-05-21 2013-11-21 Reza Tehrani Wish list for social networking site
CN103605661A (zh) * 2013-10-18 2014-02-26 清华大学 社会网络信息传播树生成方法及系统
CN104778210A (zh) * 2015-03-13 2015-07-15 国家计算机网络与信息安全管理中心 一种微博转发树和转发森林构建方法
CN106157155A (zh) * 2016-07-27 2016-11-23 北京大学 基于地图隐喻的社交媒体信息传播可视化分析方法及系统
CN106503230A (zh) * 2016-11-07 2017-03-15 贾志娟 一种基于复杂网络的微博传播溯源方法
CN107222381A (zh) * 2016-03-21 2017-09-29 北大方正集团有限公司 微博数据的传播路径确定方法和装置
CN107274221A (zh) * 2017-06-12 2017-10-20 王亚杰 一种页面网络推广方法及系统
CN110912809A (zh) * 2019-12-23 2020-03-24 京东数字科技控股有限公司 信息分享链的生成方法及装置、电子设备、存储介质

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9049249B2 (en) * 2012-11-26 2015-06-02 Linkedin Corporation Techniques for inferring an organizational hierarchy from a social graph
CN103384210B (zh) * 2013-06-25 2016-03-30 深圳市国电科技通信有限公司 宽带通信网络拓扑扫描的方法
CN105069003B (zh) * 2015-06-15 2018-06-29 北京工业大学 一种基于转发链相似度的用户关注对象推荐计算方法
US20170286558A1 (en) * 2016-04-01 2017-10-05 Buzzfeed, Inc. Tracking Internet Sharing Using Augmented URLs
CN108268521A (zh) * 2016-12-30 2018-07-10 北京国双科技有限公司 传播路径图的生成方法及装置
US10158558B1 (en) * 2017-01-19 2018-12-18 Cisco Technology, Inc. Segment routing of packets according to a multicast distribution tree in a network
CN107730205A (zh) * 2017-10-12 2018-02-23 如是科技（大连）有限公司 招聘信息的分享行为的记录方法及装置

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7203701B1 (en) * 2002-02-20 2007-04-10 Trilogy Development Group, Inc. System and method for an interface to provide visualization and navigation of a directed graph
US20130311327A1 (en) * 2012-05-21 2013-11-21 Reza Tehrani Wish list for social networking site
CN103605661A (zh) * 2013-10-18 2014-02-26 清华大学 社会网络信息传播树生成方法及系统
CN104778210A (zh) * 2015-03-13 2015-07-15 国家计算机网络与信息安全管理中心 一种微博转发树和转发森林构建方法
CN107222381A (zh) * 2016-03-21 2017-09-29 北大方正集团有限公司 微博数据的传播路径确定方法和装置
CN106157155A (zh) * 2016-07-27 2016-11-23 北京大学 基于地图隐喻的社交媒体信息传播可视化分析方法及系统
CN106503230A (zh) * 2016-11-07 2017-03-15 贾志娟 一种基于复杂网络的微博传播溯源方法
CN107274221A (zh) * 2017-06-12 2017-10-20 王亚杰 一种页面网络推广方法及系统
CN110912809A (zh) * 2019-12-23 2020-03-24 京东数字科技控股有限公司 信息分享链的生成方法及装置、电子设备、存储介质

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4050853A4 *

Also Published As

Publication number Publication date
US20230033804A1 (en) 2023-02-02
EP4050853A1 (en) 2022-08-31
EP4050853A4 (en) 2023-12-06
CN110912809A (zh) 2020-03-24
CN110912809B (zh) 2021-09-17

Similar Documents

Publication Publication Date Title
WO2021129379A1 (zh) 信息分享链的生成方法及装置、电子设备、存储介质
CN106357517B (zh) 定向标签生成方法及装置
CN108280115B (zh) 识别用户关系的方法及装置
WO2018024057A1 (zh) 用于访问业务的方法和装置
WO2020156236A1 (zh) 关联信息的推送方法、装置，电子设备及存储介质
US20140325391A1 (en) System and method for updating information in an instant messaging application
US11423090B2 (en) People relevance platform
CN109862100B (zh) 用于推送信息的方法和装置
CN111913875A (zh) 用于基于软件执行跟踪自动加标签的方法和系统
CN113127307A (zh) 溯源请求的处理方法、相关装置、系统及存储介质
CN105337841A (zh) 一种信息处理方法和系统、客户端和服务器
CN108932640B (zh) 用于处理订单的方法和装置
US10880261B2 (en) Personal web address management system
CN112258244B (zh) 确定目标物品所属任务的方法、装置、设备及存储介质
CN107291923B (zh) 信息处理方法和装置
CN111488386A (zh) 数据查询方法和装置
US20180049020A1 (en) Server apparatus, program, data transmission and reception method, and terminal device
US20200118016A1 (en) Data attribution using frequent pattern analysis
CN110262856B (zh) 一种应用程序数据采集方法、装置、终端及存储介质
CN110716911B (zh) 数据处理方法及装置、电子设备、存储介质
CN113505284A (zh) 资源数据溯源方法、装置、存储介质及电子设备
CN108874625B (zh) 信息处理方法及装置、电子设备、存储介质
CN112100534A (zh) 页面分享中的信息处理方法、装置、介质及电子设备
CN108173934B (zh) 应用信息显示方法及装置、终端、服务器及存储介质
CN112035581A (zh) 基于模型的任务处理方法、装置、设备和介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20905783

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2020905783

Country of ref document: EP

Effective date: 20220523

NENP Non-entry into the national phase

Ref country code: DE