CN117112618A - EDA software data query method, electronic device and medium - Google Patents
EDA software data query method, electronic device and medium Download PDFInfo
- Publication number
- CN117112618A CN117112618A CN202311390150.3A CN202311390150A CN117112618A CN 117112618 A CN117112618 A CN 117112618A CN 202311390150 A CN202311390150 A CN 202311390150A CN 117112618 A CN117112618 A CN 117112618A
- Authority
- CN
- China
- Prior art keywords
- eda software
- query
- target
- data
- software data
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000008859 change Effects 0.000 claims description 8
- 238000005192 partition Methods 0.000 claims description 3
- 239000000758 substrate Substances 0.000 claims 3
- 230000008569 process Effects 0.000 description 6
- 230000009471 action Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000004140 cleaning Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
- 239000002699 waste material Substances 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/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- 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/25—Integrating or interfacing systems involving database management systems
-
- 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)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the technical field of EDA software, in particular to an EDA software data query method, electronic equipment and a medium, wherein the method comprises the following steps: step S1, according to U i The data query dimension and the data query granularity of the required query construct an index table Q i The method comprises the steps of carrying out a first treatment on the surface of the Step S2, obtaining U i Corresponding target EDA software data query request, query Q i If the target index corresponding to the target EDA software data exists, executing the step S3, otherwise, executing the step S4; step S3, calling a data query interface of the storage module to query based on the target index to acquire U i Corresponding target EDA software data; s4, directly inquiring the storage module, acquiring target EDA software data and a target address corresponding to the target EDA software data, and sending the target EDA software data and the target address to the U i At Q i Corresponding to the increase ofAnd (5) indexing. The invention reduces the memory resources occupied by EDA software data query and improves the EDA software data query efficiency.
Description
Technical Field
The present invention relates to the technical field of EDA software, and in particular, to an EDA software data query method, electronic device, and medium.
Background
During the operation of electronic design automation (Electronic Design Automation, EDA for short), a great amount of dynamic relationship data is required to be queried, and the dynamic relationship data includes relationships among elements, element information, membership relationships and the like. EDA software generally stores data in a continuous storage mode, and if no index is established, continuous scanning inquiry is needed in the inquiry process, so that the data inquiry efficiency is low and the response time of a user is long. In the prior art, an index is directly built on a storage module of EDA software to improve query efficiency, but the index is determined according to query characteristics, so that an index data structure is diversified, and if the index is stored in the data storage module for a long life cycle, a large amount of memory resources are occupied for a long time in the running period, so that the problems of resource shortage and low utilization rate are caused. In addition, the diversified index data structure is bound with the data storage module, so that maintainability is poor, and coupling density is high. Therefore, how to reduce the memory resources occupied by the EDA software data query and improve the data query efficiency is a technical problem to be solved.
Disclosure of Invention
The invention aims to provide an EDA software data query method, electronic equipment and a medium, which reduce memory resources occupied by EDA software data query and improve EDA software data query efficiency.
According to a first aspect of the present invention, there is provided a method for querying data of EDA software, the EDA software comprising a memory module and K user modules { U } 1 ,U 2 ,…,U k ,…,U K A storage module and K user modules are independently arranged, wherein the storage module is used for storing EDA software data to be stored in a continuous memory mode according to business logic partition, and U k For the kth user module, the value of K ranges from 1 to K, U k Comprising a read module and/or a write module, U k For reading EDA software data from or writing EDA to the memory moduleSoftware data;
the method comprises the following steps:
step S1, according to U i Data query dimension and data query granularity of the required query, U i Construct a corresponding index table Q i ，U i For a user module comprising a reading module, the value range of i is 1 to K;
step S2, obtaining U i Corresponding target EDA software data query request for querying current Q i If the target index corresponding to the target EDA software data exists, executing the step S3, otherwise, executing the step S4;
step S3, calling a data query interface of the storage module to query the storage module based on the target index to acquire U i Corresponding target EDA software data;
step S4, directly inquiring the storage module, acquiring target EDA software data and target addresses corresponding to the target EDA software data, and sending the target EDA software data and the target addresses corresponding to the target EDA software data to the U i ，U i Based on the target address at Q i The corresponding index is incremented.
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 EDA software data query method, the electronic equipment and the medium provided by the invention can achieve quite technical progress and practicality, have wide industrial utilization value, and have at least the following beneficial effects:
according to the invention, the index table is arranged in the inclusion module user module, so that EDA software queries the storage module in an external index mark mode, and the storage module and the index table are decoupled. Each user module can construct a corresponding index table according to the data query dimension and the data query granularity of the required query, and the diversity of the index table is realized. In addition, each target index is built in the index table for subsequent searching during the first inquiry, so that the on-demand dynamic construction of the index table is realized. The method reduces the memory resources occupied by EDA software data query and improves the EDA software data query efficiency.
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 an EDA software data query method 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.
According to a first aspect of the present invention, there is provided a method for querying data of EDA software, the EDA software comprising a memory module and K user modules { U } 1 ,U 2 ,…,U k ,…,U K A storage module and K user modules are independently arranged, wherein the storage module is used for storing EDA software data to be stored in a continuous memory mode according to business logic partition, and U k For the kth user module, K is in the range of 1 to K, and K is the total number of the user modules in the EDA softwareIt will be appreciated that the number of user modules may be added or deleted depending on the particular application, and thus the particular value of K will vary with the number of user modules. U (U) k Comprising a read module and/or a write module, U k For reading or writing EDA software data from or into the memory module; u is as follows k Only the read module may be included for reading EDA software data from the memory module only. U (U) k It is also possible to include only a write module for only overwriting EDA software data in the storage module. U (U) k The EDA software data can be read from the storage module or rewritten in the storage module. The EDA software is provided with a plurality of application program interfaces (Application Program Interface, API for short) for realizing different operations on the storage module, and specifically comprises a data query interface, a subscription change notification interface, a data writing operation interface and a cancellation change notification interface.
The method comprises the following steps:
step S1, according to U i Data query dimension and data query granularity of the required query, U i Construct a corresponding index table Q i ，U i For a user module comprising a read module, i has a value in the range 1 to K.
According to the query service requirements of each user module comprising the reading module, corresponding query dimensions and query granularity are set, so that the diversity of the index data structure is realized, and the index requirement difference caused by different service requirement differences is met. Because the user module and the storage module are independently arranged, the index table is also independent of the storage module, the index table is decoupled from the storage module, the maintenance is convenient, and the storage resource of the memory module is not occupied.
Step S2, obtaining U i Corresponding target EDA software data query request for querying current Q i If there is a target index corresponding to the target EDA software data, executing step S3, otherwise, executing step S4.
U is as follows i In the EDA software data query process, pairThe number of times of the data to be queried is different and the query time period is also different, if all the data to be queried are directly indexed, the waste of memory resources is caused, so that the Q can be initially i Is empty, when target EDA software data is queried for the first time, the target EDA software data is queried again based on the query result in Q i And (3) constructing an index for direct use in subsequent inquiry. For a small number of target indexes, the target indexes may be used only once, but the indexes used only once occupy a relatively small amount, so that the real-time dynamic creation of the target indexes can reduce the occupation of memory resources as a whole.
Step S3, calling a data query interface of the storage module to query the storage module based on the target index to acquire U i Corresponding target EDA software data.
The data query interface is provided in an API mode, so that the reading module can continuously perfect index information held by the reading module during query, and when the index is already provided, the reading module does not need to traverse all storage in the storage module, so that IO loss of traversing and searching all data during repeated query is reduced.
Step S4, directly inquiring the storage module, acquiring target EDA software data and target addresses corresponding to the target EDA software data, and sending the target EDA software data and the target addresses corresponding to the target EDA software data to the U i ，U i Based on the target address at Q i The corresponding index is incremented.
The dynamic creation of the target index is achieved by step S4. The index data occupation resource is precisely controlled by the user module, the resource utilization efficiency is improved, and the memory resource occupation in the operation period is reduced.
As one embodiment, the data query dimensions include element relationships, element information, and genus relationships, etc., and the query granularity is proportional to the target address range to which the target EDA software data corresponds. The storage module is used for partitioning and storing the element relation, the element information and the genus relation data in a continuous memory mode. The query granularity can be specifically an address range interval with different sizes or a specific address, and each user module is independently set, so that the index table of the user module comprising the reading module is also independently set, and therefore, a personalized index table can be set for each user module comprising the reading module, thereby realizing diversified setting of the index table in the EDA software. For example, the user module 1 needs to construct an index key according to the names of the components, so as to quickly inquire the component information according to the names; the user module 2 needs to construct index keys according to the component relationships, and quickly inquires the component relationships according to names.
As an embodiment, the specific structure of the index table may be specifically set according to different query requirements, and in the step S1, if U i The space occupation requirement of the corresponding data query is higher than the query speed requirement, and a U is constructed by adopting a red-black tree mode i Corresponding index table Q i If U i The corresponding query speed requirement is higher than the space occupation requirement of the data query, and a hash table mode is adopted to construct U i Corresponding index table Q i . For example, user module 3 needs to build an index using the red-black tree in order to arrive at an ordered query; again, the user module 5 needs to build an index using a hash table in order to achieve fast polling.
After the index is established, the corresponding EDA software data in the storage module may change, and if the index table and the data in the storage module are not synchronous, data query errors are caused, so that the synchronism of the index table and the data in the storage module needs to be ensured, and the accuracy of the index table is ensured. As an embodiment, the method further comprises:
step S10, U i Sending a subscription index query range request to the storage module through a subscription change notification interface of the storage module, wherein the storage module records U i And (5) corresponding index query ranges.
U is as follows i The corresponding index query range is U i The address range to which the data to be queried belongs.
Step S20, the storage module receives U through a data writing operation interface of the storage module j The corresponding EDA software data writing operation is executed by the sent EDA software data writing request, U j To include a writing moduleThe value of j ranges from 1 to K.
U is as follows i And U j May be the same user module or may be a different user module.
Step S30, if the address range for executing EDA software data writing operation belongs to U i Corresponding subscription index queries the scope, and then to U i And sending the update index information corresponding to the written EDA software data.
Step S40, U i And updating the corresponding index table Q based on the received updating index information corresponding to the written EDA software data.
Through the steps S10-S40, the storage module can acquire each U i Corresponding index inquiry range, and can be synchronized to corresponding U in real time when the data in the storage module changes i So that U i The corresponding index information can be synchronously updated in real time, so that dirty data index cleaning action is realized. In addition, index data and a custom query method are used through a unified interface, and the storage and application personalized requirements are completely decoupled. The application definition index is built according to the requirement, the logic is external, the code readability is enhanced, and the maintainability of an EDA software system is improved;
as an embodiment, in the step S20, the data writing request may specifically be a new data writing request, a data changing request or a data deleting request, so as to implement operations of adding, modifying and deleting data.
As an embodiment, the method further comprises:
step S100, U i Sending a cancellation index query range information request to the storage module through a cancellation change notification interface of the storage module, wherein the storage module deletes U i And (5) corresponding index query ranges.
It will be appreciated that the memory module deletes U i After the corresponding index query scope, U i After the data in the corresponding index query range changes, the storage module does not need to go to U any more i And sending the update index information corresponding to the written EDA software data.
Step S200, destroy Q i Release Q i Occupied memory resources.
When Q is i After finishing the service, the received notification action is logged off and Q is released through a logging-off change notification interface provided by the storage module i The held index data occupies the run-time resources. Based on the above, the embodiment of the invention realizes that the index data is arranged outside the storage module, and the life cycle of the index data can be accurately controlled.
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, the index table is arranged in the inclusion module user module, so that EDA software queries the storage module in an external index target mode, and the storage module and the index table are decoupled. Each user module can construct a corresponding index table according to the data query dimension and the data query granularity of the required query, and the diversity of the index table is realized. In addition, each target index is built in the index table for subsequent searching during the first inquiry, so that the on-demand dynamic construction of the index table is realized. The method reduces the memory resources occupied by EDA software data query and improves the EDA software data query efficiency.
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. An EDA software data query method is characterized in that,
the EDA software comprises a storage module and K user modules { U } 1 ,U 2 ,…,U k ,…,U K A storage module and K user modules are independently arranged, wherein the storage module is used for storing EDA software data to be stored in a continuous memory mode according to business logic partition, and U k For the kth user module, the value of K ranges from 1 to K, U k Comprising a read module and/or a write module, U k For reading or writing EDA software data from or into the memory module;
the method comprises the following steps:
step S1, according to U i Data query dimension and data query granularity of the required query, U i Construct a corresponding index table Q i ，U i For a user module comprising a reading module, the value range of i is 1 to K;
step S2, obtaining U i Corresponding target EDA software data query request for querying current Q i If the target index corresponding to the target EDA software data exists, executing the step S3, otherwise, executing the step S4;
step S3, calling the data query interface of the storage module based on the target indexInquiring the storage module through the port to obtain U i Corresponding target EDA software data;
step S4, directly inquiring the storage module, acquiring target EDA software data and target addresses corresponding to the target EDA software data, and sending the target EDA software data and the target addresses corresponding to the target EDA software data to the U i ，U i Based on the target address at Q i The corresponding index is incremented.
2. The method of claim 1, wherein the step of determining the position of the substrate comprises,
the data query dimension comprises element relationships, element information and genus relationships, and the query granularity is proportional to a target address range corresponding to target EDA software data.
3. The method of claim 1, wherein the step of determining the position of the substrate comprises,
in the step S1, if U i The space occupation requirement of the corresponding data query is higher than the query speed requirement, and a U is constructed by adopting a red-black tree mode i Corresponding index table Q i If U i The corresponding query speed requirement is higher than the space occupation requirement of the data query, and a hash table mode is adopted to construct U i Corresponding index table Q i 。
4. The method of claim 1, wherein the step of determining the position of the substrate comprises,
the method further comprises the steps of:
step S10, U i Sending a subscription index query range request to the storage module through a subscription change notification interface of the storage module, wherein the storage module records U i A corresponding index query range;
step S20, the storage module receives U through a data writing operation interface of the storage module j The corresponding EDA software data writing operation is executed by the sent EDA software data writing request, U j For a user module comprising a writing module, the value range of j is 1 to K;
step S30, if the address range for executing EDA software data writing operation belongs to U i Corresponding subscription index queries the scope, and then to U i Sending update index information corresponding to the written EDA software data;
step S40, U i And updating the corresponding index table Q based on the received updating index information corresponding to the written EDA software data.
5. The method of claim 4, wherein the step of determining the position of the first electrode is performed,
in the step S20, the data writing request is a new data writing request, a data changing request or a data deleting request.
6. The method of claim 4, wherein the step of determining the position of the first electrode is performed,
the method further comprises the steps of:
step S100, U i Sending a cancellation index query range information request to the storage module through a cancellation change notification interface of the storage module, wherein the storage module deletes U i A corresponding index query range;
step S200, destroy Q i Release Q i Occupied memory resources.
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 |
|---|---|---|---|
| CN202311390150.3A CN117112618B (en) | 2023-10-25 | 2023-10-25 | EDA software data query method, electronic device and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311390150.3A CN117112618B (en) | 2023-10-25 | 2023-10-25 | EDA software data query method, electronic device and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117112618A true CN117112618A (en) | 2023-11-24 |
| CN117112618B CN117112618B (en) | 2024-01-26 |
Family
ID=88806028
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311390150.3A Active CN117112618B (en) | 2023-10-25 | 2023-10-25 | EDA software data query method, electronic device and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117112618B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117573704A (en) * | 2024-01-17 | 2024-02-20 | 上海合见工业软件集团有限公司 | Method, device, equipment and medium for indexing composite document of EDA software |
| CN117909301A (en) * | 2024-03-19 | 2024-04-19 | 上海合见工业软件集团有限公司 | Index-based object query method, device, equipment and medium |
| CN117909301B (en) * | 2024-03-19 | 2024-06-07 | 上海合见工业软件集团有限公司 | Index-based object query method, device, equipment and medium |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002251418A (en) * | 2001-02-23 | 2002-09-06 | Matsushita Electric Ind Co Ltd | Eda library management method |
| JP2004234397A (en) * | 2003-01-31 | 2004-08-19 | Matsushita Electric Ind Co Ltd | Method for controlling eda library |
| JP2004240595A (en) * | 2003-02-05 | 2004-08-26 | Matsushita Electric Ind Co Ltd | System for receiving order of eda library |
| US20180357433A1 (en) * | 2017-06-08 | 2018-12-13 | International Business Machines Corporation | Parallel access to running eda application |
| CN109614402A (en) * | 2018-12-11 | 2019-04-12 | 北京京东金融科技控股有限公司 | Multidimensional data query method and device |
| CN110378462A (en) * | 2019-06-22 | 2019-10-25 | 南京理工大学 | Solve the improvement EDA algorithm with time permutation flowshop scheduling problem |
| CN112181993A (en) * | 2020-10-27 | 2021-01-05 | 广州市网星信息技术有限公司 | Service data query method, device, server and storage medium |
| CN112417227A (en) * | 2021-01-21 | 2021-02-26 | 国能信控互联技术有限公司 | Real-time data storage and query method based on hash table and red-black tree |
| CN113569508A (en) * | 2021-09-18 | 2021-10-29 | 芯行纪科技有限公司 | Database model construction method and device for data indexing and access based on ID |
| CN115113860A (en) * | 2022-08-31 | 2022-09-27 | 北京云枢创新软件技术有限公司 | Python-based EDA (electronic design automation) software secondary development system |
| WO2023104183A1 (en) * | 2021-12-09 | 2023-06-15 | Huawei Cloud Computing Technologies Co., Ltd. | Methods and systems for event management |
| CN116383155A (en) * | 2023-06-05 | 2023-07-04 | 成都融见软件科技有限公司 | Log query system based on EDA verification simulator |
| CN116521576A (en) * | 2023-05-11 | 2023-08-01 | 上海合见工业软件集团有限公司 | EDA software data processing system |
| WO2023143096A1 (en) * | 2022-01-26 | 2023-08-03 | 阿里云计算有限公司 | Data query method and apparatus, and device and storage medium |
| CN116661856A (en) * | 2023-08-01 | 2023-08-29 | 上海合见工业软件集团有限公司 | Data splicing system of EDA software |
-
2023
- 2023-10-25 CN CN202311390150.3A patent/CN117112618B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002251418A (en) * | 2001-02-23 | 2002-09-06 | Matsushita Electric Ind Co Ltd | Eda library management method |
| JP2004234397A (en) * | 2003-01-31 | 2004-08-19 | Matsushita Electric Ind Co Ltd | Method for controlling eda library |
| JP2004240595A (en) * | 2003-02-05 | 2004-08-26 | Matsushita Electric Ind Co Ltd | System for receiving order of eda library |
| US20180357433A1 (en) * | 2017-06-08 | 2018-12-13 | International Business Machines Corporation | Parallel access to running eda application |
| CN109614402A (en) * | 2018-12-11 | 2019-04-12 | 北京京东金融科技控股有限公司 | Multidimensional data query method and device |
| CN110378462A (en) * | 2019-06-22 | 2019-10-25 | 南京理工大学 | Solve the improvement EDA algorithm with time permutation flowshop scheduling problem |
| CN112181993A (en) * | 2020-10-27 | 2021-01-05 | 广州市网星信息技术有限公司 | Service data query method, device, server and storage medium |
| CN112417227A (en) * | 2021-01-21 | 2021-02-26 | 国能信控互联技术有限公司 | Real-time data storage and query method based on hash table and red-black tree |
| CN113569508A (en) * | 2021-09-18 | 2021-10-29 | 芯行纪科技有限公司 | Database model construction method and device for data indexing and access based on ID |
| WO2023104183A1 (en) * | 2021-12-09 | 2023-06-15 | Huawei Cloud Computing Technologies Co., Ltd. | Methods and systems for event management |
| WO2023143096A1 (en) * | 2022-01-26 | 2023-08-03 | 阿里云计算有限公司 | Data query method and apparatus, and device and storage medium |
| CN115113860A (en) * | 2022-08-31 | 2022-09-27 | 北京云枢创新软件技术有限公司 | Python-based EDA (electronic design automation) software secondary development system |
| CN116521576A (en) * | 2023-05-11 | 2023-08-01 | 上海合见工业软件集团有限公司 | EDA software data processing system |
| CN116383155A (en) * | 2023-06-05 | 2023-07-04 | 成都融见软件科技有限公司 | Log query system based on EDA verification simulator |
| CN116661856A (en) * | 2023-08-01 | 2023-08-29 | 上海合见工业软件集团有限公司 | Data splicing system of EDA software |
Non-Patent Citations (2)
| Title |
|---|
| DANDAN LIU.ET AL: "Methodology of fault injection based on EDA software", 2010 PROGNOSTICS AND SYSTEM HEALTH MANAGEMENT CONFERENCE, pages 1 - 5 * |
| 陈雪梅: "EDA海量数据查询和报表性能优化", 广东通信技术, pages 65 - 67 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117573704A (en) * | 2024-01-17 | 2024-02-20 | 上海合见工业软件集团有限公司 | Method, device, equipment and medium for indexing composite document of EDA software |
| CN117573704B (en) * | 2024-01-17 | 2024-04-12 | 上海合见工业软件集团有限公司 | Method, device, equipment and medium for indexing composite document of EDA software |
| CN117909301A (en) * | 2024-03-19 | 2024-04-19 | 上海合见工业软件集团有限公司 | Index-based object query method, device, equipment and medium |
| CN117909301B (en) * | 2024-03-19 | 2024-06-07 | 上海合见工业软件集团有限公司 | Index-based object query method, device, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117112618B (en) | 2024-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN117112618B (en) | EDA software data query method, electronic device and medium | |
| CN100353325C (en) | Method for realing sharing internal stored data base and internal stored data base system | |
| CN102741843B (en) | Method and apparatus for reading data from database | |
| WO2022017347A1 (en) | Distributed database system and data processing method | |
| CN104252501B (en) | A kind of computing device and method executing database manipulation order | |
| CN108509462B (en) | Method and device for synchronizing activity transaction table | |
| CN109933609B (en) | Method and terminal for generating IDs in batches | |
| CN108073696B (en) | GIS application method based on distributed memory database | |
| CN113220659B (en) | Data migration method, system, electronic device and storage medium | |
| CN107977446A (en) | A kind of memory grid data load method based on data partition | |
| CN109656950B (en) | Recursive query method, device, server and storage medium | |
| CN112395264A (en) | Processing method for mapping between logical target and volume in distributed storage system | |
| CN102163232A (en) | SQL (Structured Query Language) interface implementing method supporting IEC61850 object query | |
| CN103886109A (en) | Method and device for realizing row lock of database | |
| CN104166661A (en) | Data storage system and method | |
| CN113704248B (en) | Block chain query optimization method based on external index | |
| CN108090056A (en) | Data query method, apparatus and system | |
| CN108280123B (en) | HBase column polymerization method | |
| CN105956041A (en) | Data model processing method based on Spring Data for MongoDB cluster | |
| WO2024041433A1 (en) | Data processing method and apparatus | |
| CN111414356A (en) | Data storage method and device, non-relational database system and storage medium | |
| WO2024041376A1 (en) | Distributed graph data processing system, method, apparatus and device, and storage medium | |
| CN111752941B (en) | Data storage and access method and device, server and storage medium | |
| CN113626382B (en) | Index method, system and related device for aggregation object in distributed file system | |
| CN100486177C (en) | Method of synchronously operating network element by network management and its system |
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 |