Data processing method and related device

Abstract

The invention provides a data processing method and a related device. The method comprises the steps that a query request is received, the query request carries a first condition, and the first condition is used for indicating a first relation with a first target object; the graph model is inquired through a first condition, the number of second target objects is obtained, and the relation between the second target objects and the first target objects meets the first relation; wherein the graph model is used for indicating the relationship between the first object and the second object, the first target object belongs to the first object, and the second target object belongs to the second object. According to the technical scheme provided by the invention, the total data amount under one or more dimensions is queried through the graph model, so that the query efficiency can be improved.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a data processing method and related devices. Background Art

[0002] At present, when querying the total amount of data under one or more dimensions for multiple data, it is often necessary to scan and calculate all the data once, for example, all the data needs to be grouped, deduplicated, and summed, in order to obtain the total amount of data under one or more dimensions. When the amount of data is too large, the query performance will drop sharply when querying the total amount of data under one or more dimensions by this method. Therefore, how to improve query efficiency is a problem that needs to be solved. Summary of the invention

[0003] The embodiments of the present application provide a data processing method and related devices, which can improve query efficiency by querying the total amount of data in one or more dimensions through a graph model.

[0004] In a first aspect, an embodiment of the present application provides a data processing method, the method comprising:

[0005] A query request is received, where the query request carries a first condition, where the first condition is used to indicate a first relationship with a first target object; a graph model is queried through the first condition to obtain the number of second target objects, where the relationship between the second target object and the first target object satisfies the first relationship; wherein the graph model is used to indicate the relationship between the first object and the second object, where the first target object belongs to the first object, and the second target object belongs to the second object.

[0006] In the above technical solution, the first condition is used to indicate the first relationship with the first target object. The query request carries the first condition. If the object that has a first relationship with the first target object is called the second target object, it can be understood that the query request is used to request the number of second target objects that have a first relationship with the first target object. The relationship between the first object and the second object is indicated in the graph model, where the first target object belongs to the first object and the second target object belongs to the second object. Therefore, the number of second target objects can be obtained by traversing the objects that have a first relationship with the first target object on the first target object in the query graph model, without the need to query the number of second target objects (that is, the total amount of data under one or more dimensions) through complex join queries and aggregation queries, thereby improving query efficiency.

[0007] In combination with the first aspect, in some possible implementations of the first aspect, the first condition includes indication information of the first target object and indication information of the first relationship.

[0008] In the above technical solution, the first target object can be determined in the first object through the indication information of the first target object. The first relationship can be determined in the relationship related to the first target object through the indication information of the first relationship. Therefore, the number of second target objects that meet the first condition can be obtained in the graph model, which improves the efficiency of the query.

[0009] In combination with the first aspect, in some possible implementations of the first aspect, the indication information of the first target object includes: an identifier of the first target object.

[0010] In the above technical solution, in the graph model, the identifiers of the various first objects are different, the first target object belongs to the first object, and the indication information of the first target object includes the identifier of the first target object, so that the first target object can be traversed through the identifier of the first target object to quickly determine the first target object, and then the first target object and the second object having a relationship with the first target object can be quickly obtained, and the number of the second target objects in the second object can be determined according to the first relationship. This improves the efficiency of the query.

[0011] In combination with the first aspect, in some possible implementations of the first aspect, the indication information of the first target object further includes: a type of the first target object.

[0012] In the above technical solution, the indication information of the first target object also includes the type of the first target object. Enriching the indication information of the first target object is equivalent to adding query dimensions during query, so that the query can adapt to multi-dimensional flexible queries, thereby improving the flexibility of the query.

[0013] In combination with the first aspect, in some possible implementations of the first aspect, the first target object includes one or more third target objects, and the third target object belongs to the first object.

[0014] In the above technical solution, the first target object includes one or more third target objects, and the third target object belongs to the first object. That is to say, in the graph model, different first objects can be combined for querying, rather than being limited to querying the number of second target objects that have a first relationship with the first object, thereby improving the flexibility of the query.

[0015] In combination with the first aspect, in some possible implementations of the first aspect, the indication information of the first relationship includes: time information corresponding to the first relationship.

[0016] In combination with the first aspect, in some possible implementations of the first aspect, the indication information of the first relationship further includes one or more of the following: the type of the first relationship; and indicator information of the first relationship.

[0017] In the above technical solution, the first condition includes the type of the first relationship and / or the indicator information of the first relationship, so that the user can obtain more accurate data. That is, by allowing queries that meet multi-dimensional conditions, the accuracy of the query is improved.

[0018] In combination with the first aspect, in some possible implementations of the first aspect, the graph model includes a first node, a second node, and a connecting edge between the first node and the second node, wherein the first node is used to indicate a first object, the second node is used to indicate a second object, and the connecting edge between the first node and the second node is used to indicate the relationship between the first object and the second object.

[0019] In the above technical solution, by using the first node to indicate the first object, the second node to indicate the second object, and the connecting edge between the first node and the second node to indicate the relationship between the first node and the second node, the first object and the second object, and the relationship between the first object and the second object can be represented in the graph model.

