Two-Dimensional Index Table for Data Transmission Speed
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data transmission methods in wide area networks face low bandwidth, unstable connections, and congestion issues, particularly when transmitting large files, which hinders the growth of service systems and results in inefficient data search and repair processes.
Innovation Solution
A data transmission method utilizing a two-dimensional index table generated based on a multi-thread sequence traversal algorithm, which divides data into blocks with standardized sizes, allowing for simultaneous traversal and reconstruction, and includes check codes for accuracy, enabling efficient data block transmission and reconstruction.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a hash tree manner is used to identify file content accuracy, then file content accuracy is ensured, but the time for traversing the hash tree to find file blocks is long and search efficiency is low
Solution Approach 1:
The patent segments the hash tree structure into multiple parallel hash trees, where each hash tree corresponds to a specific file type or category. This segmentation allows the system to traverse only the relevant hash tree for a given file type rather than searching through a single large hash tree, significantly reducing traversal time while maintaining accurate file content identification.
Solution Approach 2:
The patent introduces a new dimension by organizing hash trees in a multi-dimensional structure based on file attributes such as file type, size range, and creation time. This dimensional organization enables the system to quickly narrow down the search space by filtering along multiple dimensions simultaneously, reducing traversal time while preserving measurement precision for file content accuracy.
2Reliability
If a linear file blocking solution is used to avoid congestion, then data congestion is avoided, but the directory traversal speed is slow and search efficiency is low
Solution Approach 1:
The patent divides the file system directory structure into multiple segmented regions, each with its own optimized traversal path. By segmenting the directory traversal task and processing multiple segments in parallel, the system maintains reliable congestion avoidance through controlled data flow while significantly improving overall traversal speed through concurrent processing.
Solution Approach 2:
The patent performs preliminary actions by pre-organizing file blocks into structured groups with predefined traversal paths and pre-calculating optimal routes through the file system. This preliminary organization allows the system to avoid congestion during actual traversal operations while achieving fast search speeds through the pre-established efficient paths.
3Quantity of substance
If the size of hash tree is increased to handle larger files, then larger files can be processed, but the time for traversing the hash tree increases and search efficiency decreases
Solution Approach 1:
The patent segments large files into smaller logical units and creates separate hash tree entries for each unit, organized in a hierarchical structure. This allows the system to handle large files by processing them as collections of smaller units, maintaining the capacity to process large quantities of data while keeping individual hash tree traversals efficient and fast.
Solution Approach 2:
The patent adds dimensional organization to hash trees by incorporating file attributes such as size ranges, modification times, and file types as additional indexing dimensions. This multi-dimensional structure enables the system to handle larger files and more data while maintaining search efficiency by allowing queries to filter and narrow down results along multiple dimensions simultaneously.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
This application discloses a data transmission method and a related device, to improve a directory traversal speed and improve data search and data repair efficiency. The method includes: generating, by a first device, a two-dimensional index table based on a preset multi-thread sequence traversal algorithm and a size of target data that needs to be transmitted, where the two-dimensional index table is used to indicate a storage location of each piece of data in the target data; performing, by the first device, data reconstruction on the target data based on the two-dimensional index table to obtain a two-dimensional data block pool, where the two-dimensional data block pool includes a plurality of data blocks, and each data block corresponds to one pair of coordinates in the two-dimensional index table; and obtaining, by the first device, the plurality of data blocks through indexing by using the two-dimensional index table, and sending the plurality of data blocks to a second device.