scholarly journals XML Schema Evolution Approach Assuring the Automatic Propagation to XML Documents

2006 ◽  
Vol 13D (5) ◽  
pp. 641-650
Author(s):  
Young-Gook Ra
Author(s):  
Giovanna Guerrini ◽  
Marco Mesiti

The large dynamicity of XML documents on the Web has created the need to adequately support structural changes and to account for the possibility of evolving and versioning the schemas describing XML document structures. This chapter discusses and compares the support for schema evolution and versioning provided by commercial systems as well as the most relevant approaches and prototypes proposed and developed by the research community.


2014 ◽  
Vol 599-601 ◽  
pp. 1683-1687
Author(s):  
Xia Zhou

In order to implement the mapping between XML documents and relational database, this paper proposes the mapping method based on XML documents and relational database. On the basis of keeping documents ’hierarchy, order and uniqueness, this method can mapping XML documents to the corresponding relational database very quickly and implement the reconstruction of XML documents.


Author(s):  
Joshua Amavi ◽  
Jacques Chabin ◽  
Mirian Halfeld-Ferrari ◽  
Pierre Réty
Keyword(s):  

Author(s):  
Ibrahim Dweib ◽  
Joan Lu

In this chapter, the research background is discussed. This includes XML model, XML query languages, XML schema languages, XML Application Program Interface, XML documents types, XML data storage approaches, relational database model, and the similarities and differences between XML model and relational database model. Finally the chapter summary is given.


Author(s):  
JIANGUO LU ◽  
JU WANG ◽  
SHENGRUI WANG

XML Schema matching problem can be formulated as follows: given two XML Schemas, find the best mapping between the elements and attributes of the schemas, and the overall similarity between them. XML Schema matching is an important problem in data integration, schema evolution, and software reuse. This paper describes a matching system that can find accurate matches and scales to large XML Schemas with hundreds of nodes. In our system, XML Schemas are modeled as labeled and unordered trees, and the schema matching problem is turned into a tree matching problem. We proposed Approximate Common Structures in trees, and developed a tree matching algorithm based on this concept. Compared with the traditional tree edit-distance algorithm and other schema matching systems, our algorithm is faster and more suitable for large XML Schema matching.


2014 ◽  
Vol 608-609 ◽  
pp. 401-407
Author(s):  
Su Jin Cai

Data exchange can make different information systems of enterprises realize data interaction. The objective establishing it is to keep information sharing and synchronization in enterprises, which can effectively use resources, improve the performance of the system and speeds up information circulation. Data exchange model is the core of realizing data exchange and it has a set of completed data storage and access mechanism. The paper verifies the mapping of relational schema and XML schema, the conversion of database and XML data, and XML document schema, and the paper constructs XSLT documents among different XML schemas, and explains and implements the algorithms of the conversion among different XML documents.


Author(s):  
Karen Coyle

Application profiles fulfill similar functions to other forms of metadata documentation, such as data dictionaries. The preference is for application profiles to be machine-readable and machine-actionable, so that they can provide validation and processing instructions, not unlike XML schema does for XML documents. These goals are behind the work of the Dublin Core Metadata Initiative in the work that has been done over the last decade to develop application profiles for data that uses the Resource Description Framework model of the World Wide Web Consortium.


Sign in / Sign up

Export Citation Format

Share Document