The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jun. 07, 2011

Filed:

Feb. 10, 2004
Applicants:

Herry Sutanto, Kirkland, WA (US);

Jamie Wakeam, Redmond, WA (US);

Jerome Turner, Redmond, WA (US);

Richard Duncan, Kirkland, WA (US);

Sashi Raghupathy, Redmond, WA (US);

Timothy H. Kannapel, Bellevue, WA (US);

Zoltan Szilagyi, Bellevue, WA (US);

Inventors:

Herry Sutanto, Kirkland, WA (US);

Jamie Wakeam, Redmond, WA (US);

Jerome Turner, Redmond, WA (US);

Richard Duncan, Kirkland, WA (US);

Sashi Raghupathy, Redmond, WA (US);

Timothy H. Kannapel, Bellevue, WA (US);

Zoltan Szilagyi, Bellevue, WA (US);

Assignee:

Microsoft Corporation, Redmond, WA (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 7/00 (2006.01);
U.S. Cl.
CPC ...
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.


Find Patent Forward Citations

Loading…