CN108920618A - Method, device, medium and electronic equipment for storing object calling relationship - Google Patents

Abstract

The embodiment of the invention provides a method for storing an object call relation, which comprises the following steps: mapping the object in the acquired object calling relation with the node in the tree structure data model; generating identification information corresponding to an object in an object calling relation at a current node in a tree structure data model, and acquiring identification information of a child node and/or identification information of a father node of the current node; and creating a corresponding key value based on the identification information of the node and the acquired identification information of the child node and/or the identification information of the father node, and saving the object calling relationship based on the key value. The technical scheme of the embodiment of the invention meets the high concurrency requirement of the system, reduces the configuration difficulty and the maintenance cost, and realizes the convenient addition of the call relation to the production system which is put into use.

Description

Method, device, medium and electronic equipment for storing object calling relationship

technical field

The present invention relates to the field of computer technology, in particular to a method, device, medium and electronic equipment for storing object calling relationships.

Background technique

WeChat is a free application for smart terminals to provide instant messaging services. WeChat supports cross-communication operators and cross-operating system platforms to quickly send free voice messages, videos, pictures and texts through the network. "Drifting Bottle", "Moments", "Public Platform", "Voice Notepad" and other service plug-ins.

WeChat provides public platform, circle of friends, message push and other functions. Users can add friends and follow the public platform through "shake", "search number", "nearby people" and scan the QR code. At the same time, WeChat will share the content To friends and share the exciting content that users see to WeChat circle of friends.

At present, there is no relevant solution on the market that can store complex calling relationships between users in WeChat.

It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present invention, and therefore may include information that does not constitute prior art known to those of ordinary skill in the art.

Contents of the invention

The purpose of the embodiments of the present invention is to provide a method, device, medium and electronic device for storing object call relations, and then overcome the problems in the related art at least to a certain extent.

Other features and advantages of the invention will become apparent from the following detailed description, or in part, be learned by practice of the invention.

According to the first aspect of the embodiments of the present invention, there is provided a method for saving an object call relationship, which is characterized in that it includes:

Map the objects in the obtained object call relationship with the nodes in the tree structure data model;

The current node in the tree structure data model generates identification information corresponding to the object in the object call relationship, and obtains the identification information of the child node and/or the identification information of the parent node of the current node;

A corresponding key value is created based on the identification information of the node and the acquired identification information of the child node and/or the identification information of the parent node, and the object call relationship is saved based on the key value.

In one embodiment of the present invention, based on the aforementioned solution, the above-mentioned mapping of the objects in the obtained object call relationship with the nodes in the tree structure data model includes:

Establish a tree-like network according to the object calling relationship, wherein the tree-like network is a relationship network between objects, which is composed of objects and object calling relationships;

Determining the objects in the tree network as nodes in the tree structure data model;

The object calling relationship in the tree network is determined as the pointing relationship between nodes in the tree structure data model.

In one embodiment of the present invention, based on the foregoing solution, the above-mentioned establishment of a tree network according to the object call relationship includes:

If the first object in the object call relationship calls the second object, generate a connection line from the first object pointing to the second object, and use the pointed connection line to represent the object call relationship, so as to establish the call between objects in the object call relationship A tree-like network of relationships.

In one embodiment of the present invention, based on the foregoing solution, the above-mentioned nodes in the tree-structured data model generate identification information corresponding to the object in the object call relationship, including:

Identification information corresponding to the object is generated based on the order in which the object in the object call relationship is mapped to the node in the tree structure data model.

In one embodiment of the present invention, based on the foregoing solution, the above method further includes:

Replace the name of the node in the tree structure data model with the name of the object in the corresponding object call relationship after mapping. .

In one embodiment of the present invention, based on the foregoing solution, the above-mentioned identification information based on the node and the obtained identification information of the child node and/or the identification information of the parent node create a corresponding key value, and the object call relationship is realized based on the key value. Save, including:

Obtain the name information of the node;

A key value corresponding to the name of the node, the identification information of the node, and the acquired identification information of the child node and/or the identification information of the parent node is created.

In one embodiment of the present invention, based on the foregoing solution, the above-mentioned nodes in the tree structure data model generate identification information corresponding to the object in the object call relationship, and obtain the identification information of the node's child nodes and/or the identification information of the parent node ,include:

