XML Data Exchange Research Articles

Application of a technology based on JavaEE in National Rural Environmental Health Monitoring Information Management System

To establish a national rural environmental health monitoring information management system supporting the application and management of four levels of data at the county, municipal, provincial and national levels, to realize the inter-departmental and cross-platform interconnection service of the national environmental health monitoring information management system. JavaEE and BS architecture platform, Web Service, XML and other data application and exchange service technologies were used to set data entry and audit functions, such as logic verification, extreme value verification and inter-table relationship verification for key variables, and also used to make the computer interface automatically configured. The functions of data entry, audit, exchange, historical data query and download, system management and maintenance, monitoring system feedback, data reporting progress of the national rural environmental health monitoring information management system across different departments and platforms can be realized by the JavaEE technology. The national rural environmental health monitoring information management system was simple in operation and friendly in interface, and had a good application prospect in the field of public health monitoring data management.

Reasoning about integrity constraints for tree-structured data

We study a class of integrity constraints for tree-structured data modelled as data trees, whose nodes have a label from a finite alphabet and store a data value from an infinite data domain. The constraints require each tuple of nodes selected by a conjunctive query (using navigational axes and labels) to satisfy a positive combination of equalities and a positive combination of inequalities over the stored data values. Such constraints are instances of the general framework of XML-to-relational constraints proposed recently by Niewerth and Schwentick. They cover some common classes of constraints, including W3C XML Schema key and unique constraints, as well as domain restrictions and denial constraints, but cannot express inclusion constraints, such as reference keys. Our main result is that consistency of such integrity constraints with respect to a given schema (modelled as a tree automaton) is decidable. An easy extension gives decidability for the entailment problem. Equivalently, we show that validity and containment of unions of conjunctive queries using navigational axes, labels, data equalities and inequalities is decidable, as long as none of the conjunctive queries uses both equalities and inequalities; without this restriction, both problems are known to be undecidable. In the context of XML data exchange, our result can be used to establish decidability for a consistency problem for XML schema mappings. All the decision procedures are doubly exponential, with matching lower bounds. The complexity may be lowered to singly exponential, when conjunctive queries are replaced by tree patterns, and the number of data comparisons is bounded.

The Application of XML Data Exchange in Mechatronics Concept Designer

This paper is about the application of XML data exchange in Mechatronics Concept Designer (MCD), and the implementation method of the data exchange between MCD and other systems in PLM, which putting in place the foundations of the seamless connection among the data systems. The research helps to make MCD more intelligent, and to complete the data management in the concept design of industrial automatic products developed by MCD.

Development of a software tool as an introduction to Geospatial Information Technology based on geospatial standards

This paper presents the development of an “all-in-one” software tool, called “gittok” [pronounced: jee-tock, ʤiːtɒk] that assists both higher education students and industry professionals in learning about Geospatial Information Technology (GIT) based on the concepts of geospatial standards. While there are a number of popular and advanced open source Geographic Information Science (GIS) systems and tools, the software designed in this research is not a GIS, but an education assistance tool that helps to teach the basic concepts of GIT. Gittok was designed around the basic concept of using geospatial standards to help with learning the knowledge areas of GIT. Gittok allows students to acquire and edit geospatial data directly in compliance with an application schema. Users of the gittok software can gain an overview of GIT and directly experience, through “hands-on” operation, spatial analysis, XML data exchange, geo-library management and map design. Therefore, the authors hope that gittok will become a popular and useful tool for GIT education.

Research on Public Data Exchange Platform of OA System Based on XML

OA system widely used in government agencies, large enterprises and institutions. For data exchange between different application systems, the use of XML technology research public data exchange platform. First, the logical structure of public data exchange to achieve data exchange between application system, heterogeneous operating systems and databases; Then study XML data exchange, including the basics of XML, XML data exchange technical advantages, using XML processing data ways etc. Finally, study data exchange platform, XML data exchange technology makes data exchange simple and convenient. The content of this paper, to facilitate the development of data exchange between different systems, speed the development process, improve data reuse, reduce development costs, easy maintenance advantages.

Research on Supporting Platform for Enterprise OA Software System

