CN101650689A - Nonvolatile data storage and search method and device - Google Patents
Nonvolatile data storage and search method and device Download PDFInfo
- Publication number
- CN101650689A CN101650689A CN200910171878A CN200910171878A CN101650689A CN 101650689 A CN101650689 A CN 101650689A CN 200910171878 A CN200910171878 A CN 200910171878A CN 200910171878 A CN200910171878 A CN 200910171878A CN 101650689 A CN101650689 A CN 101650689A
- Authority
- CN
- China
- Prior art keywords
- nonvolatile data
- programming
- module
- data
- nonvolatile
- 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
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)
- Stored Programmes (AREA)
- Devices For Executing Special Programs (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 thetree 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 resultsof 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 searchmethod is visualized.
Description
Technical field
The present invention relates to the data storage technology in the communication system, relate in particular to a kind of storage and search method and device of Nonvolatile data.
Background technology
Along with the development of mobile communication technology, the renewal speed of terminal is also more and more faster, and each terminal manufacturer is constantly being developed the end product that possesses the multiple business function in order to attract more user.Terminal manufacturer is carried out the exploitation of termination function by means of terminal software platform in development process, will be referred to multiple different types of Nonvolatile data on stream, for example: the parameter of dispatching from the factory, physical layer parameter, communication protocol and the network parameter etc. of terminal, segment its quantity and probably have 100,000, therefore, very important to the organization and administration of terminal Nonvolatile data.
Method for organizing to Nonvolatile data comprises: storage and retrieval.At present, the method for organizing to Nonvolatile data is: adopt structure of arrays to store, adopt Id index accesses method to retrieve.But, because the restriction of array self linear structure, that is: the data item of each in the array is arranged according to the numbering of correspondence, described numbering is by ascending or descending series arrangement, as: 1,2,3,4,5 or the like, if in array, insert or deleted data item, then need be numbered the data item in the array again, therefore, the Nonvolatile data in the array is difficult to expansion, migration process is loaded down with trivial details, can nested property poor; Because the retrieval of Nonvolatile data is to carry out according to the numbering of different pieces of information item correspondence, so search method is directly perceived inadequately; In addition, the storage size of data item need be identical during non-volatile data storage, like this, causes partial data item corresponding memory space not to be fully used, and wasted a lot of storage spaces, makes operating factor of memory space not high.
Summary of the invention
In view of this, fundamental purpose of the present invention is to provide a kind of storage and search method and device of Nonvolatile data, but it is nested to make that the terminal Nonvolatile data of storing is easy to the expansion deep layer, improve the storage space utilization factor, and search method is directly perceived.
For achieving the above object, technical scheme of the present invention is achieved in that
The present invention proposes a kind of storage and search method of Nonvolatile data, this method comprises:
Classified Nonvolatile data is defined as tree structure, and to node assignment in the tree;
Node is carried out compiling link by the tree structure of assignment, the result of programming compiling link and the base address when storing programming;
The skew and the size of Nonvolatile data to be retrieved calculated in base address during according to the result of compiling link and programming, the base address during according to programming and to the skew of Nonvolatile data to be retrieved and the result of calculation retrieval Nonvolatile data of size.
Wherein, described classified Nonvolatile data is defined as before the tree structure, also comprises:
Nonvolatile data is classified by demand.
Wherein, the described C language that adopts when classified Nonvolatile data is defined as tree structure; Accordingly,
Described result and skew and the size of calculating Nonvolatile data to be retrieved of the base address during programming according to compiling link is specially:
Base address during with the result of compiling link and programming is a foundation, and the computing method offsetof of the data-bias that utilization C language is provided and the computing method sizeof of size of data calculate the skew and the size of Nonvolatile data to be retrieved.
In the such scheme, in the time of need expanding described Nonvolatile data, this method further comprises: the Nonvolatile data that increases newly is classified, and insert the new node of formation in the former defined tree structure, whole new tree structure is carried out compiling link and programming operation again.
Wherein, described Nonvolatile data is classified by demand, for: by the different application business field of Nonvolatile data or by the different types of data of Nonvolatile data Nonvolatile data is classified.
The invention allows for a kind of storage and indexing unit of Nonvolatile data, this device comprises: definition module, collector, programming module, computing module and retrieval module; Wherein,
Described definition module is used for classified Nonvolatile data is defined as tree structure, and to node assignment in the tree, the definition and the result of assignment is sent to collector;
Described collector, be used for defined and the tree structure of node assignment carried out the compiling link operation according to definition module, and with the result notification programming module of compiling link;
Described programming module is used for the result of the compiling link that the programming collector sent out, and the base address during the storage programming;
Described computing module, the skew and the size of Nonvolatile data to be retrieved calculated in the base address when being used for according to the result of the compiling link of programming module programming and programming, and result of calculation is sent to retrieval module;
Described retrieval module, base address when being used for according to the programming of programming module and computing module are to the skew of Nonvolatile data to be retrieved and the result of calculation retrieval Nonvolatile data of size.
This device further comprises sort module, is used for Nonvolatile data is classified by demand, and notifies definition module with classification results.
Adopt the C language when wherein, described definition module is defined as tree structure with classified Nonvolatile data; Accordingly,
The skew and the size of Nonvolatile data to be retrieved calculated in the base address of described computing module during according to the result of the compiling link of programming module programming and programming, is specially:
Base address during with the result of the compiling link of programming module programming and programming is a foundation, and the computing method offsetof of the data-bias that utilization C language is provided and the computing method sizeof of size of data calculate the skew and the size of Nonvolatile data to be retrieved.
In the such scheme, described sort module is classified Nonvolatile data by demand, for: by the different application business field of Nonvolatile data or by the different types of data of Nonvolatile data Nonvolatile data is classified.
The storage of Nonvolatile data provided by the invention and search method and device are defined as tree structure with classified Nonvolatile data, and to node assignment in the tree; Node is carried out compiling link by the tree structure of assignment, the result of programming compiling link and the base address when storing programming; The skew and the size of Nonvolatile data to be retrieved calculated in base address during according to the result of compiling link and programming, the base address during according to programming and to the skew of Nonvolatile data to be retrieved and the result of calculation retrieval Nonvolatile data of size.Nonvolatile data among the present invention is defined as tree structure, as the branch that will increase certain one deck in the tree structure or the number of plies that increases tree structure, only need to increase corresponding code line and get final product, and need not revise original code, it is nested with deep layer that structure of arrays is easy to expansion relatively; In the storing process of Nonvolatile data, because the different node corresponding memory space sizes in the tree structure can be inequality, size of node is big or small consistent with storage space, has therefore saved storage space, and utilization factor is improved; In addition, retrieving is called foundation with Nonvolatile data corresponding parameters name to carry out, so the relative prior art of search method has good intuitive.
Description of drawings
Fig. 1 is the storage and the search method realization flow synoptic diagram of Nonvolatile data of the present invention;
The tree structure synoptic diagram that Fig. 2 forms for each Nonvolatile data;
Fig. 3 is storage layout's structural representation of each node in the tree structure of compiling link gained;
Fig. 4 is the storage and the indexing unit structural representation of Nonvolatile data of the present invention.
Embodiment
Basic thought of the present invention is: classified Nonvolatile data is defined as tree structure, and to node assignment in the tree; Node is carried out compiling link by the tree structure of assignment, the result of programming compiling link and the base address when storing programming; The skew and the size of Nonvolatile data to be retrieved calculated in base address during according to the result of compiling link and programming, the base address during according to programming and to the skew of Nonvolatile data to be retrieved and the result of calculation retrieval Nonvolatile data of size.
The compiler language that the present invention program is adopted in implementation process can be: C, VB or Java etc.; Can be variety classes for the described Nonvolatile data of different equipment, as: terminal Nonvolatile data or measuring and controlling equipment Nonvolatile data etc.
Be C below with the compiler language, Nonvolatile data is that example is described in further detail the present invention for the terminal Nonvolatile data.
Fig. 1 is the storage and the search method realization flow synoptic diagram of Nonvolatile data of the present invention, and as shown in Figure 1, this flow process may further comprise the steps:
Step 101: Nonvolatile data is classified by demand;
Here, can classify to the terminal Nonvolatile data by the different application business field of Nonvolatile data or by the demands such as different types of data of Nonvolatile data, for example, if the different types of data by Nonvolatile data is classified, method can be: terminal Nonvolatile data corresponding parameters is divided into read-only parameter and read-write parameter; Described read-only parameter is divided into calibration parameter CLIB and preset parameter FIXED etc. again, is used for the termination function parameter is calibrated; Described read-write parameter is divided into MMI parameter, AFC parameter, RTC parameter and CSD parameter etc. again, is used to represent the difference in functionality characteristic of terminal.
Step 102: the structure that defines classified Nonvolatile data tree;
Be specially: adopt the definition mode of the data structure (struct) of C language that classified Nonvolatile data is defined as tree structure, available false code is expressed as follows:
At first, ground floor under the definition tree structure root node, here, the ground floor under the root node nv_param comprises two nodes, be respectively: read-write parameter nv_dynamic in the Nonvolatile data and the read-only parameter nv_static in the Nonvolatile data, code is:
Struct?nv_param
{
nv_static；/*read?only?parameters*/
nv_dynamic；/*read/write?parameters*/
}
Here, described root node nv_param, arbitrary node that expression is defined in the tree structure is a Nonvolatile data.
Define the second layer of tree structure again, it is the branch under ground floor node nv_static and the nv_dynamic, branch under the ground floor node nv_static comprises three nodes, is respectively: calibration parameter clib, clearance spaces parameter s pare and preset parameter fixed, and code is:
Struct?nv_static
{
clib；/*Calibration?parameters*/
spare；/*Spare?area*/
fixed；/*Fixed?parameters*/
……
}
Branch under the ground floor node nv_dynamic comprises four nodes, is respectively: interface access parameter mmi, shield controlled variable afc, real-time Transmission controlled variable rtc and csd automatically, code is:
Struct?nv_dynamic
{
mmi；/*mmi?parameters*/
afc；/*afc?parameters*/
rtc；/*rtc?parameters*/
csd；/*csd?parameters*/
…
}
Here, begin successively to define the structure that Nonvolatile data is set from root node, the tree structure that is generated as shown in Figure 2, as can be seen, if the branch of certain one deck or increase the number of plies of tree structure in the increase tree structure only needs to increase a corresponding code line and gets final product, need not revise original code.
Step 103: the node in the Nonvolatile data tree of definition is carried out assignment;
Be specially: each node in the tree structure of Nonvolatile data composition is carried out the initialization assignment, that is: each node that is respectively in the tree structure is composed initial value, and the correspondence position of each node writes corresponding Nonvolatile data in tree structure.
Here, according to the difference that node is provided with, described initial value can immobilize in the application process of terminal and also can carry out corresponding modify according to practical application.
Step 104: node is carried out compiling link by the tree structure of assignment, the result of programming compiling link and the base address when storing programming;
Be specially: code brings into operation after tree structure definition and assignment are finished, the C CompilerTools carries out compiling link to the tree structure that generates, obtain the storage layout of each node in the tree structure, at this moment, storage layout through the compiling link gained is stored in the internal memory, need the programming of described storage layout to nonvolatile memory, as: in erasable and programmable read-only memory (EPROM) or the flash memory (flash), that is: begin the node of all Nonvolatile datas the programming tree structure from certain position of EPROM or flash, wherein, certain position of described EPROM or flash, base address when being programming, or be called first address, store this base address so that use in the later retrieval process.
Fig. 3 is the storage layout of each node in the tree structure of compiling link gained, as can be seen, different node corresponding memory space sizes is also inequality, size of node is big or small consistent with storage space, that is: the bigger storage space of correspondence when node is big, node is hour corresponding less storage space, so storage space utilization factor height.
Here, the compiling link process of described C CompilerTools and described programming process are prior art, no longer are described in further detail.
Step 105: the skew and the size of Nonvolatile data to be retrieved calculated in the base address during according to the result of compiling link and programming;
Be specially: if retrieve certain Nonvolatile data, can be with Nonvolatile data corresponding parameters title to be retrieved, as: spare notifies compiler, base address when compiler is in conjunction with the storage layout of each node in the tree structure of compiling link gained and programming afterwards, size and skew that the computing method sizeof of the size of data that utilization C language is provided and the computing method offsetof of data-bias calculate Nonvolatile data spare.Specific implementation process about sizeof and two kinds of algorithms of offsetof is a prior art, no longer describes in detail here.
Here as can be seen, the present invention is in the process that Nonvolatile data is retrieved, only need Nonvolatile data corresponding parameters title notice compiler to be retrieved is realized follow-up search operaqtion, that is: search operaqtion is carried out according to Nonvolatile data corresponding parameters title, not by intermediate parameters, as number the execution search operaqtion, so search method has reached the intuitive requirement.
Step 106: the base address during according to programming and to the result of calculation retrieval Nonvolatile data of the skew of Nonvolatile data to be retrieved and size.
Here, if original Nonvolatile data is adjusted, as: expansion etc., then re-execute step 101 to step 104, the Nonvolatile data corresponding parameters that increases newly is classified, on the basis of original code, increase code line afterwards, and carry out the initialization assignment, again the whole tree structure after the change is carried out compiling link again, and the result of programming compiling link.
Fig. 4 is the storage and the indexing unit structural representation of Nonvolatile data of the present invention, and as shown in Figure 4, this device comprises: definition module, collector, programming module, computing module and retrieval module; Wherein,
Described definition module is used for classified Nonvolatile data is defined as tree structure, and to node assignment in the tree, the definition and the result of assignment is sent to collector;
Described collector, be used for defined and the tree structure of node assignment carried out the compiling link operation according to definition module, and with the result notification programming module of compiling link;
Described programming module is used for the result of the compiling link that the programming collector sent out, and the base address during the storage programming;
Described computing module, the skew and the size of Nonvolatile data to be retrieved calculated in the base address when being used for according to the result of the compiling link of programming module programming and programming, and result of calculation is sent to retrieval module;
Described retrieval module, base address when being used for according to the programming of programming module and computing module are to the skew of Nonvolatile data to be retrieved and the result of calculation retrieval Nonvolatile data of size.
This device further comprises sort module, is used for Nonvolatile data is classified by demand, and notifies definition module with classification results.
When being defined as tree structure with classified Nonvolatile data, adopts described definition module the C language; Accordingly,
The skew and the size of Nonvolatile data to be retrieved calculated in the base address of described computing module during according to the result of the compiling link of programming module programming and programming, is specially:
Base address during with the result of the compiling link of programming module programming and programming is a foundation, and the computing method offsetof of the data-bias that utilization C language is provided and the computing method sizeof of size of data calculate the skew and the size of Nonvolatile data to be retrieved.
Described sort module is classified Nonvolatile data by demand, for: by the different application business field of Nonvolatile data or by the different types of data of Nonvolatile data Nonvolatile data is classified.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (9)
1, a kind of storage of Nonvolatile data and search method is characterized in that, this method comprises:
Classified Nonvolatile data is defined as tree structure, and to node assignment in the tree;
Node is carried out compiling link by the tree structure of assignment, the result of programming compiling link and the base address when storing programming;
The skew and the size of Nonvolatile data to be retrieved calculated in base address during according to the result of compiling link and programming, the base address during according to programming and to the skew of Nonvolatile data to be retrieved and the result of calculation retrieval Nonvolatile data of size.
2, the storage of Nonvolatile data according to claim 1 and search method is characterized in that, described classified Nonvolatile data are defined as before the tree structure, also comprise:
Nonvolatile data is classified by demand.
3, the storage of Nonvolatile data according to claim 1 and 2 and search method is characterized in that, the described C language that adopts when classified Nonvolatile data is defined as tree structure; Accordingly,
Described result and skew and the size of calculating Nonvolatile data to be retrieved of the base address during programming according to compiling link is specially:
Base address during with the result of compiling link and programming is a foundation, and the computing method offsetof of the data-bias that utilization C language is provided and the computing method sizeof of size of data calculate the skew and the size of Nonvolatile data to be retrieved.
4, the storage of Nonvolatile data according to claim 2 and search method, it is characterized in that, in the time of need expanding described Nonvolatile data, this method further comprises: the Nonvolatile data that increases newly is classified, and insert the new node of formation in the former defined tree structure, whole new tree structure is carried out compiling link and programming operation again.
5, according to the storage and the search method of claim 2 or 4 described Nonvolatile datas, it is characterized in that, described Nonvolatile data is classified by demand, for: by the different application business field of Nonvolatile data or by the different types of data of Nonvolatile data Nonvolatile data is classified.
6, a kind of storage of Nonvolatile data and indexing unit is characterized in that, this device comprises: definition module, collector, programming module, computing module and retrieval module; Wherein,
Described definition module is used for classified Nonvolatile data is defined as tree structure, and to node assignment in the tree, the definition and the result of assignment is sent to collector; Described collector, be used for defined and the tree structure of node assignment carried out the compiling link operation according to definition module, and with the result notification programming module of compiling link;
Described programming module is used for the result of the compiling link that the programming collector sent out, and the base address during the storage programming;
Described computing module, the skew and the size of Nonvolatile data to be retrieved calculated in the base address when being used for according to the result of the compiling link of programming module programming and programming, and result of calculation is sent to retrieval module;
Described retrieval module, base address when being used for according to the programming of programming module and computing module are to the skew of Nonvolatile data to be retrieved and the result of calculation retrieval Nonvolatile data of size.
7, the storage of Nonvolatile data according to claim 6 and indexing unit is characterized in that, this device further comprises sort module, are used for Nonvolatile data is classified by demand, and notify definition module with classification results.
8, according to the storage and the indexing unit of claim 6 or 7 described Nonvolatile datas, it is characterized in that, adopt the C language when described definition module is defined as tree structure with classified Nonvolatile data; Accordingly,
The skew and the size of Nonvolatile data to be retrieved calculated in the base address of described computing module during according to the result of the compiling link of programming module programming and programming, is specially:
Base address during with the result of the compiling link of programming module programming and programming is a foundation, and the computing method offsetof of the data-bias that utilization C language is provided and the computing method sizeof of size of data calculate the skew and the size of Nonvolatile data to be retrieved.
9, the storage of Nonvolatile data according to claim 7 and indexing unit, it is characterized in that, described sort module is classified Nonvolatile data by demand, for: by the different application business field of Nonvolatile data or by the different types of data of Nonvolatile data Nonvolatile data is classified.
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 true CN101650689A (en) | 2010-02-17 |
| CN101650689B 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) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011032443A1 (en) * | 2009-09-16 | 2011-03-24 | 中兴通讯股份有限公司 | Method and device for storing and retrieving non-volatile data |
| CN106126457A (en) * | 2015-01-26 | 2016-11-16 | 西部数据技术公司 | Data storage device and the method being used for retrieving integrated bridge joint firmware from storage SOC(system on a chip) (SOC) |
| CN106911403A (en) * | 2015-12-23 | 2017-06-30 | 联芯科技有限公司 | The calibration method and device of a kind of mobile terminal |
| CN114706946A (en) * | 2022-03-28 | 2022-07-05 | 广州万辉信息科技有限公司 | 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
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011032443A1 (en) * | 2009-09-16 | 2011-03-24 | 中兴通讯股份有限公司 | Method and device for storing and retrieving non-volatile data |
| CN106126457A (en) * | 2015-01-26 | 2016-11-16 | 西部数据技术公司 | Data storage device and the method being used for retrieving integrated bridge joint firmware from storage SOC(system on a chip) (SOC) |
| CN106126457B (en) * | 2015-01-26 | 2021-01-01 | 西部数据技术公司 | Data storage device and method of configuring and operating the same |
| CN106911403A (en) * | 2015-12-23 | 2017-06-30 | 联芯科技有限公司 | The calibration method and device of a kind of mobile terminal |
| CN114706946A (en) * | 2022-03-28 | 2022-07-05 | 广州万辉信息科技有限公司 | Trademark category retrieval platform and method |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2011032443A1 (en) | 2011-03-24 |
| CN101650689B (en) | 2011-10-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10984020B2 (en) | System and method for supporting large queries in a multidimensional database environment | |
| CN100468402C (en) | Sort data storage and split catalog inquiry method based on catalog tree | |
| CN1983266B (en) | File system storing transaction records in flash-like media | |
| US20130151535A1 (en) | Distributed indexing of data | |
| CN102693266B (en) | Search for method, the navigation equipment and method of generation index structure of database | |
| CN106133706A (en) | The system and method for the memorizer distribution in multi-level store system | |
| CN103765381B (en) | Parallel work-flow to B+ tree | |
| CN101650689B (en) | Nonvolatile data storage and search method and device | |
| CN1983265A (en) | File system having inverted hierarchical structure | |
| CN105653691A (en) | Information resource management method and management apparatus | |
| CN102243660A (en) | Data access method and device | |
| CN102722432A (en) | Method and apparatus for tracing memory access | |
| CN106873952B (en) | Data processing system and method for mobile terminal webpage development and application device | |
| US20130173509A1 (en) | Method and arrangement for processing data | |
| CN103914483A (en) | File storage method and device and file reading method and device | |
| CN102622224B (en) | Method for achieving tree-like control piece with search function in Windchill system | |
| CN107229429A (en) | A kind of memory space management and device | |
| CN111596945B (en) | Differential upgrading method for dynamic multi-partition firmware of embedded system | |
| CN103631838A (en) | Method and system for storing tabular data in a memory-efficient manner | |
| CN116662019B (en) | Request distribution method and device, storage medium and electronic device | |
| CN109995871A (en) | A kind of Pod dispatching method and device | |
| CN110781430B (en) | Novel virtual data center system of internet and construction method thereof | |
| CN101339568B (en) | Method and device for constructing data tree | |
| CN105786525A (en) | Method and device for transplanting code from process model to thread model | |
| KR102354343B1 (en) | Spatial indexing method and apparatus for blockchain-based geospatial data |
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 |