[0020] In combination with the first aspect, in some possible implementations of the first aspect, the number of second target objects is obtained by querying the graph model according to the first condition, including: querying the graph model according to the first condition, obtaining the target connection edges that satisfy the first relationship; and determining the number of target connection edges as the number of second target objects.

[0021] In the above technical solution, the graph model is queried according to the first condition to obtain the target connection edges that satisfy the first relationship, and the number of target connection edges is determined as the number of second target objects. The number of second target objects can be quickly obtained without the need for complex join queries and aggregation queries, thereby improving the query efficiency.

[0022] In combination with the first aspect, in some possible implementations of the first aspect, the method for constructing a graph model includes: obtaining data of a first node, data of a second node, and data of a connecting edge between the first node and the second node according to a first data record; and constructing a graph model based on the data of the first node, data of the second node, and data of a connecting edge between the first node and the second node.

[0023] In the above technical solution, a graph model is constructed based on the first data record by storing the first object, the second object, and the relationship between the first object and the second object as elements and data in the graph model to calculate the total amount of data. This method can solve the current problems of high performance consumption and high computing latency in calculating the total amount of data, improve the computing speed, and thus improve the efficiency of the query.

[0024] In combination with the first aspect, in some possible implementations of the first aspect, the method further includes: when an update condition is met, updating the graph model according to the incremental data record; the incremental data record represents a data record after the first data record.

[0025] In the above technical solution, by updating the graph model, the graph model can be continuously improved, so that when users query data, they do not need to worry about whether the data is not in the graph model, thereby improving the accuracy and reliability of the query.

[0026] In a second aspect, an embodiment of the present application provides a data processing device, which includes a module or unit for executing the method described in the first aspect or any possible implementation manner of the first aspect.

[0027] In a possible implementation, the device includes: a transceiver module and a processing module;

[0028] A transceiver module, configured to receive a query request, wherein the query request carries a first condition, and the first condition is used to indicate a first relationship with a first target object;

[0029] A processing module, configured to query the graph model according to the first condition to obtain the number of second target objects, wherein the relationship between the second target objects and the first target objects satisfies the first relationship;

[0030] The graph model is used to indicate the relationship between the first object and the second object, the first target object belongs to the first object, and the second target object belongs to the second object.

[0031] In a possible implementation, the first condition includes: indication information of the first target object and indication information of the first relationship.

[0032] In a possible implementation manner, the indication information of the first target object includes: an identifier of the first target object.

[0033] In a possible implementation manner, the indication information of the first target object further includes: the type of the first target object.

[0034] In a possible implementation manner, the first target object includes one or more third target objects, and the third target objects belong to the first object.

[0035] In a possible implementation manner, the indication information of the first relationship includes: time information corresponding to the first relationship.

[0036] In a possible implementation manner, the indication information of the first relationship further includes one or more of the following: the type of the first relationship; and indicator information of the first relationship.

[0037] In one possible implementation, the graph model includes a first node, a second node, and a connecting edge between the first node and the second node, wherein the first node is used to indicate a first object, the second node is used to indicate a second object, and the connecting edge between the first node and the second node is used to indicate a relationship between the first object and the second object.

[0038] In a possible implementation, the processing module is specifically configured to query the graph model according to the first condition to obtain target connection edges that satisfy the first relationship; and determine the number of target connection edges as the number of second target objects.

[0039] In one possible implementation, the processing module is specifically used to obtain data of the first node, data of the second node, and data of a connecting edge between the first node and the second node according to a first data record; and to construct a graph model based on the data of the first node, data of the second node, and data of a connecting edge between the first node and the second node.

[0040] In a possible implementation, the processing module is further used to update the graph model according to the incremental data record when the update condition is met; the incremental data record represents the data record after the first data record.

[0041] In a third aspect, an embodiment of the present application provides an electronic device, the electronic device includes a processor, the processor is coupled to a memory, and can be used to execute a computer program or instruction in the memory to implement the method described in any possible implementation of the first aspect above. Optionally, the electronic device also includes a memory. Optionally, the electronic device also includes a communication interface, and the processor is coupled to the communication interface.

[0042] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, in which a computer program or instructions are stored. When the computer program or instructions are executed, the method described in any possible implementation manner of the first aspect above is implemented.

[0043] In a fifth aspect, an embodiment of the present application provides a computer program product, which includes a computer program or instructions. When the computer program or instructions are executed, the method described in any possible implementation manner of the first aspect above is implemented.

[0044] In a sixth aspect, an embodiment of the present application provides a chip, the chip including a processor, the processor being used to execute a computer program or instruction, when the processor executes the computer program or instruction, the chip executes the method described in any possible implementation of the first aspect. Optionally, the chip also includes a communication interface, the communication interface being used to receive or send a signal.

[0045] Optionally, in the process of executing the method described in any possible implementation of the first aspect above, the processor may be a processor specifically used to execute these methods, or a processor that executes these methods by executing computer instructions in a memory, such as a general-purpose processor. The memory may be a non-transitory memory, such as a read-only memory (ROM), which may be integrated with the processor on the same chip or may be separately arranged on different chips. The embodiment of the present application does not limit the type of memory and the arrangement of the memory and the processor. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments of the present application will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0047] Figure 1 It is an application scenario diagram of a data processing method provided in an embodiment of the present application;

