{A} {DTD} complexity metric

  • McFadyen R
  • Chen Y
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 1

    Citations

    Citations of this article.

Abstract

In this paper, we propose a metric for measuring the complexity of
a DTD. For the same purpose, different designers may create different
DTDs. A complexity metric can assist us to evaluate and compare their
different merits. Through the recognition of strongly connected components,
the metric accommodates the recursive relationship of elements in
a DTD. The metric presented here can be expressed in a simple and
informal way involving the number of elements, connectors, appearance
indicators and back edges.

Author-supplied keywords

  • DTD
  • XML
  • complexity
  • cyclomatic
  • metric

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

  • PUI: 38291940
  • SGR: 1442351216
  • SCOPUS: 2-s2.0-1442351216
  • ISBN: 0-88986-345-8

Authors

  • Ron McFadyen

  • Yangjun Chen

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free