Information acquisition method, device, server and storage medium

Abstract

The present disclosure relates to an information acquisition method, apparatus, server, and storage medium. The method includes: obtaining a first graph identifier of each first graph, where the first graph includes at least one original graph identifier, and the original graph to which the original graph identifier belongs includes at least one device identifier; generating first association data indicating an association relationship between the first graph identifiers; wherein, for two first graph identifiers having an association relationship, each first graph to which the two first graph identifiers belong includes original graph identifiers related to the two first graph identifiers; based on each first graph identifier and the first association data, connecting the first graphs having an association relationship to obtain at least one second graph and a second graph identifier of each second graph.

Description

Technical Field

[0001] The present disclosure relates to the field of the Internet, and specifically to an information acquisition method, apparatus, server, and storage medium. Background Art

[0002] Graph connection is a common data mining means for determining device identifiers belonging to the same device. The process of graph connection is based on the association relationship between graph identifiers. In the related art, each graph targeted in the process of graph connection is a graph including device identifiers. Whether there is an association relationship between two graph identifiers is determined according to whether the graphs to which the two graph identifiers belong include the same device identifiers. In order to determine the association relationship between graph identifiers, it is necessary to access the device identifiers in each graph to determine whether any two graphs include the same device identifiers. On the one hand, the number of device identifiers is large, and accessing a large number of device identifiers consumes a lot of resources, resulting in a lot of resources consumed in determining the association relationship between graph identifiers and a lot of resources consumed in the process of graph connection. On the other hand, in the process of graph connection, it is necessary to load each graph targeted in the process of graph connection into the memory, and the storage space of the memory occupied by each graph targeted in the process of graph connection is the storage space of the memory occupied by all device identifiers. The number of device identifiers is large, and the storage space of the memory occupied by each graph targeted in the process of graph connection is large. Summary of the Invention

[0003] The present disclosure provides an information acquisition method, apparatus, server, and storage medium to at least solve the problems that a lot of resources are consumed in the process of graph connection in the related art and the storage space of the memory occupied by each graph targeted in the process of graph connection is large. The technical solution of the present disclosure is as follows:

[0004] According to the first aspect of the embodiments of the present disclosure, an information acquisition method is provided, including:

[0005] Obtain a first graph identifier of each first graph, where the first graph includes: at least one original graph identifier, and the original graph to which the original graph identifier belongs includes at least one device identifier;

[0006] Generate first association data indicating the association relationship between the first graph identifiers; wherein, for two first graph identifiers having an association relationship, each first graph to which each of the two first graph identifiers belongs includes an original graph identifier related to the two first graph identifiers;

[0007] Based on each first graph identifier and the first association data, perform graph connection on the first graphs having an association relationship to obtain at least one second graph and a second graph identifier of each second graph.

[0008] According to the second aspect of the embodiments of the present disclosure, an information acquisition apparatus is provided, including:

[0009] An acquisition module, configured to acquire a first figure identifier of each first figure, where the first figure includes: at least one original figure identifier, and the original figure to which the original figure identifier belongs includes at least one device identifier;

[0010] A generation module, configured to generate first association data indicating an association relationship between the first figure identifiers; wherein, for two first figure identifiers having an association relationship, each first figure to which each of the two first figure identifiers belongs includes an original figure identifier related to the two first figure identifiers;

[0011] A first connection module, configured to perform figure connection on the first figures having an association relationship based on each first figure identifier and the first association data, to obtain at least one second figure and a second figure identifier of each second figure.

[0012] According to a third aspect of the embodiments of the present disclosure, there is provided a server, including:

[0013] A processor;

[0014] A memory for storing executable instructions of the processor;

[0015] Wherein, the processor is configured to execute the instructions to implement the method according to any one of the first aspect.

[0016] According to a fourth aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium, when the instructions in the computer-readable storage medium are executed by a processor of a server, enabling the server to execute the method according to any one of the first aspect.

[0017] According to a fifth aspect of the embodiments of the present disclosure, there is provided a computer program product, including computer-readable code, when the computer-readable code runs on a server, enabling the server to execute the method according to any one of the first aspect.