[0048] Figure 2 It is a flowchart of a data processing method provided in an embodiment of the present application;

[0049] Figure 3 It is a schematic diagram of a graph model provided in an embodiment of the present application;

[0050] Figure 4 is a structural schematic diagram of a data processing device provided in an embodiment of the present application;

[0051] Figure 5 is a structural diagram of an electronic device 500 provided in an embodiment of the present application;

[0052] Figure 6 It is a schematic diagram of the structure of a chip provided in an embodiment of the present application. DETAILED DESCRIPTION

[0053] In order to make the objectives, technical solutions and advantages of the present application clearer, the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0054] In this application, the words "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in this application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of the words "exemplary" or "for example" is intended to present the related concepts in a concrete way.

[0055] The "first" and "second" mentioned in the embodiments of the present application are used to distinguish different objects, rather than to describe a specific order. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units that are not listed, or may optionally include other steps or units inherent to these processes, methods, products or devices.

[0056] The "embodiment" mentioned in this article means that the specific features, structures or characteristics described in conjunction with the embodiment may be included in at least one embodiment of the present application. The appearance of this phrase in various places in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It can be explicitly and implicitly understood by those skilled in the art that in the various embodiments of the present application, if there is no special explanation and logical conflict, the terms and / or descriptions between the various embodiments are consistent and can be referenced to each other, and the technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0057] It should be understood that in the present application, "at least one (item)" means one or more, "more than one" means two or more, "at least two (items)" means two or three and more than three, and "and / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0058] At present, when querying the total amount of data under one or more dimensions for multiple data, it is often necessary to scan and calculate all the data once, for example, all the data needs to be grouped, deduplicated, and summed, in order to obtain the total amount of data under one or more dimensions. When the amount of data is too large, the query performance will drop sharply when querying the total amount of data under one or more dimensions by this method. Therefore, how to improve query efficiency is a problem that needs to be solved.

[0059] Based on this, an embodiment of the present application provides a data processing method and related devices, which can improve query efficiency by querying the total amount of data in one or more dimensions through a graph model.

[0060] See also Figure 1 , Figure 1 This is an application scenario diagram of a data processing method provided in an embodiment of the present application, which involves a data source, a graph model, a query interface, and a query application.

[0061] The data source includes information about the first object, information about the second object, the relationship between the first object and the second object, etc. For example, the information about the first object may include an identifier of the first object, a type of the first object, etc. The information about the second object includes an identifier of the second object, a category of the second object, etc. The relationship between the first object and the second object includes the start time, end time (and / or time granularity) of the generation of the relationship between the first object and the second object, etc. The embodiments of the present application are not limited to this.

[0062] The graph model includes a first node for indicating a first object, a second node for indicating a second object, and a connecting edge between the first node and the second node. Among them, the connecting edge between the first node and the second node is used to indicate the relationship between the first object and the second object. The graph model can be constructed based on a data source (or data record). After the graph model is constructed, the graph model can also be stored, for example, in a database for subsequent query use. The construction of the graph model may include: based on the information of the first object, the information of the second object, and the relationship between the second object and the second object, obtaining a first node, a second node, and a connecting edge between the first node and the second node. The number of first nodes may be one or more, and the number of second nodes may also be one or more. One or more first nodes, one or more second nodes, and the connecting edges between the one or more first nodes and the one or more second nodes constitute the graph model. The storage of the graph model may be storing the graph model in a database.

[0063] The query interface refers to an interface for querying a graph model, which can query the graph model when called. The query application (or application layer) can be used to query the total amount of data. When the query application (application layer) queries the total amount of data (for example, the number of second target data that has a first relationship with the first target object), the query interface can be called to obtain the total amount of data that meets the condition from the graph model based on the first condition included in the query request. Specifically, in the graph model, a connection edge with a first relationship to the first node corresponding to the first target object is found, and the number of the connection edges is the number of second target objects that have a first relationship with the first target object, that is, the total amount of data.

[0064] See also Figure 2 , Figure 2 is a flow chart of a data processing method provided in an embodiment of the present application. The data processing method can be applied to the above Figure 1 The data processing method can be executed by a terminal device or a server or other processing device, wherein the terminal device can be, but is not limited to, a computer device and a smart phone, etc., and the server can be implemented by an independent server or a server cluster composed of multiple servers. In some possible implementations, the data processing method can be implemented by a processor calling a computer-readable instruction stored in a memory. Figure 2 As shown, the data processing method may include the following steps S201-S202.

[0065] For ease of understanding, the following embodiments are illustrated by taking the first object as a business object, the second object as a user, and the relationship between the first object and the second object as a business relationship. Among them, the business object may refer to a physical entity (e.g., a network element) or a logical entity (e.g., an application) involved in a communication service. A user may refer to an object that uses a business object. When a user uses a business object, a business relationship is established with the business object. It is understandable that the first object is a business object, the second object is a user, and the relationship between the first object and the second object is a business relationship is an example, and should not constitute any limitation on the embodiments of the present application.