With the development of information technology, OA system has become an important means to improve the management level. For secondary development problems in the process of the implementation of the OA system, the enterprise OA software system supporting platform key technology was studied. First, given graphically enterprise OA system structure; then researched e-collaboration platform, achieved different types of data sharing and exchange; then studied directory service platform, including client / server model of directory services and directory services structure; Finally, data exchange platform, takes advantage of XML data exchange technology to make data exchange simple and convenient. The content of this study, for the development of OA system provides a good solution, and laid the foundation for rapid development.

Solutions in XML data exchange

The task of XML data exchange is to restructure a document conforming to a source schema under a target schema according to certain mapping rules. The rules are typically expressed as source-to-target dependencies using various kinds of patterns, involving horizontal and vertical navigation, as well as data comparisons. The target schema imposes complex conditions on the structure of solutions, possibly inconsistent with the mapping rules. In consequence, for some source documents there may be no solutions. We investigate three problems: deciding if all documents of the source schema can be mapped to a document of the target schema (absolute consistency), deciding if a given document of the source schema can be mapped (solution existence), and constructing a solution for a given source document (solution building). We show that the complexity of absolute consistency is rather high in general, but within the polynomial hierarchy for bounded depth schemas. The combined complexity of solution existence and solution building behaves similarly, but the data complexity turns out to be very low. In addition to this we show that even for much more expressive mapping rules, based on MSO definable queries, absolute consistency is decidable and data complexity of solution existence is polynomial.

XML data exchange with target constraints

Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema, by following a mapping between the two schemas. There is a rich literature on problems related to data exchange, e.g., the design of a schema mapping language, the consistency of schema mappings, operations on mappings, and query answering over mappings. Data exchange is extensively studied on relational model, and is also recently discussed for XML data. This article investigates the construction of target instance for XML data exchange, which has received far less attention. We first present a rich language for the definition of schema mappings, which allow one to use various forms of document navigation and specify conditions on data values. Given a schema mapping, we then provide an algorithm to construct a canonical target instance. The schema mapping alone is not adequate for expressing target semantics, and hence, the canonical instance is in general not optimal. We recognize that target constraints play a crucial role in the generation of good solutions. In light of this, we employ a general XML constraint model to define target constraints. Structural constraints and keys are used to identify a certain entity, as rules for data merging. Moreover, we develop techniques to enforce non-key constraints on the canonical target instance, by providing a chase method to reason about data. Experimental results show that our algorithms scale well, and are effective in producing target instances of good quality.

Tractable XML data exchange via relations

We consider data exchange for XML documents: given source and target schemas, a mapping between them, and a document conforming to the source schema, construct a target document and answer target queries in a way that is consistent with the source information. The problem has primarily been studied in the relational context, in which data-exchange systems have also been built. Since many XML documents are stored in relations, it is natural to consider using a relational system for XML data exchange. However, there is a complexity mismatch between query answering in relational and in XML data exchange. This indicates that to make the use of relational systems possible, restrictions have to be imposed on XML schemas and mappings, as well as on XML shredding schemes. We isolate a set of five requirements that must be fulfilled in order to have a faithful representation of the XML data-exchange problem by a relational translation. We then demonstrate that these requirements naturally suggest the in-lining technique for data-exchange tasks. Our key contribution is to provide shredding algorithms for schemas, documents, mappings and queries, and demonstrate that they enable us to correctly perform XML data-exchange tasks using a relational system.

The ProteoRed MIAPE web toolkit: A User-friendly Framework to Connect and Share Proteomics Standards

The development of the HUPO-PSI's (Proteomics Standards Initiative) standard data formats and MIAPE (Minimum Information About a Proteomics Experiment) guidelines should improve proteomics data sharing within the scientific community. Proteomics journals have encouraged the use of these standards and guidelines to improve the quality of experimental reporting and ease the evaluation and publication of manuscripts. However, there is an evident lack of bioinformatics tools specifically designed to create and edit standard file formats and reports, or embed them within proteomics workflows. In this article, we describe a new web-based software suite (The ProteoRed MIAPE web toolkit) that performs several complementary roles related to proteomic data standards. First, it can verify that the reports fulfill the minimum information requirements of the corresponding MIAPE modules, highlighting inconsistencies or missing information. Second, the toolkit can convert several XML-based data standards directly into human readable MIAPE reports stored within the ProteoRed MIAPE repository. Finally, it can also perform the reverse operation, allowing users to export from MIAPE reports into XML files for computational processing, data sharing, or public database submission. The toolkit is thus the first application capable of automatically linking the PSI's MIAPE modules with the corresponding XML data exchange standards, enabling bidirectional conversions. This toolkit is freely available at http://www.proteored.org/MIAPE/.