Determine whether the current node has a parent node and a child node;

If the current node has only a parent node, then obtain the identification information of the parent node and the call relationship information of the parent node, and create a key value to save the call of the current node based on the identification information of the current node, the identification information of the parent node, and the call relationship information of the parent node relation;

If the current node has only child nodes, then obtain the identification information of the child node and the call relationship information of the child node, based on the identification information of the current node, the identification information of the child node and the call relationship information of the child node, create a key value to save the call of the current node relation;

If the current node has a parent node and a child node, the identification information of the parent node, the call relationship information of the parent node, the identification information of the child node, and the call relationship information of the child node are obtained, based on the identification information of the current node, the identification information of the parent node, The calling relationship information of the parent node, the identification information of the child node, the calling relationship information of the child node, and create a key value to save the calling relationship of the current node.

According to the second aspect of the embodiments of the present invention, a node manager is provided, including: an import module, a generation module, and a creation module; wherein,

Import the module, and map the objects in the obtained object call relationship with the nodes in the tree structure data model;

A generation module, used to generate identification information corresponding to the object in the object call relationship at the current node in the tree structure data model, and obtain the identification information of the child node and/or the identification information of the parent node of the current node;

The creation module is configured to create a corresponding key value based on the identification information of the node and the acquired identification information of the child node and/or the identification information of the parent node, and realize the preservation of the object call relationship based on the key value.

According to a third aspect of the embodiments of the present invention, there is provided a computer-readable medium on which a computer program is stored, and when the program is executed by a processor, the method for saving object call relationships as in the first aspect of the above-mentioned embodiments is implemented.

According to a fourth aspect of the embodiments of the present invention, there is provided an electronic device, including: one or more processors; a storage device for storing one or more programs, when one or more programs are processed by one or more When the processor is executed, one or more processors are made to implement the method for saving the object call relationship as described in the first aspect of the above-mentioned embodiment.

The technical solutions provided by the embodiments of the present invention may include the following beneficial effects:

An embodiment of the present invention provides a method for saving an object call relationship, and the method for saving the object call relationship includes: mapping the obtained object in the object call relationship with the node in the tree structure data model; The current node in generates the identification information corresponding to the object in the object call relationship, and obtains the identification information of the child node and/or the identification information of the parent node of the current node; based on the identification information of the node and the identification information of the obtained child node and /or the identification information of the parent node creates a corresponding key value, and realizes the preservation of the object call relationship based on the key value. The technical solution of the embodiment of the present invention satisfies the high concurrency requirements of the system, reduces configuration difficulty and maintenance cost, and realizes the convenient addition of call relations for the production system that has been put into use

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

Description of drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description serve to explain the principles of the invention. Apparently, the drawings in the following description are only some embodiments of the present invention, and those skilled in the art can obtain other drawings according to these drawings without creative efforts. In the attached picture:

Fig. 1 schematically shows a flowchart of a method for saving an object call relationship according to an embodiment of the present invention.

Fig. 2 schematically shows a flow chart of saving object call relationships according to an embodiment of the present invention.

Fig. 3 schematically shows a schematic diagram of a method for saving calling relationships between WeChat users according to an embodiment of the present invention.

Fig. 4 schematically shows a block diagram of an apparatus for storing object call relationships according to an embodiment of the present invention.

FIG. 5 shows a schematic structural diagram of a computer system suitable for implementing the electronic device of the embodiment of the present invention.

Detailed ways

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete and fully convey the concept of example embodiments to those skilled in the art.

Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided in order to give a thorough understanding of embodiments of the invention. However, those skilled in the art will appreciate that the technical solutions of the present invention may be practiced without one or more of the specific details, or other methods, components, means, steps, etc. may be employed. In other instances, well-known methods, apparatus, implementations, or operations have not been shown or described in detail to avoid obscuring aspects of the invention.

The block diagrams shown in the drawings are merely functional entities and do not necessarily correspond to physically separate entities. That is, these functional entities may be implemented in software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices entity.

The flow charts shown in the drawings are only exemplary illustrations, and do not necessarily include all contents and operations/steps, nor must they be performed in the order described. For example, some operations/steps can be decomposed, and some operations/steps can be combined or partly combined, so the actual order of execution may be changed according to the actual situation.

