Social Network Data Retrieval via Pre-established Correspondence
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing social network systems face high computational costs in data retrieval due to the need for intersection operations between large lists of user and link identities, which increases data retrieval calculations.
Innovation Solution
A data retrieval method and system that directly finds a message identity in a correspondence list by determining association between user and link identities, eliminating the need for intersection operations by storing correspondence lists that allow direct search for message identities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If intersection operation is performed on large lists of user identity and link identity, then complete retrieval of shared article information is achieved, but computational load and data retrieval calculation amount increase significantly
Solution Approach 1:
The patent pre-establishes a correspondence relationship between user identity, link identity, and message identity before retrieval operations. This preliminary organization of data allows direct access to shared article information without requiring intersection operations during actual retrieval, thus maintaining completeness while improving efficiency
Solution Approach 2:
The patent introduces a correspondence relationship table as an intermediary structure that stores pre-computed associations between user identity, link identity, and message identity. This intermediary enables direct query operations to retrieve shared article information without performing computationally intensive intersection operations on large datasets
2Adaptability or versatility
If inverted data structure is used to store user-link relationships, then retrieval function can be implemented, but calculation amount increases when number of terms in lists is large
Solution Approach 1:
The patent pre-computes and stores the correspondence relationships between user identity, link identity, and message identity in a structured format before retrieval operations. This preliminary action transforms the retrieval process from requiring complex intersection operations to simple direct queries, reducing computational power requirements while maintaining versatile retrieval capabilities
Solution Approach 2:
The patent creates a simplified copy of the complex inverted data structure in the form of a correspondence relationship table. This copy stores only the essential associations needed for retrieval operations, eliminating the need to process large lists of terms while maintaining the ability to retrieve shared article information accurately
Data Source
AI summary
A method for data retrieval is described. Interface circuitry of an information processing apparatus receives a request for data retrieval from a database. The database stores content sharing information in a social network. The request includes a first user identifier and a first link identifier. The processing circuitry determines whether the first user identifier and the first link identifier are associated in the database as a consequence of a previous sharing of a first article corresponding to the first link identifier using the first user identifier. Further, when the first user identifier and the first link identifier are determined to be associated, the processing circuitry searches for a first message identifier in the database. The first message identifier identifies a first message that includes information of the previous sharing of the first article. The processing circuitry then retrieves the first message according to the first message identifier.