CN116955415B - Design hierarchy based data search system - Google Patents
Design hierarchy based data search system Download PDFInfo
- Publication number
- CN116955415B CN116955415B CN202311176816.5A CN202311176816A CN116955415B CN 116955415 B CN116955415 B CN 116955415B CN 202311176816 A CN202311176816 A CN 202311176816A CN 116955415 B CN116955415 B CN 116955415B
- Authority
- CN
- China
- Prior art keywords
- expression
- module
- expressions
- instance
- information
- 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
- 238000013461 design Methods 0.000 title claims abstract description 16
- 230000014509 gene expression Effects 0.000 claims abstract description 83
- 238000000034 method Methods 0.000 claims abstract description 12
- 238000004590 computer program Methods 0.000 claims description 8
- 230000001174 ascending effect Effects 0.000 claims description 3
- 101100311330 Schizosaccharomyces pombe (strain 972 / ATCC 24843) uap56 gene Proteins 0.000 description 11
- 101150018444 sub2 gene Proteins 0.000 description 11
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000005018 casein Substances 0.000 description 1
- BECPQYXYKAMYBN-UHFFFAOYSA-N casein, tech. Chemical compound NCCCCC(C(O)=O)N=C(O)C(CC(O)=O)N=C(O)C(CCC(O)=N)N=C(O)C(CC(C)C)N=C(O)C(CCC(O)=O)N=C(O)C(CC(O)=O)N=C(O)C(CCC(O)=O)N=C(O)C(C(C)O)N=C(O)C(CCC(O)=N)N=C(O)C(CCC(O)=N)N=C(O)C(CCC(O)=N)N=C(O)C(CCC(O)=O)N=C(O)C(CCC(O)=O)N=C(O)C(COP(O)(O)=O)N=C(O)C(CCC(O)=N)N=C(O)C(N)CC1=CC=CC=C1 BECPQYXYKAMYBN-UHFFFAOYSA-N 0.000 description 1
- 235000021240 caseins Nutrition 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012805 post-processing Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000012795 verification Methods 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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
-
- 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)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the technical field of computers, in particular to a data search system based on design level, which realizes step S1 and acquires a search expression a 1 a 2 …a n …a N The method comprises the steps of carrying out a first treatment on the surface of the Step S2, if n=1, execute step S3, if N>1, then the search expression is partitioned into a 1 a 2 …a N‑1 And a N Two parts; step S3, based on a N Search module definition list, extract all containing a N Pre-selected module instance information and pre-selected module level information corresponding to class definition information; s4, generating all candidate instance paths, and splicing the candidate instance paths by a N Generating a candidate instance, if N is equal to 1, determining the candidate instance as a target search instance, and if N is greater than 1, executing step S5; step S5, will contain a 1 a 2 …a N‑1 Is determined as the target search instance. The inventionThe time and the memory expenditure are obviously reduced, and the searching efficiency is improved.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a data search system based on a design level.
Background
In the processes of chip code simulation, debugging, data post-processing and the like, the hierarchical tree needs to be searched. The traditional searching method loads and traverses each member module of the hierarchical tree through breadth or depth priority, namely each instance, the time complexity of traditional searching is related to the member module, and the data volume of the hierarchical tree is quite huge, the number of the member modules is quite huge, so that a great amount of time and memory overhead are required, and the searching efficiency is low. Therefore, how to reduce the time and memory overhead of data searching based on design level and improve the searching efficiency is a technical problem to be solved.
Disclosure of Invention
The invention aims to provide a data searching system based on a design level, which reduces time and memory expenditure and improves searching efficiency.
According to a first aspect of the present invention, there is provided a design-level-based data search system comprising a module definition list, a memory storing a computer program, and a processor, wherein the module definition list comprises module definition information, the module definition information comprising class definition information, module instance information, and module level information, the processor, when executing the computer program, implementing the steps of:
step S1, obtaining a search expression a 1 ?a 2 ?…?a n ?…?a N Wherein a is n For the nth level information of the search expression, the value range of N is 1 to N,;
step S2, if n=1, then step S3 is directly executed, if N>1, dividing the search expression into a 1 ?a 2 ?…?a N-1 And a N Two parts, then executing step S3;
step S3, based on a N Searching the module definition list, extracting all the content a N Pre-selected module instance information corresponding to class definition information, and pre-selected module level information corresponding to pre-selected module information;
s4, generating all candidate instance paths based on the pre-selection module instance information and the pre-selection module level information, and splicing a of each candidate instance path N Generating candidate examples, if N is equal to 1, determining all candidate examples as target search examples, and if N is greater than 1, executing step S5;
step S5, based on a 1 ?a 2 ?…?a N-1 Searching all candidate instances will include a 1 ?a 2 ?…?a N-1 Is determined as the target search instance.
Compared with the prior art, the invention has obvious advantages and beneficial effects. By means of the technical scheme, the data searching system based on the design level provided by the invention can achieve quite technical progress and practicality, has wide industrial utilization value, and has at least the following beneficial effects:
according to the method, the hierarchical tree does not need to be traversed, only the search expression is required to be processed, the search module defines the list, all candidate instance paths are generated, and then the candidate instance is generated by splicing the paths based on each candidate instance, so that the time and the memory expenditure of data search based on the design hierarchy are reduced, and the search efficiency is improved.
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 schematic diagram of a data search system based on design hierarchy 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 data searching system based on a design level, as shown in fig. 1, which comprises a module definition list, a memory and a processor, wherein the memory stores a computer program, the module definition list comprises module definition information, the module definition information comprises class definition information, module instance information and module level information, the module definition list can be a module definition list corresponding to a chip design or verification code, and the class definition information comprises design information such as a signal, a submodule contained in the class and the like. When the processor executes the computer program, the following steps are implemented:
step S1, obtaining a search expression a 1 ?a 2 ?…?a n ?…?a N Wherein a is n For the nth level information of the search expression, N has a value ranging from 1 to N.
Wherein the preset separator? Is "," or "/". As an example, search expression a 1 ?a 2 ?…?a n ?…?a N Specifically, u1 may be used, or top.sub1.u1 may be used.
Step S2, if n=1, then step S3 is directly executed, if N>1, dividing the search expression into a 1 ?a 2 ?…?a N-1 And a N Two parts, then step S3 is performed.
In the above example, a 1 ?a 2 ?…?a n ?…?a N In particular, u1 is n=1, i.e. no hierarchical information is included, which is the caseIn this case, the list is defined directly based on the search expression search module without further processing of the search expression. Search expression a 1 ?a 2 ?…?a n ?…?a N Specifically, top.sub1.u1 is N>1, which contains hierarchical information, it is necessary to divide top.sub1.u1 into top.sub1 and u1 before defining the list based on the u1 search module.
Step S3, based on a N Searching the module definition list, extracting all the content a N Pre-selected module instance information corresponding to class definition information, and pre-selected module level information corresponding to pre-selected module information.
It should be noted that, assuming that the hierarchical tree has X instances and Y pieces of module definition information, it can be understood that X is far greater than Y, in the manner of directly searching the hierarchical tree in the prior art, the corresponding time complexity is O (X), and in the present application, the corresponding time complexity is O (Y), and O (Y) is far less than O (X), that is, the embodiment of the present invention greatly reduces the time complexity and improves the searching efficiency.
S4, generating all candidate instance paths based on the pre-selection module instance information and the pre-selection module level information, and splicing a of each candidate instance path N And generating candidate examples, if N is equal to 1, determining all the candidate examples as target search examples, and if N is greater than 1, executing step S5.
Wherein all possible instance paths may be generated as candidate instance paths based on the pre-selected module instance information and the pre-selected module level information. Taking u1 searching the module definition list as an example, the generated candidate instance paths are top.sub1, top.sub2, top.sub3 and the like, if N is equal to 1, directly splicing to generate top.sub1.u1, top.sub2.u1 and top.sub3.u1 as target searching instances.
Step S5, based on a 1 ?a 2 ?…?a N-1 Searching all candidate instances will include a 1 ?a 2 ?…?a N-1 Is determined as the target search instance.
Still in search expression a 1 ?a 2 ?…?a n ?…?a N Concrete embodimentsTaking top.sub1.u1 as an example, top.sub1.u1, top.sub2.u1 and top.sub3.u1 are searched based on top.sub1, and finally top.sub1.u1 is taken as a target searching example.
It is noted that a n Only fixed expressions are included, such as top.sub1.u1 or u1 in the above examples. a, a n Fixed expressions and wildcards may also be included.
As an example, if a N Comprising a fixed expression a1 N And wild card, said step S3 comprises:
step S31, traversing the module definition list to obtain all the expressions a1 containing fixed expressions N Expression set { A } 1 N ,A 2 N ,…,A m N ,…,A M N }，A m N To contain the fixed expression a1 N The M-th expression in the expression set of (a), M ranges from 1 to M, and M is a1 contained in the module definition list N Is a sum of expressions of (a).
Wherein, taking wild card as an example, a is as follows N Specifically, u is a N Traversing the module definition list, all expression sets { U1, U2, U3} containing the fixed expression U can be obtained.
Step S32, based on each A m N Searching the module definition list, extracting each A m N Pre-selected module instance information corresponding to class definition information, and pre-selected module level information corresponding to pre-selected module information.
Taking the expression set { u1, u2, u3} containing the fixed expression u as an example, searching the module definition list based on u1, u2, u3 respectively to obtain preselected module instance information corresponding to class definition information of u1, u2, u3 and preselected module level information corresponding to preselected module information. For example, u1 is used for searching, the obtained class definition information is sub, the sub examples include sub1, sub2 and sub3, and pre-selected module level information corresponding to sub1, sub2 and sub3 is in a top level, and then all candidate example paths are generated based on the pre-selected module example information and the pre-selected module level information to obtain top.sub1.U1, top.sub2.U1 and top.sub3.U1.
As an example, if a 1 ?a 2 ?…?a N-1 There are R expressions { b } comprising a fixed expression and a wild card 1 ,b 2 ,…,b r ,…,b R },b r For the r-th expression comprising a fixed expression and a wild card, b r Is { a } 1 ，a 2 ，…，a N-1 One of the expressions, R has a value ranging from 1 to R, R being a 1 ?a 2 ?…?a N-1 The total number of the expressions including the fixed expression and the wild card, R is less than or equal to N-1, b r Includes a fixed expression B1 r And a wild card, the step S5 includes:
step S51, traversing the module definition list, and sequentially obtaining the fixed expression B1 1 ,B1 2 ,…,B1 r ,…,B1 R Expression set C of (2) 1 ,C 2 ,…,C r ,…,C R Wherein C r To include the fixed expression B1 r Is set of C r Including f (r) expressions.
Wherein, with n-1=3, r=2, a 1 ?a 2 ?…?a N-1 For example, top is a including only fixed expressions n TLB is a that includes a fixed expression and a wildcard n . TLB, sub are fixed expressions, which are wildcards, and the expression set has c1= { TLB1, TLB2}, c2= { sub1, sub2, sub3}.
Step S52, step a 1 ?a 2 ?…?a N-1 A including only fixed expressions n Keeping unchanged, R expressions including fixed expressions and wildcards are set according to C 1 ,C 2 ,…,C r ,…,C R The values of (2) are arranged and combined to form [ f (1) x f (2) x … x f (R) x f (R)]And the expressions to be searched.
Wherein still is a 1 ?a 2 ?…?a N-1 For top. TLB. Sub. For example, 6 expressions to be searched are generated: top.TLB1.sub1, top.TLB1.sub2, top.TLB1.sub3, top.TLB2.sub1, top.TLB2.sub2, top.TLB2.sub3.
Step S53, searching all candidate examples based on the expression to be searched, and determining the candidate example containing any expression to be searched as a target search example.
Wherein still is a 1 ?a 2 ?…?a N-1 Taking top.tlb.sub.as an example, a candidate instance including any one of top.tlb1.sub1, top.tlb1.sub2, top.tlb1.sub3, top.tlb2.sub1, top.tlb2.sub2, top.tlb2.sub3 is determined as the target search instance.
It should be noted that, the target search examples obtained in step S4 or step S5 are unordered, and the searches for the hierarchical design are generally desirably arranged based on the order of the hierarchical tree, and as an embodiment, the system further includes a hierarchical tree generated based on the module definition information, where each node corresponds to an example, and the hierarchical relationship between nodes is generated based on the module hierarchical information, and when the processor executes the computer program, the following steps are further implemented:
step S10, acquiring the ordering mode of the current hierarchical tree.
Wherein the current hierarchical tree is ordered in an ascending order of letters or in a descending order of letters, for example, in an ascending order of 26 letters in English, or in a descending order of 26 letters in English.
And step S20, all target search examples are ordered according to the ordering mode of the current hierarchical tree and then output.
It should be noted that if the first letters of the two target search instances are the same, the ranking is based on the second letter, if the second letter is also the same, the ranking is based on the third letter, and so on.
As an embodiment, the system includes a hierarchical tree presentation interface, the hierarchical tree presentation interface defaults to presenting all instances in the hierarchical tree, and the step S20 further includes:
step S30, hiding non-target example search examples in all examples in the hierarchical tree display interface, and only displaying target search examples.
The target search instance can be displayed more intuitively through step S30.
According to the system provided by the embodiment of the invention, a hierarchical tree does not need to be traversed, only the search expression needs to be processed, the search module defines the list to generate all candidate instance paths, and then the candidate instance is generated by splicing the paths based on each candidate instance, so that the time and the memory expenditure of data search based on a design hierarchy are reduced, and the search efficiency is improved.
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 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 data search system based on design level is characterized in that,
the method comprises a module definition list, a memory storing a computer program and a processor, wherein the module definition list comprises module definition information, the module definition information comprises class definition information, module instance information and module level information, and when the processor executes the computer program, the following steps are realized:
step S1, obtaining a search expression a 1 ?a 2 ?…?a n ?…?a N Wherein a is n For the nth level information of the search expression, the value range of N is 1 to N,;
step S2, if n=1, then step S3 is directly executed, if N>1, dividing the search expression into a 1 ?a 2 ?…?a N-1 And a N Two parts, then executing step S3;
step S3, based on a N Searching the module definition list, extracting all the content a N Pre-selected module instance information corresponding to class definition information, and pre-selected module level information corresponding to pre-selected module instance information;
s4, generating all candidate instance paths based on the pre-selection module instance information and the pre-selection module level information, and splicing a of each candidate instance path N Generating candidate examples, if N is equal to 1, determining all candidate examples as target search examples, and if N is greater than 1, executing step S5;
step S5, based on a 1 ?a 2 ?…?a N-1 Searching all candidate instances will include a 1 ?a 2 ?…?a N-1 Is determined as the target search instance.
2. The system of claim 1, wherein the system further comprises a controller configured to control the controller,
a n including only fixed expressions, or a n Including fixed expressions and wildcards.
3. The system of claim 2, wherein the system further comprises a controller configured to control the controller,
if a is N Comprising a fixed expression a1 N And wild card, said step S3 comprises:
step S31, traversing the module definition list to obtain all the expressions a1 containing fixed expressions N Expression set { A } 1 N ,A 2 N ,…,A m N ,…,A M N }，A m N To contain the fixed expression a1 N The M-th expression in the expression set of (a), M ranges from 1 to M, and M is a1 contained in the module definition list N Is the sum of the expressions of (a);
step S32, based on each A m N Searching the module definition list, extracting each A m N Pre-selected module instance information corresponding to class definition information, and pre-selected module level information corresponding to pre-selected module instance information.
4. The system of claim 2, wherein the system further comprises a controller configured to control the controller,
if a is 1 ?a 2 ?…?a N-1 There are R expressions { b } comprising a fixed expression and a wild card 1 ,b 2 ,…,b r ,…,b R },b r For the r-th expression comprising a fixed expression and a wild card, b r Is { a } 1 ，a 2 ，…，a N-1 One of the expressions, R has a value ranging from 1 to R, R being a 1 ?a 2 ?…?a N-1 The total number of the expressions including the fixed expression and the wild card, R is less than or equal to N-1, b r Includes a fixed expression B1 r And a wild card, the step S5 includes:
step S51, traversing the module definition list, and sequentially obtaining the fixed expression B1 1 ,B1 2 ,…,B1 r ,…,B1 R Expression set C of (2) 1 ,C 2 ,…,C r ,…,C R Wherein C r To include the fixed expression B1 r Is set of C r Including f (r) expressions;
step S52, step a 1 ?a 2 ?…?a N-1 A including only fixed expressions n Keeping unchanged, R expressions including fixed expressions and wildcards are set according to C 1 ,C 2 ,…,C r ,…,C R The values of (2) are arranged and combined to form [ f (1) x f (2) x … x f (R) x f (R)]The expressions to be searched;
step S53, searching all candidate examples based on the expression to be searched, and determining the candidate example containing any expression to be searched as a target search example.
5. The system of claim 1, wherein the system further comprises a controller configured to control the controller,
the system further comprises a hierarchical tree generated based on the module definition information, wherein each node corresponds to an instance, a hierarchical relationship between nodes is generated based on the module hierarchy information, and when the processor executes the computer program, the following steps are further implemented:
step S10, acquiring a sorting mode of a current hierarchical tree;
and step S20, all target search examples are ordered according to the ordering mode of the current hierarchical tree and then output.
6. The system of claim 5, wherein the system further comprises a controller configured to control the controller,
the current hierarchical tree is ordered in an ascending alphabetical order or in a descending alphabetical order.
7. The system of claim 5, wherein the system further comprises a controller configured to control the controller,
the system includes a hierarchical tree display interface that defaults to displaying all instances in the hierarchical tree, and the step S20 further includes:
step S30, hiding non-target search examples in all examples in the hierarchical tree display interface, and only displaying target search examples.
8. The system of claim 1, wherein the system further comprises a controller configured to control the controller,
is the preset separator? Is "," or "/".
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311176816.5A CN116955415B (en) | 2023-09-13 | 2023-09-13 | Design hierarchy based data search system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311176816.5A CN116955415B (en) | 2023-09-13 | 2023-09-13 | Design hierarchy based data search system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116955415A CN116955415A (en) | 2023-10-27 |
| CN116955415B true CN116955415B (en) | 2024-01-23 |
Family
ID=88442728
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311176816.5A Active CN116955415B (en) | 2023-09-13 | 2023-09-13 | Design hierarchy based data search system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116955415B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5963948A (en) * | 1996-11-15 | 1999-10-05 | Shilcrat; Esther Dina | Method for generating a path in an arbitrary physical structure |
| CN102929996A (en) * | 2012-10-24 | 2013-02-13 | 华南理工大学 | XPath query optimization method and system |
| CN109189810A (en) * | 2018-08-28 | 2019-01-11 | 拉扎斯网络科技（上海）有限公司 | Query method, query device, electronic equipment and computer-readable storage medium |
| CN109522320A (en) * | 2018-11-12 | 2019-03-26 | 杭州弗兰科信息安全科技有限公司 | A kind of optimization method for serving database homomorphic cryptography |
| CN111552666A (en) * | 2020-03-23 | 2020-08-18 | 苏州沁游网络科技有限公司 | Resource acquisition method, device, equipment and storage medium |
| CN113656830A (en) * | 2021-08-06 | 2021-11-16 | 杭州安恒信息技术股份有限公司 | Database desensitization grammar parsing method, system, computer and readable storage medium |
| CN115203206A (en) * | 2022-07-13 | 2022-10-18 | 树根互联股份有限公司 | Data content searching method and device, computer equipment and readable storage medium |
| CN115827715A (en) * | 2023-02-08 | 2023-03-21 | 上海合见工业软件集团有限公司 | Search recommendation list generation system based on user behaviors and design hierarchical tree |
| CN116483644A (en) * | 2023-06-25 | 2023-07-25 | 北京云枢创新软件技术有限公司 | Log search method for chip verification test regression, electronic equipment and medium |
| CN116680278A (en) * | 2023-07-28 | 2023-09-01 | 腾讯科技（深圳）有限公司 | Data processing method, device, electronic equipment and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020138648A1 (en) * | 2001-02-16 | 2002-09-26 | Kuang-Chih Liu | Hash compensation architecture and method for network address lookup |
| US10649986B2 (en) * | 2017-01-31 | 2020-05-12 | Salesforce.Com, Inc. | Systems, methods, and apparatuses for implementing a BY ORGID command term within a multi-tenant aware structured query language |
-
2023
- 2023-09-13 CN CN202311176816.5A patent/CN116955415B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5963948A (en) * | 1996-11-15 | 1999-10-05 | Shilcrat; Esther Dina | Method for generating a path in an arbitrary physical structure |
| CN102929996A (en) * | 2012-10-24 | 2013-02-13 | 华南理工大学 | XPath query optimization method and system |
| CN109189810A (en) * | 2018-08-28 | 2019-01-11 | 拉扎斯网络科技（上海）有限公司 | Query method, query device, electronic equipment and computer-readable storage medium |
| CN109522320A (en) * | 2018-11-12 | 2019-03-26 | 杭州弗兰科信息安全科技有限公司 | A kind of optimization method for serving database homomorphic cryptography |
| CN111552666A (en) * | 2020-03-23 | 2020-08-18 | 苏州沁游网络科技有限公司 | Resource acquisition method, device, equipment and storage medium |
| CN113656830A (en) * | 2021-08-06 | 2021-11-16 | 杭州安恒信息技术股份有限公司 | Database desensitization grammar parsing method, system, computer and readable storage medium |
| CN115203206A (en) * | 2022-07-13 | 2022-10-18 | 树根互联股份有限公司 | Data content searching method and device, computer equipment and readable storage medium |
| CN115827715A (en) * | 2023-02-08 | 2023-03-21 | 上海合见工业软件集团有限公司 | Search recommendation list generation system based on user behaviors and design hierarchical tree |
| CN116483644A (en) * | 2023-06-25 | 2023-07-25 | 北京云枢创新软件技术有限公司 | Log search method for chip verification test regression, electronic equipment and medium |
| CN116680278A (en) * | 2023-07-28 | 2023-09-01 | 腾讯科技（深圳）有限公司 | Data processing method, device, electronic equipment and storage medium |
Non-Patent Citations (5)
| Title |
|---|
| Identifying hierarchies for fast optimal search;Uras T 等;Proceedings of the AAAI Conference on Artificial Intelligence;第28卷(第1期);1-7 * |
| 一种用于RPA系统的DOM对象快速搜索与定位算法;孟媛 等;计算机科学;第49卷(第10期);252-257 * |
| 基于树分解结构的Top-k最短路径查询算法;崇昊旻;陈合;;计算机与现代化(第05期);14-19 * |
| 基于通用SQL数据集的水调报表构建方法;张高峰;吉翔华;陈凯;蒲桂林;文沛;贺帅;顾全;;人民长江(第S1期);271-274 * |
| 面向对象的机械产品设计实例表示方法及检索策略研究;胡良明;徐诚;王永娟;刘刚;;南京理工大学学报(自然科学版)(第01期);108-111+125 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116955415A (en) | 2023-10-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106598591B (en) | Webpage dynamic menu generation method and device | |
| US7370039B2 (en) | Method and system for optimizing configuration classification of software | |
| WO2019169858A1 (en) | Searching engine technology based data analysis method and system | |
| EP2631815A1 (en) | Method and device for ordering search results, method and device for providing information | |
| EP3937029A2 (en) | Method and apparatus for training search model, and method and apparatus for searching for target object | |
| CN103873318A (en) | Website automated testing method and automated testing system | |
| CN106528648A (en) | Distributed keyword approximate search method for RDF in combination with Redis memory database | |
| CN112883030A (en) | Data collection method and device, computer equipment and storage medium | |
| CN115358397A (en) | Parallel graph rule mining method and device based on data sampling | |
| CN114707051A (en) | Web page similar element searching method and system | |
| CN111984673B (en) | Fuzzy retrieval method and device for tree structure of power grid electric energy metering system | |
| CN114297535A (en) | Page display method, device and equipment for query conditions and storage medium | |
| CN110874366A (en) | Data processing and query method and device | |
| Swe et al. | Bug localization approach using source code structure with different structure fields | |
| CN116955415B (en) | Design hierarchy based data search system | |
| EP4254279A1 (en) | Machine learning pipeline augmented with explanation | |
| CN112306452A (en) | Method, device and system for processing service data by merging and sorting algorithm | |
| CN116957041A (en) | Method, device and computing equipment for compressing neural network model | |
| CN105824976A (en) | Method and device for optimizing word segmentation banks | |
| CN114610751A (en) | Structured parameter analysis method, device, equipment and medium for geographic computing language | |
| CN113495963B (en) | Embedded representation method and device of network security knowledge graph | |
| Álvarez et al. | A Task-specific Approach for Crawling the Deep Web. | |
| Marotta et al. | Managing source schema evolution in web warehouses | |
| CN114201525B (en) | Method and device for querying data | |
| EP4050525A2 (en) | Machine learning pipeline skeleton instantiation |
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 |