CN108011687B - Data processing method and device - Google Patents
Data processing method and device Download PDFInfo
- Publication number
- CN108011687B CN108011687B CN201610935512.6A CN201610935512A CN108011687B CN 108011687 B CN108011687 B CN 108011687B CN 201610935512 A CN201610935512 A CN 201610935512A CN 108011687 B CN108011687 B CN 108011687B
- Authority
- CN
- China
- Prior art keywords
- data
- field
- mark
- tree
- aiming field
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0023—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the signalling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/12—Use of codes for handling textual entities
- G06F40/126—Character encoding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/12—Use of codes for handling textual entities
- G06F40/14—Tree-structured documents
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
- H04L69/161—Implementation details of TCP/IP or UDP/IP stack architecture; Specification of modified or new header fields
- H04L69/162—Implementation details of TCP/IP or UDP/IP stack architecture; Specification of modified or new header fields involving adaptations of sockets based mechanisms
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Health & Medical Sciences (AREA)
- Computational Linguistics (AREA)
- General Health & Medical Sciences (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Artificial Intelligence (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Quality & Reliability (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention discloses a kind of data processing method and devices, belong to technical field of data processing.Method includes: the data processing request received to coded data block, and data processing request carries at least one aiming field mark in coded data block；According to the data structure definition file of at least one aiming field mark and coded data block, the nested tree of mark is generated, each branch for identifying nested tree is used to indicate the nest relation of an aiming field and its ancestors' field；According to the nested tree of mark, coded data block is decoded, the decoding data of at least one aiming field is obtained；According to data processing request, the decoding data of at least one aiming field is handled.The hierarchical relationship for needing the field identification of decoded aiming field and its ancestors' field by using nested tree representation is identified, terminal is only decoded the code segment data in coded data block, it can realize the data processing to aiming field, improve the efficiency of data processing.
Description
Technical field
The present invention relates to technical field of data processing, in particular to a kind of data processing method and device.
Background technique
Google Protocol Buffer (abbreviation Protobuf) is the format specification that a kind of pair of data are encoded, and is led to
It is usually used in the scenes such as data storage.
In the prior art, data to be encoded are usually made of multiple field nestings.What is encoded using ProtoBuf
In the process, need to create data structure definition file (such as .porto file) to describe in data to be encoded each field
Coded sequence and nest relation.Terminal is closed according to the coded sequence of each field with nested according to the data structure definition file
System, encodes each field, obtains coded data block.If terminal need to certain coded data in coded data block into
Row processing, for example read or write processing, then it needs to close each code field sequence with nested according to the data structure definition file
The description of system, is decoded coded data block, obtains the decoding data of each field, then from the decoding data of each field
The decoding data for needing field is obtained, the field can be carried out the operation such as reading or writing later.
In the implementation of the present invention, the inventor finds that the existing technology has at least the following problems:
In practical application, a field may be nested with multiple fields, only be needed in many cases to the portion in the field
Point field is handled, other fields are not relevant for, and in above-mentioned data handling procedure, no matter reading or writing which field, it is both needed to
Obtain data structure definition file, and according to data structure definition file, to whole fields in coded data block one by one into
Row decoding, so that the process of data processing is cumbersome, treatment effeciency is low.
Summary of the invention
In order to solve problems in the prior art, the embodiment of the invention provides a kind of data processing method and devices.It is described
Technical solution is as follows:
On the one hand, a kind of data processing method is provided, which comprises
The data processing request to coded data block is received, the data processing request carries in the coded data block
At least one aiming field mark；
According to the data structure definition file of at least one described aiming field mark and the coded data block, mark is generated
Know nested tree, each branch of the nested tree of mark is used to indicate the nest relation of an aiming field and its ancestors' field；
According to the nested tree of the mark, the coded data block is decoded, obtains at least one described aiming field
Decoding data；
According to the data processing request, the decoding data of at least one aiming field is handled.
On the other hand, a kind of data processing equipment is provided, described device includes:
Receiving module, for receiving the data processing request to coded data block, described in the data processing request carries
At least one aiming field mark in coded data block；
Generation module, it is fixed for the data structure according at least one aiming field mark and the coded data block
Adopted file, generates the nested tree of mark, and each branch of the nested tree of mark is used to indicate an aiming field and its ancestors' word
The nest relation of section；
Decoder module, for being decoded to the coded data block according to the nested tree of the mark, obtain described at least
The decoding data of one aiming field；
Processing module, for according to the data processing request, to the decoding data of at least one aiming field into
Row processing.
Technical solution provided in an embodiment of the present invention has the benefit that
The level for needing the field identification of decoded aiming field and its ancestors' field by using nested tree representation is identified
Relationship is decoded terminal only to the code segment data in coded data block, can realize to aiming field
Data processing improves the efficiency of data processing.
Detailed description of the invention
To describe the technical solutions in the embodiments of the present invention more clearly, make required in being described below to embodiment
Attached drawing is briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for
For those of ordinary skill in the art, without creative efforts, it can also be obtained according to these attached drawings other
Attached drawing.
Figure 1A is a kind of flow chart of data processing method provided in an embodiment of the present invention；
Figure 1B is a kind of schematic diagram of code field rule provided in an embodiment of the present invention；
Fig. 1 C is a kind of schematic diagram of the nested tree of mark provided in an embodiment of the present invention；
Fig. 1 D is a kind of coded sequence schematic diagram of the nested tree corresponding field of mark provided in an embodiment of the present invention；
Fig. 1 E is a kind of schematic diagram of first data tree provided in an embodiment of the present invention；
Fig. 1 F is a kind of schematic diagram of second data tree provided in an embodiment of the present invention；
Fig. 2 is a kind of block diagram of data processing equipment provided in an embodiment of the present invention；
Fig. 3 is a kind of structural schematic diagram of terminal provided in an embodiment of the present invention；
Fig. 4 is a kind of block diagram of device provided in an embodiment of the present invention.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, below in conjunction with attached drawing to embodiment party of the present invention
Formula is described in further detail.
Data processing method provided in an embodiment of the present invention can be applied to the scenes such as communications protocol and data storage.The number
May include request of data side and data processing side according to the main body that processing method is related to, the request of data can with for terminal,
The data processing can be for server；Or the request of data side and data processing side are respectively the difference of terminal or server
Process, the embodiment of the present invention are not construed as limiting this.In data processing method shown in figure 1A, using server as main body for into
Row is introduced.
Figure 1A is a kind of flow chart of data processing method provided in an embodiment of the present invention, and referring to Figure 1A, the present invention is implemented
Example provide method flow include:
101, the data processing request to coded data block is received, data processing request carries in coded data block at least
One aiming field mark.
Server may be stored with a large amount of coded data block, and corresponding each coded data block is correspondingly arranged on block identification.
The block identification that coded data block to be treated can be carried in data processing request allows server according to the block mark
Know, obtains coded data block corresponding with the block identification.In addition, place can be requested or be write to the data processing request to read processing
Reason request, wherein reading processing request, which is used to indicate, reads at least one aiming field, writes processing and requests to be used to indicate modification at least
One aiming field.
It should be noted that the coding rule of a field is as shown in Figure 1B, which can be made of multiple subfields,
Wherein Tag subfield is for carrying field identification, Value subfield for carrying tool volume data, Type subfield for carrying
The data type of field value.Wherein, key assignments (key) of the Tag and Type together as field.Wherein, Val_Len is optional
, only exist when Type value is 2, Val_Len is used to indicate the length of Value.The coded format according to shown in Figure 1B, can be with
The field identification of one field, data type, the length of field value and value of field etc. are encoded and (encoded), is obtained
To the coded data of the field.Wherein, when being nested with field in a certain field, which is used as should
The value of the Value subfield of field.Therefore, a coded data block can be regarded as multiple fields with nest relation
Coded data.
Wherein, the data type of the value of Type and corresponding Protobuf coding mode is as shown in table 1.Wherein, each
Kind Protobuf data type may include many general data type.It that is to say, to general number in Protobuf coding mode
Sorted out according to type.Wherein, the corresponding data type of Varint is encoded using variable-length encoding mode；64-bit,32-
The corresponding data type of bit uses fixed-length code (FLC), and it is 64 (8 byte) that 64-bit, which corresponds to regular length, and 32-bit is corresponding
Regular length is 32 (4 byte)；The corresponding data type code length of Length-delimited is by Val_Len subfield
Value indicates；Start group and End group respectively indicate start field and trailer field in code set structure.Wherein,
When being encoded using variable-length encoding mode, it can indicate whether the field terminates with first of each byte, for example, byte
First indicate that field is not finished when being 1, first of byte when being 0, indicates that the field terminates to the byte.
Table 1
102, according to the data structure definition file of at least one aiming field mark and coded data block, it is embedding to generate mark
Set tree.
The detailed process for generating the nested tree of mark can be with are as follows: for each target word at least one aiming field mark
Segment identification determines the position of aiming field mark in data structure definition file；It is fixed from data structure according to determining position
Ancestors' field identification of nested aiming field mark is obtained in adopted file；According to each aiming field mark and its ancestors' field mark
Know, generates the nested tree of mark.
It wherein, include ancestors' word of at least one aiming field mark and each aiming field mark in the nested tree of mark
Segment identification identifies the level that the nested each branch set is used to indicate between an aiming field mark and its ancestors' field and closes
System.Specifically, the leaf node in the mark nesting tree in the nested tree of each corresponding mark of aiming field mark, each target word
Non-leaf nodes (not including Root node) in the nested tree of the corresponding mark of ancestors' field identification of segment identification.Wherein, target word
Ancestors' field identification of segment identification refer in the nested tree of mark from root node to aiming field mark through all words in branch
Segment identification.It should be noted that the nest relation of interfield is used to indicate the hierarchical relationship of interfield in the embodiment of the present invention.
For example, Fig. 1 C is a kind of schematic diagram of nested tree of mark, wherein Tag1 and Tag5 is aiming field mark,
Tag7 is ancestors' field identification of Tag1, indicates that the corresponding field of Tag1 is nested in the corresponding field of Tag7.Similarly, Tag8 is
Ancestors' field identification of Tag5 indicates that the corresponding field of Tag5 is nested in the corresponding field of Tag8.Wherein, root node does not have
There is a physical meaning, when specific implementation can use as default the root node.
It should be noted that the nested tree of the mark can be indicated in the form of chained list, or by the form of sequence list
It indicates, the embodiment of the present invention is not construed as limiting this.
103, according to the nested tree of mark, coded data block is decoded, the solution yardage of at least one aiming field is obtained
According to.
After getting coded data block, server can be according to the nested tree of mark to one layer of field of coded data block
One layer is decoded, and detailed process can be with are as follows: each branch of tree nested for mark, the target word that is included according to branch
Ancestors' field identification of segment identification and aiming field mark, reads the field identification in coded data block；Reading target
When field identification, Data Position in coded data block is identified based on aiming field, in coded data block with Data Position
Corresponding coded data is decoded, and obtains the decoding data of aiming field.
Wherein, a branch for the nested tree of mark can be regarded as aiming field in the branch and identify corresponding aiming field
Decoding paths.Still by taking Fig. 1 C as an example, it is assumed that Tag1 corresponds to aiming field 1, and Tag5 corresponds to aiming field 5, then the solution of aiming field 1
Code path is Tag7- > Tag1, and the decoding paths of aiming field 5 are Tag8- > Tag5.
Specifically, it for either objective field, is arranged in server code data block by the sequence of certain level
The coded data of each field, in coded data block in the hierarchical relationship of each code field data from outside to inside tree nested with mark
(removing root node) is corresponded by the hierarchical relationship of father node to child node.Based on the coding rule introduced in above-mentioned steps 101,
Server can be decoded coded data outermost in coded data block, that is to say, server can read outermost
The field identification of layer coded data.The first-level nodes (the root node in the nested tree of the corresponding mark of outermost layer in coded data block
Child node), therefore, server judges to identify nested tree the first-level nodes when reading outermost first field identification
It whether include first field identification in corresponding field identification, if comprising thening follow the steps 1031, it is no to then follow the steps
1032。
For example, being as shown in figure iD the coded sequence schematic diagram of Fig. 1 C corresponding field, it is assumed that Tag7 corresponding field 7, Tag8
Corresponding field 8, field 7 and field 8 are located at the first layer of coded data block, and Tag7 is nested for mark with Tag8 known to Fig. 1 C
The highest node of level in tree in addition to root node, thus the level of field 7 and field 8 in coded data block respectively with
Tag7 is consistent with the level at the place in decoding paths Tag8.Specifically, by taking decoding paths is Tag7- > Tag1 as an example, if clothes
The first field identification that business device is decoded to during being decoded to coded data block first layer is 7, then according to decoding road
Diameter is it is found that the field identification of corresponding level is also 7 (Tag7), and therefore, server can get Tag7 from the nested tree of mark
Junior field identification Tag1.
Step 1031, corresponding second field identification of child node that the field identification is obtained from the nested tree of mark, judgement
Whether second field identification has junior's field identification in the nested tree of mark.
It should be noted that server is after determining and identifying in nested tree the first-level nodes comprising first field identification,
The corresponding coded data of the first field identification is decoded in coded data block, specifically, server continuation is read backward
The Val_Len subfield of the first field is taken, to determine the length of the first field according to the value of Val_Len subfield, according to
The length of one field determines the Data Position of the first field Value subfield, thus according to the number of the first field Value subfield
According to position, the coded data of the first field is obtained, and then the coded data in the first field is carried out according to the second field identification
Decoding.
Specifically, whether the case where junior's field identification is had according to second field identification, to the volume in the first field
The process that code data are decoded can be divided into following two kinds of situations:
The first situation, the second field identification have junior's field identification.
Specifically, if the second field identification has junior's field identification, server determines the in the nested tree of mark
Junior's field identification of two field identifications, i.e. third field identification.Server determines second in the coded data of the first field
The position of field identification, and continue the Val_Len subfield for reading the second field backward, to obtain the length of the second field, root
According to the length of the second field, the Data Position of the coded data of the second field is determined, to obtain the coded data of the second field.
Later, the coded data in the second field is decoded according to third field identification.This is to the coded data in the second field
The process that is decoded with the process being decoded to the coded data in the first field similarly.
For example, it is assumed that Tag1 also has junior field identification Tag3 in the nested tree of mark shown in Fig. 1 C, then where Tag1
The decoding paths of branch's instruction are Tag7- > Tag1- > Tag3, and server judges whether Tag1 has junior's word in decoding paths
Segment identification has junior's field identification Tag3 according to decoding paths Tag1.At this point, server can determine needs in field
The field for being 1 to field identification in 1 coded data is decoded.Specifically, server obtains the Value subfield of field 1
Coded data, be decoded according to coded data of the field identification 3 to the Value subfield of field 1.
It should be noted that each layer is according to the value of field identification due to during encoding to data
Ascending sequence is encoded, and therefore, in order to improve the efficiency of data processing, identifying can be according to field mark in nested tree
Ascending sequence arrangement field identification is known, so that carrying out the sequence of preorder traversal to the nested tree of mark is coded data block
The coded sequence of middle respective field avoids repetition and carries out the low problem of traversal bring treatment effeciency to the nested tree of mark.
Second situation, the second field identification do not have junior's field identification.
Specifically, if the second field identification does not have junior's field identification, by the corresponding field of the second field identification
It is determined as aiming field.Server can the coded data directly to second field be decoded, obtain the solution of aiming field
Code data.
By taking decoding paths is Tag7- > Tag1 as an example, it is assumed that the second field identification is Tag1 at this time, does not have junior's field
Mark, then the corresponding field 1 of Tag1 is aiming field.Server can the sub- word of Value directly to the Tag1 corresponding field
The coded data of section is decoded the decoding data that aiming field can be obtained.Such as, it is assumed that field 7 is for indicating that student believes
Breath, student information includes: name and the age of student.Assuming that field 1 indicates that the age of student is 18, encoded radio binary system
It is expressed as 00010010, then can obtain the decoding data of field 1 after being decoded to the field 1 are as follows: Tag=1, Type=
Int32, Value=18 (for using decimal representation).
If not including the first field mark in the corresponding field identification of the nested tree the first-level nodes of step 1032, mark
Know, then obtains the length of corresponding first field of the first field identification；According to the length of first field, next field is read
Mark.
In the present invention is implemented, it sets in the corresponding field identification of the first-level nodes when mark is nested not comprising first field
When mark, server confirmation does not need to be decoded the coded data of the first field corresponding to first field identification, services
Device determines the Data Position of next field identification according to the length of the first field Value subfield, jumps directly to next
Data Position where field identification is decoded next field identification.
For example, it is assumed that the length of the first field Value subfield is four bytes, then server is obtaining the first field
After the length of Value subfield, the coded data of the Value subfield of the first field is not decoded, jumps directly to the 5th
A byte starts to decode.
It in the present invention is implemented, can be using tree structure to decoding during being decoded to coded data block
The data of field involved in process are stored, and according to the difference of data processing request type, storage mode can be divided into as follows
Step 104 and 105.
In the embodiment of the present invention, the tree structure that the field decoded is stored as can be known as data tree, the data tree
In each node be used to store the content of each field.
If 104, data processing request, which is used to indicate, reads at least one aiming field, by each aiming field and its ancestral
The decoding data of first field is stored as the first data tree.
Specifically, during being decoded to the coded data block, for each aiming field, server can be with
According to the hierarchical relationship between each aiming field and its ancestors' field, by each aiming field and its solution yardage of ancestors' field
According to the first data tree is stored as, the node in first data tree is used to store the decoding data of field.
This kind of storage mode can be applied to the scene for the read requests that data processing request is aiming field, which asks
It asks to be used to indicate and reads at least one aiming field.Under this kind of scene, in order to reduce data processing amount, server can only by
The decoding data of aiming field and its ancestors' field stores the first data tree according to corresponding hierarchical relationship.
For example, as referring to figure 1E, coded data block is decoded for the mark nested tree according to Fig. 1 C first
Data tree, each node in first data tree are used to the decoding data of storage respective field.Wherein, Root node can be with
Without any physical meaning, in practical application, the value of Root can be used as default.
If 105, data processing request, which is used to indicate, modifies at least one aiming field, the coded number of field will not be decoded
The second data tree is stored as according to the decoding data of reconciliation code field.
Wherein, decoding field includes each aiming field and its ancestors' field.
Specifically, during being decoded to coded data block, for each field in coded data block, according to
Hierarchical relationship between each field will not decode the coded data of field, the decoding data of each aiming field, each target
The decoding data of ancestors' field of field is stored as the second data tree, and the node in second data tree is for storing decoding field
Decoding data or for storing the coded data for not decoding field.
Under this kind of scene, server can not decode the decoding data for decoding field and the coded data of field, press
According to corresponding hierarchical relationship, it is stored as the second data tree, in order to after the decoding data to aiming field is modified,
Convenient for the update to coded data block, to improve the update efficiency to coded data block.
For example, it is assumed that being in the field of same level with field 7 and field 8, there are also fields 6, are nested in together with field 1
The also field 2 of field 7 is nested in the also field 4 of field 8 together with field 5, is then identified according to shown in Fig. 1 C nested
Tree, during being decoded to coded data block, is not decoded processing to field 6, field 2 and field 4, server is direct
By the storage of its coded data into the node of the corresponding level of data tree, and for field 7, field 1, field 8 and field 5, service
The decoding data that device then decodes it is stored into the node of the corresponding level of data tree.It is as shown in fig. 1F this kind of storage side
The structure of the second data tree of one kind under formula.
Wherein, server is not relevant for the particular content of field 6, field 2 and field 4, for example whether be indifferent to it nested
There are other fields etc., therefore, for data tree level, according to the coded data of storage, not can determine that the word indicated by it
Which field is section be, indicates the coded data for not decoding field in Fig. 1 F using m_node.Wherein, m_node1 indicates field
6, m_node2 indicates that field 2, m_node3 indicate field 4.
It should be noted that server can be during being decoded coded data block, according to the word being decoded to
Level where section, according to the content (coded data or decoding data) of field, the above-mentioned data tree of dynamic generation.Certainly, it services
Device the static data tree for generating a default size, each node therein can also be set as zero or other default values in advance,
Then corresponding decoding data or coded data are stored into corresponding node according to the decoding cases to field.
It should be noted that server can make different responses according to the difference of data processing request type.For example,
When data processing request, which is used to indicate, reads aiming field, server can be according to the decoding of at least one aiming field
Data respond the data processing request；When data processing request be used to indicate modification aiming field when, then root this state data processing
Request determines the aiming field for needing to modify, and modifies to the aiming field in the second data tree that later, server needs
The second data tree is encoded to be updated to coded data block again according to the content of modification, detailed process is referring to step
Rapid 106 to 108.
106, it modifies, obtains to the value of field in the decoding data of at least one aiming field in the second data tree
Modified second data tree.
Server can obtain the decoding data of an at least aiming field in second data tree in the step, and according to
Data processing request modifies to the value of field in the decoding data of at least one aiming field, by field after modification
Value store into the respective nodes of the second data tree.
It should be noted that the data processing request can serve to indicate that one at least one aiming field or
Multiple aiming fields are modified, and the embodiment of the present invention is not construed as limiting this.
107, modified second data tree is encoded, obtains newly encoded data block.
Server can re-start coding to field indicated by modified second data tree, obtain newly organized yardage
According to block.The coding rule encoded to data tree can be as shown in table 2.
Table 2
Specifically, the process recompiled to data can be with are as follows: carries out first sequence time to modified second data tree
It goes through；For traversing each node extremely, if the node is used to store the coded data (i.e. m_node node) for not decoding field,
The data of field will not then be decoded directly as the corresponding coded data of the node；If the node is for storing ancestors' field
Second decoding data of the node corresponding field is then encoded, obtains the node pair by decoding data (i.e. non-leaf nodes)
The coded data answered；If the node is used to store the decoding data (leaf node of i.e. non-m_node node) of aiming field,
Then the first decoding data of the node corresponding field is encoded, obtains the corresponding coded data of the node；According to each section
The traversal order of point arranges the corresponding coded data of each node, obtains newly encoded data block.
Wherein it is possible to default mark be used in each node of data tree to indicate the node whether for m_node section
Point, for example, being expressed as m_node section when the value of the type marker is 1 for a type identification position is increased before node data
Point, when the value of the type marker is 0, expression is not m_node node etc., and the embodiment of the present invention is not construed as limiting this.
It should be noted that in order to improve the efficiency encoded according to data tree, and in holding and original encoding data block
The consistency of code field sequence, sequence that can be ascending according to field identification by the field of each level, by corresponding word
The content of section, to by storing in the respective nodes into data tree, allows server according to the data tree elder generation sequence time by left
The sequence gone through, the cataloged procedure of all fields in disposable complete paired data tree, without carrying out repeatedly traversal to data tree.Tool
Body, server carries out preorder traversal to data tree, is encoded according to coding rule shown in table 2 to the node of traversal extremely.
For to the second data tree shown in Fig. 1 F, server is first traversed to m_node1 node, and server can determine
The m_node1 node is m_node node, then directly replicates the coded data of the m_node1 node into newly encoded data block.
Server continues traversal to 7 place node of field, and server can determine that the field 7 is the non-leaf section of non-m_node node
Point, then the length Val_ of the data type (Tag+Type) and Value subfield of the field identification to the field 7 and field value
Len is encoded.Then server is traversed to 1 place node of field, and equally, server can determine that the field 1 is non-m_
The leaf node of node node, then by data type (Tag+Type), the field of the field identification of the field 1 and field value
The length Val_Len (existing when Type is 2) and the value of Value subfield of 1 Value subfield are encoded, and are obtained
The coded data of field 1, and the coded data of the field 1 is stored to the Value subfield of field 7.Then, server traverses
To m_node1 node, server can determine that the node is m_node node, then the coded data of the node is arranged in field
It stores after 1 coded data to the Value subfield of field 7.Other nodes similarly, finally obtain newly encoded data block.
108, original encoding data block is replaced with into newly encoded data block.
Server can delete original encoding data block, and store the newly encoded data block, to realize to coded data block
It updates.
Method provided in an embodiment of the present invention needs decoded aiming field and its ancestral by using nested tree representation is identified
The hierarchical relationship of the field identification of first field solves server only to the code segment data in coded data block
Code, can realize the data processing to aiming field, improve the efficiency of data processing.
It should be noted that above-mentioned flow chart of data processing is only introduced using server as executing subject, and certainly, the number
It can also be applied to communications protocol scene according to process flow, the flow chart of data processing is carried out by terminal and server interaction at this time,
In that case, terminal can execute above-mentioned steps 101 and 102, identify nested tree to generate, and the nested tree of mark is carried
Be sent to server in data processing request, server according to the nested tree of the mark received to the coded data block of storage into
Row decoding and the subsequent process that aiming field is handled, i.e. content involved in above-mentioned steps 103 to 108.Due to one
The corresponding data structure file of a coded data block may be very huge, and server is not needed to obtain and compiled in above-mentioned decoding process
The data structure definition file of code data block, only can realize decoding process according to the mark nesting tree that terminal is sent, save
Memory space, and the data structure file, above-mentioned decoding process can not be obtained since decoding end is possibly in some cases
It can be applied to the versatility that data processing is improved in wider scene.Further, due to the data of the nested tree of mark
Amount is smaller, can reduce the pressure of data transmission, the efficiency of improve data transfer.
Fig. 2 is a kind of block diagram of data processing equipment provided in an embodiment of the present invention.Referring to Fig. 2, which includes receiving
Module 201, generation module 202, decoder module 203 and processing module 204.
Wherein, receiving module 201 and generation module 202, for receiving the data processing request to coded data block, the number
Request to carry at least one aiming field mark in the coded data block according to processing；Generation module 202 and decoder module 203 connect
It connects, for the data structure definition file according at least one aiming field mark and the coded data block, it is embedding to generate mark
Set tree, each branch of the mark nesting tree are used to indicate the nest relation of an aiming field and its ancestors' field；Decode mould
Block 203 is connect with processing module 204, for being decoded to the coded data block, obtaining this at least according to the mark nesting tree
The decoding data of one aiming field；Processing module 204 is used for according to the data processing request, at least one target word
The decoding data of section is handled.
In one possible implementation, generation module 202, for at least one aiming field mark
Each aiming field mark, in the data structure definition file determine the aiming field mark position；According to the position,
Ancestors' field identification of nested aiming field mark is obtained from the data structure definition file；According to each aiming field
Mark and its ancestors' field identification, generate the mark nesting tree.
In one possible implementation, which is used for each branch for the mark nesting tree, root
Ancestors' field identification of the aiming field mark and aiming field mark that are included according to the branch, reads the coded data block
In field identification；When reading aiming field mark, the number in the coded data block is identified based on the aiming field
According to position, coded data corresponding with the Data Position in the coded data block is decoded, the solution of the aiming field is obtained
Code data.
In one possible implementation, the device further include:
Memory module reads at least one aiming field if be used to indicate for the data processing request, right
During the coded data block is decoded, by ancestors' word of the decoding data of each aiming field and each aiming field
The decoding data of section is stored as the first data tree, and the node in first data tree is used to store the decoding data of field；If
The data processing request, which is used to indicate, modifies at least one aiming field, then during decoded to the coded data block,
The solution of the coded data of field, the decoding data of each aiming field, ancestors' field of each aiming field will not be decoded
Code data are stored as the second data tree, and the node in second data tree is used for the decoding data or coded data of field.
In one possible implementation, which is used to be used to indicate modification when the data processing request
When at least one aiming field, to the value of field in the decoding data of at least one aiming field in second data tree
It modifies, obtains modified second data tree；Modified second data tree is encoded, newly encoded data are obtained
Block；The coded data block is replaced with into the newly encoded data block.
In one possible implementation, which is used to carry out first modified second data tree
Sequence traversal；For traversing each node extremely, if the node does not solve this for storing the coded data for not decoding field
The data of code field are directly as the corresponding coded data of the node；If the node is used to store the solution yardage of ancestors' field
According to then the second decoding data of the node corresponding field is encoded, obtains the corresponding coded data of the node；If the section
The decoding data for storing aiming field is put, then the first decoding data of the node corresponding field is encoded, is somebody's turn to do
The corresponding coded data of node；The corresponding coded data of each node is arranged according to the traversal order of each node, is obtained
The newly encoded data block.
The device that the embodiment of the present disclosure provides needs decoded aiming field and its ancestral by using nested tree representation is identified
The hierarchical relationship of the field identification of first field solves terminal only to the code segment data in coded data block
Code, can realize the data processing to aiming field, improve the efficiency of data processing.
It should be understood that data processing equipment provided by the above embodiment is when handling data, only with above-mentioned each function
The division progress of module can according to need and for example, in practical application by above-mentioned function distribution by different function moulds
Block is completed, i.e., the internal structure of equipment is divided into different functional modules, to complete all or part of function described above
Energy.In addition, data processing equipment provided by the above embodiment and data processing method embodiment belong to same design, it is specific real
Existing process is detailed in embodiment of the method, and which is not described herein again.
Fig. 3 is a kind of structural schematic diagram of terminal provided in an embodiment of the present invention, which can be used for executing above-mentioned each
Data processing method is provided in a embodiment.Referring to Fig. 3, which includes:
Terminal 300 may include RF (Radio Frequency, radio frequency) circuit 110, include one or more meter
The memory 120 of calculation machine readable storage medium storing program for executing, input unit 130, display unit 140, sensor 150, voicefrequency circuit 160,
WiFi (Wireless Fidelity, Wireless Fidelity) module 170, the processing for including one or more than one processing core
The components such as device 180 and power supply 190.It will be understood by those skilled in the art that terminal structure shown in Fig. 3 is not constituted pair
The restriction of terminal may include perhaps combining certain components or different component cloth than illustrating more or fewer components
It sets.Wherein:
RF circuit 110 can be used for receiving and sending messages or communication process in, signal sends and receivees, particularly, by base station
After downlink information receives, one or the processing of more than one processor 180 are transferred to；In addition, the data for being related to uplink are sent to
Base station.In general, RF circuit 110 includes but is not limited to antenna, at least one amplifier, tuner, one or more oscillators, uses
Family identity module (SIM) card, transceiver, coupler, LNA (Low Noise Amplifier, low-noise amplifier), duplex
Device etc..In addition, RF circuit 110 can also be communicated with network and other equipment by wireless communication.The wireless communication can make
With any communication standard or agreement, and including but not limited to GSM (Global System of Mobile communication, entirely
Ball mobile communcations system), GPRS (General Packet Radio Service, general packet radio service), CDMA (Code
Division Multiple Access, CDMA), WCDMA (Wideband Code Division Multiple
Access, wideband code division multiple access), LTE (Long Term Evolution, long term evolution), Email, SMS (Short
Messaging Service, short message service) etc..
Memory 120 can be used for storing software program and module, and processor 180 is stored in memory 120 by operation
Software program and module, thereby executing various function application and data processing.Memory 120 can mainly include storage journey
Sequence area and storage data area, wherein storing program area can the (ratio of application program needed for storage program area, at least one function
Such as sound-playing function, image player function) etc.；Storage data area, which can be stored, uses created number according to terminal 300
According to (such as audio data, phone directory etc.) etc..In addition, memory 120 may include high-speed random access memory, can also wrap
Include nonvolatile memory, a for example, at least disk memory, flush memory device or other volatile solid-state parts.
Correspondingly, memory 120 can also include Memory Controller, to provide processor 180 and input unit 130 to memory
120 access.
Input unit 130 can be used for receiving the number or character information of input, and generate and user setting and function
Control related keyboard, mouse, operating stick, optics or trackball signal input.Specifically, input unit 130 may include touching
Sensitive surfaces 131 and other input equipments 132.Touch sensitive surface 131, also referred to as touch display screen or Trackpad are collected and are used
Family on it or nearby touch operation (such as user using any suitable object or attachment such as finger, stylus in touch-sensitive table
Operation on face 131 or near touch sensitive surface 131), and corresponding attachment device is driven according to preset formula.It is optional
, touch sensitive surface 131 may include both touch detecting apparatus and touch controller.Wherein, touch detecting apparatus detection is used
The touch orientation at family, and touch operation bring signal is detected, transmit a signal to touch controller；Touch controller is from touch
Touch information is received in detection device, and is converted into contact coordinate, then gives processor 180, and can receive processor 180
The order sent simultaneously is executed.Furthermore, it is possible to using multiple types such as resistance-type, condenser type, infrared ray and surface acoustic waves
Realize touch sensitive surface 131.In addition to touch sensitive surface 131, input unit 130 can also include other input equipments 132.Specifically,
Other input equipments 132 can include but is not limited to physical keyboard, function key (such as volume control button, switch key etc.),
One of trace ball, mouse, operating stick etc. are a variety of.
Display unit 140 can be used for showing information input by user or the information and terminal 300 that are supplied to user
Various graphical user interface, these graphical user interface can be made of figure, text, icon, video and any combination thereof.
Display unit 140 may include display panel 141, optionally, can use LCD (Liquid Crystal Display, liquid crystal
Show device), the forms such as OLED (Organic Light-Emitting Diode, Organic Light Emitting Diode) configure display panel
141.Further, touch sensitive surface 131 can cover display panel 141, when touch sensitive surface 131 detects touching on it or nearby
After touching operation, processor 180 is sent to determine the type of touch event, is followed by subsequent processing device 180 according to the type of touch event
Corresponding visual output is provided on display panel 141.Although touch sensitive surface 131 and display panel 141 are conducts in Fig. 3
Two independent components realize input and input function, but in some embodiments it is possible to by touch sensitive surface 131 and display
Panel 141 is integrated and realizes and outputs and inputs function.
Terminal 300 may also include at least one sensor 150, such as optical sensor, motion sensor and other sensings
Device.Specifically, optical sensor may include ambient light sensor and proximity sensor, wherein ambient light sensor can be according to environment
The light and shade of light adjusts the brightness of display panel 141, and proximity sensor can close display when terminal 300 is moved in one's ear
Panel 141 and/or backlight.As a kind of motion sensor, gravity accelerometer can detect in all directions (generally
Three axis) acceleration size, can detect that size and the direction of gravity when static, can be used to identify mobile phone posture application (ratio
Such as horizontal/vertical screen switching, dependent game, magnetometer pose calibrating), Vibration identification correlation function (such as pedometer, tap)；Extremely
In other sensors such as gyroscope, barometer, hygrometer, thermometer, the infrared sensors that terminal 300 can also configure, herein
It repeats no more.
Voicefrequency circuit 160, loudspeaker 161, microphone 162 can provide the audio interface between user and terminal 300.Audio
Electric signal after the audio data received conversion can be transferred to loudspeaker 161, be converted to sound by loudspeaker 161 by circuit 160
Sound signal output；On the other hand, the voice signal of collection is converted to electric signal by microphone 162, after being received by voicefrequency circuit 160
Audio data is converted to, then by after the processing of audio data output processor 180, such as another end is sent to through RF circuit 110
End, or audio data is exported to memory 120 to be further processed.Voicefrequency circuit 160 is also possible that earphone jack,
To provide the communication of peripheral hardware earphone Yu terminal 300.
WiFi belongs to short range wireless transmission technology, and terminal 300 can help user's transceiver electronics by WiFi module 170
Mail, browsing webpage and access streaming video etc., it provides wireless broadband internet access for user.Although Fig. 3 is shown
WiFi module 170, but it is understood that, and it is not belonging to must be configured into for terminal 300, it can according to need completely
Do not change in the range of the essence of invention and omits.
Processor 180 is the control centre of terminal 300, utilizes each portion of various interfaces and connection whole mobile phone
Point, by running or execute the software program and/or module that are stored in memory 120, and calls and be stored in memory 120
Interior data execute the various functions and processing data of terminal 300, to carry out integral monitoring to mobile phone.Optionally, processor
180 may include one or more processing cores；Preferably, processor 180 can integrate application processor and modem processor,
Wherein, the main processing operation system of application processor, user interface and application program etc., modem processor mainly handles nothing
Line communication.It is understood that above-mentioned modem processor can not also be integrated into processor 180.
Terminal 300 further includes the power supply 190 (such as battery) powered to all parts, it is preferred that power supply can pass through electricity
Management system and processor 180 are logically contiguous, to realize management charging, electric discharge and power consumption by power-supply management system
The functions such as management.Power supply 190 can also include one or more direct current or AC power source, recharging system, power supply event
Hinder the random components such as detection circuit, power adapter or inverter, power supply status indicator.
Although being not shown, terminal 300 can also include camera, bluetooth module etc., and details are not described herein.Specifically in this reality
It applies in example, the display unit of terminal is touch-screen display, and terminal further includes having memory and one or more than one
Program, perhaps more than one program is stored in memory and is configured to by one or more than one processing for one of them
Device executes.The one or more programs include executable instruction, and terminal 300 is configured as executing instruction, to execute
Method performed by terminal in above-mentioned data processing method embodiment.
In the exemplary embodiment, a kind of non-transitorycomputer readable storage medium including instruction, example are additionally provided
It such as include the memory of instruction, above-metioned instruction can be executed by the processor in terminal to complete data processing side in above-described embodiment
Method.For example, the non-transitorycomputer readable storage medium can be ROM, random access memory (RAM), CD-ROM, magnetic
Band, floppy disk and optical data storage devices etc..
Fig. 4 is a kind of block diagram of data processing equipment provided in an embodiment of the present invention.For example, device 400 can be provided
For a server.Referring to Fig. 4, it further comprises one or more processors, Yi Jiyou that device 400, which includes processing component 422,
Memory resource representated by memory 432, can be by the instruction of the execution of processing component 422, such as application program for storing.
The application program stored in memory 432 may include it is one or more each correspond to one group of instruction module.
In addition, processing component 422 is configured as executing instruction, to execute in above-mentioned data processing method embodiment performed by server
Method.
Device 400 can also include the power management that a power supply module 426 is configured as executive device 400, and one has
Line or radio network interface 450 are configured as device 400 being connected to network and input and output (I/O) interface 458.Dress
Setting 400 can operate based on the operating system for being stored in memory 432, such as Windows ServerTM, Mac OS XTM,
UnixTM,LinuxTM, FreeBSDTMOr it is similar.
In the exemplary embodiment, a kind of non-transitorycomputer readable storage medium including instruction, example are additionally provided
It such as include the memory of instruction, above-metioned instruction can be executed by the processor in server to complete the data in above-described embodiment
Reason method.For example, the non-transitorycomputer readable storage medium can be ROM, random access memory (RAM), CD-
ROM, tape, floppy disk and optical data storage devices etc..
Those of ordinary skill in the art will appreciate that realizing that all or part of the steps of above-described embodiment can pass through hardware
It completes, relevant hardware can also be instructed to complete by program, the program can store in a kind of computer-readable
In storage medium, storage medium mentioned above can be read-only memory, disk or CD etc..
The foregoing is merely presently preferred embodiments of the present invention, is not intended to limit the invention, it is all in spirit of the invention and
Within principle, any modification, equivalent replacement, improvement and so on be should all be included in the protection scope of the present invention.
Claims (10)
1. a kind of data processing method, which is characterized in that the described method includes:
The data processing request to coded data block is received, the data processing request carries in the coded data block at least
One aiming field mark；
According to the data structure definition file of at least one described aiming field mark and the coded data block, it is embedding to generate mark
Each branch of set tree, the nested tree of mark is used to indicate the nest relation of an aiming field and its ancestors' field；
According to the nested tree of the mark, the coded data block is decoded, obtains the solution of at least one aiming field
Code data, comprising: each branch of tree nested for the mark, the aiming field mark for being included according to the branch and
Ancestors' field identification of the aiming field mark, reads the field identification in the coded data block；Reading the mesh
When marking-up segment identification, the Data Position in the coded data block is identified based on the aiming field, to the coded data
Coded data corresponding with the Data Position is decoded in block, obtains the decoding data of the aiming field；
According to the data processing request, the decoding data of at least one aiming field is handled.
2. the method according to claim 1, wherein described at least one aiming field according to mark and institute
The data structure definition file of coded data block is stated, generating the nested tree of mark includes:
For each aiming field mark at least one described aiming field mark, in the data structure definition file
Determine the position of the aiming field mark；
According to the position, ancestors' field mark of the nested aiming field mark is obtained from the data structure definition file
Know；
According to each aiming field mark and its ancestors' field identification, the nested tree of the mark is generated.
3. the method according to claim 1, wherein the method also includes:
If the data processing request is used to indicate at least one described aiming field of reading, to the coded data block
During being decoded, by the solution yardage of the decoding data of each aiming field and ancestors' field of each aiming field
According to the first data tree is stored as, the node in first data tree is used to store the decoding data of field；
If the data processing request is used to indicate at least one described aiming field of modification, to the coded data block
During decoded, the coded data of field, the decoding data of each aiming field, each target word will not be decoded
The decoding data of ancestors' field of section is stored as the second data tree, and the node in second data tree is used to store the solution of field
Code data or coded data.
4. according to the method described in claim 3, it is characterized in that, described according to the data processing request, to it is described at least
The decoding data of one aiming field carries out processing
If the data processing request is used to indicate at least one described aiming field of modification, to institute in second data tree
The value for stating field in the decoding data of at least one aiming field is modified, and modified second data tree is obtained；
Modified second data tree is encoded, newly encoded data block is obtained；
The coded data block is replaced with into the newly encoded data block.
5. according to the method described in claim 4, it is characterized in that, described compile modified second data tree
Code, obtaining newly encoded data block includes:
Preorder traversal is carried out to modified second data tree；
For traversing each node extremely, if the node is used to store the coded data for not decoding field, by described in not
The data of field are decoded directly as the corresponding coded data of the node；
If the node is used to store the decoding data of ancestors' field, by the second decoding data of the node corresponding field
It is encoded, obtains the corresponding coded data of the node；
If the node is used to store the decoding data of aiming field, by the first decoding data of the node corresponding field
It is encoded, obtains the corresponding coded data of the node；
The corresponding coded data of each node is arranged according to the traversal order of each node, obtains the newly organized yardage
According to block.
6. a kind of data processing equipment, which is characterized in that described device includes:
Receiving module, for receiving the data processing request to coded data block, the data processing request carries the coding
At least one aiming field mark in data block；
Generation module, for the data structure definition text according at least one aiming field mark and the coded data block
Part, generates mark nesting tree, and each branch of the nested tree of mark is used to indicate an aiming field and its ancestors' field
Nest relation；
Decoder module, for being decoded to the coded data block according to the nested tree of the mark, obtain described at least one
The decoding data of aiming field is also used to each branch of tree nested for the mark, the mesh for being included according to the branch
Ancestors' field identification of marking-up segment identification and aiming field mark, reads the field identification in the coded data block；
When reading aiming field mark, the Data Position in the coded data block is identified based on the aiming field,
Coded data corresponding with the Data Position in the coded data block is decoded, the decoding of the aiming field is obtained
Data；
Processing module is used for according to the data processing request, at the decoding data of at least one aiming field
Reason.
7. device according to claim 6, which is characterized in that the generation module, for at least one described mesh
Each aiming field mark in marking-up segment identification determines the aiming field mark in the data structure definition file
Position；According to the position, ancestors' field of the nested aiming field mark is obtained from the data structure definition file
Mark；According to each aiming field mark and its ancestors' field identification, the nested tree of the mark is generated.
8. device according to claim 6, which is characterized in that described device further include:
Memory module, if at least one described aiming field of reading is used to indicate for the data processing request, right
During the coded data block is decoded, by the ancestral of the decoding data of each aiming field and each aiming field
The decoding data of first field is stored as the first data tree, and the node in first data tree is used to store the solution yardage of field
According to；If the data processing request is used to indicate at least one described aiming field of modification, to the coded data block
During decoded, the coded data of field, the decoding data of each aiming field, each target word will not be decoded
The decoding data of ancestors' field of section is stored as the second data tree, and the node in second data tree is used to store the solution of field
Code data or coded data.
9. device according to claim 8, which is characterized in that the processing module is used to use when the data processing request
Decoding when at least one described aiming field is modified in instruction, at least one aiming field described in second data tree
The value of field is modified in data, obtains modified second data tree；Modified second data tree is carried out
Coding, obtains newly encoded data block；The coded data block is replaced with into the newly encoded data block.
10. device according to claim 9, which is characterized in that the processing module is used for described modified second
Data tree carries out preorder traversal；For traversing each node extremely, if the node is for storing the coding for not decoding field
Data, then by the data for not decoding field directly as the corresponding coded data of the node；If the node is used for
The decoding data for storing ancestors' field, then encode the second decoding data of the node corresponding field, obtain the section
The corresponding coded data of point；If the node is used to store the decoding data of aiming field, by the node corresponding field
The first decoding data encoded, obtain the corresponding coded data of the node；According to the traversal order of each node
The corresponding coded data of each node is arranged, the newly encoded data block is obtained.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610935512.6A CN108011687B (en) | 2016-11-01 | 2016-11-01 | Data processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610935512.6A CN108011687B (en) | 2016-11-01 | 2016-11-01 | Data processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108011687A CN108011687A (en) | 2018-05-08 |
| CN108011687B true CN108011687B (en) | 2019-11-26 |
Family
ID=62048079
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610935512.6A Active CN108011687B (en) | 2016-11-01 | 2016-11-01 | Data processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108011687B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111967702A (en) * | 2019-05-20 | 2020-11-20 | 阿里巴巴集团控股有限公司 | Data processing method and system |
| CN110245191B (en) * | 2019-06-18 | 2021-07-02 | 政采云有限公司 | Data processing method and device |
| US11463112B1 (en) * | 2021-04-06 | 2022-10-04 | Micron Technology, Inc. | Dynamic bit flipping order for iterative error correction |
| CN115276889B (en) * | 2021-04-29 | 2024-09-24 | 腾讯科技（深圳）有限公司 | Decoding processing method, decoding processing device, computer equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101719915A (en) * | 2009-11-10 | 2010-06-02 | 北京中创信测科技股份有限公司 | Method and device for realizing field decoding |
| US8111702B1 (en) * | 2007-12-20 | 2012-02-07 | Cisco Technology, Inc. | Configuring route properties for use in transport tree building |
| CN102761543A (en) * | 2012-06-27 | 2012-10-31 | 北京中创信测科技股份有限公司 | Method and device for realizing SIP (session initiation protocol) universal encoding and decoding |
-
2016
- 2016-11-01 CN CN201610935512.6A patent/CN108011687B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8111702B1 (en) * | 2007-12-20 | 2012-02-07 | Cisco Technology, Inc. | Configuring route properties for use in transport tree building |
| CN101719915A (en) * | 2009-11-10 | 2010-06-02 | 北京中创信测科技股份有限公司 | Method and device for realizing field decoding |
| CN102761543A (en) * | 2012-06-27 | 2012-10-31 | 北京中创信测科技股份有限公司 | Method and device for realizing SIP (session initiation protocol) universal encoding and decoding |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108011687A (en) | 2018-05-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108011687B (en) | Data processing method and device | |
| CN104965721B (en) | The method and device that a kind of pair of application program is updated | |
| CN104618217B (en) | Share method, terminal, server and the system of resource | |
| CN104142868B (en) | Establish the method and device of connection | |
| CN103702297B (en) | Short message enhancement, apparatus and system | |
| CN106612250A (en) | Resource utilization authority judgment system and method | |
| CN107534685A (en) | A kind of method for processing business and device | |
| CN103763112B (en) | A kind of user identity protection method and apparatus | |
| CN105740145B (en) | The method and device of element in orient control | |
| CN103678502B (en) | Information collection method and device | |
| CN104699501B (en) | A kind of method and device for running application program | |
| CN103543988A (en) | Method for processing array information, method and device of controlling information to enter arrays | |
| CN103631625B (en) | A kind of method of data acquisition, user terminal, server and system | |
| CN104133832A (en) | Pirate application identification method and device | |
| CN109584341A (en) | The method and device drawn on drawing board | |
| CN103945241A (en) | Streaming data statistical method, system and related device | |
| CN103687063A (en) | Network connecting method, network connecting device and terminal equipment | |
| CN105047185B (en) | A kind of methods, devices and systems obtaining audio accompaniment | |
| CN107992498A (en) | A kind of method and system for importing data to data warehouse | |
| CN114416723B (en) | Data processing method, device, equipment and storage medium | |
| CN106708555B (en) | A kind of method and apparatus loading plug-in unit | |
| CN105302589B (en) | A kind of method and device obtaining unloading information | |
| CN104102560A (en) | Method and device for testing system performance | |
| CN115981798B (en) | File analysis method, device, computer equipment and readable storage medium | |
| CN106775745A (en) | The method and device of consolidation procedure code |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |