Hierarchical Data Exchange via Linear Compound Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current client-server solutions for exchanging hierarchical data, such as XML documents, face inefficiencies due to extensive string processing, increased file sizes, and poor cache utilization, as they require extensive parsing, validation, and conversion on both the server and client sides.
Innovation Solution
The system employs a Linear Compound Storage (LCS) document format that encodes hierarchical data with memory layout and address information, allowing for direct loading into memory without the need for costly parsing, and optimizes data placement to improve cache utilization by storing related data in consecutive memory locations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If hierarchical data is exchanged using string-based formats like XML, then data can be transmitted between client and server, but processing time and file size increase significantly due to extensive string processing and parsing requirements
Solution Approach 1:
The patent changes the fundamental parameter of data representation from string-based (XML) to binary-based formats. The server serializes hierarchical data into a binary format that can be directly parsed without extensive string processing, and the client deserializes it back into memory structures. This parameter change eliminates the need for node-by-node parsing and validation, dramatically reducing processing time while maintaining data exchange functionality.
Solution Approach 2:
The patent replaces the mechanical string parsing and validation process with a binary data loading mechanism. Instead of manually parsing XML tags and validating data structures, the system uses binary serialization that can be directly loaded into memory using standard loading operations. This substitution of the processing mechanism eliminates the time-consuming string processing steps while maintaining data integrity.
2Productivity
If hierarchical data is parsed and validated node-by-node to construct a document object model, then data can be processed and used, but memory utilization is poor due to non-optimized memory layout
Solution Approach 1:
The patent applies preliminary action by having the server pre-serialize the hierarchical data into a binary format with optimized memory layout before transmission. The binary format is designed to map directly onto the client's memory structure, so when the data is loaded, it already has the correct layout and requires no additional processing. This preliminary preparation eliminates the need for post-receiving memory reorganization, improving both processing efficiency and memory utilization.
3Adaptability or versatility
If extensive string processing is performed to convert hierarchical data into string tags and parse XML documents, then data can be exchanged between systems, but file size increases and processing loads on both client and server increase
Solution Approach 1:
The patent changes the data representation parameter from human-readable string format to compact binary format. This parameter change reduces the file size significantly while maintaining the ability to exchange hierarchical data between client and server. The binary format preserves all necessary data information without the redundancy and overhead of XML tags, attributes, and formatting strings.
Solution Approach 2:
The patent extracts the essential data information from the verbose XML format and represents it in a compact binary structure. By taking out only the necessary data elements and their relationships, the system eliminates unnecessary string processing, reduces file size, and lowers processing load while maintaining full data exchange capability.
Data Source
AI summary
Systems and methods are disclose for facilitating the transfer of hierarchical data to a computer memory are provided. A disclosed method may include receiving an electronic document containing hierarchical data, memory layout information, and memory address information, wherein the memory address information comprises a base address. The data may be restructuring to conform with the memory layout of the computer memory when it is determined, based on the memory layout information, that a memory layout of the hierarchical data does not match the memory layout of the computer memory. Memory address information may be translated when it is determined that the base address is not available in the computer memory. The restructured hierarchical data may be loaded into the computer memory based on the translated memory address information.