IP Library Patent Application 11230934
Patent Application
App. No. 11/230,934

Generating relational structure for non-relational messages

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
11/230,934
Abstract

A messaging server ( 112 ) provides a message store ( 116 ) for storing messages in a relational manner. A set of related messages, such as an email string between two or more people, is represented as a message container ( 200 ) having relational references to one or more submessages ( 210, 212, 214 ). The messaging server ( 112 ) processes non-relational messages sent by the server by inserting ( 516 ) tags that uniquely identify components within the message. The messaging server ( 112 ) also processes tagged or untagged non-relational messages received by the server to create ( 616, 618 ) relational counterparts in the message store ( 116 ). Relational searches can be executed on the messages in the message store ( 116 ) to perform audits or forensic analyses of the messages.

Claims (39)

1 . A computerized messaging server in an electronic messaging system, comprising:

a message store module adapted to store using a relational structure components of messages exchanged in the electronic messaging system; and

a structuring module adapted to receive a non-relational message exchanged using the messaging system, to create a relational counterpart of the non-relational message, and to store the relational counterpart in the message store module.

2 . The messaging server of claim 1 , wherein the structuring module comprises:

a downstream processing module adapted to analyze the non-relational message to produce a set of message components, to examine the message store module to identify any relationships between the message components of the non-relational message and the message components stored in the message store module, and to create new relational data in the message store module to reflect the identified relationships.

3 . The messaging server of claim 2 , wherein the message store module is further adapted to store a hash value identifying a message component and wherein the downstream processing module is further adapted to generate a hash value from a message component of the non-relational message and determine whether the hash value from the non-relational component matches the hash value identifying the message component in the message store.

4 . The messaging server of claim 1 , wherein the structuring module comprises:

an upstream processing module adapted to tag the non-relational message with information including unique identifiers for message components within the non-relational message.

5 . The messaging server of claim 4 , wherein the non-relational message is in one of a plurality of formats and wherein the upstream processing module is further adapted to identify the format of the non-relational message and insert tags specific to the format.

6 . The messaging server of claim 1 , further comprising:

a searching module adapted to enable relational searches on the components of messages stored in the message store module.

7 . A computer program product having a computer-readable medium having computer program instructions recorded thereon for processing messages exchanged using an electronic messaging system, comprising:

a message store module adapted to store using a relational structure components of messages exchanged in the electronic messaging system; and

a structuring module adapted to create a relational counterpart of the non-relational message exchanged using the messaging system, and to store the relational counterpart in the message store module.

8 . The computer program product of claim 7 , wherein the structuring module comprises:

a downstream processing module adapted to analyze the non-relational, message to produce a set of message components, to examine the message store module to identify any relationships between the message components of the non-relational message and the message components stored in the message store module, and to create new relational data in the message store module to reflect the identified relationships.

9 . The computer program product of claim 8 , wherein the message store module is further adapted to store a hash value identifying a message component and wherein the downstream processing module is further adapted to generate a hash value from a message component of the non-relational message and determine whether the hash value from the non-relational component matches the hash value identifying the message component in the message store.

10 . The computer program product of claim 7 , wherein the structuring module comprises:

an upstream processing module adapted to tag the non-relational message with information including unique identifiers for message components within the non-relational message.

11 . The computer program product of claim 10 , wherein the non-relational message is in one of a plurality of formats and wherein the upstream processing module is further adapted to identify the format of the non-relational message and insert tags specific to the format.

12 . The computer program product of claim 7 , further comprising:

a searching module adapted to enable relational searches on the components of messages stored in the message store module.

13 . A computer-implemented method of processing messages exchanged using an electronic messaging system, comprising:

providing a data store for storing, using a relational structure, components of messages exchanged in the electronic messaging system;

creating a relational counterpart of a non-relational message exchanged using the messaging system; and

storing the relational counterpart in the message store module.

14 . The method of claim 13 , further comprising:

analyzing the non-relational message to produce a set of message components;

examining the message store module to identify any relationships between the message components of the non-relational message and the message components stored in the message store module; and

creating new relational data in the message store module to reflect the identified relationships.

15 . The method of claim 14 , wherein the data store stores a hash value identifying a message component and further comprising:

generating a hash value from a message component of the non-relational message; and

determining whether the hash value from the non-relational component matches the hash value identifying the message component in the data store.

16 . The method of claim 13 , further comprising:

tagging the non-relational message with information including unique identifiers for message components within the non-relational message.

17 . The method of claim 16 , wherein the non-relational message is in one of a plurality of formats and further comprising:

identifying the format of the non-relational message and inserting tags specific to the format.

18 . The method of claim 13 , further comprising:

executing a relational search on the components of messages stored in the data store.

Assignments (3)
SECURITY AGREEMENT Recorded Sep 16, 2008
From: BLUESPACE SOFTWARE CORP.
To: SILICON VALLEY BANK
Reel/Frame 021538/0090 →
CERTIFICATE OF DOMESTICATION Recorded Jul 20, 2006
From: BLUESPACE GROUP LTD.
To: BLUESPACE SOFTWARE CORP.
Reel/Frame 017966/0685 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 9, 2005
From: MARSTON, JUSTIN P.; HATCH, ANDREW S.
To: BLUESPACE GROUP LTD.
Reel/Frame 017338/0646 →