Fig. 1 schematically shows a flowchart of a method for saving an object call relationship according to an embodiment of the present invention.

With reference to shown in Figure 1, according to an embodiment of the present invention, the preservation method of object call relationship comprises the following steps:

Step S110, mapping the acquired objects in the object call relationship with the nodes in the tree structure data model.

In one embodiment of the present invention, the object call relationship can be the call relationship between users in WeChat, for example: WeChat user A group forwards to WeChat users B and D, and forwards to C through Moments, and WeChat group user D passes group Forward to WeChat user H.

In one embodiment of the present invention, since the calling relationship or forwarding relationship between users in WeChat is similar to the structure of a multi-fork tree, the tree-structured data model can be hierarchically organized like a tree, and there is a recursive relationship. In such a structure, each instance is called a node, each node has multiple child nodes and a parent node, the top node is called the root node, it has no parent node, and the bottom node is called a leaf node, it has no Child nodes, all intermediate nodes are called non-leaf nodes.

In one embodiment of the present invention, based on the aforementioned solution, a tree network is established according to the object call relationship, wherein the tree network is a relationship network between objects, which is composed of objects and object call relationships; the objects in the tree network It is determined as a node in the tree structure data model; the object call relationship in the tree structure network is determined as a pointing relationship between nodes in the tree structure data model.

In one embodiment of the present invention, based on the aforementioned solution, if the first object in the object call relationship calls the second object, a connection line from the first object to the second object is generated, and the object call is represented by the connection line with the point relationship, to establish a tree-like network of the calling relationship between objects in the object calling relationship, and so on, to establish a tree-like network of calling relationships between objects in the object calling relationship.

In one embodiment of the present invention, based on the aforementioned solution, the name of the node in the tree structure data model is replaced with the name of the object in the corresponding object call relationship after mapping

In one embodiment of the present invention, based on the foregoing solution, the name of the node is obtained; and a key value is created corresponding to the name of the node, the identification information of the node, and the obtained identification information of the child node and/or the identification information of the parent node.

Step S120, the current node in the tree structure data model generates identification information corresponding to the object in the object call relationship, and obtains the identification information of the child node and/or the identification information of the parent node of the current node.

In one embodiment of the present invention, identification information corresponding to the object is generated based on the import sequence of the nodes in the object import tree structure data model in the object call relationship.

In an embodiment of the present invention, based on the foregoing solution, an identification information can be stored in the node, and the identification information can create a corresponding key-value (Key-Value) in Redis to store the calling relationship between the nodes.

In step S130, a corresponding key value is created based on the identification information of the node and the acquired identification information of the child node and/or the identification information of the parent node, and the storage of the object call relationship is realized based on the key value.

In one embodiment of the present invention, the name of the node can be obtained; the name of the node and the identification information of the node and the obtained identification information of the child node and/or the identification information of the parent node can be used to create a corresponding key value .

In one embodiment of the present invention, creating the key value corresponding to the identification information to realize the preservation of the object call relationship can be realized by a key-value (Key-Value) storage database, for example: Aerospike, LevelDB, Scalaris, ProjectVoldemort, HyperDex, Berkeley DB , Apache Accumulo, Redis, Apache Cassandra and other non-relational databases. This database is a NoSQL (non-relational database) model, and its data is organized, indexed and stored in the form of key-value pairs. Key-value storage is very suitable for business data that does not involve too many data relationships and business relationships, such as: the call relationship between users in WeChat proposed in the embodiment of the present invention, and can effectively reduce the number of times to read and write disks, compared with SQL Database storage has better read and write performance.

In one embodiment of the present invention, as shown in Figure 2, saving the object call relationship may include the following steps:

Step S210: Determine whether the current node has a parent node and a child node; if there is only a parent node, perform step S220; if there is only a child node, perform step S230; if there are both parent nodes and child nodes, perform step S240.

Step S230: Based on the identification information of the parent node and the calling relationship, save the calling relationship of the current node.