[0066] Step S201: receiving a query request, where the query request carries a first condition, and the first condition is used to indicate a first relationship with a first target object.

[0067] The query request is used to request the total amount of data that meets the first condition, that is, the number of second target objects that have a first relationship with the first target object. The first target object belongs to the first object. The second target object belongs to the second object. The first object can be one or more objects, or a set of objects. The first target object belongs to the first object, which can be specifically understood as the first target object is one of the one or more first objects, or an element in the set of objects. Similarly, the relationship between the second target object and the second object can be obtained, which will not be repeated here.

[0068] The execution subject of the data processing method is the above Figure 1 The terminal device where the query application is located is used as an example for explanation. A user can initiate a query request on the query application (for example, the query application on the terminal device), and the query request carries the first condition input by the user. Accordingly, the terminal device receives the query request carrying the first condition.

[0069] In a possible implementation manner, the first condition may include indication information of the first target object and indication information of the first relationship.

[0070] The indication information of the first target object is used to indicate the first target object. The first target object can be determined by the indication information of the first object. The indication information of the first relationship is used to indicate the first relationship. The first relationship can be determined in the relationships related to the first target object by the indication information of the first relationship.

[0071] In a possible implementation manner, the first target object includes one or more third target objects, and the third target objects belong to the first object.

[0072] That is, the first relationship with the first target object in the first condition may refer to the intersection of the first relationships with one or more third target objects, or may refer to the union of the first relationships with one or more third target objects.

[0073] Exemplarily, when the first target object includes a third target object, the first relationship with the first target object may refer to the first relationship with the third target object. When the first target object includes multiple third target objects (for example, when the first target object A1 includes the third target object C1 and the third target object C2), the first relationship with the first target object may refer to the intersection of the first relationships with each of the multiple third target objects. Alternatively, when the first target object includes multiple third target objects (for example, when the first target object A1 includes the third target object C3 or the third target object C4), the first relationship with the first target object may refer to the union of the first relationships with each of the multiple third target objects. For example, when the first target object A1 includes a third target object C1, if the first relationship with the third target object is the first relationship d1 and the first relationship d2, then the first relationship with the first target object A1 is the first relationship d1 and the first relationship d2. When the first target object A2 includes the third target object C1 and the third target object C2, the first relationship with the third target object C1 includes the first relationship d1 and the first relationship d2, and the first relationship with the third target object C2 includes the first relationship d1 and the first relationship d3, then the first relationship with the first target object A2 includes the first relationship d1. When the first target object A2 includes the third target object C1 or the third target object C2, the first relationship with the third target object C1 includes the first relationship d1 and the first relationship d2, and the first relationship with the third target object C2 includes the first relationship d1 and the first relationship d3, then the first relationship with the first target object A2 includes the first relationship d1, the first relationship d2, and the first relationship d3.

[0074] In a possible implementation manner, the indication information of the first target object may include an identifier of the first target object.

[0075] The identifiers of the first objects are different from each other. That is to say, the identifiers of the first target objects are different from each other. Therefore, the first target object in the first objects can be determined by the identifier of the first target object.

[0076] In a possible implementation manner, the indication information of the first target object may include an index of the first target object.

[0077] When the information of the first object includes an index, the indexes of the first objects are also different. That is, the indexes of the first target objects are different. Therefore, the first target object in the first objects can be determined by the index of the first target object.

[0078] When the first condition includes the index of the first object, the first target object can be determined more quickly, thereby further improving the speed and efficiency of the query.

[0079] In a possible implementation manner, the indication information of the first target object may further include the type of the first target object.

[0080] For example, when the first object is a business object, the type of the first object may include a network device or an application, etc. Therefore, the type of the first target object may be a network device or an application, etc.

[0081] In a possible implementation manner, the indication information of the first relationship may include time information corresponding to the first relationship.

[0082] Exemplarily, the start time and end time of the relationship (eg, the first relationship) between the first object and the second object, or the start time and time granularity.

[0083] In a possible implementation manner, the indication information of the first relationship may further include one or more of the following: the type of the first relationship; and indicator information of the first relationship.

[0084] Exemplarily, when the first object is a business object, the second object is a user, and the relationship between the first object and the second object is a business relationship, the type of business relationship may refer to a business type, including but not limited to voice, video, web browsing, streaming media, and instant messaging.

[0085] Step S202: query the graph model according to the first condition to obtain the number of second target objects, and the relationship between the second target objects and the first target objects satisfies the first relationship.

[0086] The graph model is used to indicate the relationship between the first object and the second object. The first target object belongs to the first object, and the second target object belongs to the second object. In other words, the second target object may refer to a second object that has a first relationship with the first target object.

[0087] It can be understood that the first target object refers to the first object included in the first condition. Exemplarily, the first object includes a first object A and a first object B. If the first object included in the first condition is the first object A but not the first object B, then the first object A is the first target object, and the first object B is not the first target object. If the first object included in the first condition is the first object B but not the first object A, then the first object B is the first target object, and the first object A is not the first target object.

