METHOD, SYSTEM AND APPARATUS FOR PROCESSING COMMUNICATIONS

• US 20130103769A1
• Filed: 10/25/2011
• Published: 04/25/2013
• Est. Priority Date: 10/25/2011
• Status: Abandoned Application

• Current Assignee: Blackberry Limited
• Original Assignee: Blackberry Limited
• Inventors: HYMEL, James Allen
• Application Number:
  US13/280,443
• Publication Number:
  US 20130103769A1
• Time in Patent Office: Days
• US Class Current: 709/206
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: G06Q 10/107 Computer-aided management of electronic mailing [e-mailing]

Abstract

According to embodiments described in the specification, a method, system and apparatus for processing messages are provided. The method comprises storing a plurality of messages in a memory of the server, each message having one of a plurality of thread identifiers; receiving a closing message via a communications interface, the closing message including a first thread identifier and a thread closing instruction; responsive to receiving the closing message, locating each of the plurality of messages having thread identifiers which match the first thread identifier; and updating a status indicator in association with each of the located messages.

Claims

1. A method of processing messages at a server, the method comprising:

storing a plurality of messages in a memory of the server, each message having one of a plurality of thread identifiers;

receiving a closing message via a communications interface, the closing message including a first thread identifier and a thread closing instruction;

responsive to receiving the closing message, locating each of the plurality of messages having thread identifiers which match the first thread identifier; and

updating a status indicator in association with each of the located messages.

2. The method of claim 1, further comprising:

generating, at the processor, a calendar invitation; and

transmitting the calendar invitation via the communications interface.

3. The method of claim 2 wherein the closing instruction further comprises calendar event data and wherein the calendar invitation is generated based on the calendar event data.

4. The method of claim 3 wherein the calendar event data comprises an event time, an event description and at least one invitee identifier.

5. The method of claim 1 wherein storing the plurality of messages comprises storing one of a plurality of account identifiers in association with each of the plurality of messages;

wherein the closing instruction includes at least a first account identifier, and wherein the locating of messages comprises locating each of the plurality of messages having thread identifiers which match the first thread identifier and associated with account identifiers which match the first account identifier.

6. The method of claim 1, further comprising:

responsive to receiving the closing instruction, determining if the closing instruction is authorized prior to locating messages.

7. The method of claim 6 wherein the closing instruction includes an originator identifier, and wherein determining if the closing instruction is authorized comprises:

maintaining a list of identifiers of authorized accounts in the memory; and

determining whether the originator identifier is included in the list.

8. A server, comprising:

a memory;

a communications interface; and

a processor interconnected with the memory and the communications interface;

the processor configured to store a plurality of messages in the memory, each message having one of a plurality of thread identifiers;

the processor further configured to receive a closing message via the communications interface, the message including a first thread identifier and a thread closing instruction;

the processor further configured, responsive to receiving the closing message, to locate each of the plurality of messages having thread identifiers which match the first thread identifier; and

the processor further configured to update a status indicator in association with each of the located messages.

9. The server of claim 8, further comprising:

generating, at the processor, a calendar invitation; and

transmitting the calendar invitation via the communications interface.

10. The server of claim 9 wherein the closing instruction further comprises calendar event data and wherein the calendar invitation is generated based on the calendar event data.

11. The server of claim 10 wherein the calendar event data comprises an event time, an event description and at least one invitee identifier.

12. The server of claim 8 wherein storing the plurality of messages comprises storing one of a plurality of account identifiers in association with each of the plurality of messages;

wherein the closing instruction includes at least a first account identifier, and wherein the locating of messages comprises locating each of the plurality of messages having thread identifiers which match the first thread identifier and associated with account identifiers which match the first account identifier.

13. The server of claim 8, further comprising:

responsive to receiving the closing instruction, determining if the closing instruction is authorized prior to locating messages.

14. The server of claim 13 wherein the closing instruction includes an originator identifier, and wherein determining if the closing instruction is authorized comprises:

maintaining a list of identifiers of authorized accounts in the memory; and

determining whether the originator identifier is included in the list.

15. A non-transitory computer readable medium for storing a plurality of computer-readable instructions executable by a processor for performing a method comprising:

storing a plurality of messages in a memory of the server, each message having one of a plurality of thread identifiers;

receiving a closing message via a communications interface, the closing message including a first thread identifier and a thread closing instruction;

responsive to receiving the closing message, locating each of the plurality of messages having thread identifiers which match the first thread identifier; and

updating a status indicator in association with each of the located messages.

16. The non-transitory computer readable medium of claim 15, further comprising:

generating, at the processor, a calendar invitation; and

transmitting the calendar invitation via the communications interface.

17. The non-transitory computer readable medium of claim 16 wherein the closing instruction further comprises calendar event data and wherein the calendar invitation is generated based on the calendar event data.

18. The non-transitory computer readable medium of claim 17 wherein the calendar event data comprises an event time, an event description and at least one invitee identifier.

19. The non-transitory computer readable medium of claim 15 wherein storing the plurality of messages comprises storing one of a plurality of account identifiers in association with each of the plurality of messages;

wherein the closing instruction includes at least a first account identifier, and wherein the locating of messages comprises locating each of the plurality of messages having thread identifiers which match the first thread identifier and associated with account identifiers which match the first account identifier.

20. The non-transitory computer readable medium of claim 15, further comprising:

responsive to receiving the closing instruction, determining if the closing instruction is authorized prior to locating messages.

21. The non-transitory computer readable medium of claim 20 wherein the closing instruction includes an originator identifier, and wherein determining if the closing instruction is authorized comprises:

maintaining a list of identifiers of authorized accounts in the memory; and

determining whether the originator identifier is included in the list.