Search

The processing of XML documents often includes creation and validation. These two operations are typically performed in two different nodes within a computer network that do not correlate with each other. The process of creation is also called instantiation of a template and can be described by filling a template with data from external repositories. Initial access to arbitrary sources can be formulated as an expression of certain command languages like XPath. Filling means copying invariant element nodes to the target document and unfolding variable parts from a given template. Validation is a descision problem returning true if a given XML document satisfies a schema and false otherwise. The main subject is to find a language that unions the template expansion and the validation. [..]., 4 pages (with Extended Abstract)

Data validation is becoming more and more important with the ever-growing amount of data being consumed and transmitted by systems over the Internet. It is important to ensure that the data being sent is valid as it may contain entry errors, which may be consumed by different systems causing further errors. XML has become the defacto standard for data transfer. The XML Schema Definition language (XSD) was created to help XML structural validation and provide a schema for data type restrictions, however it does not allow for more complex situations. In this article we introduce a way to provide rule based XML validation and correction through the extension and improvement of our SRML metalanguage. We also explore the option of applying it in a database as a trigger for CRUD operations allowing more granular dataset validation on an atomic level allowing for more complex dataset record validation rules., 18 pages

International audience; One major concept in web development using XML is validation: checking whether some document instance fulfills structural constraints described by some schema. Over the last few years, there has been a growing debate about XML validation, and two main schools of thought emerged about the way it should be done. On the one hand, some advocate the use of validation with respect to complete grammar-based descriptions such as DTDs and XML Schemas. On the other hand, motivated by a need for greater flexibility, others argue for no validation at all, or prefer the use of lightweight constraint languages such as Schematron with the aim of validating only required constraints, while making schema descriptions more compositional and more reusable. Owing to a logical compilation, we show that validators used in each of these approaches share the same theoretical foundations, meaning that the two approaches are far from being incompatible. Our findings include that the logic in [2] can be seen as a unifying formal ground for the construction of robust and efficient validators and static analyzers using any of these schema description techniques. This reconciles the two approaches from both a theoretical and a practical perspective, therefore facilitating any combination of them.

peer-reviewed The concept of automation has dramatically changed after the machine-to-machine communication was established in mid 20th century and Information Systems were enabled to form networks and exchange data. Like any form of communication, protocols (standards) are an essential part of such networks and compatibility with the defined protocol is the most fundamental requirement for facilitating an effective exchange environment. With the exponential advancement of processing technologies over the past years, contemporary information systems are capable of targeting complicated tasks within an automated workflow. The components of such workflow are in constant interaction and, therefore, reliable exchange standards for effective storage of the structured data play a vital role in enabling interoperability. However, as standards improve to cover the emerging requirements and to provide solutions for new demands, conforming to standards with complex data models is a non-trivial subject. To overcome conformance issues, which blocks semantic interoperability, the literature suggests defining the standards using machine-readable schema. This research, conducted in line with design and development methodology, represents our work on delivering the machine-readable specification of OASIS XLIFF 2.1, a business-driven and XML-based standard. This standard is the most widely adopted exchange format in the localisation world and provides a platform for storage of translatable content and the associated metadata. The result of this work, an advanced validation platform based on standardised and declarative methods, is included in the Specification of the standard as normative. This work improves the state-of-the-art of the standard by providing machine-readable and platform independent artefacts that can be used by all users to guarantee an interoperable environment for XLIFF-based workflows. This dissertation contributes to knowledge by providing a detailed study of XML validation methods, discovering gaps in the related literature and also by examining schema languages, especially Schematron, against business-driven rules. Finally, this work attempts to highlight the expressivity and capability of standardised XML schema languages, which lack fundamental research, and we hope that the results of this work would promote their wide adoption by providing useful guidelines. The validation platform for XLIFF 2.1 represents a unique work, by scale and official recognition, which is based on standardised and declarative methods.

Very few research works have been done on XML security over relational databases despite that XML became the de facto standard for the data representation and exchange on the internet and a lot of XML documents are stored in RDBMS. In [14], the author proposed an access control model for schema-based storage of XML documents in relational storage and translating XML access control rules to relational access control rules. However, the proposed algorithms had performance drawbacks. In this paper, we will use the same access control model of [14] and try to overcome the drawbacks of [14] by proposing an efficient technique to store the XML access control rules in a relational storage of XML DTD. The mapping of the XML DTD to relational schema is proposed in [7]. We also propose an algorithm to translate XPath queries to SQL queries based on the mapping algorithm in [7].