Hyperlink Compression via Base Link and Seed Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Mobile devices have limited display size, memory, and bandwidth, making it challenging to effectively display and transmit rich content, including hyperlinks, from desktop computers, which often contain redundant information.
Innovation Solution
A compression algorithm is employed to reduce redundant information in hyperlinks within a document, using a sequential compression method and a base link construct, allowing for efficient representation and transmission of hyperlinks on mobile devices by converting them into a more compact form.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If hyperlinks are transmitted in their original uncompressed form, then all hyperlink information is preserved, but the data transmission size and time increase significantly on mobile devices
Solution Approach 1:
The hyperlink transmission process is segmented into three distinct phases: compression phase (where hyperlinks are compressed and base link is established), transmission phase (where compressed hyperlinks are sent to mobile device), and decompression phase (where base link and compressed hyperlinks are recombined). This segmentation allows optimization at each stage while preserving complete hyperlink information.
Solution Approach 2:
The base link (common prefix) is identified and extracted in advance during the compression phase, before transmission. This preliminary action allows the majority of redundant information to be removed upfront, significantly reducing the data size that needs to be transmitted while ensuring the information can be fully reconstructed at the receiving end.
2Productivity
If compressed hyperlinks are used to reduce data size, then data transmission efficiency improves, but the complexity of the transmission system increases
Solution Approach 1:
The base link acts as an intermediary element that mediates between the compressed hyperlink data and the original hyperlink information. By introducing this intermediate representation (the common prefix stored as base link), the system achieves efficient compression without requiring complex decompression algorithms, as the reconstruction process simply involves concatenating the base link with the compressed portion.
3Loss of information
If all hyperlink information is transmitted to ensure completeness, then information accuracy is maintained, but the bandwidth consumption increases on mobile devices
Solution Approach 1:
The hyperlink data is transformed from its original parameter representation (full URLs) to a compressed parameter representation (relative paths or shortened identifiers). This parameter change maintains the semantic meaning and accuracy of hyperlink information while dramatically reducing the bandwidth required to transmit the same information set to mobile devices.
Data Source
AI summary
A computer-implemented method can include accessing a network-accessible document that is formatted according to a hypertext markup language and that has a plurality of hyperlinks; producing a transcoded document from the network-accessible document; and providing the transcoded document to a computing device. Producing the transcoded document can include concatenating two or more of the plurality of hyperlinks to form a compression seed, compressing the compression seed with a compression algorithm to form a compressed seed, storing the compressed seed as a base hyperlink in the transcoded document, and compressing each of the plurality of hyperlinks. Compressing each hyperlink can include concatenating each hyperlink with the compression seed, compressing the concatenated hyperlink and compression seed to form a seed portion corresponding to the compression seed and a link portion corresponding to the hyperlink, extracting the seed portion, and substituting in the transcoded document the link portion for the hyperlink.