[0088] In a possible implementation, the graph model includes a first node, a second node, and a connection edge between the first node and the second node, wherein the first node is used to indicate a first object, the second node is used to indicate a second object, and the connection edge between the first node and the second node is used to indicate a relationship between the first object and the second object.

[0089] See also Figure 3 , Figure 3 It is a schematic diagram of a graph model provided in an embodiment of the present application.

[0090] Figure 3 In the example, multiple first nodes can be used to indicate a first object consisting of a base station (e.g., base station 1, base station 2), an application (APP) (e.g., application 1, application 2), and a combination of a base station and an application (e.g., a combination of base station 1 and application 2). The information of the first object of base station 1 includes the identification (Identity, ID) of base station 1 (GNodeB01) and the manufacturer of base station 1 (manufacturer A). The information of the first object of base station includes the ID of base station 2 (GNodeB02) and the manufacturer of base station 2 (manufacturer A). The information of the first object of application 1 includes the ID of application 1 (APP1) and the type of application 1 (instant messaging). The information of the first object of application 2 includes the ID of application 2 (APP2) and the type of application 2 (video). The information of the first object consisting of the combination of base station 1 and application 2 includes the IDs of base station 1 and application 2 (GNodeB01+APP2) and the types of base station 1 and application 2 (video). It can be understood that Figure 3 The information types of the same type of first objects (such as base station 1 and base station 2) shown in the figure are the same (for example, the information of base station 1 and base station 2 both include ID and manufacturer), but in fact the information types of each first object may be the same or different. For example, the information of the first object of base station A may include ID and manufacturer, and the information of the first object of base station B may include ID and bandwidth, etc. Multiple second nodes can be used to indicate multiple users (for example, user 1, user 2, ..., user N). In other words, the second object is a user at this time. The information of the second object may include ID and category, etc. For example, in Figure 3 In the example, the ID of user 1 is user1 and the category is category 1. The ID of user 2 is user2 and the category is category 2. The ID of user N is userN and the category is category N. The categories of each user can be the same or different. For example, category 1, category 2, and category N can be the same or different. Figure 3 The data includes connection edges between multiple first nodes and multiple second nodes. Specifically, the information of the connection edge between the first node, base station 1, and the second node, user 1, is shown, including: the time when the relationship between base station 1 and user 1 was established (2023 / 08 / 05), the traffic is 300 megabits (Mega), the download rate is 50 megabits per second (Mbps), and the number of interruptions is 1.

[0091] In one possible implementation, the method for constructing a graph model includes: obtaining data of a first node, data of a second node, and data of a connecting edge between the first node and the second node according to a first data record; and constructing a graph model based on the data of the first node, data of the second node, and data of a connecting edge between the first node and the second node.

[0092] A data record refers to a set of data generated when a first object and a second object have a relationship (e.g., a business relationship). A data record may include information about the first object, information about the second object, and information describing the relationship between the first object and the second object.

[0093] Exemplarily, if the first object is a business object, the information of the business object may include: the identity (ID) of the business object and the type of the business object. For example, the identity of the business object may be GNodeB01, APP1, etc., and the type of the business object may be a base station or application, etc.

[0094] In a possible implementation, the information of the business object may also include: one or more of the manufacturer, standard, bandwidth, software version, APP name, APP type, and APP version of the business object.

[0095] Exemplarily, if the second object is a user, the user information may include: an identifier of the user. For example, the identifier of the user may be User001.

[0096] In one possible implementation, the user information may also include one or more of the user category, user gender, package information of the operator used by the user (including package name, package validity period, etc.), information of the terminal device used by the user (for example, manufacturer, model, software version, etc.), and user hobby information (for example, shopping preferences, sports preferences, book preferences, film and television preferences, etc.).

[0097] Exemplarily, the information of the business relationship between the business object and the user may include the business start time, time granularity (and / or end time), etc. The business start time refers to the time when the business relationship between the business object and the user begins.

[0098] In a possible implementation, the description information of the service relationship between the service object and the user may also include service indicators (eg, downlink rate), indicator values ​​(eg, downlink rate values), poor service quality, service interruption, number of interruptions, etc.

[0099] For example, the information included in a first data record is: the user identified as user1 used the application APP2 service under the base station GNodeB01 on 2023 / 08 / 25, the traffic was 300M, the download rate was 50Mbps, and the video viewing was interrupted once. According to the first data record, the data of the first node (i.e., the information of the first object), the data of the second node (i.e., the information of the second object), and the data of the connection edge between the first node and the second node (i.e., the information of the relationship between the first object and the second object) can be obtained. Specifically, through the first data record, it can be obtained that the first objects are the base station GNodeB01 and the application APP2, (the first object can also be a combination of the base station GNodeB01 and the application APP2), the second object is user1, and the description information of the relationship between the first object and the second object (for example, the service relationship) includes the service start time 2023 / 08 / 25 and the service indicator information, and the service indicator includes the traffic, download rate and the number of interruptions, wherein the value of the service indicator of the traffic is 300M, the value of the service indicator of the download rate is 50Mbps, and the value of the service indicator of the number of interruptions is 1.

