{'fraction_non_alphanumeric': 0.012686567164179104, 'fraction_numerical': 0.0, 'mean_word_length': 4.986607142857143, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A New Prototype of XML Compression Technique

XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many effective XML compressors, such as XMill, have been recently proposed to solve this data inflation problem, they do not address the problem of running queries on compressed XML data. More recently, some compressors have been proposed to query compressed XML data. However, the compression ratio of these compressors is usually worse than that of XMill and that of the generic compressor gzip, while their query performance and the expressive power of the query language they support are inadequate. In practice, a good compression ratio is achievable only if there is adequate exploring and exploiting of the redundancy in the XML structure and the commonality in the XML data. Good compression and decompression times are achievable only by parsing and processing the XML document just once, such as by using an SAX parser. And there is an issue for compression time and compression ratio. In this paper we propose our approach a XML compressor which support querring compress XML data with partial decompressor. Our approach tried to address the compression time and adaptive compression ratio for XML database.