Pierre Genevès, Nabil Layaïda · 2013
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.
Cited by 0
Julien Cuvillier, K C Morris · 2011
This report describes installation and use of the XML (Extensible Markup Language) Validation Website. The website is one of several tools produced by NIST's XML Testbed project within the Manufacturing Systems Integration Division at NIST. These tools aid in producing high quality XML schemas using a standards-based approach to manufacturing systems integration.
Cited by 0Open access
ÎαμÏάÏ, ÎημήÏÏιοÏ, Kampas, Dimitrios · 2009
Cited by 0
2008
With XML as with SGML, we can have structural correctness, once they provide syntactic rules to state how to mark-up all the documents of the same family (of the same type); moreover, XML also imposes a working approach in which there is a complete separation between the structure of the data and the way it looks. So it is possible to avoid that someone will write a letter putting the ending before the body. Also, being purely declarative and completely independent of the processing, it is possible to swap documents between different systems without having to change them. But even this way, there still is a lack of content validation. Therefore, as Ramalho et al [1] pointed out, if a document has the decrees published by some kings, and includes their birth dates, it is critical if there is a sentence in which a king is said to publish a decree before he was born. In this paper we are concerned about reaching a way to automatically process a document in order to validate it semantically, avoiding this kind of incongruences that may spoil all a teams work. Keywords: XML, semantic validation, structured documents
Cited by 0
Herminio García-González, José Emilio Labra Gayo · Semantic Web · 2018
RDF validation is a field where the Semantic Web community is currently focusing attention. Besides, there is a recent trend to migrate data from different sources to semantic web formats. Therefore, in order to facilitate this transformation, we pro
Cited by 11Open access
Shene Jalil Jamal, Chnoor M. Rahman, Mzhda S. Abdulkarim · UKH Journal of Science and Engineering · 2022
Extensible Markup Language (XML) is a markup language that is developed to organize the structure of information in a text file. The data in XML formatted documents are represented by specifying a number of tags and determining the structural relationship between those tags. It has a simple structure and can be handled by any text editor. Therefore, XML formatted data is being commonly used to transfer and share data between different applications and organizations without having to convert the format of the data (Yang, 2019). In the XML world, “well-formed” and “valid” are the two most frequently used terms. A well-formed XML document is free from errors that can cause the document to not parse, such as: spelling, punctuation, grammar, and syntax errors. While in addition to having a well-formed markup, a valid XML must conform to a document type definition, this means the document must be semantically correct and matches a described standard of schemas and relationships (Appel, 2020).There are two standards of document type definition that can be used to validate an XML document, one is DTD or Document Type Definition which is used to identify the legal structure and names the legal elements of an XML document (Dykes and Tittel, 2011), and the other is XSD or XML Schema Definition. XSD is a diagrammatic representation that defines the valid structure of an XML document, it enables specifying the building blocks of an XML data set such as elements and attributes and their data types, number of child elements, fixed and default values of the elements and attributes that can appear in the documents (XML Schema Tutorial, 2020). In some applications the process of validating XML documents is combined with parsing the document. However, in some other cases the process of parsing and validating the XML documents need to be separated. This study focuses on constructing a separate XML document validator and validating XML documents against the defined XSD rules. A Java program is used to perform this experiment. Furthermore, the critical differences between XSD and DTD are also mentioned.
Cited by 1Open access
Kalman, Miklos, Havasi, Ferenc · arXiv (Cornell University) · 2013
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.
Cited by 0Open access
Hložek, Bohuslav · Brno University of Technology Digital Library (Brno University of Technology) · 2015
Projekt se zabývá analýzou XML LMF slovníku. Je tvořeno schéma pro schematron a XML s popisem hodnot atributů. Projekt je zpracován v jazyce Python 3.4.
Cited by 0
Miklós Kálmán · Zenodo (CERN European Organization for Nuclear Research) · 2013
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.
Cited by 0Open access
Nick Symmonds · Apress eBooks · 2003
The last chapter was a lot of fun, what with playing around with new and extended controls and all.KeywordsSchema CollectionImport SystemDocument Type DefinitionData Encryption StandardCase CONFIGThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Cited by 0
Wei Ni, Tok Wang Ling · 2008
For data centric XML data, updates bring the problem of validation that the updated data must conform to both structural and semantic constraints according to XML schemas. Most existing XML validation works today are concentrated on structural constraints with respect to DTD and XML. Schema (XSD). However, because DTD/XSD schema is too limited to express complex data semantics, they cannot be used to validate semantic constraints in XML. Meanwhile, there are few works concentrated on how to validate semantic constraints. In this paper, we investigate ORA-SS [16], a rich semantic data model, for XML data. We derive a set of important semantic constraints with respect to the data semantics in ORA-SS model including nary relationship types (n≥2), relationship attributes, object IDs and ID references, and semantic dependencies, etc, which cannot be captured by DTD/XSD schema. Then, we discuss how to validate these semantic constraints in XML updates with the help of ORASS.
Cited by 1
Bo Liu, Sebastian Link, Emir Muñoz · Arrow@dit (Dublin Institute of Technology) · 2015
The eXtensible Markup Language (XML) is the defacto industry standard for exchanging data on the Web and elsewhere. While the relational model of data enjoys a well-accepted definition of a key, several competing notions of keys exist in XML. These have complementary properties and therefore serve different applications domains. In a nutshell, XML keys allow us to capture important domain semantics in XML documents and thereby advance data processing in most applications. In this paper we propose how to validate XML documents against an expressive class of XML keys using XML Schema and XQuery, respectively. It is somewhat surprising how simple it is to express sophisticated notions of XML keys in these off-the-shelf tools. Experiments show that our simple validation technique works well for real-world data of reasonable size. For large-scale data, however, dedicated tools must be developed.
Cited by 1Open access
Toni Dietze, Toni Dietze, Simple Dtds et al. · 2009
From XML to unranked Trees <b o o k C o l l e c t i o n> <book> < t i t l e>The Lord o f the Rings< / t i t l e> < / book> <book> <r e l a t e d>
Cited by 0
K. C. Morris, Serm Kulvatunyou, Simon Frechette et al. · 2004
Many integration projects today rely on shared semantic models based on standards represented using Extensible Mark up Language (XML) technologies. Shared semantic models typically evolve and require maintenance. In addition, to promote interoperability and reduce integration costs, the shared semantics should be reused as much as possible. The GSA Component Organization and Registration Environment (CORE.GOV) initiative is an effort to promote the sharing and reuse of components to reduce the acquisition costs of software needed by government. To be effective, CORE.GOV components must be consistent and valid in terms of agreed upon standards and guidelines. In this paper, we describe an activity model for validation of shared semantic models that is coherent and supports efficient enterprise integration. We then use this activity model to frame our research and the development of tools to support those activities. Overviews of these supporting tools are described primarily in the context of the W3C XML Schema. At the present, we focus our work on the W3C XML Schema as the representation of choice, due to its extensive adoption by industry. We believe this validation model and associated tools could serve as the basis for a CORE.GOV validation and acceptance process.
Cited by 1Open access
Cuvillier, Julien, Kc Morris · 2011
Cited by 0Open access
Denny Vr, Frank Dengler, Sebastian Rudolph et al. · 2011
Abstract. Basing the Semantic Web stack on XML promised to introduce a lot of advantages by reusing tools and expertise. In general, these promises have not been fulfilled. In this paper we describe a method that re-uses existing standards creatively in order to provide a guaranteed serialization of an RDF graph that can again be used easily with widely spread XML tools and techniques like SAX, DOM, or XSLT. We provide a proof-of-concept implementation and provide a use case to illustrate the advantages of our approach. Alternative approaches are discussed and compared. 1
Cited by 0
Cristiana Chitic · TSpace · 2003
In environments like the Web, where the networks are not always reliable, it is possible that a continuous stream of data gets interrupted. To continue processing when the stream flow is restored, we have to remember the states in which the finite-state automaton was at the moment of the interruption. Our goal is to characterize classes of nonrecursive DTDs (Document Type Definition) for which on-line validation is performed by a deterministic finite-state automaton. The first class we consider contains DTDs that use only one-unambiguous regular expressions. Then, we generalize to a new class of DTDs that contain k-unambiguous regular expressions. The k-unambiguous regular expressions are a generalization of the one-unambiguous regular expressions. We investigate several characterizations of this new class of regular expressions. We also prove that the lower and upper bound on the size of the finite-state automaton used for on-line validation is exponential in the size of the DTD.
Cited by 0Open access
Yasuhiko Minamide, Akihiko Tozawa · 2006
Abstract. String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analysis against XML schemas and develop two algorithms for deciding inclusion L(G1) ⊆ L(G2) where G1 is a context-free grammar and G2 is either an XML-grammar or a regular hedge grammar. The algorithms for XML-grammars and regular hedge grammars have exponential and doubly exponential time complexity, respectively. We have incorporated the algorithms into the PHP string analyzer and validated several publicly available PHP programs against the XHTML DTD. The experiments show that both of the algorithms are efficient in practice although they have exponential complexity. 1
Cited by 12
Kurt Svensson · ACM SIGPLAN Notices · 2007
EDI-C is a programming language used in B2B (EDI, WebServices) applications. It is possible to declare XML variables in the language. XML variables are declared in a way similar to structures in C and C++. These variables are accessed through dot-notation. Validation information (facets) can also be declared. The XML structures and their validation values are, at compile time, optimized for fast evaluation and execution in the runtime environment. Usually XSD schema are read and evaluated when an XML document loads -- our method loads and evaluates the XSD schema at compile time. Thus, when executing a program, the XSD schema has already been loaded and evaluated -- i.e., it's no longer necessary to load and evaluate each time the program is executed. This method increases XML processing speed, which is vital for WebServices messaging.
Cited by 0
Boshi Sun, Xiaojie Yuan, Hong Kang et al. · 2010
With XML becoming the de facto standard for representing and exchanging data on the Internet, the problem of validation of XML data when updated has attracted more and more attentions. The traditional brute-force validation processes the entire updated XML document from scratch, which is less efficient. This paper presents a method for XML incremental validation based on simplified XML element sequence pattern, ensuring the XML document to remain conforming to the constrains established by XML Schema. The incremental method focuses on the fragment that the update operations directly affected and thus is more efficient compared to the traditional methods.
Cited by 7