[0100] The first object can be represented by a first node, the second object can be represented by a second node, and the business relationship can be represented by a connection edge between the first node and the second node. Figure 3 As shown, based on the first data record, the relationship between the first object GNodeB01 (first node) and the second object user1 (second node) (the information of the connection edge between the first node and the second node) can be obtained. Based on the first data record, the relationship between the first object APP2 (first node) and the second object user1 (second node) (the information of the connection edge between the first node and the second node) can also be obtained. Based on the first data record, the relationship between the combination of the first object GNodeB01 and APP2 (first node) and the second object user1 (second node) (the information of the connection edge between the first node and the second node) can also be obtained. In the graph model, the first node is used to represent the first object, and the data of the first node represents the information of the first object. The second node is used to represent the second object, and the data of the second node represents the information of the second object. In the graph model, the first node and the second node are connected to obtain the connection edge between the first node and the second node, the connection edge between the first node and the second node represents the relationship between the first object and the second object, and the data of the connection edge between the first node and the second node represents the information of the relationship between the first object and the second object. According to the multiple first nodes, multiple second nodes, and the connection edges between the multiple first nodes and the multiple second nodes obtained from the multiple data records, a graph model can be constructed.

[0101] In a possible implementation, querying the graph model according to the first condition to obtain the number of second target objects specifically includes: querying the graph model according to the first condition to obtain target connection edges that satisfy the first relationship; and determining the number of target connection edges as the number of second target objects.

[0102] Exemplarily, the ID of the first target object in the first condition is APP1, and the first relationship includes that the generation time of the relationship is 2023 / 08 / 27. Then, the first node Q corresponding to the first object (i.e., the first target object) with ID APP1 can be found in the graph model, and the target connection edge with the time of 2023 / 08 / 27 can be determined in the connection edge connected to the first node Q. Since each connection edge is connected by a first node and a second node, and one end of the target connection edge is the first node Q for indicating the first target object, the other end of the target connection edge is the second node for indicating the second target object. It can be known that the number of target connection edges connected to the first node Q is the number of second target objects that satisfy the first relationship.

[0103] In a possible implementation, the second node may be associated with a user profile of the user, so that one or more user features in the user profile may be used as query dimensions when querying the second target object.

[0104] For example, the first condition of the query request includes: the first target object is base station A, the second target object satisfies feature S, and the time of the first relationship is 2023 / 08 / 15. Then, based on the first condition, the second object connected to the first target object can be queried, and the second object whose relationship with the first target object satisfies the time of 2023 / 08 / 15 and satisfies feature S is determined as the second target object, and the number of second target objects can be obtained accordingly.

[0105] In a possible implementation, the method may further include: when an update condition is met, updating the graph model according to the incremental data record.

[0106] The incremental data record refers to the data record after the first data record.

[0107] In a possible implementation, the update condition may be a time granularity, that is, at each time granularity, the data of the first node, the data of the second node, and the data of the connecting edge between the first node and the second node are obtained according to each incremental data record, and based on the data of the first node, the data of the second node, and the data of the connecting edge between the first node and the second node, the graph model is constructed (updated).

[0108] In a possible implementation, the update condition may be the number of incremental data records. That is, every time N incremental data records are generated, the data of the first node, the data of the second node, and the data of the connecting edge between the first node and the second node are obtained according to each incremental data record, and the graph model is constructed (updated) based on the data of the first node, the data of the second node, and the data of the connecting edge between the first node and the second node.

[0109] In one possible implementation, updating the graph model may mean adding the first node, the data of the first node, the second node, the data of the second node, and the data of the connecting edge between the first node and the second node involved in the incremental data record to the constructed graph model based on the constructed graph model.

[0110] In one possible implementation, updating the graph model may refer to constructing a new graph model by using the first node, the data of the first node, the second node, the data of the second node, and the data of the connecting edge between the first node and the second node involved in the incremental data record.

[0111] The above describes in detail the method involved in the embodiment of the present application. The following provides a device for implementing the method in the embodiment of the present application.

[0112] See also Figure 4 , Figure 4 4 is a schematic diagram of a data processing device provided in an embodiment of the present application. The data processing device 400 may be implemented by hardware, software, or a combination of hardware and software. Figure 4 As shown, the data processing device 400 includes: a transceiver module 401 and a processing module 402, wherein:

[0113] The transceiver module 401 is used to receive a query request, where the query request carries a first condition, where the first condition is used to indicate a first relationship with a first target object;

[0114] Processing module 402, for querying the graph model according to the first condition to obtain the number of second target objects, and the relationship between the second target objects and the first target objects satisfies the first relationship;

[0115] The graph model is used to indicate the relationship between the first object and the second object, the first target object belongs to the first object, and the second target object belongs to the second object.

[0116] In a possible implementation, the first condition includes: indication information of the first target object and indication information of the first relationship.

