XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
CPI: constraints-preserving inlining algorithm for mapping XML DTD to relational schema
Data & Knowledge Engineering - ER2000
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
From XML Schema to Relations: A Cost-Based Approach to XML Storage
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A comprehensive solution to the XML-to-relational mapping problem
Proceedings of the 6th annual ACM international workshop on Web information and data management
Redundancy, dependencies and normal forms for XML databases
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
XShreX: Maintaining Integrity Constraints in the Mapping of XML Schema to Relational
DEXA '06 Proceedings of the 17th International Conference on Database and Expert Systems Applications
Efficient schema-based XML-to-Relational data mapping
Information Systems
RRXS: redundancy reducing XML storage in relations
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Mapping DTDs to relational schemas with semantic constraints
Information and Software Technology
XPEV: a storage model for well-formed XML documents
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
Hi-index | 0.00 |
The eXtensible Markup Language (XML) has recently emerged as a standard for data representation and interchange on the web. Based on its popularity used in most application, the critical issues are to store and to query XML data to exploit the full power of this technology. Since relational database is widely used technology for storing and querying, therefore replacing it with pure XML database is not a good choice and very expensive process. It is thus crucial to map XML data into relational data and this process is one that occurs frequently. Many existing methods exist in the literature, and defining what the best mapping method is explicitly important. The intention of this paper is to the existing mapping methods in terms of generating good relational schema. At the end a new mapping method is developed to overcome the limitations the limitations and shows that it is efficient in terms of removing relation redundancy.