XML Transformations Research Articles

ATOP

The TEI XSL Stylesheets codebase is a tool that tackles the transformation of TEI XML documents to and from various formats. This includes the crucial activity of generating schemas from TEI ODD, the TEI XML–conformant specification format that allows one to write a schema language (for example, TEI P5 itself is written in ODD) or to customize TEI P5 using a literate programming approach. Because of the difficulties of maintaining this current set of stylesheets, a task force was created with the mission of developing, from scratch, an ODD processor that reads in a series of one or more TEI ODD customization files, merges them with a TEI language (likely, but not necessarily, TEI P5 itself), and generates RELAX NG and Schematron schemas. This paper presents a rationale for this task and the initial steps of this work.

Mapping of extensible markup language-to-ontology representation for effective data integration

<span lang="EN-US">Extensible markup language (XML) is well-known as the standard for data exchange over the Internet. It is flexible and has high expressibility to express the relationship between the data stored. Yet, the structural complexity and the semantic relationships are not well expressed. On the other hand, ontology models the structural, semantic and domain knowledge effectively. By combining ontology with visualization effect, one will be able to have a closer view based on respective user requirements. In this paper, we propose several mapping rules for the transformation of XML into ontology representation. Subsequently, we show how the ontology is constructed based on the proposed rules using the sample domain ontology in University of Wisconsin-Milwaukee (UWM) and mondial datasets. <br /> We also look at the schemas, query workload, and evaluation, to derive the extended knowledge from the existing ontology. The correctness of the ontology representation has been proven effective through supporting various types of complex queries in simple protocol and resource description framework query language (SPARQL) language.</span>

Model-based XML to Relational Database Mapping Choices

Extensible Markup Language (XML) technology is widely used for data exchange and data representation in both online and offline mode. This structured format language able to be transformed into other formats and share information across platforms. XML is simple; however, it is designed to accommodate changes. For this paper, a study on transformation of XML document into relational database is conducted. Crucial part of this process is how to maintain the hierarchy and relationships between data in the document into database. Approaches that are discussed in this paper each uses own unique way of data storing technique and database design. Therefore, each algorithm is assessed with three datasets constitute of small, medium and large size XML file. The efficiency of the algorithms is being tested on time taken for data storing and query execution process. At the end of the evaluation, we discuss factors that affect algorithm performance and present suggestions to improve mapping scheme for future works

Transforming XML to RDF(S) with Temporal Information

The Resource Description Framework (RDF) is a model for representing resources on the Web. With the widespread acceptance of RDF in various applications (e.g., knowledge graph), a huge amount of RDF data is being proliferated. Therefore, transforming legacy data resources into RDF data is of increasing importance. In addition, time information widely exists in various real-world applications and temporal Web data has been represented and managed in the context of temporal XML. In this paper, we concentrate on transformation of temporal XML (eXtensible Markup Language) to temporal RDF data. We propose the mapping rules and mapping algorithms which can transform the temporal XML Schema and document into temporal RDF Schema and temporal RDF triples, respectively. We illustrate our mapping approach with an example and implement a prototype system. It is demonstrated that our mapping approach is valid.

QuantNet a Database-Driven Online Repository of Scientific Information

In this study a framework for an online database-driven repository of information – QuantNet – is presented. QuantNet is aimed at easing the process of web publishing for those who are unfamiliar with technical details and markup languages. At the same time advanced users are provided with easy user style markup tools while flexible and trouble-free application administration is being a top priority. In this realm a special emphasis is put on the construction of a metalanguage containing only simplest possible structures. Different stages – from low-level text processing via Atox to the transformation of XML documents via XSLT, PHP and mySQL – are thoroughly described. The motivation for further possible application extensions like DTD or preliminary document check, based on analytic grammar form, is provided.

Health Information Exchange for Continuity of Maternal and Neonatal Care Supporting: A Proof-of-Concept Based on ISO Standard.

Background Around the world, people receive care at various institutions; therefore, clinical information is recorded either on paper or distributed on different information systems with reduced capabilities for sharing data. One approach to handling the complex nature of the health information systems and making it interoperable is the two-level modeling, and the ISO 13606 standard is an option to support this model. A regionally governed EHR program in Brazil proposed to use the ISO 13606 standard and archetypes. This program includes an EHR repository for consolidating the longitudinal electronic record of patients' health. Objective This article aims to present the results and lessons learned from a proof-of-concept (POC) for integrating the Maternal and Neonatal Healthcare Information System (SISMater) developed by the Federal University of Minas Gerais (UFMG) with the EHR system developed by the Department of Healthcare for the State of Minas Gerais (SES/MG). Methods The design of the architecture and software development were driven by the content to be exchanged between the SISMater system and the EHR system and the usage of XML transformation to translate an ISO 13606 EHR extract and vice versa. This POC did not include tests related to revision objects according to ISO 13606 reference model. Results The software architecture and software components required for this POC were proposed and tested. The EHR system validated the syntax and semantic and persisted the extract in the EHR repository. Complete results can be accessed at https://github.com/pocppsus/repository. Conclusion The approach for using XML transformations could make easier the process for ISO 13606 noncompliant EMR systems to exchange EHR data with the SES/MG EHR system.

Transforming XML documents to OWL ontologies: A survey

The aims of XML data conversion to ontologies are the indexing, integration and enrichment of existing ontologies with knowledge acquired from these sources. The contribution of this paper consists in providing a classification of the approaches used for the conversion of XML documents into OWL ontologies. This classification underlines the usage profile of each conversion method, providing a clear description of the advantages and drawbacks belonging to each method. Hence, this paper focuses on two main processes, which are ontology enrichment and ontology population using XML data. Ontology enrichment is related to the schema of the ontology (TBox), and ontology population is related to an individual (Abox). In addition, the ontologies described in these methods are based on formal languages of the Semantic Web such as OWL (Ontology Web Language) or RDF (Resource Description Framework). These languages are formal because the semantics are formally defined and take advantage of the Description Logics. In contrast, XML data sources are without formal semantics. The XML language is used to store, export and share data between processes able to process the specific data structure. However, even if the semantics is not explicitly expressed, data structure contains the universe of discourse by using a qualified vocabulary regarding a consensual agreement. In order to formalize this semantics, the OWL language provides rich logical constraints. Therefore, these logical constraints are evolved in the transformation of XML documents into OWL documents, allowing the enrichment and the population of the target ontology. To design such a transformation, the current research field establishes connections between OWL constructs (classes, predicates, simple or complex data types, etc.) and XML constructs (elements, attributes, element lists, etc.). Two different approaches for the transformation process are exposed. The instance approaches are based on XML documents without any schema associated. The validation approaches are based on the XML schema and document validated by the associated schema. The second approaches benefit from the schema definition to provide automated transformations with logic constraints. Both approaches are discussed in the text.

Managing experiments on cognitive processes in writing with HandSpy

Experiments on cognitive processes require a detailed analysis of the contribution of many participants. In the case of cognitive processes in writing, these experiments require special software tools to collect gestures performed with a pen or a stylus, and recorded with special hardware. These tools produce different kinds of data files in binary and proprietary formats that need to be managed on a workstation file system for further processing with generic tools, such as spreadsheets and statistical analysis software. The lack of common formats and open repositories hinders the possibility of distributing the workload among researchers within the research group, of re-processing the collected data with software developed by other research groups, and of sharing results with the rest of the cognitive processes research community. This paper describes the development of HandSpy, a collaborative environment for managing experiments in the cognitive processes in writing. This environment was designed to cover all the stages of the experiment, from the definition of tasks to be performed by participants, to the synthesis of results. Collaboration in HandSpy is enabled by a rich web interface. To decouple the environment from existing hardware devices for collecting written production, namely digitizing tablets and smart pens, HandSpy is based on the InkML standard, an XML data format for representing digital ink. This design choice shaped many of the features in HandSpy, such as the use of an XML database for managing application data and the use of XML transformations. XML transformations convert between persistent data representations used for storage and transient data representations required by the widgets on the user interface. Despite being a system independent from a specific collecting device, for the system validation, a framework for data collection was created. This framework has also been highlighted in the paper due to the important role it took in a data collection process, of a scientific project to study the cognitive processes involved in writing.

Compiler support for effective XSL transformation

SUMMARYXML is a markup language used to describe data or documents. The main goal of XML is to facilitate the sharing of data across diverse information systems, especially via the Internet. XML Stylesheet Transformations (XSLT) is a standard approach to describing how to transform an XML document into another data format. The ever‐increasing number of Web technologies being used in our everyday lives commonly employs XSLT to support data exchange among heterogeneous environments, and the associated increasing burdens on XSLT processors have increased the demand for high‐performance XSLT processors. In this paper, we present an XSLT compiler, named Zebu, which can transform an XSLT stylesheet into the corresponding C program. The compiled program can be used to transform documents without the processing of XSLT stylesheets. The results of experimental testing using standard benchmarks show that the proposed XSLT compiler performs well in processing XML transformations. Copyright © 2011 John Wiley & Sons, Ltd.

XQUERY : Efficient searching and indexing Algorithm Based on Multi- tries

XML is emerging as a de facto standard for information exchange over internet. XML file is plan text file and self explanatory therefore XML users are increase dramatically. There are two type of groups who has interest on XML utilization effectively, the first group is mainly interested in XML as a humanly consumable exchange format. They are looking up for tools that allow easy manipulation and transformation of small XML document. Second community is mainly interested in XML as a data storage format. Their primary focus is on design of query languages for storage effectively. This data-oriented paradigm has taken more efforts in query evaluation. XML data doesnot have fix schema, managing the document is difficult job . It is therefore major challenge for database community to design query languages and storage methods that can retrieve data effectively. There has been a growing need for developing high-performance techniques to query large XML .. The proposed technique summarized XML document into an ‘x-store’ , which store xml document distinct node :- element node, attribute node and value element node value, and path information. The unique storage address is generated for each node and it is indexed on path name.. Then we come up with the novel method of query searching which utilize multi-way tries to answer the query effectively .

Interoperability of Medical Device Information and the Clinical Applications: An HL7 RMIM based on the ISO/IEEE 11073 DIM

Medical devices are essential to the practice of modern healthcare services. Their benefits will increase if clinical software applications can seamlessly acquire the medical device data. The need to represent medical device observations in a format that can be consumable by clinical applications has already been recognized by the industry. Yet, the solutions proposed involve bilateral mappings from the ISO/IEEE 11073 Domain Information Model (DIM) to specific message or document standards. Considering that there are many different types of clinical applications such as the electronic health record and the personal health record systems, the clinical workflows, and the clinical decision support systems each conforming to different standard interfaces, detailing a mapping mechanism for every one of them introduces significant work and, thus, limits the potential health benefits of medical devices. In this paper, to facilitate the interoperability of clinical applications and the medical device data, we use the ISO/IEEE 11073 DIM to derive an HL7 v3 Refined Message Information Model (RMIM) of the medical device domain from the HL7 v3 Reference Information Mode (RIM). This makes it possible to trace the medical device data back to a standard common denominator, that is, HL7 v3 RIM from which all the other medical domains under HL7 v3 are derived. Hence, once the medical device data are obtained in the RMIM format, it can easily be transformed into HL7-based standard interfaces through XML transformations because these interfaces all have their building blocks from the same RIM. To demonstrate this, we provide the mappings from the developed RMIM to some of the widely used HL7 v3-based standard interfaces.

QVT-based model transformation using XSLT

Model transformations are one of the key technologies in modelbased development. The graphical notation of relational QVT provides a concise, intuitive way to specify transformations. But this notation is not directly applicable for practitioners because of the lack of tool support. On the other hand, XSLT is a common and powerful language for XML transformations, but not suitable for directly programming transformations of semantically complex models due to its low level syntax. We combine the best of both techniques by using QVT graphical notation to specify a transformation as a set of QVT relations, and implementing each relation as an XSLT rule template. A prototype tool with a QVT graphical editor and an automatic XSLT program generator has been developed to support the approach.

Reasoning about XML with temporal logics and automata

We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of programs. Many properties of interest in the XML context are related to navigation, and can be formulated in temporal logics for trees. We choose a logic that admits a simple single-exponential translation into unranked tree automata, in the spirit of the classical LTL-to-Büchi automata translation. Automata arising from this translation have a number of additional properties; in particular, they are convenient for reasoning about unary node-selecting queries, which are important in the XML context. We give two applications of such reasoning: one deals with a classical XML problem of reasoning about navigation in the presence of schemas, and the other relates to verifying security properties of XML views.

Deciding equivalence of top–down XML transformations in polynomial time

Many useful XML transformations can be expressed by deterministic top–down tree transducers. A normal form is presented for such transducers (extended with the facility to inspect their input trees). A transducer in normal form has a unique canonical form which can be obtained by a minimization procedure, in polynomial time. Thus, equivalence of transducers in normal form can be decided in polynomial time. If the transducer is total, the normal form can be obtained in polynomial time as well.