[0117] In a possible implementation manner, the indication information of the first target object includes: an identifier of the first target object.

[0118] In a possible implementation manner, the indication information of the first target object further includes: the type of the first target object.

[0119] In a possible implementation manner, the first target object includes one or more third target objects, and the third target objects belong to the first object.

[0120] In a possible implementation manner, the indication information of the first relationship includes: time information corresponding to the first relationship.

[0121] In a possible implementation manner, the indication information of the first relationship further includes one or more of the following: the type of the first relationship; and indicator information of the first relationship.

[0122] In one possible implementation, the graph model includes a first node, a second node, and a connecting edge between the first node and the second node, wherein the first node is used to indicate a first object, the second node is used to indicate a second object, and the connecting edge between the first node and the second node is used to indicate a relationship between the first object and the second object.

[0123] In a possible implementation, the processing module 402 is specifically configured to query the graph model according to the first condition to obtain target connection edges that satisfy the first relationship; and determine the number of target connection edges as the number of second target objects.

[0124] In one possible implementation, the processing module 402 is specifically used to obtain data of the first node, data of the second node, and data of the connecting edge between the first node and the second node according to the first data record; and to construct a graph model based on the data of the first node, data of the second node, and data of the connecting edge between the first node and the second node.

[0125] In a possible implementation, the processing module 402 is further configured to update the graph model according to the incremental data record when an update condition is met; the incremental data record represents a data record after the first data record.

[0126] It should be noted that the implementation and beneficial effects of each module of the data processing device 400 can also be referred to above. Figure 2 The corresponding description of the method embodiment shown will not be repeated here.

[0127] See also Figure 5 , Figure 51 is a schematic diagram of the structure of an electronic device 500 provided in an embodiment of the present application. The electronic device 500 may include a memory 501 and a processor 502. Further optionally, the electronic device 500 may also include a communication interface 503 and a bus 504. The memory 501, the processor 502 and the communication interface 503 are connected to each other through the bus 504. The communication interface 503 is used to exchange data with other devices.

[0128] The memory 501 is used to provide a storage space, in which data such as an operating system and a computer program can be stored. The memory 501 includes, but is not limited to, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), or a portable read-only memory (CD-ROM).

[0129] The processor 502 is a module for performing arithmetic operations and logical operations, and may be a combination of one or more of processing modules such as a central processing unit (CPU), a graphics processing unit (GPU), or a microprocessor unit (MPU). The processor 502 may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0130] The processor 502 calls the computer program stored in the memory 501 to execute the method steps in the above method embodiment. The specific content can be found in the above method embodiment and will not be repeated here.

[0131] Correspondingly, the processor 502 calls the computer program stored in the memory 501, and can also be used to execute the method steps performed by each unit in the above-mentioned device embodiment. The specific content can be found in the above-mentioned device embodiment, which will not be repeated here.

[0132] For electronic devices that can be chips or chip systems, see Figure 6 Schematic diagram of the chip structure shown.

[0133] like Figure 6 As shown, the chip 600 includes a processor 601 and an interface 602. The number of the processors 601 may be one or more, and the number of the interfaces 602 may be multiple. It should be noted that the functions corresponding to the processor 601 and the interface 602 may be implemented by hardware design, software design, or a combination of hardware and software, which is not limited here.

[0134] Optionally, the chip 600 may further include a memory 603, and the memory 603 is used to store necessary program instructions and data.

[0135] In the present application, the processor 601 may be used to call a program for implementing the data processing method provided in one or more embodiments of the present application in an electronic device from the memory 603 and execute the instructions contained in the program. The interface 602 may be used to output the execution result of the processor 601.

[0136] For the data processing method provided by one or more embodiments of the present application, reference may be made to the various embodiments shown above, which will not be described in detail here.

[0137] An embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored. When the computer program runs on a processor, the method in the above method embodiment can be implemented.

[0138] An embodiment of the present application further provides a computer program product, which includes a computer program. When the computer program runs on a processor, the method in the above method embodiment can be implemented.

[0139] An embodiment of the present application further provides a chip, which includes a processor, and the processor is used to execute a computer program. When the processor executes the computer program, the method in the above method embodiment can be implemented.

[0140] It should be understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a hard disk drive (HDD), a solid-state drive (SSD), a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchlink DRAM (SLDRAM), and direct rambus RAM (DRRAM). It should be noted that the memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0141] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented by software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instruction is loaded and executed on a computer, the process or function described in the embodiment of the present application is executed in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device or other programmable device. The computer program or instruction may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer program or instruction may be transmitted from one website site, computer, server or data center to another website site, computer, server or data center by wired or wireless means. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server, data center, etc. that integrates one or more available media. The available medium may be a magnetic medium, for example, a floppy disk, a hard disk, a tape; it may also be an optical medium, for example, a digital video disc; it may also be a semiconductor medium, for example, a solid-state hard disk. The computer-readable storage medium may be a volatile or nonvolatile storage medium, or may include both volatile and nonvolatile types of storage media.

