CN1492322A - xmL data compressing and decompressing method - Google Patents
xmL data compressing and decompressing method Download PDFInfo
- Publication number
- CN1492322A CN1492322A CNA031402534A CN03140253A CN1492322A CN 1492322 A CN1492322 A CN 1492322A CN A031402534 A CNA031402534 A CN A031402534A CN 03140253 A CN03140253 A CN 03140253A CN 1492322 A CN1492322 A CN 1492322A
- Authority
- CN
- China
- Prior art keywords
- data
- code
- node
- xml
- record
- 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.)
- Pending
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Document Processing Apparatus (AREA)
Abstract
The xml data compressing and decompressing method features that during data compression, the 'data structure feature' in data code in xml format is induced into structure code in xml format. By means of the structure code, the computer system can perform universal compression code creating program to create compression program dynamically. The computer system performs the data compression program to convert the xml data into data code in plain format. During data decompressing, the computer system perform decompressing program to analyze data code and restore source data information by referring to the description of structure code to data feature. Applying the said technology can keep complete data information while reducing data storage and transmission amount.
Description
Technical field:
The present invention relates to a kind of xml data compression and decompressing method.
Background technology:
Extending mark language (Extensible Markup Lange) xml is a kind of semantic marker rule that World Wide WebConsortium (W3C) announces, since in Dec, 1997 issue, xml has obtained immense success; It is used according to many modes widely, and some of them are used and begun to carry out, and other application have had quite surprising achievement, can predict that the effect meeting of xml is more and more important.
Since the xml right and wrong proprietary and be easy to read and write, just make it become the desirable form of swap data between different application.The xml data format file can be divided into two parts, carrier and load.Carrier can be divided into two parts again: attributive character and architectural feature.Attributive character plays the function of description, definition of data form and data attribute in the xml data file, as the data type, and the version of length and demonstration or print format etc., architectural feature data of description in the xml data file and the relation between the data.Remainder then is valid data: load.
The xml language is exactly the major part that carrier part has often occupied whole data file as significant disadvantages of format specification existence of a kind of data carrier, and carrier part is greater than the part of load (data) usually.For example:
Can be as follows with xml to the description of the proportion of " iron ":
Script?1：
<OBJECT?name＝”iron”>
<specific_gravity
type＝”number”1ength＝”4”unit＝”g/cube?cm”>7.86<specific_gravity/>
＜/OBJECT〉(119 characters)
Can resolve to: the proportion of object " iron " is 7.86, and measurement unit is " a gram/cubic centimetre ", and valid data length is 4, and data type is a numeral.
Wherein, valid data are iron, 7.86 (8 characters do not comprise separator).Remainder (111 characters) all is according to description or the definition to corresponding data of format specification requirement and application need, carrier makes this data computing machine program of processing or reader be appreciated that the implication of data, thereby realize and simplify the function of computing machine automatic data processing, but or the read function of realization xml data.Therefore, if ignore the part of data carrier, the implication of data itself will disappear and make data become nonsensical, can not resolve in other words.
Yet, if according to above form, the proportion of 100 kinds of different materials is described, data carrier partly will repeat (being 11100 characters) in a large number.The most of storage space and the transmission space of data file have been occupied.The target of xml data compression algorithm is exactly the size of wishing the packed data carrier.
To above-mentioned data layout, we can use the special xml file of xml, and it is unduplicated content that " outline " (xml Schema) concludes its carrier part:
Script?2：
<Element?name＝”OBJECT”>
<Attribute?name＝”name”type＝”string”/>
<Element?name＝”specific_gravity”>
<Attribute?name＝”type”type＝”string”/>
<Attribute?name＝”length”type＝”number”length＝”4”/>
<Attribute?name＝”unit”type＝”string”/>
</Element>
</Element>
According to the conclusion of Script 2, Script l can be rewritten as:
Script?3
<OBJECT?name＝”iron”>
<specific_gravity>7.86<specific_gravity/>
</OBJECT>
In Script 3, removed the property content of specific_gravity, that is:, made the size of file reduce in the carrier description of data attribute having been concluded in the outline file.Utilize existing xml technology, can from outline Script 2, retrieve the attribute of specific_gravity, thereby keep information integrity.
But, compare with the size (8 characters) of load, the size of Script 3 is still very big, though this is because comprised the data structure rule of Script 1 at Script 2, but in the xml data file, still must remove to realize the concrete form of data structure by the grammer that uses xml.That is to say syntax rule and Schema technology, can't reduce the size of the structure of carrier in the xml data file effectively with xml.
Summary of the invention:
Purpose of the present invention is exactly in order to overcome the above problems, and a kind of xml data compression and decompressing method are provided, and reduces the size of the structure of carrier in the xml data file effectively.
For achieving the above object, the present invention proposes a kind of xml data compression and decompressing method, comprise compression process and decompression process, it is characterized in that: compression process comprises the steps: 1) computer system concludes the structural code become the xml form to " data structure feature " in the data code of xml form; 2) computer system service data condensing routine is converted to the xml data data code of putting down civilian form; In the decompression process, computer system operation gunzip, the resolution data code, and the reference structure code recovers the information of source data to the description of data feature.
Owing to adopted above scheme, the xml data are converted to the data code of putting down civilian form, the useful load ratio of this data layout has increased many, and data obtain compression.As long as every data in the flat civilian formatted data after the compression and structural code connect the description of data feature, we just can revert to original xml data layout to them.If comprised lot of data in the source document, apparent, become file conversion the form of structural code+flat civilian formatted data to store and transmit, widely the storage space of packed data and transmission space.
Description of drawings:
Fig. 1 is an embodiment of the invention structural code product process synoptic diagram.
Fig. 2 is an embodiment of the invention compressed code product process synoptic diagram.
Fig. 3 is an embodiment of the invention data compression schematic flow sheet.
Fig. 4 is an embodiment of the invention data decompression schematic flow sheet.
Fig. 5 embodiment of the invention extended function schematic flow sheet.
Embodiment:
Also the present invention is described in further detail in conjunction with the accompanying drawings below by specific embodiment.
Still being described as example to what the proportion of iron was in the preamble, if load (data) part is converted to flat civilian form with agreement separator partition data:
Script?4
OBJECT，water+1
OBJECT，iron+7.86
OBJECT，lead+11.34
...
OBJECT，copper+8.96
The useful load ratio of this data layout has increased many, and data obtain compression.
If with connecting someway, we just can obtain the features relevant of every data in the Script 4 the respective nodes among every data among the Script 4 and the outline file Script 2, and they are reverted to original xml data layout.If Script 1 has comprised lot of data, apparent, the form that it is converted to Script 2+Script 4 is stored and is transmitted, widely the storage space of packed data and transmission space.
The present invention just provides a kind of like this method.This method is concluded the structural code that becomes the xml form to " data structure feature " in the data code of xml form when data compression.Utilize structural code, computer system can be moved general compressed code generator program, dynamically generates condensing routine.Computer system service data condensing routine is converted to the xml data data code of putting down civilian form.During data decompression, computer system operation gunzip, the resolution data code, and the reference structure code recovers the information of source data to the description of data feature.By using this technology reduces data storage and transmission when preserving data integrity information size.Wherein, the generation of condensing routine also can be adopted other modes, generates general condensing routine as passing through programming, thereby exempts the dynamically step of generation compressed code.But adopting general compressed code generator program (xslt) to generate compressed code makes compression process only can once finish the compression duty of xml data on the browser (as Internet Explorer 5.5, Netscape 6.1 and Mozilla etc.) of a support xslt.The process of " compressed code generator program " generation " compressed code " can also be optimized at specific data structure, improves the execution efficient of compressed code, thereby improves the efficient of the data compression of data structure of the same type in enormous quantities.In addition, when the data transmit-receive both sides arranged to use the compressed code generator program, compressed code was what not need to transmit with permanent storage.
Following substep describes in detail:
One, xml data file compression method
1, set up structural code:
Described structural code is one section xml code, concluded, described the architectural feature of the data file of xml form, has write down the mapping relations of every data and architectural feature in the data code simultaneously.
A) set up the structural code example:, the architectural feature of xml data file is reduced structural code by the processing of computing machine journey system.Structural code is one section code with xml marking convention and syntax rule data of description structure.In order to next section xml data instance:
Script?5
<Customer?CompanyName＝”ABC?Company”City＝”Bejing”Address＝”XYZ?Street”>
<Order?OrderNumber＝”123456”Date＝”2003-01-03”>
<Item?ItemNumber＝”X123”name＝......>
<Quantity>1000<Quantity>
<Item......>
</Order>
<Order......>
......
</Order>
</Customer>
Setting up the basic skills of structural code can be with reference to the accompanying drawings 1.
B) structural code uses a node element to describe the node element that has the same structure type in the xml data file, and this node can be called " record node " (Record Node), and all record nodes use identical xml mark title, for example
<RECORD?name＝”Customer”>
......
</RECORD>
Represent that this node describes in the xml data file by name " Customer " the structure type of node element, RECORD then is the xml mark title of the record node of agreement.
C) at the record intranodal, the use node element is described each attribute node in the xml data file, can be called " field node " (Column Node).The field node uses identical xml mark title, for example:
<RECORD?name＝”Customer”>
<COLUMN?name＝”CompanyName”/>
<COLUMN?name＝”City”/>
......
</RECORD>
Middle COLUMN is the xml mark title of field node, and the value of its attribute name is represented the title of field.
D) if the node element in the xml data file includes the daughter element node, use above-mentioned a), b) each subrecord node of the method recursive definition of two steps, for example:
＜RECORD name＝”Customer”＞ ＜COLUMN name＝”CompanyName”/＞ ＜COLUMN name＝”City”/＞ ...... ＜RECORD name＝”Order”＞ ＜COLUMN name＝”OrderNumber”/＞ ...... ＜RECORD name＝”Item”＞ ＜COLUMN name＝”ItemNumber”/＞ ＜COLUMN name＝”name”/＞ ...... ＜RECORD name＝”Quantity”＞ ＜COLUMN name＝”Value”/＞ ＜/RECORD＞ ＜/RECORD＞ ...... <!-- SIPO <DP n="6"> --> <dp n="d6"/> ＜/RECORD＞ ...... ＜/RECORD＞
E) for the back end that value is arranged such as above-mentioned＜Quantity〉1000＜/Quantity〉can arrange the default character name section, for example:
<RECORD?name＝”Quantity”>
<COLUMN?name＝”Value”/>
</RECORD>
F) different record node may contain the subrecord node of same type, re-defines the mode that practical structural code answers type of service definition and type to quote in different father nodes for fear of these subrecord nodes.For example, the result of Script 5 outputs should be as follows:
Script 5.1＜!--quoting the Customer type definition--＞＜record type=" Customer "/＞＜!--type definition of Customer--＞＜RECORD name=" Customer "＞＜COLUMN name=" CompanyName "/＞＜COLUMN name=" City "/＞...＜!--quoting the Order type definition--＞＜record type=" Order "/＞＜/RECORD＞＜!--type definition of Order--＞＜RECORD name=" Order "＞＜COLUMN name=" OrderNumber "/＞...＜!--quoting the Item type definition--＞＜record type=" Item "/＞＜!--SIPO＜DP n=" 7 "〉--〉＜dp n=" d7 "/＜/RECORD＞＜!--type definition of Item--＞＜RECORD name=" Item "＞＜COLUMN name=" ItemNumber "/＞＜COLUMN name=" name "/＞...＜!--quoting the Quantity type definition--＞＜record type=" Quantity "＞＜/RECORD＞＜!--type definition of Quantity--＞＜RECORD name=" Quantity "＞＜COLUMN name=" Value "/＞＜/RECORD＞
Therefore, the record node can be divided into again: two kinds of record type definition node and record type reference nodes.The xml token name of type reference node is called " record ".
G) if, can under the prerequisite of not destroying the structural code function, in structural code, add some auxiliary codes in order to optimize condensing routine or gunzip.
H) under the prerequisite of the function of not destroying structural code, can embed in certain Schema outline code that is suitable for by the bar structure code.
I) can comprise in the structural code that data code is preserved or the coded system during transmission, whether further use binary compression (as the zip method etc.) that the data code is compressed with the unlabeled data code.
2. compressed code generates:
Described data compression code (program) is one section program code, when carrying out in computer system, according to the description generation data code of structural code.
2-1) by computer system operation " compressed code generator program ", the structural code that process 1 produces is handled, produce " compressed code ".
2-2) " compressed code generator program " is the program that the bar structure code converts compressed code to, and be irrelevant with the content and structure feature of xml data, and a factor changes according to the variation of the syntax rule of the grammer of code or structural code.Therefore under specific grammer scheme, the compressed code generator program is constant.With reference to the accompanying drawings 2.
A) at each the record node type in the structural code, produce a cover as the described disposal route of following steps b-f, it is different according to the flag of different recording and structure, the generation form is identical but program code that content is different, and content described herein is meant flag title, field quantity, subrecord quantity and arrangement etc.;
B), produce the program code of one section output record flag if the subrecord node is arranged under the node
C), produce the program code of one section output default records flag if there is not the subrecord node under the node
D) to each attribute node under the record node, produce the program code that one section output field data adds separator
E) to each the subrecord node under the record node, use a)-d) process, recurrence produces subrecord node procedure code.
F) quote at each the record node in the structural code, the disposal route of the type is called in statement.
2-3) function of " compressed code " is program code or symbol code such as the xslt code that the xml data file is transformed to flat civilian form.
3, compression:
3-1) computing machine journey system carries out the compressed code instruction, and the data in the xml data file convert data code to.
3-2) in the compressed code implementation, use that different record mark symbols---" flag " indicates the record of different structure, the usage flag symbol is separated data field, and with the end of sign flag record.Utilize the corresponding relation of the property value of node in the flag of data code and the structural code to set up the mapping relations of node element in the record of data code and the structural code.Simultaneously according to the respective field of structural code to the description array data code of order of the field.Thereby set up the mapping relations of each data and structural code in the data code.Can be with reference to the accompanying drawings 3.
For example can change into after data code Script 5 compressions:
Script?6
Customer+ABC?Company，Bejing，XYZ?Street’
Order+123456，2003-01-03’
Item+X123，......+1000’
Item+......+...’
Annotate: the newline among the Script 6 is optional, only is in the present example to read for convenience.
Illustrate:
A) each row corresponds to a record in Script 6.
B) each bar record first " speech " is the flag of record (Word) in Script 6, can find the record node with the flag value name in aforesaid structural code.
C) each bar record is separated field value (data) with ", ".
D) each bar is recorded in the series arrangement of flag data afterwards by record intranodal field node in the structural code.
E) each bar record is used " ' " sign-off.
F) in the source data＜Quantity 1000＜Quantity node, it is the child node of Item, and self does not comprise child node, if use default subrecord flag "+" can realize exactly that still (as: Item has only a subrecord Quantity to mapping relations, and Quantity does not have subrecord), then can use default subrecord flag.
G) because structural code also is a kind of xml data file, therefore also can use said method to compress, different is, because under specific grammer scheme, " structural code " of different xml data all has identical version.Therefore use technology of the present invention to compress or no longer need to come when decompressing the architectural feature of description scheme code to structural code, can directly write out general structural code compression and decompression program with another structural code.
Use the record mark of data file can in structural code, inquire architectural feature in this data file that is recorded in the xml form and the architectural feature in data file.
3-3) as a kind of embodiment, the structural code of described xml form makes that the compressed code generation script that can use the xslt form is logical, by the processing of xslt processor, dynamically generate xslt compression script, and then can use xslt compression script compression xml data code.Described xslt processor is a kind of software that can become the xml file by xslt grammer instruction transformation another kind of text.Described xslt is XSL Transformations, is issued by W3C.
4, modify
4-1) data file of an xml form can be described the attributive character of its every data with Schema, and Schema also is a kind of data file of xml form.Therefore can use this method compression Schema file, add to then in the destination file between the structural code and data code.
4-2) structural code also can be used the physical storage locations of the Schema of URL grammatical markers xml data file.
The application of said method in decompression process can be with reference to the accompanying drawings 5.
Structural code after the compression can be formed a complete results file with the form and the data code of file header.If structural code is divided into different file storage or transmission with data code, data code must be at the signature (as filename or URL) of the anterior indicating arrangement code of file.
Two, data file decompression method
The data decompression program is one section program code, and when carrying out in computer system, the deal with data code recovers the feature of source data according to the description of structural code.
Can be with reference to the accompanying drawings 4.
1. data decompression is divided into: " mark scannng program " (Scanner) and " pointer driver " (Driver) two major parts can be with various programming languages realizations.
2. " mark scannng program ", " pointer driver " part all is public, is applicable to the decompress(ion) of all data layouts.
3. " pointer driver " at first reads in structural code during decompressed data, if in the structural code mark data code used certain binary compression, then cue mark scanning pass program need at first use corresponding method that the data code is decoded.
4. " pointer driver " finds out the label symbol (flag) of article one record in structural code, drives " mark scannng program " beginning scan-data code then.
" mark scannng program " from the compression data file reference position begin with the unit of being labeled as one by one mark (Token) carry out the scanning of data file." mark " is all separators, flag and the valid data in the data file." mark scannng program " stops at scan pointer on the mark after scanning " data " mark, and triggering and wait " pointer driver " are tested to current mark, and " pointer driver " moves to next mark after sending instruction.
6. " pointer driver " is according to the description of structural code, judge the feature of current mark, if the feature of mark is consistent with the description of structural code, the expression data are correct, are original xml data layout thereby can utilize structural code to the current data value of the description reconstruct of current data feature.
If in the structural code mark position of Schema, can read in the information of Schema in advance and use said method to decompress.
It is mutual that for example " mark scannng program " and " pointer driver " uses following five main method, finishes the resolving of decompression
Whether 1.hasMoreRecord whether () inquiry also has record after " mark scannng program " current pointer position, it is correct to be used for the judgment data structure.If the pointer driver, concludes also have uncompleted record according to the description of structural code, and the mark scannng program is no record, represent that then data may lose.If opposite, according to the description of structural code, conclude that writing scan should finish, and still have record in the data code, represent that then data and outline format do not match.
(2.isRecord String tag), whether correctly and whether inquiry " mark scannng program " current pointer position is a record-header with the name of tag value (rs chacter is closelyed follow the numerical value of tag), be used for the whether loop start of data structure of judgment data structure.If, can drive " mark scannng program " pen travel is arrived next mark position, export the end mark of a record node, and export a record node starting mark.
Whether 3.hasMoreData whether () inquiry " mark scannng program " current pointer position also has field data, it is correct to be used for the judgment data structure.If this method is returned " no ", should export the end mark of current record node.
4.getNextData () reads the current data of " mark scannng program ", if hasMoreData () returns " yes ", use this method to read flag data, drive pointer,, export an attribute node simultaneously according to the description of outline to present node to the next position.
Whether 5.hasMoreSubRecord whether () inquiry also has subrecord after " mark scannng program " current pointer position, it is correct to be used for the judgment data structure.If rreturn value is " yes ", and be complementary, with regard to starting mark that writes down node of information output of utilization structure code with structural code.
Move down i mark position 6.skip (inti) drive " mark scannng program " current pointer, be used to have a mind to ignore some data, for example skip the data of the flag node that need not read.
The invention has the beneficial effects as follows
Compress the electronic data of xml form effectively, thereby improve the transmission and the storage efficiency of xml form electronic data effectively.Reduce the transmission of xml form electronic data and the cost of storage.
Can directly apply to traditional EDI field, make the EDI data user can use xml technical finesse data, thereby reduce the technical difficulty that EDI uses, reduce enforcement and operation cost that EDI uses.
Can be applicable to the embedded application software system,, improve data transmission efficiency as the electronic data transmission system of mobile phone.
Because being exactly the data transmit-receive both sides, the key concept of " network service " uses the outline format transmitting-receiving xml message of making an appointment, the present invention can be applicable to based on the e-commerce system of " network service (Web service) " framework and other e-commerce system, improves data transmission and storage efficiency.
Owing to use the data of this method compression can remain text mode, therefore can handle by various text transfer protocol transmission and existing public technology easily.For example, can or directly transmit the form of data embedded web page the data file of compression with webpage.
Just the present invention will be described for convenience for above embodiment, should not be construed as limitation of the present invention.The flexible embodiment that exists based on basic design of the present invention belongs to scope of the present invention too.For example:
1. the data code of compressed xml form can be the xml code of xml code snippet or " form is complete ".
2. the structural code of mentioning in the compression process can be the xml code of xml code snippet (for example being embedded in the xml segment in the outline Schema file) or " form is complete ".
3. described structural code also is a kind of data code of xml form, therefore, can use the technique compresses structural code among the present invention.
4. described data code is meant: serviceable indicia is distinguished record and is separated the code of the text formatting of field with mark.Data code must not be the compression result that comes from the data code of xml form.
5. the computer system of indication is meant the system that device with information processing capability and relevant software systems are formed.
6. the data file of an xml form can be described the attributive character of its every data with Schema, and Schema also is a kind of data file of xml form.Therefore can use said method compression Schema file, add to then in the destination file or in addition and preserve, transmit.
7, the xml form of structural code and the feature of utilizing universal compressed code generator to generate condensing routine make compression process only can once finish the compression duty of xml data on a browser (as Internet Explorer 5.5, Netscape 6.1 and Mozilla etc.) of supporting xslt among the present invention.
8. data code can use other binary compression further to compress, and at this moment employed binary compression should give mark in structural code.
Described when 9, decompressing " recovering the information of source data " also can be included in the data decompression compression process, uses the outline file decompressed data is carried out the attribute modification.
Claims (10)
1, a kind of xml data compression and decompressing method comprise compression process and decompression process, it is characterized in that:
Compression process comprises the steps:
1) computer system is concluded the structural code that becomes the xml form to " data structure feature " in the data code of xml form;
2) computer system service data condensing routine, reference structure code are converted to the xml data data code of flat civilian form to the description of data feature;
In the decompression process, computer system operation gunzip, the resolution data code, and the reference structure code recovers the information of source data to the description of data feature.
2, xml data compression as claimed in claim 1 and decompressing method is characterized in that: structural code described in the step 1) is one section code with xml marking convention and syntax rule data of description structure; It uses a node element to describe the node element that has the same structure type in the xml data file, and this node is called " record node "; At the record intranodal, the use node element is described each attribute node in the xml data file, is called " field node "; If the node element in the xml data file includes the daughter element node, use each subrecord node of said method recursive definition.
3, xml data compression as claimed in claim 2 and decompressing method is characterized in that: the record node can be divided into again: record type definition node and record type reference node.
4, xml data compression as claimed in claim 1 or 2 and decompressing method is characterized in that: described data compression program can utilize " compressed code generator program " to generate, and described " compressed code generator program " comprises following treatment step:
A) at each the record node type in the structural code, produce a cover as the described disposal route of following steps b-f, it is different according to the flag of different recording and structure, the generation form is identical but program code that content is different, and content described herein comprises flag title, field quantity, subrecord quantity and arrangement;
B), produce the program code of one section output record flag if the subrecord node is arranged under the node;
C), produce the program code of one section output default records flag if there is not the subrecord node under the node;
D) to each attribute node under the record node, produce the program code that one section output field data adds separator;
E) to each the subrecord node under the record node, use a)-d) process, recurrence produces subrecord node procedure code;
F) quote at each the record node in the structural code, the disposal route of the type is called in statement.
5, xml data compression as claimed in claim 1 or 2 and decompressing method is characterized in that: the function of described " compressed code " is program code or the symbol code that the xml data file is transformed to flat civilian form; In the compressed code implementation, use that different record mark symbols---flag indicates the record of different structure, the usage flag symbol is separated data field, and with the end of sign flag record; Utilize the corresponding relation of the property value of node in the flag of data code and the structural code to set up the mapping relations of node element in the record of data code and the structural code; Simultaneously according to the respective field of structural code to the description array data code of order of the field; Thereby set up the mapping relations of each data and structural code in the data code.
6, xml data compression as claimed in claim 1 or 2 and decompressing method is characterized in that described gunzip comprises " mark scannng program " and " pointer driver "; " pointer driver " at first reads in structural code during decompressed data, and " pointer driver " finds out the label symbol of article one record in structural code, drives " mark scannng program " beginning scan-data code then; " mark scannng program " from the compression data file reference position begin with the unit of being labeled as one by one mark carry out the scanning of data file; " mark " is all separators, flag and the valid data in the data file; The valid data mark is called " data markers ", after " mark scannng program " scans one " data markers ", scan pointer is stopped on the mark, triggering and wait " pointer driver " are tested to current mark, and " pointer driver " moves to next mark after sending instruction; " pointer driver " is according to the description of structural code, judge the feature of current mark, if the feature of mark is consistent with the description of structural code, the expression data are correct, are original xml data layout thereby can utilize structural code to the current data value of the description reconstruct of current data feature.
7, xml data compression as claimed in claim 6 and decompressing method, it is characterized in that: if in the structural code mark data code used certain binary compression, then the cue mark scanning sequence need at first use corresponding method that the data code is decoded.
8, xml data compression as claimed in claim 1 or 2 and decompressing method, it is characterized in that: the structural code of described xml form makes that the compressed code generation script that can use the xslt form is logical, processing by xslt processor, dynamically generate xslt compression script, and then can use xslt compression script compression xml data code.
9, xml data compression as claimed in claim 8 and decompressing method is characterized in that: described xslt processor is a kind of software that can become the xml file by xslt grammer instruction transformation another kind of text.
10, xml data compression as claimed in claim 1 or 2 and decompressing method is characterized in that: the structural code after will compressing is formed a complete results file with the form and the data code of file header; Perhaps structural code and data code are divided into different file storage or transmission, this moment, data code must be at the signature of the anterior indicating arrangement code of file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA031402534A CN1492322A (en) | 2003-08-20 | 2003-08-20 | xmL data compressing and decompressing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA031402534A CN1492322A (en) | 2003-08-20 | 2003-08-20 | xmL data compressing and decompressing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1492322A true CN1492322A (en) | 2004-04-28 |
Family
ID=34240258
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA031402534A Pending CN1492322A (en) | 2003-08-20 | 2003-08-20 | xmL data compressing and decompressing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1492322A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101383848A (en) * | 2007-09-04 | 2009-03-11 | Lg电信株式会社 | System and method for mobile web service |
| CN101557399A (en) * | 2009-05-20 | 2009-10-14 | 深圳市汇海科技开发有限公司 | Method for compression and decompression of XMPP protocol transmission data |
| CN101040444B (en) * | 2004-10-18 | 2010-05-12 | 诺基亚西门子网络公司 | Method and apparatus for compressing structuring document |
| CN102096704A (en) * | 2010-12-29 | 2011-06-15 | 北京新媒传信科技有限公司 | XML (extensible markup language) compression method and device |
| CN102379087A (en) * | 2009-03-31 | 2012-03-14 | 西门子公司 | Compression method, decompression method, compression unit, decompression unit and compressed document |
| CN104850561A (en) * | 2014-02-18 | 2015-08-19 | 北京京东尚科信息技术有限公司 | Adaptive compression method for Android APK file |
| CN106503003A (en) * | 2015-09-06 | 2017-03-15 | 阿里巴巴集团控股有限公司 | A kind of compression of expandable mark language XML document, decompressing method and device |
| CN106534267A (en) * | 2016-10-19 | 2017-03-22 | 中国银行股份有限公司 | File uploading and resolving method and device |
| CN106708791A (en) * | 2017-01-04 | 2017-05-24 | 竹间智能科技（上海）有限公司 | Data format conversion method and device |
| CN109683872A (en) * | 2018-11-08 | 2019-04-26 | 广州视源电子科技股份有限公司 | Page script processing, decompressing method, device and system |
-
2003
- 2003-08-20 CN CNA031402534A patent/CN1492322A/en active Pending
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101040444B (en) * | 2004-10-18 | 2010-05-12 | 诺基亚西门子网络公司 | Method and apparatus for compressing structuring document |
| CN101383848A (en) * | 2007-09-04 | 2009-03-11 | Lg电信株式会社 | System and method for mobile web service |
| CN102379087B (en) * | 2009-03-31 | 2015-07-08 | 西门子公司 | Compression method, decompression method, compression unit, decompression unit and compressed document |
| CN102379087A (en) * | 2009-03-31 | 2012-03-14 | 西门子公司 | Compression method, decompression method, compression unit, decompression unit and compressed document |
| CN101557399A (en) * | 2009-05-20 | 2009-10-14 | 深圳市汇海科技开发有限公司 | Method for compression and decompression of XMPP protocol transmission data |
| CN102096704A (en) * | 2010-12-29 | 2011-06-15 | 北京新媒传信科技有限公司 | XML (extensible markup language) compression method and device |
| CN102096704B (en) * | 2010-12-29 | 2013-03-20 | 北京新媒传信科技有限公司 | XML (extensible markup language) compression method and device |
| CN104850561A (en) * | 2014-02-18 | 2015-08-19 | 北京京东尚科信息技术有限公司 | Adaptive compression method for Android APK file |
| CN106503003A (en) * | 2015-09-06 | 2017-03-15 | 阿里巴巴集团控股有限公司 | A kind of compression of expandable mark language XML document, decompressing method and device |
| CN106534267A (en) * | 2016-10-19 | 2017-03-22 | 中国银行股份有限公司 | File uploading and resolving method and device |
| CN106708791A (en) * | 2017-01-04 | 2017-05-24 | 竹间智能科技（上海）有限公司 | Data format conversion method and device |
| CN106708791B (en) * | 2017-01-04 | 2020-03-17 | 竹间智能科技（上海）有限公司 | Data format conversion method and device |
| CN109683872A (en) * | 2018-11-08 | 2019-04-26 | 广州视源电子科技股份有限公司 | Page script processing, decompressing method, device and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1313953C (en) | System and method of mapping between software objects and structure languige element-based documents | |
| CN1732459A (en) | Web content transcoding system and method for small display device | |
| CN1174332C (en) | Method and device for converting expressing mode | |
| CN1162790C (en) | Data communications | |
| CN1168216C (en) | Document managing apparatus, data compressing method, and data decompressing method | |
| CN1802642A (en) | Method for compressing markup languages files, by replacing a long word with a shorter word | |
| CN1321362A (en) | Method of generating distribution content, method and apparatus for content distribution, and method of code conversion | |
| CN1311887A (en) | Method and system for providing an image vector-based traffic information | |
| CN1492322A (en) | xmL data compressing and decompressing method | |
| CN1639736A (en) | Information processing apparatus and method | |
| CN1615480A (en) | Translating configuration files among network devices | |
| CN1220427A (en) | Transmission document edition device, received document processing device, server device and recording medium | |
| CN1529849A (en) | Method and apparatus for compitation of interpretative language for interactive television | |
| CN101042630A (en) | Method and apparatus for displaying document image, and information processing device | |
| CN1379882A (en) | Method for converting two-dimensional data canonical representation | |
| CN1732461A (en) | Parsing system and method of multi-document based on elements | |
| CN1627297A (en) | Method and apparatus for managing data written in markup language | |
| CN1905701A (en) | Method and system for issuing network message to mobile terminal apparatus | |
| CN1942931A (en) | Audio bitstream format in which the bitstream syntax is described by an ordered transveral of a tree hierarchy data structure | |
| CN1908931A (en) | Literal data variable typesetting method | |
| CN1415096A (en) | Language translation system | |
| CN1648900A (en) | Content management apparatus and content management method | |
| CN1841382A (en) | Information processing apparatus and method | |
| CN1410918A (en) | Searching engine based on information extraction technique | |
| CN1486469A (en) | Method and system for chatting service providing realtime tag analysis |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| AD01 | Patent right deemed abandoned | ||
| C20 | Patent right or utility model deemed to be abandoned or is abandoned |