In one embodiment of the present invention, if the current node only has a parent node, the identification information of the parent node and the call relationship information of the parent node are obtained, based on the identification information of the current node, the identification information of the parent node and the call relationship information of the parent node , create a key value to save the calling relationship of the current node;

Step S240: Based on the identification information of the child node and the calling relationship, save the calling relationship of the current node.

In one embodiment of the present invention, if the current node has only child nodes, the identification information of the child node and the call relationship information of the child node are obtained, based on the identification information of the current node, the identification information of the child node and the call relationship information of the child node , create a key value to save the calling relationship of the current node;

Step S240: Based on the identification information and calling relationship of the parent node and the identification information and calling relationship of the child node, save the calling relationship of the current node. In one embodiment of the present invention, if the current node has a parent node and a child node, the identification information of the parent node, the call relationship information of the parent node, the identification information of the child node, and the call relationship information of the child node are obtained, based on the current node Identification information, identification information of the parent node, call relationship information of the parent node, identification information of the child node, call relationship information of the child node, create a key value to save the call relationship of the current node.

In one embodiment of the present invention, it is applied to the call relationship in WeChat. When WeChat account A forwards the Taikang activity link to WeChat account B, WeChat account B clicks on the link through the circle of friends or WeChat friends, and asynchronously calls the method of saving the link. Interface, through which the calling link information is saved.

Taking the calling relationship between users in WeChat as an example, the method for saving the object calling relationship in this embodiment of the present invention will be described in detail below.

Fig. 3 schematically shows a schematic diagram of a method for saving calling relationships between WeChat users according to an embodiment of the present invention.

With reference to shown in Figure 3, according to an embodiment of the present invention, the preservation method of call relationship between WeChat users includes: A node 310, B node 320, C node 330, D node 340, H node 350; wherein, WeChat user A Corresponding to node A 310, WeChat user B corresponds to node B 320, WeChat user C corresponds to node C 330, WeChat user D corresponds to node D 340, WeChat user H corresponds to node H350, specifically, WeChat user A is in WeChat Links are published through Moments of Friends and WeChat groups respectively. The relationship between WeChat user A and WeChat user B is as follows: WeChat user B calls WeChat user A through the WeChat group, and so on. We can get WeChat user A and WeChat user C, WeChat The calling relationship between user D and WeChat user H: WeChat user A group forwards to WeChat users B and D, Moments forwards to C, WeChat user D group forwards to WeChat user H, wherein the obtained calling relationship is forwarded to the tree Structural data model import, node A is the parent node relative to node B, node C, and node D, node B, node C, and node D are child nodes of node A, node D is the parent node relative to node H, and node H is relative to D nodes are child nodes.

In one embodiment of the present invention, based on the invocation relationship of links between WeChat users determined above, identification information is generated at the nodes respectively, for example: node A is the parent node that sends the link, and the identification information is: /A; B The node calls the link of node A through the WeChat group, and the identification information is: /A/B_WXQ, which identifies the link published by node B through the WeChat group (WXQ) calling node A, and so on, and the identification information of node C is :/A/C_PYQ, the identification information identifies the link published by node C through Moments (PYQ), and the identification information of node D is: /A/D_WXQ, the identification information identifies node D through the WeChat group ( WXQ) calls the link issued by node A, and the identification information of node H is: /A/D_WXQ/H_WXQ, which identifies the link issued by node H through the WeChat group (WXQ) calling node D.

The above identification information can create corresponding KEY values in Redis to save related call information, so that the entire forwarding relationship graph can be saved in Zookeeper and Redis.

In one embodiment of the present invention, at least three parameters are required to enter the calling relationship of each node based on Zookeeper and Redis: the identification information of the parent node; the identification information of the current node; and the node name.

In one embodiment of the present invention, save each node identification information in Redis by Zookeeper as follows:

First, determine whether the identification information of the current node has been saved in Redis;

In practical applications, the call relationship between nodes is complex and huge. Therefore, when saving node identification information, it is necessary to judge whether the current node identification information has been saved in Redis, so as to avoid system instability caused by repeated operations of saving node information. The problem;

If it is judged that the current node identification information has been saved in Redis, the process of saving the current node identification information is ended.

If it is judged that the current node identification information is not stored in Redis, then obtain the link information stored in Redis by the parent node of the current node, and create a corresponding key value for the identification information of the current node and the link information of its parent node in Redis save in .

