Content Set Interaction via Data Structure Mediation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current content aggregation systems lack flexibility in interacting and integrating disparate content sets from different providers, limiting user experience and functionality within a single web page.

Innovation Solution

A system that loads both content sets into a data structure, detects events associated with the second content set, parses it to identify subsets, compares these subsets with the first content set, and executes associated actions when a match is found, allowing for enhanced interaction and behavior modification without requiring tight coupling between content sets.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If content sets from different providers are aggregated and displayed in separate display areas, then content diversity and user personalization are improved, but interaction and integration between content sets are limited

Engineering Contradiction:
Improvecontent integration flexibilityVSAvoidcontent set coupling complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent introduces a third component - a data structure - that serves as an intermediary between content sets from different providers. This data structure enables interaction and integration between content sets without requiring direct coupling between the content sets themselves, thus resolving the contradiction by providing a mediating layer that simplifies integration while maintaining flexibility

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent segments the content display system into independent content sets from different providers, each loaded into the same data structure. This segmentation allows content sets to remain independent while still interacting through the shared data structure, improving integration flexibility without increasing coupling complexity between the content sets themselves

Inventive Principle:
Principle #1Segmentation

2Ease of operation

If content sets are loaded into a data structure for interaction, then user interaction and functionality are enhanced, but system complexity increases

Engineering Contradiction:
Improveuser interaction capabilityVSAvoiddata structure management complexity
Core Design Contradiction:
Ease of operationVSDevice complexity

Solution Approach 1:

The patent implements self-service mechanisms where content sets automatically load into the data structure through event detection and parsing. The system automatically identifies subsets, compares them with existing content sets, and executes associated actions without manual intervention, thereby enhancing user interaction capability while managing complexity through automation

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent performs preliminary actions by pre-defining the data structure framework and pre-configuring content sets to be loaded into it. This preliminary setup enables complex interactions and user functionality to emerge automatically when content is loaded, reducing the operational complexity of managing interactions during runtime

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10095801B2Providing interaction between a first content set and a second content set in a computer system
Publication Date: 2018.10.09 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US10095801B2 patent drawing
  • US10095801B2 patent drawing
  • US10095801B2 patent drawing

AI summary

Interaction is provided between a first content set and a second content set, both of which are loaded into a data structure. When an event associated with loading of the second content set is detected, the second content set is parsed to identify at least one sub-set of the second content set. The identified sub-set is checked against a first data set associated with the first content set to determine whether the identified sub-set matches the first data set. If a match is found, an action associated with the least one identified sub-set is executed and the data structure is modified.