XML processing by Tree-Branch symbiosis algorithm

Abstract

The processing of XML documents has been regarded as the performance bottleneck in most systems and applications. A number of techniques have been developed to improve the performance of XML processing, ranging from the schema-specific model to the streaming-based model to the hardware acceleration. These methods only address parsing and scheduling the XML document in memory [1]. Although there are a few of works have discussed the efficiency of the data read-write between XML and Relational Database, they constructed the DOM and reading relational database synchronously and neglected the differences of pace between DOM (a general format of XML document in memory) building and relational database reading[2], which will reduce the performance of the entire system. In this paper, we present a processing model for storing and building XML document in data transfer between XML and relational database. In this model, a XML document is parsed and its elements are stored in a single table of database instead, it is not necessary to read the nodes according to their hierarchical structure, thus leveraging the workload of DOM building to memory by the algorithm called Tree-Branch inter growth. To show the feasibility and effectiveness of our approaches, we present our C# implementation of XML processing in this paper. Our empirical study shows our algorithm can improve the XML document processing performance significantly.