Computing the Cost of Typechecking of Composition of Macro Tree Transducers

Macro tree transducers are a classical formal model for structural-recursive tree transformation with accumulative parameters. They have recently been applied to model XML transformations and queries. Typechecking a tree transformation means checking whether all valid input trees are transformed into valid output trees, for the given regular tree languages of input and output trees. Typechecking macro tree transducers is generally based on inverse type inference, because of the advantageous property that inverse transformations effectively preserve regular tree languages. It is known that the time complexity of typechecking an n-fold composition of macro tree transducers is non-elementary. The cost of typechecking can be reduced if transducers in the composition have special properties, such as being deterministic or total, or having no accumulative parameters. In this paper, the impact of such properties on the cost of typechecking is investigated. Reductions in cost are achieved by applying composition and decomposition constructions to tree transducers. Even though these constructions are well-known, they have not yet been analyzed with respect to the precise sizes of the transducers involved. The results can directly be applied to typechecking XML transformations, because type formalisms for XML are captured by regular tree languages.

The time complexity of typechecking tree-walking tree transducers

Tree-walking tree transducers can be typechecked in double exponential time. More generally, compositions of k tree-walking tree transducers can be typechecked in (k + 1)-fold exponential time. Consequently k-pebble tree transducers, which form a model of XML transformations and XML queries, can be typechecked in (k + 2)-fold exponential time. The results hold for both ranked and unranked trees.

Typed iterators for XML

XML transformations are very sensitive to types: XML types describe the tags and attributes of XML elements as well as the number, kind, and order of their sub-elements. Therefore, operations, even simple ones, that modify these features may affect the types of documents. Operations on XML documents are performed by iterators that, to be useful, need to be typed by a kind of polymorphism that goes beyond what currently exists. For this reason these iterators are not programmed but, rather, hard-coded in the languages. However, this approach soon reaches its limits, as the hard-coded iterators cannot cover fairly standard usage scenarios. As a solution to this problem we propose a generic language to define iterators for XML data. This language can either be used as a compilation target (e.g., for XPATH) or it can be grafted on any statically typed host programming language (as long as this has product types) to endow it with XML processing capabilities. We show that our language mostly offers the required degree of polymorphism, study its formal properties, and show its expressiveness and practical impact by providing several usage examples and encodings.

Product Derivatives of Regular Expressions

We propose a novel extension of Brzozowski's derivative of regular expressions, called product derivatives. It takes two regular expressions and the meaning of its result is stated as follows: a product derivative of R with respect to S is a regular expression obtained by the consumption of all the sequences in the first regular expression by the second, i.e., the result is the product of Brzozowski's derivatives of R with respect to sequences in S. We develop an algorithm for our derivatives in coinductive manner. The termination of the algorithm is shown based on the proof method by Brandt and Henglein. We expect the derivative proposed in this talk is an important step to the development of the derivatives of a regular hedge expression taking a regular hedge expression as input, which is useful for transformation of XML documents with function terms typed with regular hedge expressions. The situation, for example, occurs in the transformation of XML documents with the links to the other Web services, such as Active XML documents.

Frontiers of tractability for typechecking simple XML transformations

Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus on complete algorithms which always produce the correct answer. We consider top–down XML transformations incorporating XPath expressions and abstract document types by grammars and tree automata. By restricting schema languages and transformations, we identify several practical settings for which typechecking can be done in polynomial time. Moreover, the resulting framework provides a rather complete picture as we show that most scenarios cannot be enlarged without rendering the typechecking problem intractable. So, the present research sheds light on when to use fast complete algorithms and when to reside to sound but incomplete ones.

Towards the faster transformation of XML documents

XML is so flexible that several different schemas are often used even in the same application domain. To interchange XML documents between two parties, it is necessary to transform XML documents into ones that conform to the schema of a partner. Since a transformation is repeatedly applied to a large volume of XML documents, the transformation speed is important. This paper proposes a method for generating XSLT scripts, which support the fast transformation of XML documents, given one-to-one matching relationships between leaf nodes of XML schemas. The proposed method consists of two steps: computing matches between internal nodes and generating XSLT scripts. Specifically, the proposed method considers many-to-one matches among cardinality nodes. The transformation of recursive structures is also supported. The proposed method generates XSLT scripts with fewer templates that are proportional to the number of the matches between recursive nodes. Experimental results show that the proposed method generates XSLT scripts that support the faster transformation of XML documents, compared with previous work.