Web Page Menu Compression via Index Substitution

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Web pages with hierarchical menus require significant time and memory resources due to the large size of menu source code, which is particularly problematic for mobile devices with limited memory.

Innovation Solution

A method that compresses web page menus by generating unique indices for fragments and words in the menu source code, replacing occurrences with these indices, and storing them in a dictionary, reducing the size of the menu and memory requirements.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If hierarchical menus are included in web pages to enhance user experience, then user browsing capability is improved, but web page size increases leading to longer retrieval time

Engineering Contradiction:
Improveuser browsing capabilityVSAvoidweb page retrieval time
Core Design Contradiction:
Ease of operationVSLoss of time

Solution Approach 1:

The menu system is segmented into two parts: a compressed menu data structure sent with the web page for immediate rendering, and a separate comprehensive menu database stored externally. This segmentation allows the web page to include only essential menu information in compressed form, reducing page size and retrieval time while maintaining full menu functionality.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Instead of including the full menu database in each web page, a compressed copy or representation of the menu data is embedded in the web page. The complete menu information remains in the external database, allowing web pages to be smaller while still providing access to full menu functionality through the compressed data structure.

Inventive Principle:
Principle #26Copying

2Speed

If menu source code is stored in an external file separate from web pages to reduce retrieval time, then web page loading speed is improved, but initial download time and client memory usage increase

Engineering Contradiction:
Improveweb page loading speedVSAvoidclient memory usage
Core Design Contradiction:
SpeedVSQuantity of substance

Solution Approach 1:

The menu data undergoes parameter changes through compression techniques, transforming the original menu database into a compact data structure with reduced size. This compressed representation maintains all necessary menu information while occupying significantly less client memory, allowing the external file approach to be viable for memory-constrained devices.

Inventive Principle:
Principle #35Parameter changes

3Reliability

If full menu information is included in each web page to ensure complete functionality, then menu accessibility is improved, but web page size and transmission time increase

Engineering Contradiction:
Improvemenu accessibilityVSAvoidtransmission time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The menu data is pre-compressed into a compact data structure before being sent with the web page. This preliminary compression action ensures that the full menu information is available for immediate rendering without requiring transmission of the uncompressed original data, thus maintaining menu accessibility while reducing transmission time.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10049089B2Methods for compressing web page menus and devices thereof
Publication Date: 2018.08.14 USABLENET INC
  • US10049089B2 patent drawing
  • US10049089B2 patent drawing
  • US10049089B2 patent drawing

AI summary

A method, non-transitory computer readable medium, and apparatus that obtains an original menu associated with a web page requested by a client computing device. The original menu comprises at least a plurality of URLs, each comprising one or more fragments, and a plurality of titles, each comprising one or more words. A unique index for one occurrence of each of at least a subset of the fragments and the words is generated. At least one dictionary comprising the generated indices associated with a corresponding one of the fragments or the words is generated. A modified menu is generated by replacing each occurrence of each of the at least a subset of the one or more fragments and the one or more words of the original menu with a corresponding one of the unique indices. The modified menu and the at least one dictionary are sent to the client computing device.