[0018] The technical solutions provided by the embodiments of the present disclosure may include the following beneficial effects:

[0019] Performing figure connection on the first figures. Since the number of first figure identifiers is less than the number of device identifiers, determining the association relationship between the first figure identifiers in the present disclosure only needs to access the first figure identifiers in each first figure. Determining the association relationship between the figure identifiers in the present disclosure consumes less resources, and the process of figure connection consumes and occupies less resources, saving the resources consumed in the process of figure connection and improving the efficiency of figure connection.

[0020] It should be understood that the above general description and the following detailed description are only exemplary and explanatory, and cannot limit the present disclosure. Description of the Drawings

[0021] The accompanying drawings herein are incorporated into the specification and constitute a part of this specification, showing embodiments consistent with the present disclosure, and are used together with the specification to explain the principles of the present disclosure, and do not constitute an improper limitation of the present disclosure.

[0022] Figure 1 is a flowchart of an embodiment of an information acquisition method shown according to an exemplary embodiment;

[0023] Figure 2 is a schematic flowchart of performing multiple graph connections;

[0024] Figure 3 is a structural block diagram of an information acquisition device shown according to an exemplary embodiment;

[0025] Figure 4 is a structural block diagram of a server shown according to an exemplary embodiment. Detailed Embodiments

[0026] In order to enable those of ordinary skill in the art to better understand the technical solutions of the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.

[0027] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned accompanying drawings are used to distinguish similar objects, and do not necessarily need to describe a specific order or sequence. It should be understood that such used data can be interchanged under appropriate circumstances so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. On the contrary, they are merely examples of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

[0028] Figure 1 is a flowchart of an embodiment of an information acquisition method shown according to an exemplary embodiment. The method includes the following steps:

[0029] Step 101, obtain a first graph identifier for each first graph.

[0030] In the present disclosure, the first graph includes: at least one original graph identifier, and the original graph to which the original graph identifier belongs includes at least one device identifier. For each device identifier, the device identifier can be an identifier of a software module or a hardware module on a terminal. Each original graph identifier belongs to an original graph respectively.

[0031] Multiple associated data can be obtained from a server for storing associated data, and each associated data can be used as an original graph respectively. The associated data includes one or more device identifiers. Each associated data can be used as an original graph respectively. The associated data is detected by a terminal for detecting associated data. The number of terminals for detecting associated data is multiple. For any terminal for detecting associated data, the terminal detects one or more device identifiers belonging to the terminal from one or more data packets generated on the terminal each time, and generates an associated data including one or more device identifiers belonging to the terminal. When the number of device identifiers belonging to the terminal detected in one detection is multiple, each device identifier belonging to the terminal comes from a data packet respectively. The terminal sends the associated data to the server for storing associated data.

[0032] For example, for a terminal for detecting associated data, the terminal detects the device identifier A belonging to the terminal and the device identifier B belonging to the terminal from two data packets generated on the terminal within a period of time, and the terminal sends the associated data including the device identifier A and the device identifier B to the server for storing associated data. The terminal detects the device identifier B belonging to the terminal and the device identifier C belonging to the terminal from two data packets generated on the terminal within another period of time, and the terminal sends the associated data including the device identifier B and the device identifier C to the server for storing associated data.

[0033] In the present disclosure, each associated data can be used as an original graph respectively. Before obtaining the first graph identifier of each first graph, each first graph can be determined in advance according to the original graph icon of each original graph. The IP address corresponding to the original graph can be obtained. The IP address corresponding to the original graph is the IP address of the terminal that sends the original graph. The terminal that sends the original graph can send the IP address of the terminal and the original Figure 1 graph to the server for storing associated data. The IP address corresponding to each original graph can be obtained from the server for storing associated data. Each first graph can be determined according to the IP address corresponding to each original graph. If the IP address corresponding to an original graph is different from the IP address corresponding to any other original graph, a first graph including only the original graph identifier of the original graph is generated. If there are multiple original graphs with the same corresponding IP address, a first graph including the original graph identifiers of each original graph in the multiple original graphs is generated.

