A stock ownership penetration method based on bidirectional search, a terminal and a storage medium

Abstract

The application relates to the technical field of data storage and processing, and discloses a stock right penetration method based on bidirectional search, a terminal and a storage medium. The method constructs a stock right graph structure: based on original stock holding data, a directed graph is constructed; a vertex set represents an institution entity, and an edge set represents a stock holding relationship between institutions; the weight of an edge in the stock right graph represents a stock holding proportion between institutions, and a time stamp information is additionally attached to the edge to record the timeliness of the stock holding relationship; graph structure cleaning: deleting an unweighted edge in the stock right graph, detecting and eliminating a circular stock holding; executing bidirectional penetration search: for any given starting point and ending point in the stock right graph, initiating a forward search from the starting point to obtain a forward path, initiating a reverse search from the ending point to obtain a reverse path, and when the forward search and the reverse search meet at a vertex, the reverse path of the forward path and the reverse path are combined, so that a complete stock holding link is obtained. The application can effectively realize stock right penetration between institutions.

Description

Technical Field

[0001] This invention relates to the field of data storage and processing technology, specifically to a method, terminal, and storage medium for equity penetration based on bidirectional search. Background Technology

[0002] As the financial industry faces increasingly stringent risk management and compliance requirements, the efficient analysis and management of complex inter-institutional shareholding relationships has become crucial. While traditional graph databases can represent these relationships, they are inefficient under large-scale, high-concurrency queries, particularly in path computation (i.e., penetration). The inherent characteristics of graph structures make graph databases difficult to scale horizontally, limiting their application in distributed systems. Summary of the Invention

[0003] To address the technical problems existing in the prior art, this invention provides a method, terminal, and storage medium for bidirectional search of equity penetration. Through specific data structures and algorithm optimization, it enables rapid loading, storage, and penetration calculation of large-scale inter-institutional relationship networks. Thus, by inputting any two institutions, it can search and discover all shareholding links of these two institutions, i.e., equity penetration.

[0004] To achieve the above objectives, the present invention provides the following technical solution: This invention discloses a method for equity penetration based on bidirectional search, comprising the following steps: Constructing an equity graph structure: Based on the original shareholding data, construct a directed graph. Among them, the vertex set V Represents institutional entities, edge sets E It represents the shareholding relationship between institutions; the weight of the edge in the equity diagram represents the shareholding ratio between institutions, and the edge is also attached with timestamp information to record the timeliness of the shareholding relationship; Graph structure cleaning: Remove unweighted edges in the equity graph, detect and eliminate circular shareholdings; Perform a two-way lookup search: for any given starting point in the equity graph s and the end point t , from the starting point s Initiating a forward search yields a forward path. From the finish line t Initiate a reverse search to obtain the reverse path When forward search and reverse search are at the same vertex v ∈ V When they meet, the forward path will be... Reverse path of the reverse path To merge and thus obtain the complete shareholding chain. .

[0005] As a further improvement to the above scheme, the equity penetration method also includes an acceleration step of path caching and merging, which is performed before the bidirectional penetration search is executed, specifically including: I. Identifying vertices with high in-degree and out-degree Construct a set of vertices with high in-degree and out-degree H The expression is:

[0006] In the formula, h Indicates the vertex with higher in-degree and out-degree; Indicates the out-degree, that is, from the vertex h The number of starting edges; Indicates in-degree, i.e., the flow towards the vertex. h The number of edges; To set a threshold; II. Preprocessing and caching paths For each high in-degree vertex h Pre-compute and cache data from any vertex in the equity graph. u arrive h All forward paths The expression is , p Indicates a path; For each high in-degree vertex h Pre-compute and cache from h Reaching any vertex in the equity graph w All reverse path sets The expression is ; By combining the forward path set and the reverse path set, a cache path set with high in-degree vertices is constructed; During the bidirectional penetration search, priority is given to querying the cached path set of all high in-degree vertices from the starting point. s To the finish line t This path allows for faster acquisition of the complete shareholding chain. The expression is:

[0007] In the formula, Represents the union; Represents vertices v The corresponding set of forward paths; Represents vertices v The corresponding set of reverse paths.

[0008] As a further improvement to the above scheme, dynamic pruning rules are added during the bidirectional penetration search process to improve search efficiency. Specific rules include: When the cumulative shareholding ratio on a path is lower than a preset threshold, the search for that path is terminated. When the path's penetration level exceeds a preset threshold, the search for that path is terminated. During the search process, asset management product nodes that serve as intermediaries are automatically skipped.

[0009] As a further improvement to the above scheme, the preset ratio threshold is 5%; the preset number of layers threshold is 6.

[0010] As a further improvement to the above scheme, the threshold The value is , n For vertex set V The total number of vertices in the array.