Secondly, it is judged whether the identification information of the parent node of the current node is stored in Zookeeper;

If it is judged that the identification information of the parent node is not saved, and it is determined that the current node does not have a parent node, then the identification information of the child nodes of the current node is obtained, and the identification information of the current node and the identification information of its child nodes are created to correspond to key values and saved in Redis;

If it is judged that the parent node identification information is saved, it is determined that the current node has a parent node and a child node, and the parent node identification information and child node identification information are directly obtained to create the corresponding key value and save it in Redis.

Finally, it is judged whether the child node link information of the current node has saved the identification information of the current node;

If the identification information of the current node is saved in the link information of the child node, the process of saving the identification information of the current node is directly ended;

If the identification information of the current node is not saved in the link information of the child node, the identification information of the current node is saved in Redis.

The device embodiments of the present invention are introduced below, which can be used to implement the method for saving the object call relationship mentioned above in the present invention.

Fig. 4 schematically shows a block diagram of an apparatus for storing object call relationships according to an embodiment of the present invention.

Referring to FIG. 4 , according to an embodiment of the present invention, an apparatus 400 for storing object call relations includes: an import module 402, a generation module 404, and a creation module 406; wherein,

The import module 402 is used to map the objects in the obtained object call relationship with the nodes in the tree structure data model;

The generation module 404 is used to generate the identification information corresponding to the object in the object call relationship at the current node in the tree structure data model, and obtain the identification information of the child node and/or the identification information of the parent node of the current node;

The creation module 406 is configured to create a corresponding key value based on the identification information of the node and the acquired identification information of the child node and/or the identification information of the parent node, and realize the preservation of the object call relationship based on the key value.

In one embodiment of the present invention, based on the foregoing solution, the import module 402 is specifically configured to establish a tree network according to the object calling relationship, wherein the tree network is a relationship network between objects, and is composed of objects and object calling relationships; Determine the objects in the tree-like network as nodes in the tree-structure data model; determine the object calling relationship in the tree-like network as the pointing relationship between nodes in the tree-structure data model.

In one embodiment of the present invention, based on the foregoing solution, the import module 402 is also used to generate a connection line from the first object to the second object if the first object in the object call relationship calls the second object, and the connection line with The connecting lines pointing to represent object call relationships, so as to establish a tree network of call relationships among objects in the object call relationships.

In one embodiment of the present invention, based on the foregoing solution, the generation module 404 is specifically configured to generate identification information corresponding to the object based on the order in which the objects in the object call relationship are mapped to the nodes in the tree structure data model.

In an embodiment of the present invention, based on the foregoing solution, the import module 402 is further configured to replace the name of the node in the tree structure data model with the name of the object in the corresponding object call relationship after the mapping.

In one embodiment of the present invention, based on the foregoing solution, the creating module 406 is specifically configured to obtain the name of the node; combine the name of the node with the identification information of the node and the obtained identification information of the child nodes and/or The identification information of the parent node creates a corresponding key value.

In one embodiment of the present invention, based on the foregoing solution, the creating module 406 is further specifically used for:

Determine whether the current node has a parent node and a child node;

If the current node has only a parent node, then obtain the identification information of the parent node and the call relationship information of the parent node, and create a key value to save the call of the current node based on the identification information of the current node, the identification information of the parent node, and the call relationship information of the parent node relation;

If the current node has only child nodes, then obtain the identification information of the child node and the call relationship information of the child node, based on the identification information of the current node, the identification information of the child node and the call relationship information of the child node, create a key value to save the call of the current node relation;

If the current node has a parent node and a child node, the identification information of the parent node, the call relationship information of the parent node, the identification information of the child node, and the call relationship information of the child node are obtained, based on the identification information of the current node, the identification information of the parent node, The calling relationship information of the parent node, the identification information of the child node, the calling relationship information of the child node, and create a key value to save the calling relationship of the current node.

Since each functional module of the device for storing object call relations in the example embodiment of the present invention corresponds to the steps of the above example embodiment of the method for storing object call relations, for details not disclosed in the device embodiments of the present invention, please refer to this An embodiment of the method for saving the above-mentioned object call relationship is invented.

