发明授权
- 专利标题: Complexity metrics for data schemas
- 专利标题(中): 数据模式的复杂性指标
-
申请号: US11376946申请日: 2006-03-16
-
公开(公告)号: US07861229B2公开(公告)日: 2010-12-28
- 发明人: Ralf Lammel , Stanislav Kitsis , David L. Remy , Priyamvadha P. Lakshminarayanan
- 申请人: Ralf Lammel , Stanislav Kitsis , David L. Remy , Priyamvadha P. Lakshminarayanan
- 申请人地址: US WA Redmond
- 专利权人: Microsoft Corporation
- 当前专利权人: Microsoft Corporation
- 当前专利权人地址: US WA Redmond
- 代理机构: Workman Nydegger
- 主分类号: G06F9/44
- IPC分类号: G06F9/44
摘要:
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.
公开/授权文献
- US20070220486A1 Complexity metrics for data schemas 公开/授权日:2007-09-20