Compact Node Location Encoding for Structured Documents
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing length of name-based location paths in structured documents such as XML or HTML files leads to significant overhead in storage space and computing resources, particularly when node names are long, posing challenges in efficiently organizing, storing, and transferring data.
Innovation Solution
A node location encoding scheme that uses ASCII characters to encode each node on a path based on its type and position, allowing for compact representation of location paths, reducing storage and computational requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If name-based location paths are used to locate nodes in structured documents, then node identification accuracy is improved, but storage space and computing resource requirements increase significantly
Solution Approach 1:
The patent changes the parameter representation from full node names to compact encoded values. Each node is assigned a unique identifier based on its position in the document structure rather than its name, dramatically reducing the space required to represent location paths while maintaining the ability to uniquely identify nodes.
Solution Approach 2:
The patent extracts only the essential identifying information from node names by using positional encoding. Instead of storing or transmitting full node names, the system extracts and encodes the position of each node in the document hierarchy, retaining node identification capability while eliminating redundant name information.
2Measurement precision
If name-based location paths are used to locate nodes in structured documents, then node identification accuracy is improved, but computing resource requirements increase significantly
Solution Approach 1:
The patent transforms the computing-intensive operation of comparing and processing full node names into simpler operations on compact encoded position values. This parameter transformation reduces the computational complexity of location path operations while preserving node identification accuracy.
Solution Approach 2:
The patent extracts only the positional information necessary for node identification, removing the computationally expensive node name components. This extraction reduces the amount of data that needs to be processed, compared, and manipulated, thereby reducing computing resource requirements.
3Quantity of substance
If compact encoding is used to reduce location path length, then storage space is reduced, but encoding complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-assigning compact encoded identifiers to nodes based on their positional relationships in the document structure. This pre-computation of position-based codes simplifies the encoding process and makes the compact representation readily available without requiring complex real-time encoding operations.
Data Source
AI summary
Techniques for encoding node locations are provided. In some examples, a node in a hierarchy such as a document object model (DOM) may be expressed as a location path from the root node of the hierarchy to the node. Each node on the location path may be encoded using a mapping between the type and/or index of the node and a set of characters such as ASCII characters. The encoding of each node on the path be concatenated to form the encoded location path. The encoding seeks to minimize the length of the encoded location path. For example, in an embodiment, a single ASCII character may be used to encode both the type and the index of a node. In an embodiment, breakpoint locations may be encoded using methods provided to reduce storage and computing resource required.