Relational and XML Data Exchange

Data exchange is the problem of finding an instance of a target schema, given an instance of a source schema and a specification of the relationship between the source and the target. Such a target instance should correctly represent information from the source instance under the constraints imposed by the target schema, and it should allow one to evaluate queries on the target instance in a way that is semantically consistent with the source data. Data exchange is an old problem that re-emerged as an active research topic recently, due to the increased need for exchange of data in various formats, often in e-business applications. In this lecture, we give an overview of the basic concepts of data exchange in both relational and XML contexts. We give examples of data exchange problems, and we introduce the main tasks that need to addressed. We then discuss relational data exchange, concentrating on issues such as relational schema mappings, materializing target instances (including canonical solutions and cores), query answering, and query rewriting. After that, we discuss metadata management, i.e., handling schema mappings themselves. We pay particular attention to operations on schema mappings, such as composition and inverse. Finally, we describe both data exchange and metadata management in the context of XML. We use mappings based on transforming tree patterns, and we show that they lead to a host of new problems that did not arise in the relational case, but they need to be addressed for XML. These include consistency issues for mappings and schemas, as well as imposing tighter restrictions on mappings and queries to achieve tractable query answering in data exchange. Table of Contents: Overview / Relational Mappings and Data Exchange / Metadata Management / XML Mappings and Data Exchange

Efficient reasoning about a robust XML key fragment

We review key constraints in the context of XML as introduced by Buneman et al. We demonstrate that: (1) one of the proposed inference rules is not sound in general, and (2) the inference rules are incomplete for XML key implication, even for nonempty sets of simple key paths. This shows, in contrast to earlier statements, that the axiomatizability of XML keys is still open, and efficient algorithms for deciding their implication still need to be developed. Solutions to these problems have a wide range of applications including consistency validation, XML schema design, data exchange and integration, consistent query answering, XML query optimization and rewriting, and indexing. In this article, we investigate the axiomatizability and implication problem for XML keys with nonempty sets of simple key paths. In particular, we propose a set of inference rules that is indeed sound and complete for the implication of such XML keys. We demonstrate that this fragment is robust by showing the duality of XML key implication to the reachability problem of fixed nodes in a suitable digraph. This enables us to develop a quadratic-time algorithm for deciding implication, and shows that reasoning about this XML key fragment is practically efficient. Therefore, XML applications can be unlocked effectively since they benefit not only from those XML keys specified explicitly by the data designer but also from those that are specified implicitly.

XML data exchange

Data exchange is the problem of finding an instance of a target schema, given an instance of a source schema and a specification of the relationship between the source and the target. Theoretical foundations of data exchange have recently been investigated for relational data. In this article, we start looking into the basic properties of XML data exchange, that is, restructuring of XML documents that conform to a source DTD under a target DTD, and answering queries written over the target schema. We define XML data exchange settings in which source-to-target dependencies refer to the hierarchical structure of the data. Combining DTDs and dependencies makes some XML data exchange settings inconsistent. We investigate the consistency problem and determine its exact complexity. We then move to query answering, and prove a dichotomy theorem that classifies data exchange settings into those over which query answering is tractable, and those over which it is coNP-complete, depending on classes of regular expressions used in DTDs. Furthermore, for all tractable cases we give polynomial-time algorithms that compute target XML documents over which queries can be answered.

Exploring PSI-MI XML Collections Using DescribeX

Summary PSI-MI has been endorsed by the protein informatics community as a standard XML data exchange format for protein-protein interaction datasets. While many public databases support the standard, there is a degree of heterogeneity in the way the proposed XML schema is interpreted and instantiated by different data providers. Analysis of schema instantiation in large collections of XML data is a challenging task that is unsupported by existing tools.In this study we use DescribeX, a novel visualization technique of (semi-)structured XML formats, to quantitatively and qualitatively analyze PSI-MI XML collections at the instance level with the goal of gaining insights about schema usage and to study specific questions such as: adequacy of controlled vocabularies, detection of common instance patterns, and evolution of different data collections. Our analysis shows DescribeX enhances understanding the instance-level structure of PSI-MI data sources and is a useful tool for standards designers, software developers, and PSI-MI data providers.

Enabling Spatially Aware Mobile Applications

