CN100421076C - Reference look-up table for abstract syntax account coding/decoding system - Google Patents
Reference look-up table for abstract syntax account coding/decoding system Download PDFInfo
- Publication number
- CN100421076C CN100421076C CNB200410006288XA CN200410006288A CN100421076C CN 100421076 C CN100421076 C CN 100421076C CN B200410006288X A CNB200410006288X A CN B200410006288XA CN 200410006288 A CN200410006288 A CN 200410006288A CN 100421076 C CN100421076 C CN 100421076C
- Authority
- CN
- China
- Prior art keywords
- data
- node
- mark
- asn
- reference table
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Communication Control (AREA)
Abstract
The present invention discloses a reference look-up method for an ASN. 1 encoding / decoding system. The present invention comprises the following steps that the input data is received; the received input data is tagged with self-defining marks; the method judges whether the received data has dominant reference data, recessive reference data or selective data or not; if true, the self-defining marks in the dominant reference data, the recessive or the selective data are adjusted; the method compares whether the adjusted self-defining marks conform to the self-defining marks of a reference form; if true, the method judges that the data is completely decoded. The method of the present invention enables the traditional flow path (1) to update the definition data, execute a program generator, newly compile, and apply new functions. The new converted flow path (1) updates the define data and applies the new function. The files can be encoded / decoded without changing the program. The traditional flow path of the format files are simplified and processed.
Description
Technical field
The present invention relates to the interpretation method of a kind of ASN.1 of being used for (abstract syntax record) volume/decoding system, data in the direct reference paper of this method energy, as the coding or the decoding of ASN.1 data, the renewal of any ASN.1 data structure only needs the data at file, does not need more dynamic program.
Background of invention
In recent years since computing machine popularize flourish with internet (Internet), add adding fuel to the flames of WWW (World Wide Web) technology, make the internet become modern maximum information transmitting network and marketing media, more driven comprehensive rise of ecommerce, ecommerce is to utilize computing machine and network technology to carry out the business transaction automated method, and it can be described as the extension of electronic data interchange EDI (Electronic Data Interchange) and value added network utilization.Electronic data interchange is meant between the different enterprises and comes and goes because of transaction produces data, and the data of these contacts in infosystem, manufacturing system or the operation system of meeting in the other side enterprise, cause the work of treatment of consecutive.A computer application system also can say so, the standard and the data layout of utilization agreement, through electronic transfer mode, data are transmitted guide to another computer application system, allow computing machine " understandings ", " processing " and " response " automatically, the raising of realization work efficiency, yield-power improves, job costs reduce, and yield improves, and makes the more competitive purpose of enterprise.
For a long time, the network management information form that many electronic data are changed utilizes ASN.1 (Abstract Syntax Notation one) abstract syntax to record and narrate and describe, and its objective is the computerese that uses unified grammatical representation structure in order to provide between different machines.ASN.1 proposes the standard set method, to narrate various types of data structures, make the representation of data that a kind of uniform way be arranged, the sets of data coding that has that matches with ASN.1 is called Basic Encoding Rules (BasicEncoding Rule, BER), its objective is the data structure that ASN.1 is narrated, coding is so that transmit on network in some way.ASN.1 is the standard method that is described in the transmission over networks information format.It has two parts: data, data type and Format Series Lines in a part of descriptor; Another part describes how each is partly formed message.
ASN.1 is a kind of data encoding format that extensively is used in encrypted message transmission, electronic certificate, communication information exchange or the like, because the internet is in vogue, the demand of security generally increases, and the data of ASN.1 coded format are used also so be day by day extensive.Yet, in order to use the ASN.1 Data transmission, must adjust program at the ASN.1 data layout, this is very inconvenient.In this case, the instrument XML of another structured data transmission rise of taking advantage of a situation.The problem that XML does not have data structure to adjust, volume/translator is made certainly easily.Yet, the while easily on the pursuit program, the inconvenience that has but produced other.XML compares with ASN.1 following shortcoming: the overabundance of data that transmit (1).The general quantity of information of estimating that identical data need be transmitted is more than five times of ASN.1.(2) scheme of encipherment protection is not formulated yet and is finished.The chance that XML is attacked by plaintext attack and the attack of alphabetical frequency spectrum or the like is very big, needs fine and closely woven planning to be protected.(3) need a large amount of time of cost to carry out data-switching.XML transmits with the coding method of common people's energy identification, and computing machine needs through the transcoding step before using and send its entrained data.If therefore can allow ASN.1 coding/decoding system use easily, increase alternative structural data transfer mode, then will greatly increase the facility on commerce or the Network Transmission.
Traditional method must be adjusted program at the ASN.1 data layout, with pretreater (Pre-Processor) or program generator modes such as (Program-Generator) data structure format is met the demands, and bothers time-consuming.Fig. 1 is the process flow diagram of classic method.As shown in Figure 1, must adjust program, utilize pretreater (Pre-Processor) or program generator modes such as (Program-Generator) that data layout is met the demands at the ASN.1 data layout.Its flow process following (1) is upgraded definition of data (2) executive routine generator (3) recompility (4) program and is used new function (Function).
In the data layout adjustment program of traditional ASN.1, the input data are not lteral data (TextFile), but (Digital) of string numberization, serial (Serial) Eight characters joint (Octet) data.
Also may comprise other digitized data in described these a string digitized data of epimere, therefore all data have formed a tree structure (Tree Structure), comprise other digitized data the more in these a string digitized data, the degree of depth of tree is darker, revert to original form in order to import data, must be with the whole expansion of tree structure (Tree Structure), the data that become string numberization are imported again.
Each node (Node) of tree structure (Tree Structure) all is the data of string numberization, the data layout adjustment program of ASN.1 is used preorder (Preorder), the program of middle preface (Inorder) or postorder (Postorder) algorithm is launched the serial data in the node (Node) respectively, and last a series of numerical data has formed the input data.The node (Node) of tree structure (Tree Structure) the more, the program code that traditional ASN.1 volume/decoding system will produce is also just the more, and is more complicated simultaneously.
For a lot of input data are reverted to original form, the data layout of tradition ASN.1 is adjusted program must be with reference to many different reference tables (Reference Table), find out the counterpart between a lot of input data and the reference table, then a lot of input data are reverted to the content in original form and the original form.
Because original form is not quite similar, traditional method must be done some corrections at ASN.1 data layout adjustment program, comprise and use pretreater (Pre-Processor) and program generator (Program-Generator), not only complexity but also speed are slower.
As mentioned above, because therefore the program of ASN.1 must must recompilate through adjusting.This classic method is then carried out new function (Function) at last again.
In view of the above-mentioned shortcoming of present ASN.1 (Abstract Syntax Notation One) coding/decoding system, the inventor tests and research through concentrated, and in line with the spirit of working with perseverance, has developed the present invention.
Summary of the invention
Fundamental purpose of the present invention is to change traditional mode that data structure format is satisfied the demands with program generator (Program-Generator), simplifies the conventional process flow to formatted file, makes ASN.1 volume/decoding system be easier to use.
For achieving the above object, the invention provides a kind of look-up method of quoting of the ASN.1 of being used for volume/decoding system, comprising: receive the input data; Mark is ordered in the input data filling that is received certainly; Judge and whether have dominance comparable data, recessive comparable data or selective data in the received data; If any, adjust have described dominance comparable data, recessive comparable data or a selective data order mark certainly; Compare and describedly mark whether to conform to the mark of ordering certainly of reference table through ordering certainly of adjusting; As conform to, judge that promptly these data decipher fully.
According to said method, should import the comparison of data and reference table, if contain " Explicit " character string in the reference table then judge that described input data contain dominance comparable data (Explicit).
According to said method, the mark (SpecifiedIndex) of ordering certainly of this dominance comparable data (Explicit) is merged with its data content, become and adjust the back data.
At the look-up method of quoting of the described ASN.1 of being used for volume/decoding system, wherein filling is the data directory of setting up the ASN.1 special use from the step of ordering mark indicating various data markers, various data structure classification, and the characteristic of various ASN.1.
The aforesaid ASN.1 of being used for volume/decoding system quote look-up method, wherein received data is the numerical serial data.Received data also comprises OPTIONAL/DEFAULT/ANY.
The aforesaid ASN.1 of being used for volume/decoding system quote look-up method, wherein said from ordering the form that mark is used for differentiating the pairing reference table of received data.
According to the look-up method of quoting of the described ASN.1 of being used for volume/decoding system, wherein this received data also comprises recessive comparable data (Implicit).Received data also comprises selective data (Optional).
According to the look-up method of quoting of the described ASN.1 of being used for volume/decoding system, if the content of wherein said property data (Optional) is without filling in, then with this data deletion.
According to the look-up method of quoting of the described ASN.1 of being used for volume/decoding system, compare these input data and a reference table, judge that then these input data contain recessive comparable data (Implicit) if contain " Implicit " character string in the reference table.
According to the look-up method of quoting of the above-described ASN.1 of being used for volume/decoding system,, know its data attribute and recover to become adjusted data wherein by comparison this recessiveness comparable data (Implicit) and reference table.
As mentioned above as can be known, traditional volume/decoding flow process is: (1) upgrades definition of data, (2) executive routine generator, and (3) are recompilated, and (4) use new function (Functions).And flow process of the present invention is: (1) is upgraded definition of data (2) and is used new Functions; And use the volume/decoding flow process of method of the present invention only to need: (1) is upgraded definition of data (2) and is used new Functions.Thereby use method of the present invention, more dynamic program can the processing format file.Save the executive routine generator and recompilate two steps, make the renewal of any ASN.1 data structure only need not need more dynamic program at the data of file.
Description of drawings
Fig. 1 is the process flow diagram that the ASN.1 data layout is adjusted of prior art;
Fig. 2 is the structural drawing of quoting look-up method that is used for ASN.1 coding/decoding system of one embodiment of the present of invention;
Fig. 3 be one embodiment of the present of invention tree structure figure is adjusted into linear data with as the input data synoptic diagram;
Fig. 4 is the explanation process flow diagram of an embodiment of step that is used for dominance comparable data and recessive data are adjusted into the adjustment data of one of original tally of the present invention; And
Fig. 5 is the process flow diagram of the adjustment selective data of one embodiment of the present of invention.
Detailed description of the invention
As shown in Figure 2, use the look-up method of quoting of the present invention, the coding and decoding flow process is: (1) is upgraded definition of data (2) program and is used new function (Function).Thereby the executive routine generator of classic method and the step of recompility have been simplified.
Method of the present invention is being identical with traditional method aspect the input data definition, and the input data are not the data (Text File) of literalization but a string Eight characters joint serial digital data.
Also may comprise other numerical data in the described serial digital data, therefore all data have formed a tree structure (Tree Structure), other numerical data that comprises in this a string numerical data is many more, the degree of depth of tree is dark more, revert to original form in order to import data, the whole expansion of tree structure (Tree Structure) must be become serial digital data and imports.
Each node (Node) of tree structure (Tree Structure) all is the data of string tree wordization.The data layout adjustment program of existing ASN.1 uses preorder (Preorder), middle preface (Inorder) or postorder (Postorder) algorithm routine in layer respectively the serial data in the node (Node) to be launched, and a series of numerical data that obtains has at last formed the input data.
The main difference point of method of the present invention and existing method is that the data layout method of adjustment of existing ASN.1 is that tree structure (Tree) node (Node) is in layer launched respectively, once launch and method of the present invention is a node (Node) with tree structure (Tree), a series of numerical data that obtains has at last formed the input data.
According to the definition of ASN.1, when the input data contain dominance with reference to (Explicit), indicate that dominance has formed a node (Node) with reference to the mark (Tag) of (Explicit).It is one from ordering mark (Specifled Index) that the present invention redefines this node (Node), pointer (Pointer) points to this from ordering mark (Specified Index), because real data has formed the child node of above-mentioned node, thereby thereby earlier these two nodes are merged into a node and obtain real data, then pointer (Pointer) is pointed to this adjusted node (Node), promptly this is from ordering mark (Specified Index).
According to the definition of ASN.1, when the input data include recessive reference (Implicit), indicate that recessive mark (Tag) with reference to (Implicit) has formed a node (Node).It is one from ordering mark (Specified Index) that the present invention redefines this node (Node), pointer (Pointer) points to this from ordering mark (Specified Index), but because the attribute of real data is lost, thereby the reference table (Reference Table) of contrast ASN.1 is found out data attribute to obtain real data earlier, then pointer (Pointer) is pointed to the node that this includes authentic data, i.e. mark (SpecifiedIndex).
According to the definition of ASN.1, when the input data include selective data (Optional), indicate that the mark (Tag) of selective data (Optional) and content (Content) have formed a node (Node).It is one from ordering mark (Specified Index) that the present invention redefines this node (Node), the reference table (Reference Table) of contrast ASN.1 checks whether data content is empty (Null), if data content is empty, then these data (being node (Node)) are deleted.
Method of the present invention has comprised a kind of loader (loader) of ASN.1 definition of data, be used for (1) and set up the data directory of ASN.1 special use to indicate various data markers (tag), these data markers comprise hidden indicium (IMPLICIT) and/or dominant marker (EXPLICIT) etc., indicate that the data structure classification comprises SET/SET OF/SEQUENCE/SEQUENCE OF/INSTANCE OF/CHOICE or the like, and the characteristic of indicating ASN.1, as OPTIONAL/DEFAULT/ANY or the like, and can (2) allow ASN.1 volume/translator read at any time, to such an extent as to when revising, (3) need not change ASN.1 volume/translator.
Shown in Fig. 3 (a), head end (being root node Root) contains three child node A, B and C.A node (Node) contains child node A1 again, and C node (Node) contains four child node C1, C2, C3, C4, this tree structure (Tree Structure) is unique, visits the node of tree structure one by one, is converted into a linear data, shown in Fig. 3 (b), its output is A in proper order, A1, B, C, C1, C2, C3, C4, wherein 1,11,2,3,31,32,33,34 level and the positions of expression data in tree structure (Tree Structure).
Shown in Fig. 4 (a), head end (being root node Root) contains three child node A, B and C.Wherein A node (Node) is represented a dominance reference marker (Explicit), and C node (Node) is represented a recessive reference marker (Implicit), and A node (Node) contains a child node A1 again.It is one from ordering mark (Specified Index) that the present invention redefines A node (Node), pointer (Pointer) points to this from ordering mark (Specified Index), because real data has formed the child node A1 of above-mentioned node, thereby earlier these two nodes are merged into a node A3 to obtain real data, then pointer (Pointer) is pointed to this adjusted node A3 (Node).The present invention redefines C node (Node) for another and orders mark (Specified Index) certainly, pointer (Pointer) points to this from ordering mark (Specified Index), because the attribute of real data is lost, therefore the reference table (Reference Table) of contrast ASN.1 is found out data attribute to obtain real data earlier, then pointer (Pointer) is pointed to this node that includes authentic data (Node) C.This tree structure (TreeStructure) is unique, adjusts the node of this tree structure, is converted into the source code mark.Fig. 4 (b) is adjusted tree structure.
Shown in Fig. 5 (a), head end (being root node Root) contains four child node A, B, and C and D, wherein D node (Node) is represented a selective data (optional).When the input data include selective data (optional) D, mark (Tag) and the content (content) of indicating selective data (optional) have formed a node (Node) D, it is one from ordering mark (Specified Index) that the present invention redefines this node (Node), the reference table (Reference Table) of contrast ASN.1 checks whether data D content is empty (Null), if data D content is that sky is then deleted these data (being node (Node)).Show tree structure (Tree Structure) after the adjustment (promptly deleting D) as Fig. 5 b.
According to above accompanying drawing with to detailed description of the invention, those skilled in the art can improve, add and replace the present invention, but this is all within claim of the present invention.
Claims (10)
1. one kind is used for the look-up method of quoting that abstract syntax is recorded and narrated volume/decoding system, comprising:
(a) receive the input data;
(b) mark is ordered in the input data filling that is received certainly;
(c) judge whether have dominance comparable data, recessive comparable data or selective data in the received data;
(d) if any, adjust have described dominance comparable data, recessive comparable data or a selective data order mark certainly;
(e) comparison is described marks whether to conform to the mark of ordering certainly of reference table through ordering certainly of adjustment;
(f) as conforming to, promptly decision data is deciphered fully.
2. method according to claim 1, it is characterized in that, in described step (c), described input data and reference table are compared, if contain " Explicit " character string in the described reference table, judge that then the input data contain the dominance comparable data.
3. method according to claim 1 is characterized in that, in described step (d), the mark of ordering certainly of the described dominance comparable data of described adjustment is meant described from ordering the merging of mark and its data content.
4. method according to claim 1, it is characterized in that, in described step (c), described input data and reference table are compared, if contain " Implicit " character string in the described reference table, then judge in the described input data and contain recessive comparable data.
5. method according to claim 1 is characterized in that, in described step (d), by described recessive comparable data is compared with reference table, obtains data attribute, and recovers to become adjusted data.
6. method according to claim 1 is characterized in that, in described step (d), if the content of selective data is without filling in, then with this data deletion.
7. method according to claim 1 is characterized in that, described filling is labeled as the characteristic of data directory to indicate that various data markers, various data structure classification and various abstract syntax are recorded and narrated of setting up the ASN.1 special use from ordering.
8. method according to claim 1 is characterized in that the described data that receive are serial digital data.
9. method according to claim 1 is characterized in that described received data also comprises OPTIONAL/DEFAULT/ANY.
10. method according to claim 1 is characterized in that, and is described from ordering the form that mark is used for differentiating the pairing reference table of received data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200410006288XA CN100421076C (en) | 2004-03-23 | 2004-03-23 | Reference look-up table for abstract syntax account coding/decoding system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200410006288XA CN100421076C (en) | 2004-03-23 | 2004-03-23 | Reference look-up table for abstract syntax account coding/decoding system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1673964A CN1673964A (en) | 2005-09-28 |
| CN100421076C true CN100421076C (en) | 2008-09-24 |
Family
ID=35046526
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB200410006288XA Expired - Fee Related CN100421076C (en) | 2004-03-23 | 2004-03-23 | Reference look-up table for abstract syntax account coding/decoding system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100421076C (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0327058A2 (en) * | 1988-02-02 | 1989-08-09 | Nec Corporation | Protocol data unit encoding/decoding system |
| EP0513799A1 (en) * | 1991-05-15 | 1992-11-19 | Nec Corporation | System for supporting a conversion between abstract syntax and transfer syntax |
| JPH04336731A (en) * | 1991-05-14 | 1992-11-24 | Nec Corp | Protocol data generation analyzer |
| EP0567137A1 (en) * | 1992-04-23 | 1993-10-27 | Nec Corporation | Protocol data unit encoding/decoding device |
-
2004
- 2004-03-23 CN CNB200410006288XA patent/CN100421076C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0327058A2 (en) * | 1988-02-02 | 1989-08-09 | Nec Corporation | Protocol data unit encoding/decoding system |
| JPH04336731A (en) * | 1991-05-14 | 1992-11-24 | Nec Corp | Protocol data generation analyzer |
| EP0513799A1 (en) * | 1991-05-15 | 1992-11-19 | Nec Corporation | System for supporting a conversion between abstract syntax and transfer syntax |
| EP0567137A1 (en) * | 1992-04-23 | 1993-10-27 | Nec Corporation | Protocol data unit encoding/decoding device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1673964A (en) | 2005-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108052681B (en) | Method and system for synchronizing structured data between relational databases | |
| US7831540B2 (en) | Efficient update of binary XML content in a database system | |
| CN1979485A (en) | Method and system for efficiently handling navigational state in a portal | |
| CN102693317B (en) | Method and device for data mining process generating | |
| CN1979478B (en) | File processing system and file processing method | |
| CN112270550A (en) | New energy electric power source tracing method and system based on block chain | |
| CN104199900A (en) | Audit and analysis method based on file trajectory tracking trees | |
| CN103092821A (en) | Electronic contract correction recording implementing method | |
| CN102799690A (en) | Method for verifying page input by using database technology | |
| CN101710336A (en) | Method for accelerating data processing by using relational middleware | |
| CN109213820A (en) | Method for realizing fusion use of multiple types of databases | |
| CN1979511A (en) | File data safety management system and method | |
| CN109902125A (en) | A kind of distributed storage method based on existing database | |
| CN100392654C (en) | Publication-oriented intelligent template model establishing method | |
| CN109618250A (en) | A kind of fiber optic network node administration method and system | |
| CN109274742A (en) | A kind of internet of things data acquisition and supervisor control | |
| CN103123638A (en) | Data searching method and data searching device | |
| CN108366050A (en) | A kind of common communication protocol processing method | |
| CN101930458B (en) | Short message matching method based on characteristic value | |
| CN111427869A (en) | Log system based on block chain | |
| CN113157723B (en) | SQL access method for Hyperridge Fabric | |
| CN110852764A (en) | Anti-counterfeiting traceable product identification device and method based on block chain technology | |
| CN100421076C (en) | Reference look-up table for abstract syntax account coding/decoding system | |
| CN111680316A (en) | Information security sharing method for multiple business bodies in power industry | |
| CN107147630A (en) | It is a kind of to realize the method and device that OMCI protocol stack codes are automatically generated |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080924 Termination date: 20140323 |