[0034] In some embodiments, before obtaining the first graph identifier of each first graph, it further includes: generating an original graph identifier for each original graph; generating original association data indicating the association relationship between the original graph identifiers, wherein for two original graph identifiers having an association relationship, the original graphs to which each of the two original graph identifiers belongs both include a device identifier related to the two original graph identifiers; based on each original graph identifier and the original association data, performing graph connection on the original graphs having an association relationship to obtain each first graph and the first graph identifier of each first graph.

[0035] In the present disclosure, a string can be preset, and at the same time, multiple different numbers can be preset. When generating the original graph identifier for each original graph, a number can be assigned to each original Figure 1 graph, and the numbers assigned to each original graph are different. For each original graph, the preset string can be concatenated with the number assigned to the original graph to form the original graph identifier of the original graph.

[0036] In the present disclosure, for a device identifier and two original graph identifiers, if the original graphs to which each of the two original graph identifiers belongs both include the device identifier, then the original graph identifier is the device identifier related to the two original graph identifiers. For two original graph identifiers, if there is a device identifier related to the two original graph identifiers, then the two original identifiers have an association relationship.

[0037] In the present disclosure, for any two original graph identifiers, it can be determined whether the two original graph identifiers have an association relationship according to whether there is a device identifier related to the two original graph identifiers. After determining whether any two original graph identifiers have an association relationship, original association data indicating the association relationship between the original graph identifiers can be generated.

[0038] In the present disclosure, when performing graph connection on the original graphs having an association relationship based on each original graph identifier and the original association data, each original graph identifier and the original association data can be used as the input of a graph connection algorithm such as the maximum connected component algorithm, and the graph connection algorithm performs graph connection on the original graphs having an association relationship based on each original graph identifier and the original association data to obtain each first graph and the first graph identifier of each first graph.

[0039] In the present disclosure, it is possible to perform graph connection on the original graphs having an association relationship based on each original graph identifier and the original association data to obtain each first graph and the first graph identifier of each first graph. The original association data indicates the association relationship between the original graph identifiers, and the association relationship between the original graph identifiers is actually the association relationship between the original graphs. When obtaining each first graph, the association relationship between the original graphs is considered, and the accuracy of each obtained first graph is relatively high.

[0040] In some embodiments, the original graph identifier for generating each original graph includes: generating a random number corresponding to each original graph respectively, where the random numbers corresponding to each original graph are different; for each original graph, using the random number corresponding to the original graph as the original graph identifier of the original graph.

[0041] For each original graph, the random number corresponding to the original graph can be generated by a random number generation algorithm. The random numbers corresponding to each original graph are different. For each original graph, using the random number corresponding to the original graph as the original graph identifier of the original graph.

[0042] In the present disclosure, when generating the original graph identifier for each original graph, it is only necessary to generate the random number corresponding to each original graph, use the random number corresponding to each original graph as the original graph identifier of each original graph, and the resources consumed for generating the original graph identifier of each original graph are less.

[0043] Step 102, generate first association data indicating the association relationship between the first graph identifiers.

[0044] In the present disclosure, for two first graph identifiers having an association relationship, each first graph to which each first graph identifier belongs among the two first graph identifiers includes an original graph identifier related to the two first graph identifiers.

[0045] In the present disclosure, for one original graph identifier and two first graph identifiers, if each first graph to which each first graph identifier belongs among the two first graph identifiers includes the original graph identifier, then the original graph identifier is a device identifier related to the two first graph identifiers.

[0046] For two first graph identifiers, if there exists an original graph identifier related to the two first graph identifiers, then the two first graph identifiers have an association relationship.

[0047] For two first graph identifiers, when determining whether the two first graph identifiers have an association relationship, for the first graph identifier among the two first graph identifiers, an array corresponding to the first graph identifier can be created, and each original graph identifier in the first graph to which the first graph identifier belongs is accessed in sequence. Each time an original graph identifier is accessed, the original graph identifier is added to the corresponding position in the array corresponding to the first graph identifier, and the Nth original graph identifier accessed is used as the Nth array element in the array corresponding to the first graph identifier. The union of the arrays corresponding to the two first graph identifiers is calculated by using the existing method for calculating the union of two arrays. If the calculated union is not empty, it indicates that there exists a device identifier related to the two first graph identifiers, and the two first graph identifiers have an association relationship. If the calculated union is empty, it indicates that there does not exist a device identifier related to the two first graph identifiers, and the two first graph identifiers do not have an association relationship.