AbstractRecently, increasing numbers of mobile phones are appearing on the market that feature advanced navigation capabilities: embedded GPS receivers for global positioning, integrated digital compasses for detecting the heading of the device, or accelerometer‐based tilt sensors will potentially enable upcoming and future mobile phones to measure their location and orientation in 3D space. In this paper, we present an application framework for building spatially aware mobile applications – applications that visualize, process or exchange geospatial information – on mobile phones equipped with such features. The core component of the framework is a novel, platform‐independent XML data exchange format for the interface between application server and mobile device that describes the geographic vicinity of the user. The format enables a variety of new mobile interaction styles and user interface types – from traditional text‐based local search and information interfaces to innovative real‐time user interfaces like Geo‐Wands and Smart Compasses.

EXEM: Efficient XML data exchange management for mobile applications

In the past decade, the number of mobile devices has increased significantly. These devices are in turn showing more computational capabilities. It is therefore possible to envision a near future where client applications may be deployed on these devices. There are, however, constraints that hinder this deployment, especially the limited communication bandwidth and storage space available. This paper describes the Efficient XML Data Exchange Manager (EXEM) that combines context-dependent lossy and lossless compression mechanisms used to support lightweight exchange of objects in XML format between server and client applications. The lossy compression mechanism reduces the size of XML messages by using known information about the application. The lossless compression mechanism decouples data and metadata (compression dictionary) content. We illustrate the use of EXEM with a prototype implementation of the lossless compression mechanism that shows the optimization of the available resources on the server and the mobile client. These experimental results demonstrate the efficiency of the EXEM approach for XML data exchange in the context of mobile application development.

EuroFIR's food databank systems for nutrients and bioactives

The objective of the EuroFIR project is to increase the Internet availability of European national food composition databases and specialised collections, including the EuroFIR BASIS database of bioactive components. Database compilers will upgrade data with food and component descriptions, documenting the compositional values and adding new data following agreed priorities. Prototype EuroFIR databank systems have used both distributed and centralised retrieval. In the preferred approach, database owners provide an interface to the EuroFIR system using an XML data exchange format. Users will have online access to a wide range of European data, linking foods and nutrients through harmonised data description and associated nutrient value information.

Approaches and Schemes for Storing DTD- Independent XML Data in Relational Databases

The volume of XML data exchange is explosively increasing, and the need for efficient mechanisms of XML data management is vital. Many XML storage models have been proposed for storing XML DTD-independent documents in relational database systems. Benchmarking is the best way to highlight pros and cons of different approaches. In this study, we use a common benchmarking scheme, known as XMark to compare the most cited and newly proposed DTD-independent methods in terms of logical reads, physical I/O, CPU time and duration. We show the effect of Label Path, extracting values and storing in another table and type of join needed for each method's query answering.

Active XML document rewriting based on tree automata theory

The problem of document rewriting is a fundamental problem in active XML (AXML) data exchange and usually has a higher complexity. Prior work was focused on string automaton theory. This paper tries to solve it by using tree automaton. More precisely, the paper firstly defines a new tree automaton, active XML tree automaton (AXTA), which can efficiently represent the set of AXML documents produced by an AXML document or AXML document schema. And then, an algorithm for constructing AXTA automaton is also proposed. Finally, a polynomial time (PTIME) determining algorithm for AXML document rewriting is presented based on AXTA automaton.

Applying XML Data Exchange Technology to the Supply Chain Management System of the Yacht Industry

In this article, Taiwan Ship Net is proposed to be a portal Web site of the Taiwan yachtindustry. By using Microsoft Distributed interNet Application (DNA) and Active ServicePage (ASP), the supply chain management system, consisting of three sections, shipyards, suppliers, and administrator, exchanges and transfers the information ofenterprise's system. Through applying XML to conduct the information exchange, weintegrate the formats of orders for several yacht manufacturers and suppliers, develop the system of placing orders online, and edit XML documents to exchange the information in the system. E-catalogs that are easy to preserve and update will replace the traditional paper catalogs hereafter. The various demands of accessories will result in an increase in the costs of production and logistics. Through this system, yacht manufacturers can search the material of E-catalogs and purchase online directly. Meanwhile, it will allow the suppliers to update the E-catalogs regularly to be more competitive in the market. Taiwan Ship Net can provide the newest information to foreign customers and communicate with all yacht companies, equipment suppliers, and manufacturers in Taiwan.