Data processing: database and file management or data structures – Database and file access – Preparing data for information retrieval
Reexamination Certificate
2007-07-31
2010-12-21
Jalil, Neveen Abel (Department: 2165)
Data processing: database and file management or data structures
Database and file access
Preparing data for information retrieval
Reexamination Certificate
active
07856437
ABSTRACT:
To provide a data store, nodes representing respective chunks of files are stored in a predefined structure that defines relationships among the nodes, where the files are divided into the chunks. The nodes are collected into plural groups stored in persistent storage, where some of the nodes are collected into a particular one of the groups according to a locality relationship of the some of the nodes.
REFERENCES:
patent: 5727081 (1998-03-01), Burges et al.
patent: 5873097 (1999-02-01), Harris
patent: 5970496 (1999-10-01), Katzenberger
patent: 6584459 (2003-06-01), Chang
patent: 6654743 (2003-11-01), Hogg
patent: 6721275 (2004-04-01), Rodeheffer
patent: 6925470 (2005-08-01), Sangudi et al.
patent: 7058644 (2006-06-01), Patchet
patent: 7062507 (2006-06-01), Wang
patent: 7082505 (2006-07-01), Chen
patent: 7281006 (2007-10-01), Hsu
patent: 7346734 (2008-03-01), Chen et al.
patent: 7487138 (2009-02-01), Borthakur et al.
patent: 2003/0145093 (2003-07-01), Oren
patent: 2005/0091234 (2005-04-01), Hsu
patent: 2005/0097313 (2005-05-01), Bolosky et al.
patent: 2006/0020662 (2006-01-01), Robinson
patent: 2006/0059171 (2006-03-01), Borthakur
patent: 2006/0106857 (2006-05-01), Lillibridge et al.
patent: 2006/0155735 (2006-07-01), Traut
patent: 2006/0253476 (2006-11-01), Roth
patent: 2006/0282475 (2006-12-01), Suermondt et al.
patent: 2007/0124415 (2007-05-01), Lev-Ran
patent: 2007/0162462 (2007-07-01), Zhang et al.
patent: 2009/0037456 (2009-02-01), Kirshenbaum
“Discovering Large Dense Subgraphs in Massive Graphs”, David Gibson et al. 2005, pp. 721-732. http://portal.acm.org/citation.cfm?id=1083592.1083676&coll=ACM&dl=ACM&CFID=83256907&CFTOKEN=90756675.
“h-Assignent of Simplical complexes and reverse search”, Sonoko Moriyama et al. , vol. 154, issue 3, 2006, pp. 594-597 http://www.sciencedirect.com/science?—ob=ArticleURL&—udi=B6TYW-4HDP6VR-2&—user=2502287&—coverDate=03%2F01%2F2006&—rdoc=1&—fmt=high&—orig=search&—sort=d&—docanchor=&view=c&—searchStrld=1284135091&—rerunOrigin=google&—acct=C0000.
U.S. Appl. No. 11/888,154, Notice of Allowance dated Mar. 30, 2010, pp. 1-13.
K. Eshghi et al., U.S. Appl. No. 11/546,235, entitled “Producing Representative Hashes for Segments of a File,” filed Oct. 11, 2006, pp. 1-18, Figs. 1-3.
M. Lillibridge et al., U.S. Appl. No. 10/988,415, entitled “Method and System for Assured Document Retention,” filed Nov. 12, 2004, pp. 1-29, Figs. 1-13.
G. H. Forman et al., U.S. Appl. No. 11/156,955, entitled “Identification of Files with Similar Content,” filed Jun. 20, 2005, pp. 1-19, Figs. 1-5.
K. Eshghi et al., U.S. Appl. No. 11/345,834, entitled “Segmentation of Data Sequence,” filed Feb. 1, 2006, pp. 1-24, Figs. 1A-9.
A.Z. Broder et al., “Min-Wise Independent Permutations,” pp. 1-36 (1998).
K. Eshghi et al., “A Framework for Analyzing and Improving Content-Based Chunking Algorithms,” pp. 1-10 (2005).
http://en.wikipedia.org/wiki/Hash—function, definition for hash function, pp. 1-4 (at least as early as Jul. 27, 2006).
U.S. Appl. No. 11/514,634, entitled “Data Structure Representation Using Hash-Based Directed Acyclic Graphs and Related Method,” filed Sep. 1, 2006, pp. 1-41, Figs. 1-18.
U.S. Appl. No. 11/888,154, Non-Final Rejection dated Sep. 3, 2009, pp. 1-16 and attachments.
Abel Jalil Neveen
Buckingham Kellye D
Hewlett--Packard Development Company, L.P.
LandOfFree
Storing nodes representing respective chunks of files in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Storing nodes representing respective chunks of files in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Storing nodes representing respective chunks of files in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4191036