Tree-Branch Symbiosis Algorithm for XML Parsing

Abstract

The extensible markup language XML has become the de facto standard for information representation and
interchange on the Internet. As XML becomes widespread it is critical for application developers to understand the
operational and performance characteristics of XML processing. The processing of XML documents has been regarded
as the performance bottleneck in most systems and applications. XML parsing is a core operation performed on an XML
document for it to be accessed and manipulated. Using the tree branch symbiosis algorithms a XML document are
parsed and its elements are stored in a single table of database. The nodes need not be read according to their
hierarchical structure. In this paper, we proposed the hash function when applied on the database would speed up the
access time hence improve the XML processing performance.