Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A nested set approach for building recursive XML tree structures from relational databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

Extensible Markup Language (XML) is a popular format for the interchange of data between disparate, heterogeneous systems. However, when hierarchical data is exchanged between relational database management systems (RDBMSs), the full expressive power of XML is often ignored. A major factor is the inability of RDBMSs to manipulate hierarchical data, such as an organization chart. We address this by replacing traditional link tables with a nested set approach, which has several benefits: SQL queries may be used to extract data subtrees and perform aggregate functions on them; nested set data may be converted to and from the hierarchical XML form; and the hierarchical structure is explicitly included with the data. It is important for servers to be able to manipulate subtrees quickly and efficiently in order to fill data requests from their clients. In this paper, we adapt a nested set approach to include recursive, hierarchical XML data. An algorithm is presented to use nested set information to restore the original XML document without requiring the entire tree to be reconstructed by a procedural language, and it is tested and evaluated with a prototype application. Our approach allows two relational systems to efficiently exchange subtree data as XML hierarchical data instead of merely using XML as a wrapper around relational data.

Published in:

Network Science Workshop (NSW), 2011 IEEE

Date of Conference:

22-24 June 2011