With the introduction of XML (eXtensible Mark-up Language) in the last decade, as a standard for the representation and exchange of data, and rapid penetration into varied industries, the eventual rise of XML document storage mechanisms like Native XML Databases (NXDs), is not surprising. NXDs are well suited to support a variety of transaction processing behaviors. In this paper, we explore current XML standards, languages, and tools that help complement native XML databases. We will contrast NXDs with alternative XML storage and retrieval mechanisms, support for current XML standards. The paper will expose purported limitations with NXD solutions, specifically surrounding integrity constraints, and performance of very large XML collections in high volume transaction environments. We will propose an architectural framework, Nextgen, for NXDs that offers features and performance found in traditionally large RDBMSs. We will show that XML databases can be useful in representing semi-structured data and allowing adaptability of environments with rapidly changing data structures.
|School:||California State University, Long Beach|
|School Location:||United States -- California|
|Source:||MAI 48/02M, Masters Abstracts International|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be