Complexity metrics for data schemas
US7861229B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 16, 2006 |
| Grant date | Dec 28, 2010 |
| Priority date | — |
| Expiry date | Oct 28, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/10
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A schema code complexity analysis architecture that computes complexity data for output to a code designer. The complexity data can be in the form of a number and/or complexity level. A schema component is provided for processing schema code, and a metrics component, for outputting a complexity value based on complexity of the schema code. In one implementation, the schema code is based on an XML schema, and the metrics component employs a newly-defined variation of a McCabe cyclomatic complexity metric to determine the complexity value. The decisions employed for computing schema complexity can include choices, occurrence constraints, element references to substitution groups, type references to types that are extended or restricted, a multiplicity of root element declarations, and nillable elements.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.