[0142] It is understandable that in the embodiments of the present application, the electronic device can perform some or all of the steps in the embodiments of the present application, and these steps or operations are only examples. The embodiments of the present application can also perform other operations or variations of various operations. In addition, the various steps can be performed in different orders presented in the embodiments of the present application, and it is possible that not all operations in the embodiments of the present application need to be performed.

[0143] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments provided herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0144] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0145] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0146] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0147] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0148] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the technology or the part of the technical solution, can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard drives, ROM, RAM, magnetic disks, or optical disks.

[0149] The above description is only a specific implementation manner of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application.

Claims

1. A data processing method, characterized in that: The method comprises: receiving a query request, the query request carrying a first condition, the first condition being used to indicate a first relationship with a first target object; Querying the graph model according to the first condition, obtaining the number of second target objects, wherein the relationship between the second target objects and the first target objects satisfies the first relationship; The graph model is used to indicate the relationship between a first object and a second object, the first target object belongs to the first object, and the second target object belongs to the second object.

2. The method according to claim 1, characterized in that The first condition includes: indication information of the first target object and indication information of the first relationship.

3. The method according to claim 2, characterized in that The indication information of the first target object includes: an identifier of the first target object.

4. The method according to claim 3, characterized in that: The indication information of the first target object also includes: the type of the first target object.

5. The method according to any one of claims 1 to 4, characterized in that: The first target object includes one or more third target objects, and the third target objects belong to the first object.

6. The method according to any one of claims 1 to 5, characterized in that: The indication information of the first relationship includes: time information corresponding to the first relationship.

7. The method according to claim 6, characterized in that The indication information of the first relationship may further include one or more of the following: a type of the first relationship; The indicator information of the first relationship.

8. The method according to any one of claims 1 to 7, characterized in that: The graph model includes a first node, a second node, and a connecting edge between the first node and the second node, wherein the first node is used to indicate the first object, the second node is used to indicate the second object, and the connecting edge between the first node and the second node is used to indicate the relationship between the first object and the second object.

9. The method according to any one of claims 1 to 8, characterized in that: The querying the graph model according to the first condition to obtain the number of second target objects includes: Querying the graph model according to the first condition to obtain a target connection edge that satisfies the first relationship; The number of the target connecting edges is determined as the number of the second target objects.

10. The method according to any one of claims 1 to 9, characterized in that: The method for constructing the graph model includes: According to the first data record, obtain data of the first node, data of the second node, and data of a connection edge between the first node and the second node; The graph model is constructed based on the data of the first node, the data of the second node, and the data of the connecting edge between the first node and the second node.

11. The method according to claim 10, characterized in that The method further comprises: When the update condition is met, the graph model is updated according to the incremental data record; the incremental data record represents the data record after the first data record.

12. A data processing device, characterized in that: include: Transceiver module and processing module; The transceiver module is used to receive a query request, the query request carries a first condition, and the first condition is used to indicate a first relationship with a first target object; The processing module is used to query the graph model according to the first condition to obtain the number of second target objects, and the relationship between the second target object and the first target object satisfies the first relationship; The graph model is used to indicate the relationship between a first object and a second object, the first target object belongs to the first object, and the second target object belongs to the second object.

13. The device according to claim 12, characterized in that The first condition includes: indication information of the first target object and indication information of the first relationship.

14. The device according to claim 13, characterized in that The indication information of the first target object includes: an identifier of the first target object.

15. The device according to claim 14, characterized in that The indication information of the first target object also includes: the type of the first target object.

16. The device according to any one of claims 12 to 15, characterized in that: The first target object includes one or more third target objects, and the third target objects belong to the first object.

17. The device according to any one of claims 12 to 16, characterized in that: The indication information of the first relationship includes: time information corresponding to the first relationship.

18. The device according to claim 17, characterized in that The indication information of the first relationship may further include one or more of the following: a type of the first relationship; The indicator information of the first relationship.

19. The device according to any one of claims 12 to 18, characterized in that: The graph model includes a first node, a second node, and a connecting edge between the first node and the second node, wherein the first node is used to indicate the first object, the second node is used to indicate the second object, and the connecting edge between the first node and the second node is used to indicate the relationship between the first object and the second object.

20. The device according to any one of claims 12 to 19, characterized in that The processing module is specifically configured to query the graph model according to the first condition to obtain target connection edges that satisfy the first relationship; and determine the number of the target connection edges as the number of the second target objects.

21. The device according to any one of claims 11 to 20, characterized in that: The processing module is specifically configured to obtain, according to the first data record, data of the first node, data of the second node, and data of a connection edge between the first node and the second node; And, used to construct the graph model based on the data of the first node, the data of the second node, and the data of the connecting edge between the first node and the second node.

22. The device according to claim 21, characterized in that The processing module is also used to update the graph model according to the incremental data record when the update condition is met; the incremental data record represents the data record after the first data record.

23. An electronic device, characterized in that: include: processor; When the processor calls the computer program or instruction in the memory, the method according to any one of claims 1 to 11 is executed.

24. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program or instruction, and when the computer program or instruction is executed, the method according to any one of claims 1 to 11 is implemented.

Images