Referring now to FIG. 5 , it shows a schematic structural diagram of a computer system 500 suitable for implementing an electronic device according to an embodiment of the present invention. The computer system 500 of the electronic device shown in FIG. 5 is only an example, and should not impose any limitation on the functions and application scope of the embodiments of the present invention.

As shown in FIG. 5 , a computer system 500 includes a central processing unit (CPU) 501 that can be programmed according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage section 508 into a random-access memory (RAM) 503 Instead, various appropriate actions and processes are performed. In RAM 503, various programs and data necessary for system operation are also stored. The CPU 501 , ROM 502 , and RAM 503 are connected to each other via a bus 504 . An input/output (I/O) interface 505 is also connected to the bus 504 .

The following components are connected to the I/O interface 505: an input section 506 including a keyboard, a mouse, etc.; an output section 507 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker; a storage section 508 including a hard disk, etc. and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the Internet. A drive 510 is also connected to the I/O interface 505 as needed. A removable medium 511, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is mounted on the drive 510 as necessary so that a computer program read therefrom is installed into the storage section 508 as necessary.

In particular, according to an embodiment of the present invention, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, the embodiments of the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, where the computer program includes program codes for executing the methods shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via communication portion 509 and/or installed from removable media 511 . When this computer program is executed by a central processing unit (CPU) 501, the above-mentioned functions defined in the system of the present application are performed.

It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. A computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to, electrical connections with one or more wires, portable computer diskettes, hard disks, random access memory (RAM), read-only memory (ROM), erasable Programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In the present invention, however, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, in which computer-readable program codes are carried. Such propagated data signals may take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device. . Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in a flowchart or block diagram may represent a module, program segment, or portion of code that includes one or more logical functions for implementing specified executable instructions. It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or they may sometimes be executed in the reverse order, depending upon the functionality involved. It should also be noted that each block in the block diagrams or flowchart illustrations, and combinations of blocks in the block diagrams or flowchart illustrations, can be implemented by a dedicated hardware-based system that performs the specified function or operation, or can be implemented by a A combination of dedicated hardware and computer instructions.

The units described in the embodiments of the present invention may be implemented by software or by hardware, and the described units may also be set in a processor. Wherein, the names of these units do not constitute a limitation of the unit itself under certain circumstances.

As another aspect, the present application also provides a computer-readable medium. The computer-readable medium may be included in the electronic device described in the above-mentioned embodiments; or it may exist independently without being assembled into the electronic device. middle. The above-mentioned computer-readable medium carries one or more programs, and when the above-mentioned one or more programs are executed by the electronic device, the electronic device is made to implement the method for saving the object call relationship as in the above-mentioned embodiment.

For example, the electronic device can be implemented as shown in Figure 1: step S110, the object in the obtained object call relationship is mapped to the node in the tree structure data model; step S120 is the current node in the tree structure data model Generate identification information corresponding to the object in the object call relationship, and obtain the identification information of the child node and/or the identification information of the parent node of the current node; step S130, based on the identification information of the node and the obtained identification information of the child node and/or Or the identification information of the parent node to create the corresponding key value, and realize the preservation of the object call relationship based on the key value.

As another example, the electronic device of , can implement the various steps shown in FIG. 2 .

It should be noted that although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. Actually, according to the embodiment of the present invention, the features and functions of two or more modules or units described above may be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided to be embodied by a plurality of modules or units.

Through the description of the above implementations, those skilled in the art can easily understand that the example implementations described here can be implemented by software, or by combining software with necessary hardware. Therefore, the technical solution according to the embodiment of the present invention can be embodied in the form of a software product, and the software product can be stored in a non-volatile storage medium (which can be a CD-ROM, U disk, mobile hard disk, etc.) or on a network , including several instructions to make a computing device (which may be a personal computer, a server, a touch terminal, or a network device, etc.) execute the method according to the embodiment of the present invention.

Other embodiments of the invention will be readily apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any modification, use or adaptation of the present invention, these modifications, uses or adaptations follow the general principles of the present invention and include common knowledge or conventional technical means in the technical field not disclosed in the present invention . The specification and examples are to be considered exemplary only, with a true scope and spirit of the invention being indicated by the following claims.

