Data processing: database and file management or data structures – Database and file access – Preparing data for information retrieval
Reexamination Certificate
2009-08-17
2010-11-16
Fleurantin, Jean B. (Department: 2162)
Data processing: database and file management or data structures
Database and file access
Preparing data for information retrieval
C707S626000, C707S736000, C707S822000
Reexamination Certificate
active
07836054
ABSTRACT:
A system and method for processing a message store for near duplicate messages is provided. Metadata, content, and each attachment associated with messages are extracted. Near duplicate messages in the message store are identified. Compound digests taken of the metadata for, of the content contained in, and of the each attachment associated with each of the messages in the message store are compared. Each message having a compound digest not matching the compound digest of any other message is marked as unique and each message having a compound digest matching the compound digest of at least one other message is marked as an exact duplicate. Messages remaining unmarked and having similar content are grouped into sets that each includes one or more near duplicate messages. One of the near duplicate messages is designated as unique and each remaining near duplicate message in the set is designated as a near duplicate.
REFERENCES:
patent: 5056021 (1991-10-01), Ausborn
patent: 5477451 (1995-12-01), Brown et al.
patent: 5488725 (1996-01-01), Turtle et al.
patent: 5732265 (1998-03-01), Dewitt et al.
patent: 5799276 (1998-08-01), Komissarchik et al.
patent: 5867799 (1999-02-01), Lang et al.
patent: 5909677 (1999-06-01), Broder et al.
patent: 5950146 (1999-09-01), Vapnik
patent: 6026397 (2000-02-01), Sheppard
patent: 6119124 (2000-09-01), Broder et al.
patent: 6137911 (2000-10-01), Zhilyaev
patent: 6148102 (2000-11-01), Stolin
patent: 6173275 (2001-01-01), Caid et al.
patent: 6189002 (2001-02-01), Roitblat
patent: 6230155 (2001-05-01), Broder et al.
patent: 6240409 (2001-05-01), Aiken
patent: 6263348 (2001-07-01), Kathrow et al.
patent: 6292880 (2001-09-01), Mattis et al.
patent: 6349296 (2002-02-01), Broder et al.
patent: 6389433 (2002-05-01), Bolosky et al.
patent: 6421709 (2002-07-01), McCormick et al.
patent: 6446061 (2002-09-01), Doerre et al.
patent: 6453327 (2002-09-01), Nielsen
patent: 6480885 (2002-11-01), Olivier
patent: 6510406 (2003-01-01), Marchisio
patent: 6549957 (2003-04-01), Hanson et al.
patent: 6560597 (2003-05-01), Dhillon et al.
patent: 6598054 (2003-07-01), Schuetze et al.
patent: 6654739 (2003-11-01), Apte et al.
patent: 6658423 (2003-12-01), Pugh et al.
patent: 6675159 (2004-01-01), Lin et al.
patent: 6678705 (2004-01-01), Berchtold et al.
patent: 6701305 (2004-03-01), Holt et al.
patent: 6711585 (2004-03-01), Copperman et al.
patent: 6751628 (2004-06-01), Coady
patent: 7020645 (2006-03-01), Bisbee et al.
patent: 7035903 (2006-04-01), Baldonado
patent: 2002/0065892 (2002-05-01), Malik
patent: 2002/0120696 (2002-08-01), Mousseau et al.
patent: 2002/0122543 (2002-09-01), Rowen
patent: 2002/0184193 (2002-12-01), Cohen
patent: 2005/0148356 (2005-07-01), Ferguson et al.
patent: WO 2006/008733 (2006-01-01), None
D. Gourley, B. Totty, “HTTP, The Define Guide,” pp. 288-299, O'Reilly and Associates, Inc., Sebastopol, CA (2002).
Linhui, Jiang, “K-Mean Algorithm: Iterative Partitioning Clustering Algorithm,” http://www.cs.regina.ca/˜linhui/K—mean—algorithm.html, (2001), Computer Science Department, University of Regina, Saskatchewan, Canada.
Kanugo et al., “The Analysis of a Simple K-Means Clustering Algorithm,” pp. 100-109, Proc 16th annual symposium of computational geometry (May 2000).
Pelleg et al., “Accelerating Exact K-Means Algorithms With Geometric Reasoning,” School of Computer Science, Carnegie Mellon University, Pittsburgh (Jan. 2000).
Jain et al., “Data Clustering: A Review,” vol. 31, No. 3, ACM Computing surveys, (Sep. 1999).
R. Orfali et al., “Client/Server Survival Guide,” Ch. 19, John Wiley & Sons, Inc. (1999 3rd ed.).
Christina Yip Chung et al., “Thematic Mapping- From Unstructured Documents to Taxonomies,” CIKM'02, Nov. 4-9, 2002, pp. 608-610, ACM, McLean, Virginia, USA.
Hiroyuki Kawano, “Overview of Mondou Web Search Engine Using Text Mining and Information Visualizing Technologies,” IEEE, 2001, pp. 234-241.
James Osborn et al., “Justice: A Judicial Search Tool Using Intelligent Concept Extraction,” ICAIL-99, 1999, pp. 173-181, ACM.
Chen An et al., “Fuzzy Concept Graph and Application in Web Document Clustering,” 2001, pp. 101-106, IEEE.
Kawai Kenji
McDonald David T.
Fleurantin Jean B.
FTI Technology LLC
Inouye Patrick J. S.
Nguyen Phong
Smith Scott E.
LandOfFree
System and method for processing a message store for near... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for processing a message store for near..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for processing a message store for near... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4152447