Messenger Social Graph Sharing for Automatic Data Exchange
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing messenger-linked services are limited in data sharing capabilities, requiring manual friend list linking and restricting data exchange to photos, videos, and audio files, with no efficient way to leverage social graphs for broader data transmission and sharing.
Innovation Solution
A messenger-linked service system and method that utilizes a social graph to automatically extract and share various types of data, including card, camera, schedule, and contact information, between users and groups through a messenger platform, without manual friend recommendation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If manual friend list linking is used in messenger-linked services, then data sharing can be controlled, but user convenience deteriorates and operation complexity increases
Solution Approach 1:
The system automatically extracts social graphs from messenger platforms to identify friend relationships and enables data sharing without requiring manual user configuration. The extraction unit autonomously retrieves friend lists and relationship data, while the determination unit automatically decides which users can access shared data based on extracted social relationships, eliminating manual friend list linking while maintaining controlled data sharing.
Solution Approach 2:
The system pre-extracts social graph data including friend relationships and interaction histories before data sharing operations occur. By storing this extracted social graph information in advance, the system can quickly determine sharing permissions without requiring real-time manual input, thus improving both control reliability and operational ease.
2Reliability
If traditional messenger services are used, then basic text communication is reliable, but data sharing capabilities are limited to photos, videos, and audio files
Solution Approach 1:
The system extends messenger functionality beyond traditional media sharing to include diverse data types such as contact information, schedules, and card data from messenger-linked applications. The transmission unit is designed to handle multiple data formats by leveraging extracted social relationships, enabling universal data sharing across different application types while maintaining the reliable communication foundation of traditional messengers.
Solution Approach 2:
The system introduces a social graph extraction and determination mechanism as an intermediary layer between users and data sharing. This intermediary extracts relationship data from messenger platforms and uses it to automatically determine sharing permissions, enabling versatile data sharing across multiple application types while maintaining controlled access based on social relationships.
3Productivity
If social graphs are automatically extracted from messenger platforms, then data sharing efficiency improves, but system complexity increases
Solution Approach 1:
The system extracts social graph data including friend relationships and interaction histories from existing messenger platforms as a separate, independent function. The extraction unit retrieves this data and stores it independently, allowing the determination unit to use this extracted information for sharing decisions without requiring complex integration with the messenger's core functionality, thus improving efficiency while managing complexity.
Solution Approach 2:
The system divides the data sharing functionality into distinct modules: an extraction unit that retrieves social graph data, a determination unit that decides sharing permissions based on extracted relationships, and a transmission unit that executes data sharing. This segmentation allows each component to perform its function efficiently while reducing overall system complexity through modular design.
Data Source
AI summary
A messenger-linked service system and method using a social graph based on a human relationship of a messenger are provided. The messenger-linked service system may include a relationship extraction unit to extract a social graph of a friend relationship of the messenger, a selection unit to select data in the messenger-linked service, and an execution unit to either transmit or to execute a sharing request of the selected data to the friend using the social graph.