[0048] For any two first graph identifiers, it is possible to determine whether there is an association relationship between the two first graph identifiers based on whether there are original graph identifiers related to the two first graph identifiers. After determining whether there is an association relationship between any two first graph identifiers, first association data indicating the association relationship between the first graph identifiers can be generated.

[0049] Step 103: Based on each first graph identifier and the first association data, perform graph connection on the first graphs with an association relationship to obtain at least one second graph and the second graph identifier of each second graph.

[0050] In the present disclosure, when performing graph connection on the first graphs with an association relationship based on each first graph identifier and the first association data, each first graph identifier and the first association data can be used as inputs to a graph connection algorithm such as the maximum connected subgraph algorithm. The graph connection algorithm performs graph connection on the first graphs with an association relationship based on each first graph identifier and the first association data, and obtains at least one second graph and the second graph identifier of each second graph.

[0051] In the present disclosure, the second graph includes: a first graph identifier. The number of first graph identifiers in the second graph is one or more.

[0052] The principle of the graph connection algorithm for graph connection is: based on the association relationship between the corresponding nodes, determine multiple corresponding nodes that can be combined into a new graph, and generate a new graph including the multiple corresponding nodes that can be combined into the new graph.

[0053] For the graph connection algorithm, each first graph identifier can be used as a node respectively. The graph connection algorithm determines whether there are multiple first graph identifiers that can be combined into a second graph based on the association relationship between the nodes, that is, the association relationship between the first graph identifiers. If so, a second graph including the multiple first graph identifiers that can be combined into the second graph is generated. For a first graph identifier, if the graph connection algorithm determines based on the association relationship between the nodes that the first graph identifier cannot be combined with any other first graph identifier, then the first graph identifier serves as a second graph.

[0054] Compared with the prior art where determining the association relationship between graph identifiers requires accessing the device identifiers in each graph, determining the association relationship between the first graph identifiers in the present disclosure only requires accessing the first graph identifiers in each first graph. Since the number of first graph identifiers is less than the number of device identifiers, therefore, compared with the resources consumed by determining the association relationship between graph identifiers in the prior art, the resources consumed by determining the association relationship between graph identifiers in the present disclosure are less, and the resources consumed in the graph connection process in the present disclosure are less, saving the resources consumed in the graph connection process, thereby improving the efficiency of graph connection.

[0055] In some embodiments, after connecting the first graphs with an association relationship based on each first graph identifier and the first association data to obtain at least one second graph and the second graph identifier of each second graph, the method further includes: generating second association data indicating the association relationship between the second graph identifiers, where, for two second graph identifiers with an association relationship, each second graph to which each of the two second graph identifiers belongs includes the first graph identifier related to the two second graph identifiers; connecting the second graphs with an association relationship based on the second graph identifier of each second graph and the second association data to obtain at least one third graph and the third graph identifier of each third graph; when the number of second graphs is the same as the number of third graphs, determining at least one set of target device identifiers based on each second graph, where each device identifier in the set of target device identifiers belongs to the same device.

[0056] In the present disclosure, for a first graph identifier and two second graph identifiers, if each second graph to which each of the two second graph identifiers belongs includes the first graph identifier, then the first graph identifier is the first graph identifier related to the two second graph identifiers.

[0057] For two second graph identifiers, if there exists a first graph identifier related to the two second graph identifiers, then the two second graph identifiers have an association relationship.

[0058] For any two second graph identifiers, it is possible to determine whether the two second graph identifiers have an association relationship based on whether there exists a first graph identifier related to the two second graph identifiers. After determining whether any two second graph identifiers have an association relationship, second association data indicating the association relationship between the second graph identifiers can be generated.

