CN103399904B - Data processing method and data processing system - Google Patents
Data processing method and data processing system Download PDFInfo
- Publication number
- CN103399904B CN103399904B CN201310320946.1A CN201310320946A CN103399904B CN 103399904 B CN103399904 B CN 103399904B CN 201310320946 A CN201310320946 A CN 201310320946A CN 103399904 B CN103399904 B CN 103399904B
- Authority
- CN
- China
- Prior art keywords
- data
- tree
- control instruction
- memory
- data 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
Abstract
The present invention relates to data processing method and data processing system, wherein data processing method includes：A establishes tree-shaped data structure, and the tree-shaped data structure is sent in memory and is stored；B sends out corresponding control instruction according to the operation of client；And C, the control instruction is received to carry out corresponding operating to the data stored in the memory, and operating result is sent to the client.The present invention quickly and easily can effectively manage data convenient for being safeguarded to data.
Description
Technical field
The present invention relates to technical field of data processing more particularly to data processing methods and data processing system.
Background technology
With the raising of the level of informatization, various businesses data processing amount is continuously increased, such as report form statistics data, office
Document data, e-mail data, audio, video data, vehicle data etc..If data processing amount is excessive, data structure is very multiple
Miscellaneous, level of nesting depth, random case are more between data, are just not easy to carry out classification processing to data, therefore, to huge data volume
It is an arduous and complicated task to carry out processing.
Currently, mostly mass data is stored and processed using the BOM system based on relevant database, but this
The mode kind data stored and processed so that terminal user is larger to the maintenance difficulties of extensive mass data, processing speed
It is relatively low, and be difficult to effectively manage data, such as search, be inserted into, delete, change etc..
Invention content
Therefore, the present invention provides data processing method and processing system, is asked existing for available data treatment technology with overcoming
Topic.
Specifically, a kind of data processing method that the embodiment of the present invention proposes, including step：A establishes tree-shaped data knot
Structure, and tree-shaped data structure is sent in memory and is stored；B sends out corresponding control according to the operation of client
System instruction；And C, control instruction is received to carry out corresponding operating to the data stored in memory, and operating result is sent
To client.
In addition, a kind of data processing system that the embodiment of the present invention proposes, including establish module, control module and place
Manage module.Module is established, for establishing tree-shaped data structure, and tree-shaped data structure is sent in memory and is deposited
Storage；Control module sends out corresponding control instruction for the operation according to client；Processing module refers to for receiving control
It enables to carry out corresponding operating to the data stored in memory, and operating result is sent to client.
By above-described embodiment it is found that the present invention by establish tree-shaped data structure and according to the control instruction of client with
Corresponding operating is carried out to the data stored in memory, this data structure is the data knot of the tree-shaped nested form of object-oriented
Structure, convenient for being safeguarded to data；More quickly and easily data can also effectively be managed, such as search, be inserted into, delete
The operations such as remove, change.And terminal user is allowed to participate in the design of product data model, it can more effectively ensure number in memory
According to the consistency with actual product data.
Above description is only the general introduction of technical solution of the present invention, in order to better understand the technical means of the present invention,
And can be implemented in accordance with the contents of the specification, and in order to allow the above and other objects, features and advantages of the present invention can
It is clearer and more comprehensible, it is special below to lift preferred embodiment, and coordinate attached drawing, detailed description are as follows.
Description of the drawings
Fig. 1 is the step flow chart for the data processing method that the embodiment of the present invention proposes；
Fig. 2 is the main frame schematic diagram for the data structure that the embodiment of the present invention proposes；
Fig. 3 is the main frame block diagram for the data processing system that the embodiment of the present invention proposes.
Specific implementation mode
It is of the invention to reach the technological means and effect that predetermined goal of the invention is taken further to illustrate, below in conjunction with
Attached drawing and preferred embodiment, to propose according to the present invention data processing method and processing system its specific implementation mode, structure,
Feature and effect are described in detail as after.
For the present invention aforementioned and other technology contents, feature and effect, in following cooperation with reference to the preferable reality of schema
Applying during example is described in detail clearly to be presented.By the explanation of specific implementation mode, when predetermined mesh can be reached to the present invention
The technological means taken and effect be able to more deeply and it is specific understand, however institute's accompanying drawings are only to provide with reference to and say
It is bright to be used, it is not intended to limit the present invention.
Fig. 1 is the step flow chart of data processing method provided in an embodiment of the present invention.Referring to Fig. 1, the present invention is implemented
The data processing method of example may include following steps S101-S105：
Step S101：Tree-shaped data structure is established, and tree-shaped data structure is sent in memory and is stored.
In this step, tree-shaped data structure includes data object, element property etc..Data object include element property and
Data subobject etc..Element property can be used for recording undecomposable or be not required to analytical product parameter, the parameter in corresponding data
Name-parameter value.Allowing uniaxially to establish set membership between data object, a data object may include multiple subobjects, and
One data object only allows to gather around that there are one parent objects.As shown in Fig. 2, data object is represented as rectangle frame, such as vehicle production
Product data object 201, device product data object 203, system product data object 205, sub-system products data object 207
Deng data object can represent the objects such as device, system, assembly, parts in actual vehicle product data.Vehicle product data
Object 201 includes its element property：Attribute：Value 209 and its data subobject：Device product data object 203.If vehicle product
When data object 201 is A vehicles, then attribute：Value 209 can be model：2Y288（Indicate the model 2Y288 of A vehicles）, device production
Product data object 203 can be engine system or chassis system etc., and so on, then can be to device product data object
203 are further refined as system product data object 207, such as valve etc..Memory can be set in server.
Step S103：Corresponding control instruction is sent out according to the operation of client.
In this step, for example, user by client select search engine model when, then according to search engine model
Operation send out the corresponding control instruction for searching engine model.
Step S105：This control instruction is received to carry out corresponding operating to the data stored in memory, and operation is tied
Fruit is sent to client.
It specifically may also include step in step S105：
Traversing operation is carried out to find tree shaped data to the tree data structure stored in memory according to control instruction
The destination node of structure, and corresponding operating is carried out to destination node.
In this step, traversing operation can be breadth traversal, extreme saturation or other traversal methods.It is with breadth traversal
Example, when control instruction is to search information, such as when the control instruction of engine model, then the tree shaped data to being stored in memory
Structure carries out breadth traversal operation, i.e., will search the primary keyword of information, for example, " engine " successively with the root in data structure
Node, root node each straton node be compared, if a certain node be recorded as search information primary keyword（Start
Machine）, then the subtree of this node is searched to judge whether that record has lookup information（That is engine model）, believe if so, will then search
Breath（That is engine model）It is sent to client.
It, then can be to being stored in memory such as when the control instruction of engine model when control instruction is to be inserted into information
Tree data structure carry out traversing operation, such as breadth traversal operation, i.e., will be inserted into the primary keyword of information, such as " start
Machine " is compared with each straton node of root node, root node in data structure successively, if a certain node is recorded as being inserted into
The primary keyword of information（That is engine）, then information will be inserted into（That is the model of engine）It is inserted into the child node as this node.
If there is no the primary keywords that record is inserted into information（That is engine）Node.The node of engine will be then recorded as new
Knots inserting, and using the model of engine as the child node of the new node for being inserted into record engine.It will be inserted into engine again
The information of model is sent to client.
It, then can be to being stored in memory such as when the control instruction of engine model when control instruction is to delete information
Tree data structure carry out traversing operation, such as breadth traversal operation, i.e., will delete the primary keyword of information, such as " start
Machine " is compared with each straton node of root node, root node in data structure successively, if a certain node is recorded as being inserted into
The primary keyword of information（That is engine）, then search the subtree of this node and have deletion information, such as engine models to find record
Number node, will record engine model node and its subtree delete.The information for having deleted engine model is sent to again
Client.
It, then can be to being stored in memory such as when the control instruction of engine model when control instruction is modification information
Tree data structure carry out traversing operation, such as breadth traversal operation, i.e., by the primary keyword of modification information, such as " start
Machine " is compared with each straton node of root node, root node in data structure successively, if a certain node is recorded as being inserted into
The primary keyword of information（That is engine）, then the subtree of this node is searched to find the node for recording and having engine model, it will send out
The model of motivation is modified.The information for having changed engine model is sent to client again.
It specifically may also include step in step S101：
The mapping table between keyword and data object is established, in order to rapidly be operated to data.
In this step, the purpose of establishing mapping table be mainly further increase the speed of searching data, and for
Required information can be also quickly found using the method by comparing the difficult data information looked for.Such as a mapping table is valve
It is corresponding with engine, air pump, that is, indicate valve either the attribute of engine can also be the attribute of air pump.
It specifically may also include step in step S105：
According to the mapping table and control instruction between keyword and data object, with to the data stored in memory
Carry out corresponding operating.
In this step, operation includes breadth traversal, extreme saturation or other traversal methods, by taking breadth traversal as an example, if
One mapping table is that valve and engine, air pump correspond to, and control instruction is when searching the control instruction of valve, then to storage
The tree data structure that is stored in device carries out breadth traversal, i.e., by " engine " or " air pump " successively with the root knot in data structure
Point, root node each straton node be compared, if certain node be engine or air pump, to the subtree of engine or air pump
It is searched to find the respective attributes of valve.
It specifically may also include step after step S105：
Operating result is shown, and the tree data structure after operation is sent in memory and is stored.
Can include in client by operating result so that user checks in this step.Can to it is modified, delete and
The tree data structure of the operations such as insertion, which is sent in memory, to be stored.
In an embodiment of the present invention, the present invention is by establishing tree-shaped data structure and according to the control instruction of client
To carry out corresponding operating to the data stored in memory, this data structure is the data knot of the tree-shaped nested form of object-oriented
Structure, convenient for being safeguarded to data；More quickly and easily data can also effectively be managed, such as search, be inserted into, delete
The operations such as remove, change.And terminal user is allowed to participate in the design of product data model, it can more effectively ensure number in memory
According to the consistency with actual product data.
Fig. 3 is the main frame block diagram for the data processing system that the embodiment of the present invention proposes.Referring to Fig. 3, data processing
System includes：Establish module 301, control module 303 and processing module 305.
More specifically, establishing module 301, it is sent to for establishing tree-shaped data structure, and by tree-shaped data structure
It is stored in memory.
Specifically, tree-shaped data structure includes data object, element property etc..Data object includes element property sum number
According to subobject etc..Element property can be used for recording undecomposable or be not required to analytical product parameter, the parameter name-in corresponding data
Parameter value.Allowing uniaxially to establish set membership between data object, a data object may include multiple subobjects, and one
Data object only allows to gather around that there are one parent objects.
Control module 303 sends out corresponding control instruction for the operation according to client.
Specifically, when such as user selects to search engine model by client, then according to lookup engine model
Operation sends out the corresponding control instruction for searching engine model.
Processing module 305, for receiving this control instruction to carry out corresponding operating to the data stored in memory, and will
Operating result is sent to client.
Specifically, processing module 305 are additionally operable to carry out the tree data structure stored in memory according to control instruction
Traversing operation carries out corresponding operating to find the destination node of tree data structure to destination node.Traversing operation can be with
For breadth traversal, extreme saturation or other traversal methods.
In addition, processing module 305 can also include searching unit 3051, be inserted into unit 3053, deleting unit 3055 and
Change unit 3057 and other operating units to data.Data processing system can also include：Display module 307.
Searching unit 3051 is lookup information when receiving control instruction, such as when the control instruction of engine model, then
Traversing operation, such as breadth traversal operation are carried out to the tree data structure stored in memory, i.e., will search the main pass of information
Keyword, such as " engine " are compared with each straton node of root node, root node in data structure successively, if a certain
Node is recorded as searching the primary keyword of information（That is engine）, then the subtree of this node is searched to judge whether that record has lookup
Information（That is engine model）, if so, will then search information（That is engine model）It is sent to client.
It is inserted into unit 3053, is insertion information when receiving control instruction, such as when the control instruction of engine model, then
Traversing operation, such as breadth traversal operation can be carried out to the tree data structure stored in memory, i.e., will be inserted into information
Primary keyword, such as " engine " are compared with each straton node of root node, root node in data structure successively, if
A certain node is recorded as being inserted into the primary keyword of information（That is engine）, then information will be inserted into（That is the model of engine）It is inserted into and makees
The child node of node thus.If there is no the primary keywords that record is inserted into information（That is engine）Node.It will then be recorded as sending out
The node of motivation is tied as new Knots inserting, and using the model of engine as the son of the new node for being inserted into record engine
Point.The information for being inserted into engine model is sent to client again.
Deleting unit 3055 is deletion information when receiving control instruction, such as when the control instruction of engine model, then
Traversing operation, such as breadth traversal operation can be carried out to the tree data structure stored in memory, i.e., will delete information
Primary keyword, such as " engine " are compared with each straton node of root node, root node in data structure successively, if
A certain node is recorded as being inserted into the primary keyword of information（That is engine）, then the subtree for searching this node has deletion to find record
Information, for example, engine model node, will record engine model node and its subtree delete.Engine will have been deleted again
The information of model is sent to client.
Unit 3057 is changed, is modification information when receiving control instruction, such as when the control instruction of engine model, then
Traversing operation, such as breadth traversal operation can be carried out to the tree data structure stored in memory, i.e., by modification information
Primary keyword, such as " engine " are compared with each straton node of root node, root node in data structure successively, if
A certain node is recorded as being inserted into the primary keyword of information（That is engine）, then search the subtree of this node and have to find record and start
The node of type number modifies the model of engine.The information for having changed engine model is sent to client again.
Display module 307 for showing operating result, and the tree data structure after operation is sent to and is deposited
It is stored in reservoir.
Specifically, can include in client by operating result so that user checks.And can to it is modified, delete and
The tree data structure of the operations such as insertion, which is sent in memory, to be stored.
In addition, establishing module 301, it can be also used for establishing the mapping table between keyword and data object, so as to
In rapidly being operated to data.
Wherein, establish module 301 establish mapping table purpose be mainly further increase the speed of searching data, and
And required information can be also quickly found using the method for the more difficult data information looked for.A such as mapping table
It is corresponded to for valve and engine, air pump, that is, indicates valve either the attribute of engine can also be the attribute of air pump.
Processing module 305 is additionally operable to according to the mapping table and control instruction between keyword and data object, with right
The data stored in memory carry out corresponding operating.
Specifically, operation includes breadth traversal, extreme saturation or other traversal methods, by taking breadth traversal as an example, if one
A mapping table is that valve and engine, air pump correspond to, and control instruction is when searching the control instruction of valve, then to memory
The tree data structure of middle storage carries out breadth traversal, i.e., by " engine " or " air pump " successively with the root knot in data structure
Point, root node each straton node be compared, if certain node be engine or air pump, to the subtree of engine or air pump
It is searched to find the respective attributes of valve.
In embodiments of the present invention, by establishing tree-shaped data structure and according to the control instruction of client with to storage
The data stored in device carry out corresponding operating, this data structure is the data structure of the tree-shaped nested form of object-oriented, is convenient for
Data are safeguarded；More quickly and easily data can also effectively be managed, such as search, be inserted into, deleting, modification
Deng operation.And terminal user is allowed to participate in the design of product data model, it can more effectively ensure in-memory data and reality
The consistency of border product data.
One of ordinary skill in the art will appreciate that realizing all or part of flow in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the program can be stored in a computer read/write memory medium
In, the program is when being executed, it may include such as the flow of the embodiment of above-mentioned each method.Wherein, the storage medium can be magnetic
Dish, CD, read-only memory（Read-Only Memory, ROM）Or random access memory（Random Access
Memory, RAM）Deng.
The above described is only a preferred embodiment of the present invention, be not intended to limit the present invention in any form, though
So the present invention has been disclosed as a preferred embodiment, and however, it is not intended to limit the invention, any technology people for being familiar with this profession
Member, without departing from the scope of the present invention, when the technology contents using the disclosure above make a little change or modification
For the equivalent embodiment of equivalent variations, as long as be without departing from technical solution of the present invention content, it is right according to the technical essence of the invention
Any simple modification, equivalent change and modification made by above example, in the range of still falling within technical solution of the present invention.
Claims (6)
1. a kind of data processing method, it is characterized in that：Including step：
A establishes tree-shaped data structure, and the tree-shaped data structure is sent in memory and is stored, and establishes crucial
Mapping table between word and data object, the tree-shaped data structure include data object, element property, the element property
It records undecomposable or is not required to analytical product parameter, parameter name-parameter value in corresponding data allows between the data object single
Set membership is established to ground, a data object includes multiple subobjects, and a data object only allows to gather around that there are one fathers couple
As；
B sends out corresponding control instruction according to the operation of client；And
C receives the control instruction, with according between the keyword and data object mapping table and the control instruction to this
The data stored in memory carry out corresponding operating, and operating result is sent to the client.
2. data processing method according to claim 1, it is characterized in that：Further include step in executing step C：
Traversing operation is carried out to find the tree-shaped number to the tree data structure stored in the memory according to the control instruction
Corresponding operating is carried out according to the destination node of structure, and to the destination node.
3. data processing method according to claim 1, it is characterized in that：Further include step after executing step C：
The operating result is shown, and the tree data structure after operation is sent in the memory and is stored.
4. a kind of data processing system, which is characterized in that it includes：
Module is established, for establishing tree-shaped data structure, and the tree-shaped data structure is sent in memory and is deposited
Storage, establishes the mapping table between keyword and data object, which includes data object, element category
Property, the element property record undecomposable or are not required to analytical product parameter, parameter name-parameter value in corresponding data, the number
According to allowing uniaxially to establish set membership between object, a data object includes multiple subobjects, and a data object is only permitted
Permitted to gather around that there are one parent objects；
Control module sends out corresponding control instruction for the operation according to client；And
Processing module, for receiving the control instruction, with according between the keyword and data object mapping table and should
Control instruction carries out corresponding operating to the data stored in the memory, and operating result is sent to the client.
5. data processing system according to claim 4, which is characterized in that the processing module is additionally operable to according to the control
It instructs and traversing operation is carried out to find the target knot of the tree data structure to the tree data structure stored in the memory
Point, and corresponding operating is carried out to the destination node.
6. data processing system according to claim 4, which is characterized in that it further comprises：
Tree data structure after operation for showing the operating result, and is sent to the storage by display module
It is stored in device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310320946.1A CN103399904B (en) | 2013-07-26 | 2013-07-26 | Data processing method and data processing system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310320946.1A CN103399904B (en) | 2013-07-26 | 2013-07-26 | Data processing method and data processing system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103399904A CN103399904A (en) | 2013-11-20 |
| CN103399904B true CN103399904B (en) | 2018-10-02 |
Family
ID=49563533
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310320946.1A Active CN103399904B (en) | 2013-07-26 | 2013-07-26 | Data processing method and data processing system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103399904B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103793469A (en) * | 2013-12-30 | 2014-05-14 | 远光软件股份有限公司 | Data inquiry statistics method and data inquiry statistics system |
| CN104408045A (en) * | 2014-10-24 | 2015-03-11 | 浪潮软件股份有限公司 | Implementation method of ECLIPSE plugins for data model management and application |
| US10007682B2 (en) * | 2015-03-30 | 2018-06-26 | International Business Machines Corporation | Dynamically maintaining data structures driven by heterogeneous clients in a distributed data collection system |
| CN109634739B (en) * | 2018-10-31 | 2021-03-02 | 同盾控股有限公司 | Data transmission method and device |
| CN111086049B (en) * | 2019-12-24 | 2021-05-25 | 珠海格力电器股份有限公司 | Food material processing method, storage medium and vegetable cutting equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102024182A (en) * | 2009-09-10 | 2011-04-20 | 上海宝信软件股份有限公司 | System for managing asset information |
| CN102385593A (en) * | 2010-09-03 | 2012-03-21 | 金蝶软件（中国）有限公司 | Method and device as well as operation system for operating utility tree |
| CN102567419A (en) * | 2010-12-31 | 2012-07-11 | ***股份有限公司 | Mass data storage device and method based on tree structure |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7181684B2 (en) * | 2000-12-12 | 2007-02-20 | Oracle International Corporation | Dynamic tree control system |
-
2013
- 2013-07-26 CN CN201310320946.1A patent/CN103399904B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102024182A (en) * | 2009-09-10 | 2011-04-20 | 上海宝信软件股份有限公司 | System for managing asset information |
| CN102385593A (en) * | 2010-09-03 | 2012-03-21 | 金蝶软件（中国）有限公司 | Method and device as well as operation system for operating utility tree |
| CN102567419A (en) * | 2010-12-31 | 2012-07-11 | ***股份有限公司 | Mass data storage device and method based on tree structure |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103399904A (en) | 2013-11-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103399904B (en) | Data processing method and data processing system | |
| AU761923B2 (en) | Database system | |
| US9870382B2 (en) | Data encoding and corresponding data structure | |
| CN102184211B (en) | File system, and method and device for retrieving, writing, modifying or deleting file | |
| US20130290344A1 (en) | Updating a search index used to facilitate application searches | |
| CN105740303B (en) | The method and device of improved object storage | |
| CN104778222B (en) | Media library based on USB storage device is established and update method | |
| CN107045531A (en) | A kind of system and method for optimization HDFS small documents access | |
| US20080028312A1 (en) | Scene organization in computer-assisted filmmaking | |
| US10922288B2 (en) | Method for storing data elements in a database | |
| CN110390039A (en) | Social networks analysis method, device and the equipment of knowledge based map | |
| CN105721883B (en) | Video sharing method and system based on information of tracing to the source in a kind of cloud storage system | |
| US20130254240A1 (en) | Method of processing database, database processing apparatus, computer program product | |
| CN108460041A (en) | The treating method and apparatus of data | |
| US20030204537A1 (en) | Content management system and methodology for implementing a complex object using nested/recursive structures | |
| CN104408128B (en) | A kind of reading optimization method indexed based on B+ trees asynchronous refresh | |
| CN111221785A (en) | Semantic data lake construction method of multi-source heterogeneous data | |
| CN110134688B (en) | Hot event data storage management method and system in online social network | |
| CN116150159A (en) | Method, device, equipment and medium for visualizing enterprise relationship in multiple dimensions | |
| CN108959584A (en) | A kind of method and device of the processing diagram data based on community structure | |
| US20140067840A1 (en) | System and method for retrieving information | |
| US8566814B2 (en) | Transporting object packets in a nested system landscape | |
| CN105894142A (en) | Electronic process based filing and modeling method | |
| CN107741940A (en) | A kind of data storage method and storage system | |
| CN108346172B (en) | Multidimensional space data dot matrix VR display method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |