Network transmission method for large extensible markup language (XML) document

Abstract

The invention discloses a network transmission method for a large extensible markup language (XML) document. The method comprises the following steps of: 1, reading the XML document; 2, preprocessing all node tags in the XML document; 3, processing redundant tags in the XML document; and 4, finishing the compression processing and fragmentation transmission of the XML document. The step 4 further comprises the following steps of: 41, setting an initial fragmentation size to be Initial_Size; 42, extracting a plurality of pieces of data to form a data packet for the compression processing and the network transmission, wherein the size of the data packet is Initial_Size; 43, judging a current network load condition, and obtaining a value of a maximum transmission unit; 44, re-determining a fragmentation size to be New-Size according to the current network load condition and the value of the maximum transmission unit; 45, re-extracting a data packet with the size of New-Size for the compression processing and the network transmission; and 46, repeating the steps 43 to 45.

Description

technical field [0001] The invention relates to the transmission of XML files, in particular to a method for network transmission of large XML files. Background technique [0002] XML (Extensible Markup File) is a markup language that has the following advantages: (1) self-describing; (2) supporting verification of document content; (3) allowing the existence of markup languages ​​in different fields; (4) supporting Advanced collection, therefore, documents in XML format are widely used in today's Internet applications. Due to the limitation of Internet bandwidth capacity, it is very important to effectively compress XML and design the transmission mechanism when the system transmits large XML files. [0003] There are currently two ways to transfer large XML files: (1) file structure-aware; (2) non-file structure-aware; and the file structure-aware method is further divided into: schema-based and non-schema . [0004] Considering that XML files are stored in the form of ...

AI Technical Summary

Problems solved by technology

The Burrows-Wheeler transformation used by bzip2 has a high compression rate for the strings that often appear in the source document, but the compression rate for the strings that are loosely continuous is not ideal, and the overall performance is low

For the PPM algorithm, it is a technology based on context modeling and prediction. The algorithm will inevitably consume a large amount of computing resources when performing modeling and prediction. Although its PPM has the characteristics of simplicity and high compression rate, it is also a relatively expensive method. compression algorithm

Although theoretically speaking, the mode-dependent compression method can achieve a higher compression rate than the mode-independent mode, but it also has corresponding disadvantages: first, the schema file of the XML document is not always available, once it is not available XML document schema, then the algorithm cannot obtain a high compression rate

At the same time, due to the limitation of MTU, large data packets will be divided and transmitted at the network protocol layer. At the same time, the network load will also affect the throughput of the network, because if the network load is severe, the network will be congested and the data packets will be retransmitted. , although the protocol will deal with these situations, if the probability of this situation is reduced at the application layer, the throughput of the network will be improved from another aspect to reduce network congestion

Images