[0011] As a further improvement to the above scheme, in the process of constructing the equity graph structure, the shareholding ratios between institutions are converted into double-precision floating-point numbers according to the IEEE 754 standard, and the value range is constrained to (0,1], so as to obtain the weights of the edges in the equity graph.

[0012] As a further improvement to the above scheme, the timestamp information adopts the ISO 8601 quarterly coding standard in the process of constructing the equity diagram structure.

[0013] As a further improvement to the above scheme, during the graph structure cleaning process, the Tarjan strongly connected component algorithm is used to detect cyclic shareholding.

[0014] The present invention also discloses a computer terminal, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps of a bidirectional search-based equity penetration method as described above.

[0015] This invention also discloses a computer-readable storage medium storing a computer program thereon, characterized in that, when the program is executed by a processor, it implements the steps of the equity penetration method based on bidirectional search as described above. Compared with the prior art, the beneficial effects of this invention are: 1. This invention discloses a bidirectional search-based equity penetration method that introduces a time-sensitive equity graph structure and combines it with a bidirectional search algorithm to significantly improve the efficiency of cross-institutional path discovery. This invention is the first to model shareholding relationships as a directed graph with time attributes. Based on this structure, it innovatively introduces a bidirectional search algorithm to initiate path searches from both the starting and ending nodes, reducing the path search space. This method significantly improves path discovery efficiency in large-scale institutional graph data, especially in scenarios such as equity penetration and multi-hop control relationship determination, demonstrating strong real-time response capabilities.

[0016] This invention supports time-series query and backtracking analysis of equity relationships, significantly reduces the complexity of path query, and can support second-level response in graph structures with tens of millions of nodes.

[0017] 2. This invention proposes a path cache merging algorithm based on high in-degree nodes to improve the real-time performance of equity penetration search. This transforms the online complexity of the original path search into cache matching, thereby improving search real-time performance.

[0018] This invention significantly reduces redundant path search processes, fully utilizes the structural features of "hub nodes" in the diagram, and achieves sub-second response for path discovery between typical institutional pairs, meeting the real-time analysis needs such as investment penetration. Attached Figure Description

[0019] Figure 1 This is a flowchart of the equity penetration method based on bidirectional search in Embodiment 1 of the present invention.

[0020] Figure 2 This is a schematic diagram of the structure of the computer terminal in Embodiment 2 of the present invention. Detailed Implementation

[0021] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0022] Example 1

[0023] Please see Figure 1 This embodiment provides a shareholding penetration method based on bidirectional search, including the following steps: Constructing an equity graph structure: Based on the publicly disclosed original shareholding data, construct a directed graph. .

[0024] The goal of this invention is to allow the search to discover all shareholding chains between any two institutions, i.e., equity penetration, by inputting any two institutions. This invention proposes an efficient search algorithm to achieve this goal, namely, to find all path information between any two given points in the graph.

[0025] The original shareholding data file contains detailed shareholder information for each company. Based on this information, a standardized graph structure is constructed. G The set of vertices in the graph V Represents institutional entities, edge sets EThe shareholding relationship between institutions is represented; the weight of the edge in the equity graph represents the shareholding ratio between institutions. The weight of the edge in the equity graph is obtained by converting the shareholding ratio between institutions into double-precision floating-point numbers of the IEEE 754 standard and constraining the value range ∈ (0,1]. Because the shareholding information is time-sensitive, timestamp information is also attached to the edge to record the timeliness of the shareholding relationship. The timestamp information can adopt the ISO 8601 quarterly coding standard.

[0026] Graph structure cleaning: Remove unweighted edges in the equity graph and detect and eliminate circular shareholdings.

[0027] By cleaning the constructed standard graph, some data can be avoided from affecting subsequent queries. Edges without specific weights, i.e., records where institutions only have shareholding relationships but no specific shareholding percentages, will be deleted. This aims to eliminate the A→B→A type of cyclical shareholding issues and prevent queries from entering infinite loops. This is achieved by using the Tarjan strongly connected component algorithm for loop detection.

[0028] Based on the graph established by the aforementioned steps, a bidirectional search algorithm is constructed. Starting from the beginning and the end point simultaneously, the paths are merged when they "meet" at a certain intermediate node, thereby reducing the search space.

[0029] Perform a two-way lookup search: for any given starting point in the equity graph s and the end point t , from the starting point s Initiating a forward search yields a forward path. From the finish line t Initiate a reverse search to obtain the reverse path When forward search and reverse search are at the same vertex v ∈ V When they meet, the forward path will be... Reverse path of the reverse path To merge and thus obtain the complete shareholding chain. .