It should be understood that the present invention is not limited to the precise constructions which have been described above and shown in the accompanying drawings, and various modifications and changes may be made without departing from the scope thereof. The scope of the invention is limited only by the appended claims.

Claims (10)

1. A preservation method of an object calling relationship, characterized in that, comprising: Map the objects in the obtained object call relationship with the nodes in the tree structure data model; The current node in the tree structure data model generates identification information corresponding to the object in the object call relationship, and obtains the identification information of the child node and/or the identification information of the parent node of the current node; A corresponding key value is created based on the identification information of the node and the acquired identification information of the child node and/or the identification information of the parent node, and the storage of the object call relationship is realized based on the key value. 2. The preservation method of the object call relationship according to claim 1, wherein said mapping the object in the acquired object call relationship with the node in the tree structure data model comprises: Establishing a tree-like network according to the object calling relationship, wherein the tree-like network is a relationship network between objects, consisting of objects and object calling relationships; determining objects in the tree-like network as nodes in the tree-structured data model; The object calling relationship in the tree network is determined as the pointing relationship between nodes in the tree structure data model. 3. The preservation method of the object calling relationship according to claim 2, wherein said establishing a tree network according to said object calling relationship comprises: If the first object in the object call relationship calls the second object, generate a connection line pointing to the second object from the first object, and represent the object call relationship through the pointing connection line, to Establishing a tree network of invocation relationships among objects in the object invocation relationship. 4. The preservation method of the object call relationship according to claim 1 or 2, wherein the node in the tree structure data model generates identification information corresponding to the object in the object call relationship, comprising: Based on the order in which objects in the object call relationship are mapped to nodes in the tree structure data model, identification information corresponding to the object is generated. 5. The preservation method of the object call relationship according to claim 1 or 2, characterized in that, after mapping the object in the obtained object call relationship with the node in the tree structure data model, the method further comprises: The name of the node in the tree structure data model is replaced with the name of the object in the corresponding object call relationship after the mapping. 6. The method for storing object call relations according to claim 1 or 2, wherein the creation of a corresponding key value, the method also includes: Get the name of the node; A key value corresponding to the name of the node, the identification information of the node and the obtained identification information of the child node and/or the identification information of the parent node is created. 7. The preservation method of the object call relationship according to claim 1 or 2, wherein the node in the tree structure data model generates identification information corresponding to the object in the object call relationship, and obtains The identification information of the child node of the node and/or the identification information of the parent node include: judging whether the current node has a parent node and a child node; If the current node has only a parent node, then obtain the identification information of the parent node and the call relationship information of the parent node, based on the identification information of the current node, the identification information of the parent node and the call relationship information, create a key value to save the call relationship of the current node; If the current node has only child nodes, then obtain the identification information of the child node and the call relationship information of the child node, based on the identification information of the current node, the identification information of the child node and the call relationship information of the child node call relationship information, create a key value to save the call relationship of the current node; If the current node has a parent node and a child node, then obtain the identification information of the parent node, the call relationship information of the parent node, the identification information of the child node, and the call relationship information of the child node, based on the current node The identification information of the parent node, the identification information of the parent node, the call relationship information of the parent node, the identification information of the child node, the call relationship information of the child node, and create a key value to save the call relationship of the current node. 8. A storage device for an object call relationship, characterized in that the device includes: an import module, a generation module, and a creation module; wherein, Import the module, and map the objects in the obtained object call relationship with the nodes in the tree structure data model; A generation module, configured to generate identification information corresponding to the object in the object call relationship at the current node in the tree structure data model, and obtain identification information of the child node and/or identification information of the parent node of the current node ; The creation module is configured to create a corresponding key value based on the identification information of the node and the acquired identification information of the child node and/or the identification information of the parent node, and realize the storage of the object call relationship based on the key value. 9. A computer-readable medium, on which a computer program is stored, characterized in that, when the program is executed by a processor, the method for saving the object call relationship according to any one of claims 1 to 7 is implemented. 10. An electronic device, characterized in that it comprises: one or more processors; A storage device, used to store one or more programs, when the one or more programs are executed by the one or more processors, the one or more processors can implement any one of claims 1 to 7 A save method for the object call relationship.