Data processing: database and file management or data structures – Database and file access – Preparing data for information retrieval
Reexamination Certificate
2011-06-07
2011-06-07
Abel-Jalil, Neveen (Department: 2165)
Data processing: database and file management or data structures
Database and file access
Preparing data for information retrieval
C382S187000
Reexamination Certificate
active
07958132
ABSTRACT:
Systems and methods for processing data transform a first data structure (e.g., a hierarchical data structure) into a second data structure (e.g., using a parsing system), wherein the second data structure includes a first set of leaf nodes under a first ancestor node (additional sets of leaf nodes and/or ancestor nodes also may be defined in the second data structure). One or more potential candidate nodes for the ancestor nodes may be identified based, at least in part, on the ancestor nodes from the first data structure associated with the leaf nodes grouped under the new ancestor nodes. In at least some examples, the leaf nodes grouped under a new ancestor node will “vote” for their original ancestor node, and the node receiving the most “votes,” in at least some instances, will be reused as the corresponding ancestor node in the second data structure.
REFERENCES:
patent: 5394484 (1995-02-01), Casey et al.
patent: 5454046 (1995-09-01), Carman, II
patent: 5559897 (1996-09-01), Brown et al.
patent: 5581634 (1996-12-01), Heide
patent: 5680480 (1997-10-01), Beernink et al.
patent: 5710916 (1998-01-01), Barbara et al.
patent: 5911013 (1999-06-01), Taniishi
patent: 5991441 (1999-11-01), Jourjine
patent: 6092064 (2000-07-01), Aggarwal et al.
patent: 6112173 (2000-08-01), Hirayama
patent: 6285786 (2001-09-01), Seni et al.
patent: 6377259 (2002-04-01), Tenev et al.
patent: 6556983 (2003-04-01), Altschuler et al.
patent: 6711585 (2004-03-01), Copperman et al.
patent: 6714939 (2004-03-01), Saldanha et al.
patent: 6785673 (2004-08-01), Fernandez et al.
patent: 2002/0073119 (2002-06-01), Richard
patent: 2002/0085002 (2002-07-01), Lamping et al.
patent: 2002/0191452 (2002-12-01), Fujihara
patent: 2003/0130976 (2003-07-01), Au
patent: 2003/0190074 (2003-10-01), Loudon et al.
patent: 2003/0215138 (2003-11-01), Raghupathy et al.
patent: 2003/0215139 (2003-11-01), Shilman et al.
patent: 2003/0215145 (2003-11-01), Shilman et al.
patent: 2004/0088652 (2004-05-01), Abe et al.
patent: 2004/0260676 (2004-12-01), Douglis et al.
patent: 2005/0028091 (2005-02-01), Bordawekar et al.
patent: 2006/0050962 (2006-03-01), Geiger et al.
patent: 0 902 379 (1999-03-01), None
“Recognizing Mathematical Expressions using Tree Transformation,” by Zanibbi et al, IN: IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, No. 11, Nov. (2002). Available at IEEE Xplore.
U.S. Appl. No. 10/646,472 as filed on Aug. 21, 2003 (Richard Duncan, et al.).
U.S. Appl. No. 10/646,474 as filed on Aug. 21, 2003 (Richard Duncan, et al.).
U.S. Appl. No. 10/646,473 as filed on Aug. 21, 2003 (Richard Duncan, et al.).
U.S. Appl. No. 10/644,900 as filed on Aug. 21, 2003 (Richard Duncan, et al.).
Duncan Richard
Kannapel Timothy H.
Raghupathy Sashi
Sutanto Herry
Szilagyi Zoltan
Abel-Jalil Neveen
Kinsaul Daniel
Microsoft Corporation
Shook Hardy & Bacon L.L.P.
LandOfFree
Voting based scheme for electronic document node reuse does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Voting based scheme for electronic document node reuse, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Voting based scheme for electronic document node reuse will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2625838