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:
Sep. 18, 2012

Filed:

Sep. 06, 2011
Applicants:

Bernhard J. Klingenberg, Morgan Hill, CA (US);

Steven J. Davis, Austin, TX (US);

David G. Van Hise, Tucson, AZ (US);

James E. Gruener, Topsfield, MA (US);

Alisa Neeman, Santa Cruz, CA (US);

Emil R. Nunez, Cooper City, FL (US);

Nathan L. Williams, Boston, MA (US);

Inventors:

Bernhard J. Klingenberg, Morgan Hill, CA (US);

Steven J. Davis, Austin, TX (US);

David G. Van Hise, Tucson, AZ (US);

James E. Gruener, Topsfield, MA (US);

Alisa Neeman, Santa Cruz, CA (US);

Emil R. Nunez, Cooper City, FL (US);

Nathan L. Williams, Boston, MA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 17/30 (2006.01);
U.S. Cl.
CPC ...
Abstract

A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships. Redundant attributes among the relationships can thus be detected.


Find Patent Forward Citations

Loading…