[0059] In the present disclosure, when connecting the second graphs with an association relationship based on the second graph identifier of each second graph and the second association data, each second graph identifier and the second association data are used as inputs to a graph connection algorithm, such as the maximum connected subgraph algorithm. The graph connection algorithm connects the second graphs with an association relationship based on each second graph identifier and the second association data to obtain at least one third graph and the third graph identifier of each third graph.

[0060] For the graph connection algorithm, each second graph identifier can be regarded as a node respectively. The graph connection algorithm determines whether there are multiple second graph identifiers that can be combined into a third graph based on the association relationship between the nodes, that is, the association relationship between the second graph identifiers. If so, a third graph including the multiple second graph identifiers that can be combined into the third graph is generated. For a second graph identifier, if the graph connection algorithm determines based on the association relationship between the nodes that the second graph identifier cannot be combined with any other second graph identifier, then the second graph identifier serves as a third graph.

[0061] In the present disclosure, when the number of second diagrams is the same as the number of third diagrams, at least one set of target device identifiers can be determined based on each second diagram. Each device identifier in the set of target device identifiers belongs to the same device. The number of second diagrams is the same as the number of sets of target device identifiers. Through one second diagram, one set of target device identifiers can be determined.

[0062] For one second diagram, the original diagram identifiers in each first diagram corresponding to the second diagram can be aggregated to obtain a set of original diagram identifiers corresponding to the second diagram. The first diagrams corresponding to the second diagram are the first diagrams having the first diagram identifier in the second diagram. Then, the device identifiers in the original diagrams to which each of the original diagram identifiers in the set of original diagram identifiers belongs are aggregated to obtain a set of target device identifiers.

[0063] In the present disclosure, when the number of second diagrams is the same as the number of third diagrams, at least one set of target device identifiers can be determined based on each second diagram. When the number of second diagrams is the same as the number of third diagrams, it means that each second diagram identifier serves as a third diagram respectively, and any two second diagram identifiers cannot be combined into a third diagram. The number of second diagrams being the same as the number of third diagrams reflects that the corresponding diagram identifiers have been combined relatively fully. In the case where the corresponding diagram identifiers have been combined relatively fully, determining at least one set of target device identifiers can more accurately determine the device identifiers belonging to the same device.

[0064] In some embodiments, it further includes: when the number of second diagrams is not the same as the number of third diagrams, iteratively performing a graph connection operation until at least one of the following stopping conditions is met: the number of executions of the graph connection operation reaches a threshold, the number of diagrams obtained through the most recent graph connection operation is one, the number of diagrams obtained through the most recent graph connection operation is the same as the number of diagrams obtained through the previous graph connection operation before the most recent one; determining at least one set of target device identifiers based on each diagram obtained through the last graph connection operation.

[0065] In the present disclosure, when the number of second diagrams is not the same as the number of third diagrams, the graph connection operation can be iteratively performed. The graph connection operation is the same as the above-mentioned process of graph connection.

[0066] The first graph connection operation is to perform graph connection on the third diagrams having an association relationship based on the third diagram identifier of each third diagram and the data indicating the association relationship between the third diagram identifiers. The Nth graph connection operation is to perform graph connection on the corresponding diagrams having an association relationship based on the corresponding diagram identifier of each corresponding diagram and the data indicating the association relationship between the corresponding diagram identifiers. The corresponding diagram is the diagram obtained through the (N - 1)th graph connection operation.

[0067] In the present disclosure, if the number of executions of the graph connection operation reaches a threshold, the graph connection operation is no longer executed. If the number of graphs obtained through the most recent graph connection operation is one, then the graph identifiers cannot be combined any further, and the graph connection operation is no longer executed. If the number of graphs obtained through the most recent graph connection operation is the same as the number of graphs obtained through the graph connection operation immediately preceding the most recent one, then the graph connection operation is no longer executed.

[0068] In the present disclosure, when at least one stop condition is satisfied, based on each graph obtained through the last graph connection operation, at least one set of target device identifiers is determined. The number of graphs obtained through the last graph connection operation is the same as the number of sets of target device identifiers. One graph obtained through the last graph connection operation can be used to determine one set of target device identifiers.

