CN101650689B - Nonvolatile data storage and search method and device - Google Patents
Nonvolatile data storage and search method and device Download PDFInfo
- Publication number
- CN101650689B CN101650689B CN2009101718780A CN200910171878A CN101650689B CN 101650689 B CN101650689 B CN 101650689B CN 2009101718780 A CN2009101718780 A CN 2009101718780A CN 200910171878 A CN200910171878 A CN 200910171878A CN 101650689 B CN101650689 B CN 101650689B
- Authority
- CN
- China
- Prior art keywords
- nonvolatile data
- data
- module
- compiling
- tree structure
- 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 48
- 238000013500 data storage Methods 0.000 title claims abstract description 11
- 238000004364 calculation method Methods 0.000 claims description 35
- 230000008569 process Effects 0.000 description 12
- 238000010586 diagram Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 3
- 230000003068 static effect Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/06—Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Devices For Executing Special Programs (AREA)
- Stored Programmes (AREA)
Abstract
The invention discloses a nonvolatile data storage and search method which comprises the following steps: identifying sorted nonvolatile data into a tree structure and assigning values on nodes in the tree structure; compiling links for the tree structure with assigned node values, programming the results of the compiled links and storing base addresses during programming; according to the results of the compiled links and the base addresses during programming, computing the offset and the size of nonvolatile data to be searched; and according to the base addresses during programming and the computing results of the offset and the size of the nonvolatile data to be searched, searching the nonvolatile data. The invention also discloses a nonvolatile data storage and search device. By the method and the device disclosed by the invention, the stored nonvolatile data can be expanded conveniently and nested deeply to improve the utilization ratio of a storage space; in addition, the search method is visualized.
Description
Technical Field
The present invention relates to data storage technology in communication systems, and in particular, to a method and apparatus for storing and retrieving nonvolatile data.
Background
With the development of mobile communication technology, the updating speed of terminals is also faster and faster, and terminal manufacturers are continuously developing terminal products with multiple service functions in order to attract more users. Terminal manufacturers develop terminal functions with the aid of terminal software platforms during the development process, which involves many different kinds of non-volatile data, such as: the number of the terminal to be subdivided is about one hundred thousand by factory parameters, physical layer parameters, communication protocols, network parameters and the like, and therefore, the method is important for organization and management of terminal nonvolatile data.
The method for organizing the nonvolatile data comprises the following steps: and storing and retrieving. At present, the non-volatile data is organized by: and storing by adopting an array structure, and retrieving by adopting an Id index access method. However, due to the limitation of the linear structure of the array itself, namely: each data item in the array is arranged according to a corresponding number, and the numbers are arranged from small to large or from large to small, for example: 1. 2, 3, 4, 5, etc., if the data items are to be inserted or deleted in the array, the data items in the array need to be numbered again, so that the nonvolatile data in the array is difficult to expand, the transplanting process is complicated, and the nestability is poor; the retrieval of the nonvolatile data is carried out according to the numbers corresponding to different data items, so that the retrieval method is not intuitive; in addition, the size of the storage space of the data items needs to be the same when the nonvolatile data is stored, so that the storage space corresponding to part of the data items is not fully utilized, a lot of storage space is wasted, and the utilization rate of the storage space is not high.
Disclosure of Invention
In view of the above, the main objective of the present invention is to provide a method and an apparatus for storing and retrieving nonvolatile data, so that the stored terminal nonvolatile data is easy to expand, can be deeply nested, improves the utilization rate of the storage space, and is intuitive.
In order to achieve the purpose, the technical scheme of the invention is realized as follows:
the invention provides a nonvolatile data storage and retrieval method, which comprises the following steps:
defining the classified nonvolatile data as a tree structure, and assigning values to nodes in the tree;
compiling and linking the tree structure with the nodes assigned, programming the result of the compiling and linking and storing the base address during programming;
and informing a compiler of the parameter name corresponding to the nonvolatile data to be retrieved, calculating the offset and the size of the nonvolatile data to be retrieved according to the storage layout of each node in the tree structure obtained by compiling and linking and the base address during programming, and retrieving the nonvolatile data according to the base address during programming and the calculation result of the offset and the size of the nonvolatile data to be retrieved.
Before defining the classified nonvolatile data as a tree structure, the method further includes:
and classifying the nonvolatile data according to requirements.
The classified nonvolatile data is defined as a tree structure, and C language is adopted; accordingly, the method can be used for solving the problems that,
the calculating the offset and the size of the nonvolatile data to be retrieved according to the storage layout of each node in the tree structure obtained by compiling and linking and the base address during programming specifically comprises the following steps:
based on the compiled link result and the base address during programming, the offset and size of the nonvolatile data to be retrieved are calculated by using the data offset calculation method offset of and the data size calculation method sizeof provided by the C language.
In the foregoing solution, when the nonvolatile data needs to be expanded, the method further includes: and classifying the newly added nonvolatile data, accessing the data into the originally defined tree structure to form a new node, and performing compiling and linking and programming operation on the whole new tree structure again.
The nonvolatile data is classified according to requirements, and the classifying is as follows: the nonvolatile data is classified by different application service fields of the nonvolatile data or by different data types of the nonvolatile data.
The invention also proposes a device for storing and retrieving non-volatile data, the device comprising: the device comprises a definition module, a compiling module, a programming module, a calculation module and a retrieval module; wherein,
the definition module is used for defining the classified nonvolatile data into a tree structure, assigning values to nodes in the tree, and sending the definition and assignment results to the compiling module;
the compiling module is used for executing compiling and linking operation according to the tree structure which is defined by the defining module and is assigned to the nodes, and informing the programming module of the compiling and linking result;
the programming module is used for programming the result of the compiling link sent by the compiling module and storing the base address during programming;
the calculation module is used for informing the compiler of the parameter name corresponding to the nonvolatile data to be retrieved, calculating the offset and the size of the nonvolatile data to be retrieved according to the storage layout of each node in the tree structure obtained by compiling and linking and the base address during programming, and sending the calculation result to the retrieval module;
and the retrieval module is used for retrieving the nonvolatile data according to the base address when the programming module performs programming and the calculation result of the offset and the size of the nonvolatile data to be retrieved by the calculation module.
The device further comprises a classification module which is used for classifying the nonvolatile data according to the requirement and informing the definition module of the classification result.
The definition module defines the classified nonvolatile data as a tree structure and adopts C language; accordingly, the method can be used for solving the problems that,
the calculation module calculates the offset and the size of the nonvolatile data to be retrieved according to the storage layout of each node in the tree structure obtained by compiling and linking and the base address during programming, and specifically comprises the following steps:
based on the compiled link result and the base address of the programming module, the offset and size of the nonvolatile data to be retrieved are calculated by using the data offset calculation method offset of and the data size calculation method sizeof provided by the C language.
In the above scheme, the classification module classifies the nonvolatile data as required, and includes: the nonvolatile data is classified by different application service fields of the nonvolatile data or by different data types of the nonvolatile data.
The invention provides a method and a device for storing and retrieving nonvolatile data, which define classified nonvolatile data as a tree structure and assign values to nodes in the tree; compiling and linking the tree structure with the nodes assigned, programming the result of the compiling and linking and storing the base address during programming; and calculating the offset and the size of the nonvolatile data to be retrieved according to the compiling and linking result and the base address during programming, and retrieving the nonvolatile data according to the base address during programming and the calculation result of the offset and the size of the nonvolatile data to be retrieved. The nonvolatile data in the invention is defined as a tree structure, if the branch of a certain layer in the tree structure is required to be increased or the layer number of the tree structure is required to be increased, only the corresponding code line is required to be increased, the original code is not required to be modified, and the nonvolatile data is easy to expand and deeply nest compared with an array structure; in the process of storing the nonvolatile data, because the sizes of the storage spaces corresponding to different nodes in the tree structure can be different, and the sizes of the nodes are consistent with the size of the storage space, the storage space is saved, and the utilization rate is improved; in addition, the searching process is carried out according to the parameter names corresponding to the nonvolatile data, so that the searching method has good intuitiveness compared with the prior art.
Drawings
FIG. 1 is a schematic flow chart of a nonvolatile data storage and retrieval method according to the present invention;
FIG. 2 is a schematic diagram of a tree structure composed of nonvolatile data;
FIG. 3 is a schematic diagram of a storage layout structure of each node in a tree structure obtained by compiling links;
FIG. 4 is a schematic diagram of a nonvolatile data storage and retrieval device according to the present invention.
Detailed Description
The basic idea of the invention is: defining the classified nonvolatile data as a tree structure, and assigning values to nodes in the tree; compiling and linking the tree structure with the nodes assigned, programming the result of the compiling and linking and storing the base address during programming; and calculating the offset and the size of the nonvolatile data to be retrieved according to the compiling and linking result and the base address during programming, and retrieving the nonvolatile data according to the base address during programming and the calculation result of the offset and the size of the nonvolatile data to be retrieved.
The compiling language adopted in the implementation process of the scheme of the invention can be as follows: C. VB or Java, etc.; the non-volatile data may be of different kinds for different devices, such as: terminal nonvolatile data, measurement and control equipment nonvolatile data, and the like.
The following describes the present invention in further detail by taking the compiling language as C and the nonvolatile data as the terminal nonvolatile data as an example.
Fig. 1 is a schematic diagram of an implementation process of a nonvolatile data storage and retrieval method according to the present invention, as shown in fig. 1, the process includes the following steps:
step 101: classifying the nonvolatile data according to requirements;
here, the nonvolatile data of the terminal may be classified according to different application service fields of the nonvolatile data, or according to different data types of the nonvolatile data, for example, if the nonvolatile data is classified according to different data types of the nonvolatile data, the method may be: dividing parameters corresponding to the nonvolatile data of the terminal into read-only parameters and readable and writable parameters; the read-only parameters are divided into a calibration parameter CLIB, a FIXED parameter FIXED and the like and are used for calibrating the terminal function parameters; and dividing the readable and writable parameters into MMI parameters, AFC parameters, RTC parameters, CSD parameters and the like, and representing different functional characteristics of the terminal.
Step 102: defining a structure of the sorted non-volatile data tree;
the method specifically comprises the following steps: the classified nonvolatile data is defined into a tree structure by adopting a definition mode of a data structure (struct) of a C language, and the tree structure can be represented by pseudo codes as follows:
first, a first layer under the root node of the tree structure is defined, where the first layer under the root node nv _ param includes two nodes, which are: the code of a readable and writable parameter nv _ dynamic in the nonvolatile data and a read-only parameter nv _ static in the nonvolatile data is as follows:
Struct nv_param
{
nv_static；/*read only parameters*/
nv_dynamic；/*read/write parameters*/
}
here, the root node nv _ param indicates that any node in the defined tree structure is nonvolatile data.
And then defining a second layer of the tree structure, namely branches under nodes nv _ static and nv _ dynamic of the first layer, wherein the branches under the nodes nv _ static of the first layer comprise three nodes which are respectively: the calibration parameter clib, the free space parameter spare and the fixed parameter fixed are as follows:
Struct nv_static
{
clib；/*Calibration parameters*/
spare；/*Spare area*/
fixed；/*Fixed parameters*/
……
}
the branch under the first-layer node nv _ dynamic includes four nodes, which are respectively: interface access parameter mmi, automatic shielding control parameter afc, real-time transmission control parameter rtc and csd, the code is:
Struct nv_dynamic
{
mmi；/*mmi parameters*/
afc；/*afc parameters*/
rtc；/*rtc parameters*/
csd；/*csd parameters*/
…
}
here, the structure of the nonvolatile data tree is defined layer by layer from the root node, and the generated tree structure is as shown in fig. 2, it can be seen that if the branch of a certain layer in the tree structure is to be increased or the number of layers of the tree structure is to be increased, only the corresponding code line needs to be increased, and the original code does not need to be modified.
Step 103: assigning values to nodes in the defined non-volatile data tree;
the method specifically comprises the following steps: performing initialization assignment on each node in a tree structure formed by nonvolatile data, namely: and respectively assigning an initial value to each node in the tree structure, and writing corresponding nonvolatile data in the corresponding position of each node in the tree structure.
Here, the initial value may be fixed in the application process of the terminal or may be modified according to the actual application according to different node settings.
Step 104: compiling and linking the tree structure with the nodes assigned, programming the result of the compiling and linking and storing the base address during programming;
the method specifically comprises the following steps: and starting to run codes after the definition and assignment of the tree structure are completed, compiling and linking the generated tree structure by using a C language compiler to obtain the storage layout of each node in the tree structure, storing the storage layout obtained by compiling and linking in an internal memory, and programming the storage layout to a nonvolatile memory, wherein the storage layout comprises the following steps: erasable programmable read-only memory (EPROM) or flash memory (flash), namely: and programming all nonvolatile data nodes in the tree structure from a certain position of the EPROM or the flash, wherein the certain position of the EPROM or the flash is a base address during programming or a head address, and the base address is stored for use in a subsequent retrieval process.
Fig. 3 is a storage layout of each node in the tree structure obtained by compiling and linking, and it can be seen that the sizes of the storage spaces corresponding to different nodes are different, and the sizes of the nodes are the same as the size of the storage space, that is: when the node is larger, the node corresponds to a larger storage space, and when the node is smaller, the node corresponds to a smaller storage space, so that the utilization rate of the storage space is high.
Here, the compiling and linking process of the C language compiler and the programming process are prior art and will not be further described.
Step 105: calculating the offset and the size of the nonvolatile data to be retrieved according to the compiling and linking result and the base address during programming;
the method specifically comprises the following steps: if a certain nonvolatile data is to be retrieved, the parameter name corresponding to the nonvolatile data to be retrieved, such as: and informing the compiler of the spark, and then calculating the size and the offset of the nonvolatile data spark by the compiler by using a data size calculation method sizeof and a data offset calculation method offsetof provided by C language according to the storage layout of each node in the tree structure obtained by compiling and linking and the base address during programming. The specific implementation of the two algorithms sizeof and offsetof is prior art and will not be described in detail here.
It can be seen that, in the process of retrieving the nonvolatile data, the present invention only needs to notify the compiler of the parameter name corresponding to the nonvolatile data to be retrieved to implement the subsequent retrieval operation, that is: the retrieval operation is carried out according to the parameter name corresponding to the nonvolatile data, and the retrieval operation is not executed by means of intermediate parameters such as numbers, so that the retrieval method meets the requirement of intuitiveness.
Step 106: and retrieving the nonvolatile data according to the base address during programming and the calculation result of the offset and the size of the nonvolatile data to be retrieved.
Here, if the original nonvolatile data is to be adjusted, for example: and if the tree structure is expanded, re-executing the steps 101 to 104, classifying the parameters corresponding to the newly added nonvolatile data, then adding code lines on the basis of the original codes, performing initialization assignment, re-compiling and linking the whole tree structure after modification, and programming the result of compiling and linking.
Fig. 4 is a schematic structural diagram of a nonvolatile data storage and retrieval apparatus according to the present invention, as shown in fig. 4, the apparatus includes: the device comprises a definition module, a compiling module, a programming module, a calculation module and a retrieval module; wherein,
the definition module is used for defining the classified nonvolatile data into a tree structure, assigning values to nodes in the tree, and sending the definition and assignment results to the compiling module;
the compiling module is used for executing compiling and linking operation according to the tree structure which is defined by the defining module and is assigned to the nodes, and informing the programming module of the compiling and linking result;
the programming module is used for programming the result of the compiling link sent by the compiling module and storing the base address during programming;
the calculation module is used for calculating the offset and the size of the nonvolatile data to be retrieved according to the compiling and linking result programmed by the programming module and the base address during programming and sending the calculation result to the retrieval module;
and the retrieval module is used for retrieving the nonvolatile data according to the base address when the programming module performs programming and the calculation result of the offset and the size of the nonvolatile data to be retrieved by the calculation module.
The device further comprises a classification module which is used for classifying the nonvolatile data according to the requirement and informing the definition module of the classification result.
The definition module adopts C language when defining the classified nonvolatile data as a tree structure; accordingly, the method can be used for solving the problems that,
the calculation module calculates the offset and the size of the nonvolatile data to be retrieved according to the compiling and linking result programmed by the programming module and the base address during programming, and specifically comprises the following steps:
based on the compiled link result and the base address of the programming module, the offset and size of the nonvolatile data to be retrieved are calculated by using the data offset calculation method offset of and the data size calculation method sizeof provided by the C language.
The classification module classifies the nonvolatile data according to requirements, and comprises the following steps: the nonvolatile data is classified by different application service fields of the nonvolatile data or by different data types of the nonvolatile data.
The above description is only exemplary of the present invention and should not be taken as limiting the scope of the present invention, and any modifications, equivalents, improvements, etc. that are within the spirit and principle of the present invention should be included in the present invention.
Claims (9)
1. A method of storing and retrieving non-volatile data, the method comprising:
defining the classified nonvolatile data as a tree structure, and assigning values to nodes in the tree;
compiling and linking the tree structure with the nodes assigned, programming the result of the compiling and linking and storing the base address during programming;
and informing a compiler of the parameter name corresponding to the nonvolatile data to be retrieved, calculating the offset and the size of the nonvolatile data to be retrieved according to the storage layout of each node in the tree structure obtained by compiling and linking and the base address during programming, and retrieving the nonvolatile data according to the base address during programming and the calculation result of the offset and the size of the nonvolatile data to be retrieved.
2. The method of claim 1, wherein before defining the sorted non-volatile data as a tree structure, further comprising:
and classifying the nonvolatile data according to requirements.
3. The method of claim 1 or 2, wherein C language is used for defining the classified nonvolatile data as a tree structure; accordingly, the method can be used for solving the problems that,
the calculating the offset and the size of the nonvolatile data to be retrieved according to the storage layout of each node in the tree structure obtained by compiling and linking and the base address during programming specifically comprises the following steps:
based on the compiled link result and the base address during programming, the offset and size of the nonvolatile data to be retrieved are calculated by using the data offset calculation method offset of and the data size calculation method sizeof provided by the C language.
4. The method of claim 2, wherein when the nonvolatile data is to be expanded, the method further comprises: and classifying the newly added nonvolatile data, accessing the data into the originally defined tree structure to form a new node, and performing compiling and linking and programming operation on the whole new tree structure again.
5. The method of claim 2 or 4, wherein the classifying of the non-volatile data on demand is: the nonvolatile data is classified by different application service fields of the nonvolatile data or by different data types of the nonvolatile data.
6. An apparatus for non-volatile data storage and retrieval, the apparatus comprising: the device comprises a definition module, a compiling module, a programming module, a calculation module and a retrieval module; wherein,
the definition module is used for defining the classified nonvolatile data into a tree structure, assigning values to nodes in the tree, and sending the definition and assignment results to the compiling module;
the compiling module is used for executing compiling and linking operation according to the tree structure which is defined by the defining module and is assigned to the nodes, and informing the programming module of the compiling and linking result;
the programming module is used for programming the result of the compiling link sent by the compiling module and storing the base address during programming;
the calculation module is used for informing the compiler of the parameter name corresponding to the nonvolatile data to be retrieved, calculating the offset and the size of the nonvolatile data to be retrieved according to the storage layout of each node in the tree structure obtained by compiling and linking and the base address during programming, and sending the calculation result to the retrieval module;
and the retrieval module is used for retrieving the nonvolatile data according to the base address when the programming module performs programming and the calculation result of the offset and the size of the nonvolatile data to be retrieved by the calculation module.
7. The apparatus for storing and retrieving of non-volatile data as claimed in claim 6, further comprising a classification module for classifying the non-volatile data as required and informing the definition module of the classification result.
8. The apparatus for storing and retrieving of non-volatile data according to claim 6 or 7, wherein the definition module employs C language when defining the classified non-volatile data as a tree structure; accordingly, the method can be used for solving the problems that,
the calculation module calculates the offset and the size of the nonvolatile data to be retrieved according to the storage layout of each node in the tree structure obtained by compiling and linking and the base address during programming, and specifically comprises the following steps:
based on the compiled link result and the base address of the programming module, the offset and size of the nonvolatile data to be retrieved are calculated by using the data offset calculation method offset of and the data size calculation method sizeof provided by the C language.
9. The apparatus of claim 7, wherein the classification module classifies the non-volatile data as desired as: the nonvolatile data is classified by different application service fields of the nonvolatile data or by different data types of the nonvolatile data.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101718780A CN101650689B (en) | 2009-09-16 | 2009-09-16 | Nonvolatile data storage and search method and device |
| PCT/CN2010/075939 WO2011032443A1 (en) | 2009-09-16 | 2010-08-12 | Method and device for storing and retrieving non-volatile data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101718780A CN101650689B (en) | 2009-09-16 | 2009-09-16 | Nonvolatile data storage and search method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101650689A CN101650689A (en) | 2010-02-17 |
| CN101650689B true CN101650689B (en) | 2011-10-26 |
Family
ID=41672928
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009101718780A Active CN101650689B (en) | 2009-09-16 | 2009-09-16 | Nonvolatile data storage and search method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101650689B (en) |
| WO (1) | WO2011032443A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101650689B (en) * | 2009-09-16 | 2011-10-26 | 中兴通讯股份有限公司 | Nonvolatile data storage and search method and device |
| US9734117B2 (en) * | 2015-01-26 | 2017-08-15 | Western Digital Technologies, Inc. | Data storage device and method for integrated bridge firmware to be retrieved from a storage system on chip (SOC) |
| CN106911403B (en) * | 2015-12-23 | 2020-06-19 | 辰芯科技有限公司 | Calibration method and device for mobile terminal |
| CN114706946B (en) * | 2022-03-28 | 2023-05-26 | 广州万辉信息科技有限公司 | Trademark category retrieval platform and method |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3694501B2 (en) * | 2002-10-30 | 2005-09-14 | 松下電器産業株式会社 | Storage device |
| US8140806B2 (en) * | 2007-03-30 | 2012-03-20 | Oracle International Corporation | Eliminating fragmentation with buddy-tree allocation |
| KR100922389B1 (en) * | 2007-07-04 | 2009-10-19 | 삼성전자주식회사 | Indexing scheme for flash memory |
| CN101650689B (en) * | 2009-09-16 | 2011-10-26 | 中兴通讯股份有限公司 | Nonvolatile data storage and search method and device |
-
2009
- 2009-09-16 CN CN2009101718780A patent/CN101650689B/en active Active
-
2010
- 2010-08-12 WO PCT/CN2010/075939 patent/WO2011032443A1/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| WO2011032443A1 (en) | 2011-03-24 |
| CN101650689A (en) | 2010-02-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110309196A (en) | Block chain data storage and query method, apparatus, equipment and storage medium | |
| CN107678951A (en) | Test exemple automation management method, device, equipment and storage medium | |
| CN111324577B (en) | Yml file reading and writing method and device | |
| CN114491172B (en) | Rapid retrieval method, device and equipment for tree structure nodes and storage medium | |
| CN101650689B (en) | Nonvolatile data storage and search method and device | |
| CN108710662A (en) | Language transfer method and device, storage medium, data query system and method | |
| CN108008936B (en) | Data processing method and device and electronic equipment | |
| CN112668181A (en) | Simulation test method, simulation test device, electronic equipment and storage medium | |
| CN111274242A (en) | Data searching method and device of tree structure for hospital logistics operation and maintenance | |
| CN110866029A (en) | sql statement construction method, device, server and readable storage medium | |
| CN104182347A (en) | Test requirement automatic analysis method based on automatic test platform | |
| CN111026670A (en) | Test case generation method, test case generation device, and storage medium | |
| CN109165332A (en) | A kind of webpage information acquisition methods, device and equipment | |
| CN109657803A (en) | The building of machine learning model | |
| CN103425829B (en) | Method for rapidly reading layout | |
| CN112685275B (en) | Algorithm policy search method and device, electronic equipment and storage medium | |
| CN106776348B (en) | Test case management method and device | |
| CN106294530A (en) | The method and system of rule match | |
| CN110069812B (en) | Configuration method, system and storage medium for robot path track point attribute | |
| CN104572482B (en) | The storage method and device of a kind of process variable | |
| CN106354633A (en) | Task schedule generation method based on algorithmic plug-in | |
| CN102945342B (en) | Progress recognizing method, device and terminal device | |
| CN110119351B (en) | Test case execution method and device | |
| CN106570035B (en) | Database authorization method and device | |
| CN114328486A (en) | Data quality checking method and device based on model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |