Connection Manager Server for Communication Data Indexing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Users face difficulties in managing and selecting appropriate communication methods among various applications, as senders often lack information on recipients' preferred communication applications, leading to cumbersome management and search processes.
Innovation Solution
A connection manager server that stores and indexes historical communication data, determines importance and thread factors for content items, and recommends communication types based on user preferences and contexts, using machine learning to facilitate efficient communication type selection and search within communication sessions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple communication applications are used to contact different recipients, then communication versatility is improved, but device complexity and management difficulty increase
Solution Approach 1:
The patent introduces a connection manager as an intermediary system that automatically manages communication data across multiple applications. The connection manager stores historical communication data, determines importance factors and thread factors, and recommends appropriate communication types, thereby reducing the complexity of managing multiple communication applications while maintaining versatility
Solution Approach 2:
The system implements feedback mechanisms by analyzing historical communication data and using importance factors, thread factors, and content item weights to automatically recommend communication types. This feedback loop allows the system to learn from past interactions and improve communication management without increasing user burden
2Measurement precision
If senders manually search old conversations to find recipient preferences, then communication precision is improved, but loss of time increases
Solution Approach 1:
The connection manager performs preliminary actions by pre-processing and storing historical communication data, calculating importance factors and thread factors in advance. When a communication request is made, the system can quickly retrieve and analyze pre-computed data to identify recipient preferences, eliminating the need for manual searching while maintaining high precision
Solution Approach 2:
The system creates copies of communication data in an optimized format with pre-calculated importance and thread factors. These copied and structured data representations enable rapid querying and analysis, allowing the system to quickly determine recipient preferences without requiring senders to manually search through original conversation histories
3Measurement precision
If comprehensive communication data is stored and analyzed, then recommendation accuracy is improved, but use of energy and processing resources increases
Solution Approach 1:
The connection manager extracts only the essential features from comprehensive communication data, such as importance factors, thread factors, and content item weights. By extracting and storing only these critical parameters rather than processing entire communication histories, the system maintains high recommendation accuracy while significantly reducing energy consumption and processing requirements
Data Source
AI summary
It is presented a method for managing communication data. The method is performed by a connection manager server (20) and comprising the step of: causing store (41) of historical communication data, for a communication session between a user and one or more contacts, into a database (13), wherein the historical communication data comprises communication data, a session identifier, a communication type, a communication context, and a user identifier for each contact having participated in the communication session. Methods for indexing communication data, and for recommending a communication type, are also presented. Corresponding connection manager servers (20), computer programs (64, 65) and a computer program product (62, 63) are also presented.


