Title :
Determining the complexity of XML documents
Author :
Qureshi, Mustafa H. ; Samadzadeh, M.H.
Author_Institution :
PeopleSoft Inc., Denver, CO, USA
Abstract :
The eXtensible Markup Language (XML) is a recommendation of the World Wide Web Consortium (W3C). It is a public format and has been widely adopted as a means of interchanging information among computer programs. With XML documents being typically large, we need to have ways of improving their ease of use and maintainability by keeping their complexity low. This research focused on different ways of determining the complexity of XML documents based on various syntactic and structural aspects of these documents. An XML document represents a generic tree. XML documents are pre-order traversal of equivalent XML trees. One of the important findings was that documents with higher nesting levels had more weights and could therefore be viewed as being more complicated as compared to the documents with lower nesting levels. Another important finding was related to document type definitions (DTDs). DTDs can be expressed as regular expressions providing means for calculating quantitative values.
Keywords :
Internet; XML; software maintenance; software metrics; tree data structures; type theory; DTD; W3C; World Wide Web Consortium; XML document; XML trees; computer programs; document type definitions; eXtensible Markup Language; preorder traversal; software complexity measurement; software metrics; Computer science; Data models; HTML; Markup languages; SGML; Software maintenance; Software measurement; Software metrics; Web sites; XML;
Conference_Titel :
Information Technology: Coding and Computing, 2005. ITCC 2005. International Conference on
Print_ISBN :
0-7695-2315-3
DOI :
10.1109/ITCC.2005.126