XML (Extensible Mark up language) is emerging as a tool for representing and exchanging data over the
internet. When we want to store and query XML data, we can use two approaches either by using native
databases or XML enabled databases. In this paper we deal with XML enabled databases. We use
relational databases to store XML documents. In this paper we focus on mapping of XML DTD into
relations. Mapping needs three steps: 1) Simplify Complex DTD’s 2) Make DTD graph by using simplified
DTD’s 3) Generate Relational schema. We present an inlining algorithm for generating relational schemas
from available DTD’s. This algorithm also handles recursion in an XML document.
%0 Journal Article
%1 noauthororeditor
%A Suri1, Dr. Pushpa
%A Sharma2, Divyesh
%D 2013
%J International Journal on Web Service Computing (IJWSC)
%K and security service services web
%N No.2
%R 10.5121/ijwsc.2013.4202
%T SCHEMA BASED STORAGE OF XML DOCUMENTS IN
RELATIONAL DATABASES
%U https://airccse.org/journal/jwsc/papers/4123ijwsc02.pdf
%V Vol.4
%X XML (Extensible Mark up language) is emerging as a tool for representing and exchanging data over the
internet. When we want to store and query XML data, we can use two approaches either by using native
databases or XML enabled databases. In this paper we deal with XML enabled databases. We use
relational databases to store XML documents. In this paper we focus on mapping of XML DTD into
relations. Mapping needs three steps: 1) Simplify Complex DTD’s 2) Make DTD graph by using simplified
DTD’s 3) Generate Relational schema. We present an inlining algorithm for generating relational schemas
from available DTD’s. This algorithm also handles recursion in an XML document.
@article{noauthororeditor,
abstract = {XML (Extensible Mark up language) is emerging as a tool for representing and exchanging data over the
internet. When we want to store and query XML data, we can use two approaches either by using native
databases or XML enabled databases. In this paper we deal with XML enabled databases. We use
relational databases to store XML documents. In this paper we focus on mapping of XML DTD into
relations. Mapping needs three steps: 1) Simplify Complex DTD’s 2) Make DTD graph by using simplified
DTD’s 3) Generate Relational schema. We present an inlining algorithm for generating relational schemas
from available DTD’s. This algorithm also handles recursion in an XML document.},
added-at = {2022-08-18T07:44:20.000+0200},
author = {Suri1, Dr. Pushpa and Sharma2, Divyesh},
biburl = {https://www.bibsonomy.org/bibtex/21ec3621f08a870301c7e1c9ce98431fd/ijwsc},
doi = {10.5121/ijwsc.2013.4202},
interhash = {4f8959840e1af20190bccb9cb17751a0},
intrahash = {1ec3621f08a870301c7e1c9ce98431fd},
journal = {International Journal on Web Service Computing (IJWSC)},
keywords = {and security service services web},
language = {english},
month = {June},
number = {No.2},
timestamp = {2022-08-18T07:44:20.000+0200},
title = {SCHEMA BASED STORAGE OF XML DOCUMENTS IN
RELATIONAL DATABASES
},
url = {https://airccse.org/journal/jwsc/papers/4123ijwsc02.pdf},
volume = {Vol.4},
year = 2013
}