XML Tree Division via Subtree Indexing for Parallel Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for processing structured documents, such as XML documents, are inefficient due to the long time required to scan and divide large tree structures, which reduces processing efficiency and cannot be effectively resolved by prior art.
Innovation Solution
A computer-implemented method and system that calculates an index value for subtrees based on an XML schema, deciding on a division pattern to divide the tree structure into subtrees of a predetermined size, suitable for parallel processing on multi-core processors, using a coefficient table and processing history to optimize subtree size estimation and division.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the tree structure of a structured document is divided using existing methods, then the document can be processed, but the scanning and division process takes a long time, reducing processing efficiency
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing index values for subtrees based on the XML schema before actual document division occurs. The system pre-processes the schema to build a coefficient table that contains subtree size information, which is then reused during document division without requiring重新 scanning of the entire tree structure. This preliminary preparation significantly reduces the time required for dividing large structured documents.
Solution Approach 2:
The patent uses copying by creating a coefficient table that stores pre-calculated subtree size information from the XML schema. Instead of scanning and calculating subtree sizes repeatedly for each division operation, the system copies and reuses this pre-computed index data. The coefficient table serves as a reusable reference that eliminates redundant scanning operations, thereby improving processing efficiency and reducing time loss.
2Productivity
If the tree structure is divided into equal-sized subtrees, then parallel processing efficiency is improved, but determining the division pattern requires complex calculations
Solution Approach 1:
The patent replaces the mechanical scanning and counting process with an index-based calculation system. Instead of physically traversing and counting nodes to determine subtree sizes, the system uses pre-calculated index values stored in the coefficient table. This substitution of mechanical operations with indexed mathematical calculations simplifies the division pattern determination process while maintaining accuracy for creating equal-sized subtrees suitable for parallel processing.
Solution Approach 2:
The patent applies parameter changes by transforming the complex problem of tree division into a simpler parameter-based calculation. The system changes the approach from structural analysis to parameter utilization, where pre-calculated index values (parameters) from the coefficient table are used to determine division patterns. This parameter-based method simplifies the complexity of determining how to divide the tree structure into equal-sized subtrees for parallel processing.
3Reliability
If existing division methods are used, then the tree structure can be divided, but the processing time increases and efficiency decreases for large documents
Solution Approach 1:
The patent uses copying by creating and storing a coefficient table that contains pre-calculated subtree size information from the XML schema. This copied index data is then reused during document division operations, eliminating the need to re-scan and re-calculate subtree sizes. The coefficient table serves as a reusable reference that maintains division accuracy while dramatically reducing processing time for large structured documents.
Solution Approach 2:
The patent applies preliminary action by pre-processing the XML schema to calculate and store all necessary subtree size indices before actual document division occurs. This preliminary calculation creates a coefficient table that contains all the information needed for accurate division, allowing the system to maintain high division accuracy without repeating expensive scanning operations during the actual division process, thus reducing processing time.
Data Source
AI summary
A method and system for dividing a tree structure of a structured document based on a tree structure defined by a schema of the structured document. The method includes the following steps: calculating an index value of size of a subtree having each element as a root for at least part of at least one element included in the tree structure defined by the schema, and deciding on a division pattern using the index value, where the division pattern is used to divide the tree structure of the structured document to which the schema is applied so that the size of the subtree, after being divided, meets a predetermined standard.