Bulk Message Deletion Using Read Time Association
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing social network messaging systems face inefficiencies in managing storage resources due to the tedious and resource-intensive process of automatic message deletion, which iterates through all messages to determine deletion criteria, consuming significant processing resources.
Innovation Solution
A system that automatically deletes messages based on message sent or read times on a bulk basis, associating prior messages with the read time of the latest message and deleting them after a threshold period, reducing the need to track individual read times and thereby minimizing processing and storage resource usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If automatic message deletion iterates through all messages to determine deletion criteria, then message retention policy is enforced accurately, but processing resources and time consumption increase significantly
Solution Approach 1:
The system performs preliminary action by storing the read time of the latest message in advance. When bulk deletion is triggered, this pre-stored read time is immediately used to determine which messages should be deleted, eliminating the need to iterate through all messages to check their individual read statuses. This preliminary storage of deletion criteria data resolves the contradiction by enabling fast deletion execution while maintaining accurate policy enforcement.
Solution Approach 2:
The system extracts the deletion determination logic from the bulk deletion process. Instead of iterating through all messages during deletion to check read times, the system extracts and stores the latest read time separately in advance. This extracted information is then used to efficiently determine the deletion boundary, resolving the contradiction between accurate policy enforcement and processing efficiency.
2Measurement precision
If individual message read times are tracked for each message, then deletion accuracy is maintained, but storage resources and processing overhead increase
Solution Approach 1:
The system merges the read time information of multiple prior messages into a single representative value - the read time of the latest message. Instead of tracking and storing individual read times for each message in the conversation, the system combines this information by storing only the latest read time, which serves as the deletion boundary for all prior messages. This merging approach maintains deletion accuracy while significantly reducing storage requirements.
Solution Approach 2:
The stored read time of the latest message serves multiple functions: it acts as both the read confirmation timestamp for the latest message and the deletion boundary timestamp for all prior messages. This multi-functional use of a single data point eliminates the need for separate tracking mechanisms for each message, reducing storage overhead while maintaining precise deletion timing control.
Data Source
AI summary
Systems and methods are provided for deleting messages. The systems and methods include operations for: establishing, by a computing device, a communication session between a plurality of users; receiving a plurality of messages in the communication session; determining that a first message of the plurality of messages has been read by a first user of the plurality of users at a read time; in response to determining that the first message has been read by the first user at the read time, automatically associating the read time with a second of the plurality of messages that precedes the first message in the communication session; and automatically deleting the first and second messages in response to determining that an elapsed time measured from the read time associated with the first and second messages corresponds to a threshold time period.