Computer-implemented system and method for selecting documents for review

• US 9,798,798 B2
• Filed: 07/01/2016
• Issued: 10/24/2017
• Est. Priority Date: 03/19/2001
• Status: Expired due to Term

• Current Assignee: Nuix North America Inc. (Nuix Ltd.)
• Original Assignee: FTI Consulting Technology LLC (FTI Consulting Incorporated)
• Inventors: Kawai, Kenji, McDonald, David T.
• Primary Examiner(s): NGUYEN, PHONG H
• Application Number:
  US15/201,197
• Publication Number:
  US 20160314190A1
• Time in Patent Office: 480 Days
• Field of Search: 707626, 707664, 707692, 707737, 707752
• CPC Class Codes: G06F 11/1453 using de-duplication of the data
• CPC Class Codes: G06F 16/1748 De-duplication implemented within the file system, e.g. based on file segments de-duplication techniques in storage systems for the management of data blocks G06F3/0641
• CPC Class Codes: G06F 16/244 Grouping and aggregation
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/26 Visual data mining; Browsing structured data
• CPC Class Codes: G06F 16/285 Clustering or classification
• CPC Class Codes: G06F 16/93 Document management systems
• CPC Class Codes: G06Q 10/107 Computer-aided management of electronic mailing [e-mailing]
• CPC Class Codes: H04L 51/08 Annexed information, e.g. attachments
• CPC Class Codes: H04L 51/216 Handling conversation history, e.g. grouping of messages in sessions or threads
• CPC Class Codes: H04L 51/42 Mailbox-related aspects, e.g. synchronisation of mailboxes
• CPC Class Codes: Y10S 707/99937 Sorting
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99944 Object-oriented database structure
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99948 Application of database or data structure, e.g. distributed, multimedia, or image

Abstract

A computer-implemented system and method for selecting documents for review is provided. A master array of messages and topics for the messages is generated. The messages in the master array are sorted by the topics and the sorted messages are processed. During processing, each message in the master array is identified as unique, duplicate, or near duplicate. The unique messages are extracted from the duplicate and near duplicate messages, and entered into a log by creating a log entry for each of the unique messages. Each log entry includes a source of and identification information for one of the unique messages. The unique messages are then provided for document review.

Claims

1. A computer-implemented system for selecting documents for review, comprising:

a master array comprising messages and topics of the messages; and

a processor to execute modules, comprising;

a sort module to sort the messages in the master array by the topics;

a message processing module to process the sorted messages by identifying each message in the master array as unique, duplicate, or near duplicate, by extracting the unique messages from the duplicate and near duplicate messages, and by entering the unique messages into a log by creating a log entry for each of the unique messages, wherein each log entry comprises a source of and identification information for one of the unique messages;

a message counter to determine a maximum number of the messages to be processed during a single pass;

a pass determination module to determine a number of the passes required for processing the messages based on the maximum number of messages via the following equation;

2. A system according to claim 1, wherein the delivery module provides the duplicate and near duplicate messages for one or more of the unique messages during the document review.

3. A system according to claim 1, further comprising:

a reference module to cross reference in the log each unique message with the duplicate and near duplicate messages for that unique message.

4. A system according to claim 1, further comprising:

a holding area for the unique messages extracted from the duplicate and near duplicate messages.

5. A system according to claim 1, wherein the messages are stored in one or more original message stores.

6. A system according to claim 5, further comprising:

a point-to-point keyed collection storing cross-references between an identifier of the original message store for each message and an identifier of a newly created folder into which that message is placed after processing.

7. A system according to claim 1, further comprising:

an identification module to identify at least one of the duplicate and near duplicate messages for a common unique message as having a longest thread.

8. A system according to claim 7, further comprising:

a thread identification module to identify the duplicate or near duplicate message with the longest thread by identifying a number of thread markers for each of the duplicate and near duplicate messages for the common unique message and sorting the duplicate and near duplicate messages in order of increasing number of the thread markers.

9. A computer-implemented method for selecting documents for review, comprising:

generating a master array comprising messages and topics of the messages;

sorting the messages in the master array by the topics;

processing the sorted messages in one or more passes, comprising;

identifying each message in the master array as unique, duplicate, or near duplicate; and

extracting the unique messages from the duplicate and near duplicate messages and entering the unique messages into a log by creating a log entry for each of the unique messages, wherein each log entry comprises a source of and identification information for one of the unique messages;

determining a maximum number of the messages to be processed during a pass;

determining a number of the passes required for processing the messages based on the maximum number of messages via the following equation;

10. A method according to claim 9, further comprising:

providing the duplicate and near duplicate messages for one or more of the unique messages during the document review.

11. A method according to claim 9, further comprising:

cross referencing in the log each unique message with the duplicate and near duplicate messages for that unique message.

12. A method according to claim 9, further comprising:

creating a holding area for the unique messages extracted from the duplicate and near duplicate messages.

13. A method according to claim 9, wherein the messages are stored in one or more original message stores.

14. A method according to claim 13, further comprising:

generating a point-to-point keyed collection storing cross-references between an identifier of the original message store for each message and an identifier of a newly created folder into which that message is placed after processing.

15. A method according to claim 9, further comprising:

identifying at least one of the duplicate and near duplicate messages for a common unique message as having a longest thread.

16. A method according to claim 15, further comprising:

identifying the duplicate or near duplicate message with the longest thread, comprising;

identifying a number of thread markers for each of the duplicate and near duplicate messages for the common unique message; and

sorting the duplicate and near duplicate messages in order of increasing number of the thread markers.