[0069] In the present disclosure, when determining one set of target device identifiers based on one graph obtained through the last graph connection operation, each original graph associated with the graph can be determined, and a tree structure of the graph can be established. The root node in the tree structure represents the graph, and the layer where the root node is located is the first layer in the top-to-bottom direction. For a node in the Nth layer in the top-to-bottom direction, where N is not equal to 1, the child nodes of the node are located in the (N + 1)th layer in the top-to-bottom direction, and the graphs represented by the child nodes are the graphs to which the graph identifiers in the graph represented by the node belong. For one graph obtained through the last graph connection operation, the graphs represented by the leaf nodes in the tree structure of the graph are the original graphs associated with the graph, and the leaf nodes are the nodes in the last layer in the top-to-bottom direction. For one graph obtained through the last graph connection operation, the device identifiers in each original graph associated with the graph can be aggregated to obtain one set of target device identifiers.

[0070] In the present disclosure, when the number of second graphs is different from the number of third graphs, the graph connection operation can be iteratively executed until at least one of the following stop conditions is satisfied, and based on each graph obtained through the last graph connection operation, at least one set of target device identifiers is determined. Satisfying at least one stop condition reflects that the corresponding graph identifiers have been combined relatively sufficiently. In the case where the corresponding graph identifiers have been combined relatively sufficiently, determining at least one set of target device identifiers can more accurately determine the device identifiers belonging to the same device.

[0071] Please refer to Figure 2 , which shows a schematic flowchart of performing multiple graph connections.

[0072] Based on each first graph identifier and first associated data, perform graph connection on the first graphs having an association relationship to obtain at least one second graph and the second graph identifier of each second graph. Based on the second graph identifier of each second graph and second associated data, perform graph connection on the second graphs having an association relationship to obtain at least one third graph and the third graph identifier of each third graph. When the number of second graphs is the same as the number of third graphs, determine at least one set of target device identifiers based on each second graph. When the number of second graphs is different from the number of third graphs, iteratively perform the graph connection operation. When at least one stop condition is satisfied, at least one set of target device identifiers can be determined based on each graph obtained through the last graph connection operation.

[0073] Figure 3 is a structural block diagram of an information acquisition device shown according to an exemplary embodiment. Refer to Figure 3 , the information acquisition device includes: an acquisition module 301, a generation module 302, and a first connection module 303.

[0074] The acquisition module 301 is configured to acquire the first graph identifier of each first graph, where the first graph includes: at least one original graph identifier, and the original graph to which the original graph identifier belongs includes at least one device identifier;

[0075] The generation module 302 is configured to generate first associated data indicating the association relationship between the first graph identifiers; wherein, for two first graph identifiers having an association relationship, each first graph to which each of the two first graph identifiers belongs includes an original graph identifier related to the two first graph identifiers;

[0076] The first connection module 303 is configured to perform graph connection on the first graphs having an association relationship based on each first graph identifier and the first associated data to obtain at least one second graph and the second graph identifier of each second graph.

[0077] In some embodiments, the information acquisition device further includes:

[0078] A second connection module, configured to generate second association data indicating the association relationship between the second graph identifiers after graph-connecting the first graphs with an association relationship based on each first graph identifier and the first association data to obtain at least one second graph and the second graph identifier of each second graph, wherein, for two second graph identifiers with an association relationship, each second graph to which each of the two second graph identifiers belongs includes the first graph identifier related to the two second graph identifiers; graph-connect the second graphs with an association relationship based on the second graph identifier of each second graph and the second association data to obtain at least one third graph and the third graph identifier of each third graph; when the number of second graphs is the same as the number of third graphs, determine at least one target device identifier set based on each second graph, wherein each device identifier in the target device identifier set belongs to the same device.

[0079] In some embodiments, the information acquisition device further includes:

[0080] A third connection module, configured to iteratively perform the graph connection operation until at least one of the following stop conditions is met when the number of second graphs is different from the number of third graphs: the number of executions of the graph connection operation reaches a threshold, the number of graphs obtained by the most recent graph connection operation is one, the number of graphs obtained by the most recent graph connection operation is the same as the number of graphs obtained by the previous graph connection operation before the most recent one; determine at least one of the target device identifier sets based on each graph obtained by the last graph connection operation.

