Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-04-25
2006-04-25
Amsbury, Wayne (Department: 2161)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C709S201000
Reexamination Certificate
active
07035876
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.
REFERENCES:
patent: 5056021 (1991-10-01), Ausborn
patent: 5477451 (1995-12-01), Brown et al.
patent: 5488725 (1996-01-01), Turtle et al.
patent: 5799276 (1998-08-01), Komissarchik et al.
patent: 5860136 (1999-01-01), Fenner
patent: 5862325 (1999-01-01), Reed et al.
patent: 5867799 (1999-02-01), Lang et al.
patent: 6026397 (2000-02-01), Sheppard
patent: 6137911 (2000-10-01), Zhilyaev
patent: 6148102 (2000-11-01), Stolin
patent: 6167368 (2000-12-01), Wacholder
patent: 6173275 (2001-01-01), Caid et al.
patent: 6292880 (2001-09-01), Beguelin et al.
patent: 6314425 (2001-11-01), Serbinis et al.
patent: 6446061 (2002-09-01), Doerre et al.
patent: 6510406 (2003-01-01), Marchisio
patent: 6560597 (2003-05-01), Dhillon et al.
patent: 6598054 (2003-07-01), Schuetze et al.
patent: 6658423 (2003-12-01), Pugh et al.
patent: 6675159 (2004-01-01), Lin et al.
patent: 6701305 (2004-03-01), Holt et al.
patent: 6711585 (2004-03-01), Copperman et al.
patent: 2002/0038296 (2002-03-01), Margolus et al.
patent: 2002/0112008 (2002-08-01), Christenson et al.
patent: 2002/0184193 (2002-12-01), Cohen
D. Gourley, B. Totty, “Http, The Definite 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.
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.
Amsbury Wayne
Attenex Corporation
Inouye Patrick J. S.
LandOfFree
System and method for evaluating a structured message store... 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 evaluating a structured message store..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for evaluating a structured message store... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3594468