XML Schema Compression With Path Coding for Direct Querying

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional methods fail to effectively compress, decompress, and query XML documents with corresponding Schemas, as they either do not enable querying or require decompression for data retrieval.

Innovation Solution

A method and device that extract structure and data content from XML documents, determine path coding for nodes, and compress these elements, allowing for querying and decompression while maintaining the schema integrity.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of substance

If XML documents are compressed using conventional methods, then data redundancy is reduced, but query operations require decompression first

Engineering Contradiction:
Improvedata redundancyVSAvoidquery operation efficiency
Core Design Contradiction:
Loss of substanceVSProductivity

Solution Approach 1:

The patent segments the XML document into structure content (labels) and data content, compressing them separately. The structure content is compressed using a dictionary-based method where labels are replaced by their indices, while data content is compressed using statistical methods. This segmentation allows independent optimization of compression for each part while maintaining query capability on the compressed structure.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary compression of the XML structure content by building a label dictionary and replacing labels with their indices before query operations. This preliminary action creates a compressed representation that can still support efficient querying through index-based navigation, eliminating the need for full decompression during queries.

Inventive Principle:
Principle #10Preliminary action

2Productivity

If XML documents are compressed to enable direct querying, then query operations can be performed on compressed data, but the compression method becomes more complex

Engineering Contradiction:
Improvequery operation efficiencyVSAvoidcompression method complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent introduces an intermediary label dictionary that maps original XML labels to compressed indices. This intermediary structure enables both compression and query operations on the compressed data without requiring complex compression algorithms. The dictionary acts as a mediator between the original XML structure and the compressed representation, simplifying the overall system while enabling efficient querying.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Loss of substance

If XML documents are compressed without preserving structure information, then compression ratio is improved, but the ability to query and decompress is lost

Engineering Contradiction:
Improvecompression ratioVSAvoiddecompression and query capability
Core Design Contradiction:
Loss of substanceVSReliability

Solution Approach 1:

The patent creates a compressed copy of the XML structure by replacing labels with their indices from a label dictionary. This copied structure maintains the hierarchical relationships and path information needed for querying and decompression, while achieving high compression ratios. The label dictionary serves as a reference that enables reconstruction of the original structure from the compressed indices.

Inventive Principle:
Principle #26Copying

Data Source

PatentUS8768900B2Method and device for compressing, decompressing and querying document
Publication Date: 2014.07.01 NEW FOUNDER HLDG DEV LLC
  • US8768900B2 patent drawing
  • US8768900B2 patent drawing
  • US8768900B2 patent drawing

AI summary

A method for processing an XML document with a schema includes extracting structure content and data content of an XML document, determining path coding of a node in the structure content, and determining data content corresponding to the node according to a pre-stored preorder of the node, wherein the path coding of the node identifies a storage position of the node in the structure content through the node and other nodes in the structure content, and compressing respectively the node, the path coding of the node and the data content.