System and method for evaluating a structured message store for message redundancy
AssigneeAttenex Corporation
InventorsKenji Kawai, David T. McDonald
Life of this patent
Estimating the term…
Abstract
A system and method for evaluating a structured message store for message redundancy is described. A header and a message body are extracted from each of a plurality of messages maintained in a structured message store. A substantially unique hash code is calculated over at least part of the header and over the message body of each message. The messages are grouped by the hash codes. One such message is identified as a unique message within each group. In a further embodiment, the messages are grouped by conversation thread. The message body for each message within each conversation thread group is compared. At least one such message within each conversation thread group is identified as a unique message.
Claims38
A system for evaluating a structured message store for message redundancy, comprising:
- a parser extracting a header and a message body from each of a plurality of messages maintained in a structured message store;
- a digester calculating a substantially unique hash code over at least part of the header and over the message body of each message;
- and
- a message deduper grouping the messages by the hash codes and identifying one such message as a unique message within each group.
A method for evaluating a structured message store for message redundancy, comprising:
- extracting a header and a message body from each of a plurality of messages maintained in a structured message store;
- calculating a substantially unique hash code over at least part of the header and over the message body of each message;
- and
- grouping the messages by the hash codes and identifying one such message as a unique message within each group.
An apparatus for evaluating a structured message store for message redundancy, comprising:
- means for extracting a header and a message body from each of a plurality of messages maintained in a structured message store;
- means for calculating a substantially unique hash code over at least part of the header and over the message body of each message;
- and
- means for grouping the messages by the hash codes and identifying one such message as a unique message within each group.
A system for culling duplicative messages maintained in a structured message store, comprising:
- a message extractor retrieving a plurality of messages maintained in a structured message store with each message comprising a header and a message body;
- a digester calculating a substantially unique hash code over at least part of the header and over the message body;
- a message deduper, comprising:
- a comparer comparing the hash codes for each message within each group;
- and
- a culling module culling each message having an hash code matching the hash code for at least one other message within the group and retaining one such non-culled message as a unique message.
A method for culling duplicative messages maintained in a structured message store, comprising:
- retrieving a plurality of messages maintained in a structured message store with each message comprising a header and a message body;
- calculating a substantially unique hash code over at least part of the header and over the message body;
- comparing the hash codes for each message within each group;
- and
- culling each message having an hash code matching the hash code for at least one other message within the group;
- and
- retaining one such non-culled message as a unique message.
An apparatus for culling duplicative messages maintained in a structured message store, comprising:
- means for retrieving a plurality of messages maintained in a structured message store with each message comprising a header and a message body;
- means for calculating a substantially unique hash code over at least part of the header and over the message body;
- means for comparing the hash codes for each message within each group;
- and
- means for culling each message having an hash code matching the hash code for at least one other message within the group;
- and
- means for retaining one such non-culled message as a unique message.
Dependencies are inferred from the claim text.