SEO URL Mapping via Hash-Based Directory Indexing

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing methods for mapping search engine optimized URLs (SEO URLs) to actual storage locations on e-commerce sites consume substantial hardware and labor resources, as they require extensive directory mappings that are resource-intensive and inefficient.

Innovation Solution

A system utilizing a directory index that maps SEO URLs to local addresses by generating hash values for category identifiers, allowing for efficient retrieval of product and category information without the need for extensive internal directory entries, reducing directory size and cost while maintaining speed.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If extensive directory mappings are used to map SEO URLs to local addresses, then mapping accuracy is improved, but hardware resources and labor resources are substantially consumed

Engineering Contradiction:

Improvemapping accuracyVSAvoidhardware resources

Core Design Contradiction:

Measurement precisionVSUse of energy by moving object

Solution Approach 1:

The patent segments the mapping process into two parts: a compressed directory index stored in memory that contains only essential mapping relationships, and a hashing mechanism that enables direct address calculation. This segmentation eliminates the need for storing extensive directory mappings while maintaining mapping accuracy through the combination of indexed relationships and hash-based address generation.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent creates a compressed copy of the directory structure in the form of a directory index that stores only critical mapping relationships rather than the full directory hierarchy. This copied index, combined with hashing, reproduces the functionality of extensive mappings without the resource cost of storing complete directory structures.

Inventive Principle:

Principle #26Copying

2Measurement precision

If extensive directory mappings are used to map SEO URLs to local addresses, then mapping accuracy is improved, but device complexity increases

Engineering Contradiction:

Improvemapping accuracyVSAvoiddirectory structure complexity

Core Design Contradiction:

Measurement precisionVSDevice complexity

Solution Approach 1:

The patent divides the complex directory mapping problem into manageable segments: a compressed directory index containing essential mappings and a hashing function for address calculation. This segmentation simplifies the overall system by replacing the need for complex, extensive directory structures with two simpler components that work together to achieve the same mapping accuracy.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent changes the parameters of the directory representation by storing only essential mapping relationships in the directory index rather than complete path information. This parameter change, combined with hashing, maintains mapping accuracy while significantly reducing the complexity of the directory structure.

Inventive Principle:

Principle #35Parameter changes

3Productivity

If compressed directory indexing is used, then resource efficiency is improved, but mapping speed may be reduced

Engineering Contradiction:

Improveresource efficiencyVSAvoidmapping speed

Core Design Contradiction:

ProductivityVSSpeed

Solution Approach 1:

The patent performs preliminary actions by pre-computing and storing hash values in the compressed directory index for essential mapping relationships. This preliminary action enables direct address calculation without requiring extensive real-time computation, thereby maintaining mapping speed while achieving resource efficiency through the compressed index structure.

Inventive Principle:

Principle #10Preliminary action

4Loss of information

If extensive directory mappings are used, then complete path information is preserved, but directory size and cost increase

Engineering Contradiction:

Improvepath information completenessVSAvoiddirectory size

Core Design Contradiction:

Loss of informationVSQuantity of substance

Solution Approach 1:

The patent extracts only the essential mapping relationships from the complete directory structure and stores them in the compressed directory index. Full path information is not stored, but the extracted essential mappings combined with hashing provide sufficient information for accurate URL-to-address mapping, thereby reducing directory size while maintaining functional completeness.

Inventive Principle:

Principle #2Taking out (Extraction)

Solution Approach 2:

The patent replaces expensive, extensive directory mappings with a cheap, compressed directory index that stores only essential information. The hashing mechanism acts as a disposable computational step that generates complete path information on-demand without requiring storage of the full directory structure, thereby reducing directory size and cost.

Inventive Principle:

Principle #27Cheap short-living objects (Disposable)

Data Source

PatentUS11232166B2Networked page access and addressing based on partial categorization indexing

Publication Date: 2022.01.25 SALESFORCE INC

AI summary

A networked page access and addressing method to generate web pages responsive to requested client requests parses addresses of incoming requests into at least two logical segments: a first likely to represent a category and a second likely to represent a product. By generating hash values for the first segment, it can be compared against hashes in the internal directory to identify a local category corresponding to the represented in the address. If so, a local address can be generated by combining with the second segment with an identifier of that local category. Information from the data record at that local address can used to form a web page responsive to the request.