[0081] In some embodiments, the information acquisition device further includes:

[0082] An original graph connection module, configured to generate an original graph identifier for each original graph before obtaining the first graph identifier of each first graph; generate original association data indicating the association relationship between the original graph identifiers, wherein, for two original graph identifiers with an association relationship, each original graph to which each of the two original graph identifiers belongs includes the device identifier related to the two original graph identifiers; graph-connect the original graphs with an association relationship based on each original graph identifier and the original association data to obtain each first graph and the first graph identifier of each first graph.

[0083] In some embodiments, the original graph connection module is further configured to generate a random number corresponding to each original graph respectively, wherein the random numbers corresponding to each original graph are different; for each original graph, use the random number corresponding to the original graph as the original graph identifier of the original graph.

[0084] Figure 4 It is a structural block diagram of a server shown according to an exemplary embodiment. Refer to Figure 4, the server includes a processing component 422, which further includes one or more processors, and memory resources represented by a memory 432 for storing instructions executable by the processing component 422, such as application programs. The application programs stored in the memory 432 may include one or more modules each corresponding to a set of instructions. In addition, the processing component 422 is configured to execute instructions to perform the above method.

[0085] The server may further include a power component 426 configured to perform power management of the server, a wired or wireless network interface 450 configured to connect the server to a network, and an input / output (I / O) interface 458. The server may operate based on an operating system stored in the memory 432, such as Windows ServerTM, MacOS XTM, UnixTM, LinuxTM, FreeBSDTM or the like.

[0086] In an exemplary embodiment, there is also provided a computer-readable storage medium including instructions, such as a memory including instructions, which can be executed by the server to complete the above information acquisition method. Optionally, the computer-readable storage medium may be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, etc.

[0087] In an exemplary embodiment, the present application also provides a computer program product including computer-readable code, which, when executed on the server, causes the server to execute the above information acquisition method.

[0088] Those skilled in the art will readily conceive of other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present disclosure, which follow the general principles of the present disclosure and include known common knowledge or conventional technical means in the technical field not disclosed by the present disclosure. The specification and embodiments are only to be considered as exemplary, and the true scope and spirit of the present disclosure are pointed out by the following claims.

[0089] It should be understood that the present disclosure is not limited to the exact structures described above and shown in the drawings, and various modifications and changes can be made without departing from its scope. The scope of the present disclosure is only limited by the appended claims.

Claims

1. An information acquisition method, characterized in that, The method includes: Obtaining a first graph identifier for each first graph, where the first graph includes: at least one original graph identifier, and the original graph to which the original graph identifier belongs includes at least one device identifier; the first graph is determined according to the IP address corresponding to the original graph; Generating first association data indicating the association relationship between the first graph identifiers; wherein, for two first graph identifiers having an association relationship, each first graph to which each of the two first graph identifiers belongs includes an original graph identifier related to the two first graph identifiers; Based on each first graph identifier and the first association data, connecting the first graphs having an association relationship to obtain at least one second graph and a second graph identifier for each second graph; Generating second association data indicating the association relationship between the second graph identifiers, wherein, for two second graph identifiers having an association relationship, each second graph to which each of the two second graph identifiers belongs includes a first graph identifier related to the two second graph identifiers; Based on the second graph identifier of each second graph and the second association data, connecting the second graphs having an association relationship to obtain at least one third graph and a third graph identifier for each third graph; When the number of second graphs is the same as the number of third graphs, determining at least one set of target device identifiers based on each second graph, wherein each device identifier in the set of target device identifiers belongs to the same device.

2. The method according to claim 1, characterized in that, The method further includes: When the number of second graphs is not the same as the number of third graphs, iteratively performing the graph connection operation until at least one of the following stop conditions is met: the number of executions of the graph connection operation reaches a threshold, the number of graphs obtained by the most recent graph connection operation is one, or the number of graphs obtained by the most recent graph connection operation is the same as the number of graphs obtained by the previous graph connection operation immediately before the most recent one; Determining at least one set of the target device identifiers based on each graph obtained by the last graph connection operation.

