CN117076725B - Method, electronic device and medium for searching tree nodes based on underlying data - Google Patents
Method, electronic device and medium for searching tree nodes based on underlying data Download PDFInfo
- Publication number
- CN117076725B CN117076725B CN202311170136.2A CN202311170136A CN117076725B CN 117076725 B CN117076725 B CN 117076725B CN 202311170136 A CN202311170136 A CN 202311170136A CN 117076725 B CN117076725 B CN 117076725B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- displayed
- searching
- current
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000008569 process Effects 0.000 claims description 9
- 239000000758 substrate Substances 0.000 claims 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9027—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/06—Arrangements for sorting, selecting, merging, or comparing data on individual record carriers
- G06F7/08—Sorting, i.e. grouping record carriers in numerical or other ordered sequence according to the classification of at least some of the information they carry
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
The invention relates to a method, electronic equipment and medium for searching tree nodes based on bottom data, which comprises the following steps that S1, a hierarchical structure tree currently displayed based on a preset display interface acquires a starting node and determines the starting node as a current node; step S2, searching the data content of the current node from the bottom data to match target characteristic information, if successful, determining the current node as a target searching node, executing step S4, otherwise, executing step S3; step S3, if the current node has the peer nodes which are not searched and belong to the same father node, updating the peer nodes which are not searched of the current node with the first current ordering as the current node, returning to the step S2, otherwise, updating the father node of the current node as the current node, and returning to the step S2; and S4, generating and highlighting the target searching node. The invention improves the searching efficiency of the hierarchical tree nodes and reduces the occupation of the node searching memory.
Description
Technical Field
The present invention relates to the field of chip technologies, and in particular, to a method, an electronic device, and a medium for searching a tree node based on underlying data.
Background
In the process of chip design and verification debugging, related content needs to be found on a designed hierarchical structure tree through data characteristic information, so that related derivative operations (such as jumping to an original text, checking definition/calling content and the like) are carried out, wherein the hierarchical structure tree can be specifically a visual tree structure for displaying the relation between System Verilog (SV) design hierarchical structures, and the data characteristic information is character string information or type identification and the like which can be used for describing certain characteristics of an SV component. In the prior art, the hierarchical tree nodes are searched by modeling the hierarchical tree, then storing related data contents through the tree nodes, and searching and matching through traversing each tree node during searching.
However, the data content is always great in the chip design, the tree nodes are measured in tens of millions or even hundreds of millions, so that the searching action needs a quite long time, and the occupied memory also rises suddenly. Therefore, how to improve the searching efficiency of the hierarchical tree nodes and reduce the memory occupation in the node searching process becomes a technical problem to be solved urgently.
Disclosure of Invention
The invention aims to provide a method, electronic equipment and medium for searching tree nodes based on bottom data, which improve the searching efficiency of hierarchical tree nodes and reduce the occupation of node searching memory.
According to a first aspect of the present invention, there is provided a method for searching tree nodes based on underlying data, comprising:
step S1, acquiring a starting node based on a hierarchical tree currently displayed by a preset display interface, and determining the starting node as a current node;
step S2, searching the data content of the current node from the bottom layer data to perform target feature information matching, if the matching is successful, determining the current node as a target searching node, executing step S4, otherwise, executing step S3, wherein the target feature information is the data feature information to be searched, and the bottom layer data is the bottom layer data which is generated based on compiling of a design source code and is used for generating an SV hierarchical structure tree;
step S3, if the current node has the peer node which belongs to the same father node and is not searched, updating the peer node which is not searched of the current node with the first current ordering as the current node, returning to the step S2, and if the current node does not have the peer node which is not searched, updating the father node of the current node as the current node, returning to the step S2;
and S4, generating and highlighting the target searching node in a preset display interface.
According to a second aspect of the present invention, there is provided an electronic device comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being arranged to perform the method according to the first aspect of the invention.
According to a third aspect of the present invention there is provided a computer readable storage medium storing computer executable instructions for performing the method of the first aspect of the present invention.
Compared with the prior art, the invention has obvious advantages and beneficial effects. By means of the technical scheme, the method, the electronic equipment and the medium for searching the tree nodes based on the bottom data can achieve quite technical progress and practicality, have wide industrial utilization value, and have at least the following beneficial effects:
according to the embodiment of the invention, all possible related tree nodes in the hierarchical structure tree are not required to be directly generated, the bottom data is ordered based on the node sequence of the hierarchical structure tree, searching is carried out in the bottom data, the target searching node is determined, and after the target searching node is determined, the node which really needs to be presented is generated, so that the generation quantity of irrelevant nodes is reduced, the searching efficiency of the hierarchical structure tree nodes is improved, and the occupation of the node searching memory is reduced.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a method for searching tree nodes based on underlying data according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to fall within the scope of the invention.
The embodiment of the invention provides a method for searching tree nodes based on bottom layer data, which is shown in fig. 1 and comprises the following steps:
step S1, acquiring a starting node based on a hierarchical tree currently displayed by a preset display interface, and determining the starting node as a current node.
It should be noted that, the starting node is the first node to start searching, and may be a top-level node, or any node under the top-level node that is already displayed in the current interface. In the initial state, the hierarchical tree generates and displays all top-level nodes by default. The hierarchical tree may include one or more top level nodes, and the logic for selecting a starting node for a lookup is the same for any set of top level nodes and descendant nodes below the top level node. The hierarchical tree may specifically be a System Verilog hierarchical tree.
And step S2, searching the data content of the current node from the bottom layer data to perform target feature information matching, if the matching is successful, determining the current node as a target searching node, executing step S4, otherwise, executing step S3, wherein the target feature information is the data feature information to be searched, and the bottom layer data is the bottom layer data which is generated based on compiling of a design source code and is used for generating an SV hierarchical structure tree.
As one embodiment, the target feature information is one or more of a name, a type, and an expression. It should be noted that, in the prior art, the searching of the data content based on the binding of the tree nodes can only be performed based on the name and the type, and has a certain limitation.
It should be noted that, all the existing manners of generating data of the hierarchical tree based on compiling the design source code fall within the protection scope of the present invention, and are not described herein. In the searching process of the child nodes, for the non-generated nodes, the true spanning tree nodes are not needed to be generated in the hierarchical structure tree, and the true spanning tree nodes also need to bind the data content of the corresponding tree nodes for each node, so that the searching speed is low and the memory is occupied.
The embodiment of the invention directly searches based on the bottom data, has high query efficiency and greatly reduces the memory occupation. For the generated node, the search can be directly based on the underlying data, or can be performed through the data content stored in the generated node. Preferably, the searching of all the nodes is performed through the bottom data, so that the switching of the searching modes is avoided.
The existing method for generating data for generating the hierarchical tree based on compiling the design source code falls into the protection scope of the present invention, and is not described herein.
And step S3, if the current node has the peer nodes which are not searched and belong to the same father node, updating the peer nodes which are not searched for by the current node with the first current ordering as the current node, returning to the step S2, and if the current node does not have the peer nodes which are not searched for, updating the father node of the current node as the current node, returning to the step S2.
It should be noted that, the invention adopts the hierarchical structure tree to search from bottom to top, and for the scene with the target searching node down, compared with the searching mode from top to bottom, the invention can greatly reduce the number of the searching nodes and improve the node searching efficiency.
And S4, generating and highlighting the target searching node in a preset display interface.
It should be noted that, the embodiment of the invention can directly generate the nodes of the hierarchical structure tree based on the bottom layer data, and after the target search data is determined by searching the bottom layer data, only the target search node and the tree nodes truly related to the target search node need to be generated and displayed in the hierarchical structure tree, thereby greatly reducing the number of the generated irrelevant tree nodes and improving the node search efficiency of the hierarchical structure tree.
In step S2, the data content of the current node is matched with the target feature information in a regular matching manner. Specifically, the target feature information may be "ram" and regular matching is performed based on "ram" where "x" represents an arbitrary value.
As an embodiment, the step S3 includes:
and S31, in the bottom data, the data contents corresponding to the current node and all peer nodes belonging to the same father node are ordered in a reverse order according to the preset ordering requirement corresponding to the SV hierarchical structure tree.
It should be noted that, although the nodes in the hierarchical tree do not need to be generated in advance for searching, the ordering rule of each sub-node in the hierarchical tree is available in advance, so that in order to ensure the accuracy of searching and the accuracy of the nodes generated after searching, when searching based on the underlying data, the sub-nodes of each node need to be ordered in reverse order according to the order consistent with the preset ordering requirement corresponding to the hierarchical tree, and searching based on the ordered underlying data.
It should be noted that, because the method of searching from bottom to top is adopted in the present application, the child nodes of each node are sorted in reverse order according to the order consistent with the preset sorting requirement corresponding to the hierarchical structure tree, so as to ensure the accuracy of the generated node.
As an embodiment, the step S3 includes:
step S32, if the current node is the top node, performing reverse order sorting on the parent nodes of all the leaf nodes according to the preset sorting requirement corresponding to the SV hierarchical structure tree, performing reverse order sorting on the leaf nodes corresponding to the first parent node according to the preset sorting requirement corresponding to the SV hierarchical structure tree, updating the leaf nodes arranged at the first to be the current node, resetting all the nodes to be non-searched nodes, and returning to the step S2.
When the top-level node is searched, searching can be started from the leaf node, and all nodes are reset to be non-searched nodes, so that under the condition that no target searching node exists, each node is ensured not to be searched.
As an embodiment, the step S3 includes:
and step S33, if the updated current node is a starting node, generating a prompt that the target searching node is not found, ending the flow, otherwise, returning to the step S2.
It should be noted that, based on step S33, it may be ensured that the same node is not repeatedly searched.
If step S2 is performed for the first time, the process goes to step S4, and as an embodiment, the step S4 includes:
and step S41, if the starting node is determined to be the target searching node, determining the top-level node, the nodes among the top-level node and the starting node as the first nodes to be displayed.
In the scene of searching for the nodes, when one node is generated and displayed, other nodes which are the same as the node and belong to the same father node are also required to be generated and displayed. The nodes between the top level node and the target search node refer to the father node and the ancestor node of the target search node, and it should be noted that the ancestor node refers to the ancestor node of the node, the father node of the ancestor node, and so on.
In step S42, a node having the same parent node as the first node to be displayed and the same parent node being the first node to be displayed is also determined as the first node to be displayed.
Step S43, only all the first nodes to be displayed are reserved on a preset display interface, and other generated nodes which are not first to be displayed are hidden.
If the target search node can be determined directly through step S2, it is described that no additional node is required to be generated at this time, and the first node to be displayed currently in the preset display interface can be determined through steps S41 to S43, so that other generated nodes not to be displayed first can be hidden directly.
As an embodiment, the step S4 includes:
and S401, determining the top level node, the target searching node and the node between the top level node and the target searching node as a second node to be displayed.
The nodes between the top level node and the target searching node refer to a father node and a ancestor node of the target searching node, and it should be noted that the ancestor node refers to a grandfather node of the nodes, a father node of the grandfather node, and the like.
In step S402, a node having the same parent node as the second node to be displayed and the same parent node being the second node to be displayed is also determined as the second node to be displayed.
Step S403, starting from the top-level node, judging whether each second node to be displayed is generated in the SV hierarchical structure tree, if so, skipping, otherwise, generating the second nodes to be displayed in the SV hierarchical structure tree based on the bottom-level data, generating storage data corresponding to each second node to be displayed based on the bottom-level data, and storing the storage data in the second nodes to be displayed.
It should be noted that, if step S2 is not performed for the first time and step S4 is skipped, there may be a node that needs to be newly generated, and using step S401 and step S403, the generated node related to the target lookup node can be retained, the generated node unrelated to the target lookup node can be hidden, and other nodes related to the target lookup node that are not generated can be generated. In step S403, all nodes to be generated may still be sequentially generated according to a preset ordering requirement corresponding to the hierarchical tree.
It should be noted that, when a target searching node is found and displayed in the display interface, the searching may be continued, the searching may be performed based on the original target feature information, or the searching may be performed by replacing the target feature information.
As an embodiment, step S403 includes, after:
and S44, displaying all the nodes to be displayed on a preset display interface, highlighting the target search node, and hiding the nodes of other nodes not to be displayed on the preset display interface if the nodes not to be displayed on the preset display interface are displayed.
Specifically, the target search node may be highlighted, or may be displayed in a frame selection manner.
It should be noted that some exemplary embodiments are described as a process or a method depicted as a flowchart. Although a flowchart depicts steps as a sequential process, many of the steps may be implemented in parallel, concurrently, or with other steps. Furthermore, the order of the steps may be rearranged. The process may be terminated when its operations are completed, but may have additional steps not included in the figures. The processes may correspond to methods, functions, procedures, subroutines, and the like.
The embodiment of the invention also provides electronic equipment, which comprises: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being configured to perform the methods of embodiments of the present invention.
The embodiment of the invention also provides a computer readable storage medium, which stores computer executable instructions for executing the method according to the embodiment of the invention.
According to the embodiment of the invention, all possible related tree nodes in the hierarchical structure tree are not required to be directly generated, the bottom data is ordered based on the node sequence of the hierarchical structure tree, searching is carried out in the bottom data, the target searching node is determined, and after the target searching node is determined, the node which really needs to be presented is generated, so that the generation quantity of irrelevant nodes is reduced, the searching efficiency of the hierarchical structure tree nodes is improved, and the occupation of the node searching memory is reduced.
The present invention is not limited to the above-mentioned embodiments, but is intended to be limited to the following embodiments, and any modifications, equivalents and modifications can be made to the above-mentioned embodiments without departing from the scope of the invention.
Claims (8)
1. A method for searching tree nodes based on underlying data, comprising:
step S1, acquiring a starting node based on a hierarchical tree currently displayed by a preset display interface, and determining the starting node as a current node;
step S2, searching the data content of the current node from the bottom layer data to perform target feature information matching, if the matching is successful, determining the current node as a target searching node, executing step S4, otherwise, executing step S3, wherein the target feature information is the data feature information to be searched, and the bottom layer data is the bottom layer data which is generated based on compiling of a design source code and is used for generating an SV hierarchical structure tree;
step S3, if the current node has the peer node which belongs to the same father node and is not searched, updating the peer node which is not searched of the current node with the first current ordering as the current node, returning to the step S2, and if the current node does not have the peer node which is not searched, updating the father node of the current node as the current node, returning to the step S2;
s4, generating and highlighting the target searching node in a preset display interface;
the step S4 includes:
step S401, determining the top level node, the target searching node and the node between the top level node and the target searching node as a second node to be displayed;
step S402, determining that the node which has the same father node as the second node to be displayed and is the same father node as the second node to be displayed is also the second node to be displayed;
step S403, starting from the top-level node, judging whether each second node to be displayed is generated in the SV hierarchical structure tree, if so, skipping, otherwise, generating the second nodes to be displayed in the SV hierarchical structure tree based on the bottom-level data, generating storage data corresponding to each second node to be displayed based on the bottom-level data, and storing the storage data in the second nodes to be displayed.
2. The method of claim 1, wherein the step of determining the position of the substrate comprises,
if step S2 is performed for the first time, the process goes to step S4, where step S4 includes:
step S41, if the starting node is determined to be a target searching node, determining a top-level node, nodes among the top-level node and the starting node as first nodes to be displayed;
step S42, determining that the node which has the same father node as the first node to be displayed and is the same father node as the first node to be displayed is also the first node to be displayed;
step S43, only all the first nodes to be displayed are reserved on a preset display interface, and other generated nodes which are not first to be displayed are hidden.
3. The method of claim 1, wherein the step of determining the position of the substrate comprises,
the step S3 includes:
and S31, in the bottom data, the data contents corresponding to the current node and all peer nodes belonging to the same father node are ordered in a reverse order according to the preset ordering requirement corresponding to the SV hierarchical structure tree.
4. The method of claim 3, wherein the step of,
the step S3 includes:
step S32, if the current node is the top node, performing reverse order sorting on the parent nodes of all the leaf nodes according to the preset sorting requirement corresponding to the SV hierarchical structure tree, performing reverse order sorting on the leaf nodes corresponding to the first parent node according to the preset sorting requirement corresponding to the SV hierarchical structure tree, updating the leaf nodes arranged at the first to be the current node, resetting all the nodes to be non-searched nodes, and returning to the step S2.
5. The method of claim 4, wherein the step of determining the position of the first electrode is performed,
the step S3 includes:
and step S33, if the updated current node is a starting node, generating a prompt that the target searching node is not found, ending the flow, otherwise, returning to the step S2.
6. The method of claim 1, wherein the step of determining the position of the substrate comprises,
after step S403, it includes:
and S44, displaying all the nodes to be displayed on a preset display interface, highlighting the target search node, and hiding the nodes of other nodes not to be displayed on the preset display interface if the nodes not to be displayed on the preset display interface are displayed.
7. An electronic device, comprising:
at least one processor;
and a memory communicatively coupled to the at least one processor;
wherein the memory stores instructions executable by the at least one processor, the instructions being arranged to perform the method of any of the preceding claims 1-6.
8. A computer readable storage medium, characterized in that computer executable instructions are stored for performing the method of any of the preceding claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311170136.2A CN117076725B (en) | 2023-09-12 | 2023-09-12 | Method, electronic device and medium for searching tree nodes based on underlying data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311170136.2A CN117076725B (en) | 2023-09-12 | 2023-09-12 | Method, electronic device and medium for searching tree nodes based on underlying data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117076725A CN117076725A (en) | 2023-11-17 |
| CN117076725B true CN117076725B (en) | 2024-02-09 |
Family
ID=88704188
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311170136.2A Active CN117076725B (en) | 2023-09-12 | 2023-09-12 | Method, electronic device and medium for searching tree nodes based on underlying data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117076725B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111610986A (en) * | 2020-05-13 | 2020-09-01 | 南京艾科朗克信息科技有限公司 | Automatic grading method for multi-branch database of securities trading |
| AU2019321745A1 (en) * | 2019-11-06 | 2021-05-20 | Alipay (Hangzhou) Information Technology Co., Ltd. | Prioritizing shared blockchain data storage |
| CN113779085A (en) * | 2021-07-26 | 2021-12-10 | 北京大学 | Method and device for acquiring isomorphic subgraph, computer equipment and readable storage medium |
| CN115454689A (en) * | 2022-08-08 | 2022-12-09 | 北京理工大学 | Query method and system for fault location in industrial big data system |
| CN115758952A (en) * | 2022-11-11 | 2023-03-07 | 上海思尔芯技术股份有限公司 | Resource estimation method for acquiring RTL (real time language) containing level |
| CN115803731A (en) * | 2020-06-09 | 2023-03-14 | 华为技术有限公司 | Database management system and method for graph view selection of relational database databases |
| CN116228515A (en) * | 2023-05-06 | 2023-06-06 | 苏州仰思坪半导体有限公司 | Hardware acceleration system, method and related device |
| CN116910320A (en) * | 2023-09-12 | 2023-10-20 | 北京云枢创新软件技术有限公司 | Hierarchical structure tree node screening method, electronic equipment and medium |
| CN117150095A (en) * | 2023-09-12 | 2023-12-01 | 北京云枢创新软件技术有限公司 | Hierarchical tree node searching method, electronic equipment and medium |
| CN117194739A (en) * | 2023-09-12 | 2023-12-08 | 北京云枢创新软件技术有限公司 | Method, electronic equipment and medium for searching hierarchical tree nodes based on hit state |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8688683B2 (en) * | 2009-11-30 | 2014-04-01 | Business Objects Software Ltd. | Query plan reformulation |
-
2023
- 2023-09-12 CN CN202311170136.2A patent/CN117076725B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU2019321745A1 (en) * | 2019-11-06 | 2021-05-20 | Alipay (Hangzhou) Information Technology Co., Ltd. | Prioritizing shared blockchain data storage |
| CN111610986A (en) * | 2020-05-13 | 2020-09-01 | 南京艾科朗克信息科技有限公司 | Automatic grading method for multi-branch database of securities trading |
| CN115803731A (en) * | 2020-06-09 | 2023-03-14 | 华为技术有限公司 | Database management system and method for graph view selection of relational database databases |
| CN113779085A (en) * | 2021-07-26 | 2021-12-10 | 北京大学 | Method and device for acquiring isomorphic subgraph, computer equipment and readable storage medium |
| CN115454689A (en) * | 2022-08-08 | 2022-12-09 | 北京理工大学 | Query method and system for fault location in industrial big data system |
| CN115758952A (en) * | 2022-11-11 | 2023-03-07 | 上海思尔芯技术股份有限公司 | Resource estimation method for acquiring RTL (real time language) containing level |
| CN116228515A (en) * | 2023-05-06 | 2023-06-06 | 苏州仰思坪半导体有限公司 | Hardware acceleration system, method and related device |
| CN116910320A (en) * | 2023-09-12 | 2023-10-20 | 北京云枢创新软件技术有限公司 | Hierarchical structure tree node screening method, electronic equipment and medium |
| CN117150095A (en) * | 2023-09-12 | 2023-12-01 | 北京云枢创新软件技术有限公司 | Hierarchical tree node searching method, electronic equipment and medium |
| CN117194739A (en) * | 2023-09-12 | 2023-12-08 | 北京云枢创新软件技术有限公司 | Method, electronic equipment and medium for searching hierarchical tree nodes based on hit state |
Non-Patent Citations (2)
| Title |
|---|
| Pyverilog A Python-Based Hardware Design Processing Toolkit for Verilog HDL;Shinya Takamaeda-Yamazaki;《International Symposium on Applied Reconfigurable Computing》;451-460 * |
| 基于树形结构的Web信息抽取技术研究;任仲晟;《中国优秀硕士学位论文全文数据库 信息科技辑》;I138-790 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117076725A (en) | 2023-11-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN117150095B (en) | Hierarchical tree node searching method, electronic equipment and medium | |
| CN108959067B (en) | Method and device for testing search engine and computer readable storage medium | |
| KR20140009297A (en) | Formatting data by example | |
| CN102693246B (en) | Method and system for obtaining information from dataset | |
| CN117742681B (en) | Multistage data model code generation method, system, storage medium and electronic equipment | |
| US8677272B2 (en) | Graphical user interface design utility | |
| CN117076725B (en) | Method, electronic device and medium for searching tree nodes based on underlying data | |
| CN112506766A (en) | Automatic generation method of interactive test case | |
| CN116910320B (en) | Hierarchical structure tree node screening method, electronic equipment and medium | |
| CN117194739B (en) | Method, electronic equipment and medium for searching hierarchical tree nodes based on hit state | |
| CN116954622B (en) | Method for associating abstract syntax tree with source code coordinates, electronic device and medium | |
| CN112052157B (en) | Method, device and system for constructing test message | |
| CN116894412B (en) | On-demand loading method for constructing SystemVerilog object multilayer structure, electronic equipment and medium | |
| CN112579456A (en) | Web automatic testing method and device | |
| CN108399093B (en) | Node processing method and device and electronic equipment | |
| KR20060079083A (en) | Method, system and computer readable medium for evaluating hypertext links | |
| CN110968738B (en) | Intelligent station description file data type template embedded ring detection method and system | |
| CN108664383B (en) | Control testing method and software automatic testing method | |
| CN113094338B (en) | Data comparison method, system, device and medium | |
| CN116628272B (en) | Tree structure node rapid selection method based on vue framework | |
| CN116304117B (en) | Data processing method, system and storage medium for acquiring text information | |
| CN112948719B (en) | Target characteristic text browsing interaction method and device | |
| CN117371413B (en) | Organization information viewing method and system | |
| CN112835785B (en) | One-way path anchor point memory method and device for application program interface skip, storage medium and terminal | |
| CN115630620B (en) | Method and system for collecting and processing engineering cost analysis data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |