By Topic

RIAL: Redundancy Reducing Inlining Algorithm to Map XML DTD to Relations

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
$33 $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)
Amir Jahangard Rafsanjani ; Sharif Univ. of Technol., Kish Island, Iran ; Seyed-Hassan Mirian-Hosseinabadi

XML has emerged as a common standard for data exchange over the World Wide Web. One way to manage XML data is to use the power of relational databases for storing and querying them. So the hierarchical XML data should be mapped into flat relational structure. In this paper we propose an algorithm which maps DTD to relational schema and as well as content and structure it preserves the functional dependencies during the mapping process in order to produce relations with less redundancy. This is done by categorizing functional dependencies and introducing four rules to be applied to the relations created by the hybrid inlining algorithm according to each category. These rules will reduce redundancies by moving attributes, creating relations, introducing keys and preserving functional dependencies.

Published in:

Computational Intelligence for Modelling Control & Automation, 2008 International Conference on

Date of Conference:

10-12 Dec. 2008