3. The method according to claim 1, wherein Before obtaining the first graph identifier for each first graph, the method further includes: Generating an original graph identifier for each original graph; Generating original association data indicating the association relationship between the original graph identifiers, wherein, for two original graph identifiers having an association relationship, each original graph to which each of the two original graph identifiers belongs includes a device identifier related to the two original graph identifiers; Based on each original graph identifier and the original association data, connecting the original graphs having an association relationship to obtain each first graph and the first graph identifier for each first graph.

4. The method according to claim 3, characterized in that, Generating an original graph identifier for each original graph includes: Generating a random number corresponding to each original graph respectively, where the random numbers corresponding to each original graph are different; For each original graph, using the random number corresponding to the original graph as the original graph identifier of the original graph.

5. An information acquisition device, characterized in that, The apparatus includes: An obtaining module, configured to obtain a first graph identifier for each first graph, where the first graph includes: at least one original graph identifier, and the original graph to which the original graph identifier belongs includes at least one device identifier; the first graph is determined according to the IP address corresponding to the original graph; A generation module, configured to generate first association data indicating an association relationship between first graph identifiers; wherein, for two first graph identifiers having an association relationship, each first graph to which each of the two first graph identifiers belongs includes an original graph identifier related to the two first graph identifiers; A first connection module, configured to perform graph connection on the first graphs having an association relationship based on each first graph identifier and the first association data, to obtain at least one second graph and a second graph identifier of each second graph; A second connection module, configured to, after performing graph connection on the first graphs having an association relationship based on each first graph identifier and the first association data, to obtain at least one second graph and a second graph identifier of each second graph, generate second association data indicating an association relationship between the second graph identifiers, wherein, for two second graph identifiers having an association relationship, each second graph to which each of the two second graph identifiers belongs includes a first graph identifier related to the two second graph identifiers; perform graph connection on the second graphs having an association relationship based on the second graph identifier of each second graph and the second association data, to obtain at least one third graph and a third graph identifier of each third graph; when the number of second graphs is the same as the number of third graphs, determine at least one target device identifier set based on each second graph, wherein each device identifier in the target device identifier set belongs to the same device.

6. The device according to claim 5, characterized in that The apparatus further includes: A third connection module, configured to, when the number of second graphs is different from the number of third graphs, iteratively perform graph connection operations until at least one of the following stop conditions is met: the number of executions of the graph connection operation reaches a threshold, the number of graphs obtained by the most recent graph connection operation is one, the number of graphs obtained by the most recent graph connection operation is the same as the number of graphs obtained by the previous graph connection operation immediately before the most recent graph connection operation; determine at least one of the target device identifier sets based on each graph obtained by the last graph connection operation.

7. The device according to claim 5, characterized in that, The apparatus further includes: An original graph connection module, configured to generate an original graph identifier for each original graph before obtaining the first graph identifier of each first graph; generate original association data indicating an association relationship between the original graph identifiers, wherein, for two original graph identifiers having an association relationship, each original graph to which each of the two original graph identifiers belongs includes a device identifier related to the two original graph identifiers; perform graph connection on the original graphs having an association relationship based on each original graph identifier and the original association data, to obtain each first graph and the first graph identifier of each first graph.

8. The device according to claim 7, wherein The original graph connection module is further configured to generate a random number corresponding to each original graph respectively, wherein the random numbers corresponding to each original graph are different; for each original graph, use the random number corresponding to the original graph as the original graph identifier of the original graph.

9. A server, characterized in that, Includes: A processor; A memory for storing instructions executable by the processor; Wherein, the processor is configured to execute the instructions to implement the method according to any one of claims 1 to 4.

10. A computer-readable storage medium, when the instructions in the computer-readable storage medium are executed by a processor of a server, enables an electronic device to execute the method according to any one of claims 1 to 4.

11. A computer program product, comprising computer-readable code, when the computer-readable code runs on a server, enables the server to execute the method according to any one of claims 1 to 4.

Images