[0030] In this embodiment, before performing bidirectional penetration search, path caching and merging are accelerated, specifically including: I. Identifying vertices with high in-degree and out-degree Construct a set of vertices with high in-degree and out-degree H The expression is:

[0031] In the formula, h Indicates the vertex with higher in-degree and out-degree; Indicates the out-degree, that is, from the vertex h The number of starting edges; Indicates in-degree, i.e., the flow towards the vertex.h The number of edges; To set a threshold, the value is... , n For vertex set V The total number of vertices in the array.

[0032] II. Preprocessing and caching paths

[0033] For each high in-degree vertex h Pre-compute and cache data from any vertex in the equity graph. u arrive h All forward paths The expression is , p This represents a path. A forward adjacency list is used to store shareholder-institution relationships.

[0034] For each high in-degree vertex h Pre-compute and cache from h Reaching any vertex in the equity graph w All reverse path sets The expression is A reverse adjacency list is used to store the relationship between an organization and its shareholders.

[0035] By combining the forward path set and the reverse path set, a cache path set with high in-degree vertices is constructed.

[0036] During the bidirectional penetration search, priority is given to querying the cached path set of all high in-degree vertices from the starting point. s To the finish line t This path allows for faster acquisition of the complete shareholding chain. The expression is:

[0037] In the formula, To represent the union, let distinct vertices... v All possible paths that can be pieced together are merged into a single set. Represents vertices v The corresponding set of forward paths; Represents vertices v The corresponding set of reverse paths.

[0038] In some embodiments, dynamic pruning rules can be added during the bidirectional penetration search process to improve search efficiency. Specific rules include: When the cumulative shareholding ratio on the path is lower than the preset ratio threshold (5% in this embodiment), the search for the path is terminated; when the penetration level of the path exceeds the preset number of layers threshold (6 in this embodiment, which meets the criteria for identifying the actual controller of a listed company), the search for the path is terminated. During the search process, asset management product nodes that serve as intermediaries are automatically skipped.

[0039] Example 2

[0040] This embodiment provides a computer terminal, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the steps of the equity penetration method based on bidirectional search as described in Embodiment 1.

[0041] like Figure 2 As shown, the computer terminal provided in this embodiment includes: at least one processor 101, and a memory 102 connected to at least one processor 101. This embodiment does not limit the specific connection medium between the processor 101 and the memory 102. Figure 2 The example shown is the connection between processor 101 and memory 102 via bus 100. Bus 100 is... Figure 2 The connections between other components are shown in bold lines and are for illustrative purposes only, not as limiting information. Bus 100 can be divided into address bus, data bus, control bus, etc., for ease of representation. Figure 2 The bus is represented by a single thick line, but this does not indicate that there is only one bus or one type of bus. Alternatively, the processor 101 may also be called a controller; there is no restriction on the name.

[0042] In this embodiment, the memory 102 stores instructions that can be executed by at least one processor 101. The at least one processor 101 can execute the aforementioned method by executing the instructions stored in the memory 102.

[0043] The processor 101 is the control center of the device. It can connect to various parts of the control device through various interfaces and lines. By running or executing instructions stored in memory 102 and calling data stored in memory 102, the processor can perform various functions and process data, thereby monitoring the device as a whole.

[0044] In one possible design, processor 101 may include one or more processing units. Processor 101 may integrate an application processor and a modem processor, wherein the application processor mainly handles the operating system, user interface, and applications, and the modem processor mainly handles wireless communication. It is understood that the modem processor may also not be integrated into processor 101. In some embodiments, processor 101 and memory 102 may be implemented on the same chip; in some embodiments, they may also be implemented on separate chips.

[0045] Processor 101 can be a general-purpose processor, such as a central processing unit (CPU), digital signal processor, application-specific integrated circuit, field-programmable gate array or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component, capable of implementing or executing the methods, steps, and logic block diagrams disclosed in the embodiments. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the equity penetration method based on bidirectional search disclosed in Embodiment 1 can be directly manifested as execution by a hardware processor, or execution by a combination of hardware and software modules in processor 101.

[0046] Memory 102, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. Memory 102 may include at least one type of storage medium, such as flash memory, hard disk, multimedia card, card-type memory, random access memory (RAM), static random access memory (SRAM), programmable read-only memory (PROM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), magnetic storage, magnetic disk, optical disk, etc. Memory 102 can be any other medium capable of carrying or storing desired program code in the form of instructions or data structures that can be accessed by a computer, but is not limited thereto. In this embodiment, memory 102 can also be a circuit or any other device capable of implementing storage functions for storing program instructions and / or data.

[0047] By designing and programming the processor 101, the code corresponding to the equity penetration method described in the foregoing embodiments can be embedded into the chip, thereby enabling the chip to execute the code during runtime. Figure 1The steps of the equity penetration method based on bidirectional search are shown. How to design and program the processor 101 is a technique well-known to those skilled in the art and will not be described further here.

[0048] Example 3

[0049] This embodiment provides a computer-readable storage medium storing a computer program thereon. When the program is executed by a processor, it implements the steps of the equity penetration method based on bidirectional search as described in Embodiment 1.

[0050] The computer-readable storage medium may include flash memory, hard disk, multimedia card, card-type memory (e.g., SD or DX memory), random access memory (RAM), static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, magnetic disk, optical disk, etc. In some embodiments, the storage medium may be an internal storage unit of a computer device, such as the hard disk or memory of the computer device. In other embodiments, the storage medium may also be an external storage device of the computer device, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., provided on the computer device. Of course, the storage medium may include both internal storage units and external storage devices of the computer device. In this embodiment, the memory is typically used to store the operating system and various application software installed on the computer device. In addition, the memory can also be used to temporarily store various types of data that have been output or will be output.

[0051] The above description is only a preferred embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any equivalent substitutions or modifications made by those skilled in the art within the scope of the technology disclosed in the present invention, based on the technical solution and inventive concept of the present invention, should be covered within the scope of protection of the present invention.

Claims

1. A method for equity penetration based on bidirectional search, characterized in that, Includes the following steps: Constructing an equity graph structure: Based on the original shareholding data, construct a directed graph. Among them, the vertex set V Represents institutional entities, edge sets E It represents the shareholding relationship between institutions; the weight of the edge in the equity diagram represents the shareholding ratio between institutions, and the edge is also attached with timestamp information to record the timeliness of the shareholding relationship; Graph structure cleaning: Remove unweighted edges in the equity graph, detect and eliminate circular shareholdings; Perform a two-way lookup search: for any given starting point in the equity graph s and the end point t , from the starting point s Initiating a forward search yields a forward path. From the finish line t Initiate a reverse search to obtain the reverse path When forward search and reverse search are at the same vertex v ∈ V When they meet, the forward path will be... Reverse path of the reverse path To merge and thus obtain the complete shareholding chain. ; The equity penetration method also includes a path caching and merging acceleration step, which is performed before the bidirectional penetration search is executed, specifically including: I. Identifying vertices with high in-degree and out-degree Construct a set of vertices with high in-degree and out-degree H The expression is: In the formula, h Indicates the vertex with higher in-degree and out-degree; Indicates the out-degree, that is, from the vertex h The number of starting edges; Indicates in-degree, i.e., the flow towards the vertex. h The number of edges; To set a threshold; II. Preprocessing and caching paths For each high in-degree vertex h Pre-compute and cache data from any vertex in the equity graph. u arrive h All forward paths The expression is , p Indicates a path; For each high in-degree vertex h Pre-compute and cache from h Reaching any vertex in the equity graph w All reverse path sets The expression is ; By combining the forward path set and the reverse path set, a cache path set with high in-degree vertices is constructed; During the bidirectional traversal search, priority is given to querying the cached path set of all vertices with high in-degree and out-degree from the starting point. s To the finish line t This path allows for faster acquisition of the complete shareholding chain. The expression is: In the formula, Represents the union; Represents vertices v The corresponding set of forward paths; Represents vertices v The corresponding set of reverse paths; During the bidirectional penetration search, dynamic pruning rules are added to improve search efficiency. Specific rules include: When the cumulative shareholding ratio on a path is lower than a preset threshold, the search for that path is terminated. When the path's penetration level exceeds a preset threshold, the search for that path is terminated. During the search process, asset management product nodes that serve as intermediaries are automatically skipped.

2. The equity penetration method based on bidirectional search according to claim 1, characterized in that, The preset ratio threshold is 5%; the preset number of layers threshold is 6.

3. The equity penetration method based on bidirectional search according to claim 1, characterized in that, threshold The value is , n For vertex set V The total number of vertices in the array.

4. The equity penetration method based on bidirectional search according to claim 1, characterized in that, In the process of constructing the equity graph structure, the shareholding ratios between institutions are converted into double-precision floating-point numbers according to the IEEE 754 standard, and the value range is constrained to (0,1] to obtain the weights of the edges in the equity graph.

5. The equity penetration method based on bidirectional search according to claim 1, characterized in that, In constructing the equity graph structure, the timestamp information adopts the ISO 8601 quarterly coding standard.

6. The equity penetration method based on bidirectional search according to claim 1, characterized in that, During the graph structure cleaning process, the Tarjan strongly connected component algorithm is used to detect cyclic shareholding.

7. A computer terminal, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the equity penetration method based on bidirectional search as described in any one of claims 1 to 6.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the steps of the equity penetration method based on bidirectional search as described in any one of claims 1 to 6.

Images