Streaming XML Schema Validation for Relational Tree Encodings

Lade...
Vorschaubild
Dateien
impl.tar.gz
impl.tar.gzGröße: 10.37 KBDownloads: 22
text.pdf
text.pdfGröße: 542.43 KBDownloads: 86
Datum
2004
Autor:innen
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Masterarbeit/Diplomarbeit
Publikationsstatus
Published
Erschienen in
Zusammenfassung

The Extensible Markup Language (XML) is a plain text format, widely used to store and exchange documents possessing a hierarchical structure. The wide-spread use of XML as a data storage and exchange format imposed an emerging need for storing XML documents in databases. Since there are mature relational database management systems available, an obvious approach is to transform the tree shaped XML documents into tables and store them inside the RDBMS.

XML Schema is another W3C specification, allowing the description of structure and semantics of XML documents by means of regular expressions and context free grammars. The process of verifying whether an XML document fulfills a Schema definition is called validation.

This diploma thesis introduces a new way of validating relationally encoded XML documents against XML Schema definitions.

The proposed algorithm is based on the concept of deriving a regular expression. Hence, it is neither necessary to reconstruct the XML tree from its encoding, nor to build a finite state automaton from the XML Schema definition. Moreover, the encoded tree is read as a stream, i.e., exactly once, sequentially in document order.

This thesis introduces guards, an amelioration of regular expressions which integrates information about the hierarchical structure of trees. The concept of derivation is augmented to make use of the pre/post enumeration and the enriched regular expressions.

This diploma thesis comes with "http://www.ub.uni-konstanz.de/kops/volltexte/2004/1234/pdf/impl.tar.gz" an implementation of the proposed algorithm, written in the functional language Haskell.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
derivation of regular expression, regular expression, context free grammar, xml schema, validation
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690KLINGER, Stefan, 2004. Streaming XML Schema Validation for Relational Tree Encodings [Master thesis]
BibTex
@mastersthesis{Klinger2004Strea-6349,
  year={2004},
  title={Streaming XML Schema Validation for Relational Tree Encodings},
  author={Klinger, Stefan}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6349">
    <dc:format>application/octet-stream</dc:format>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6349/1/impl.tar.gz"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6349/2/text.pdf"/>
    <dc:creator>Klinger, Stefan</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6349/1/impl.tar.gz"/>
    <dcterms:title>Streaming XML Schema Validation for Relational Tree Encodings</dcterms:title>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Klinger, Stefan</dc:contributor>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6349"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:11:38Z</dc:date>
    <dcterms:abstract xml:lang="eng">The Extensible Markup Language (XML) is a plain text format, widely used to store and exchange documents possessing a hierarchical structure. The wide-spread use of XML as a data storage and exchange format imposed an emerging need for storing XML documents in databases. Since there are mature relational database management systems available, an obvious approach is to transform the tree shaped XML documents into tables and store them inside the RDBMS.&lt;br /&gt;&lt;br /&gt;XML Schema is another W3C specification, allowing the description of structure and semantics of XML documents by means of regular expressions and context free grammars. The process of verifying whether an XML document fulfills a Schema definition is called validation.&lt;br /&gt;&lt;br /&gt;This diploma thesis introduces a new way of validating relationally encoded XML documents against XML Schema definitions.&lt;br /&gt;&lt;br /&gt;The proposed algorithm is based on the concept of deriving a regular expression. Hence, it is neither necessary to reconstruct the XML tree from its encoding, nor to build a finite state automaton from the XML Schema definition. Moreover, the encoded tree is read as a stream, i.e., exactly once, sequentially in document order.&lt;br /&gt;&lt;br /&gt;This thesis introduces guards, an amelioration of regular expressions which integrates information about the hierarchical structure of trees. The concept of derivation is augmented to make use of the pre/post enumeration and the enriched regular expressions.&lt;br /&gt;&lt;br /&gt;This diploma thesis comes with "http://www.ub.uni-konstanz.de/kops/volltexte/2004/1234/pdf/impl.tar.gz" an implementation of the proposed algorithm, written in the functional language Haskell.</dcterms:abstract>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:format>application/pdf</dc:format>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:11:38Z</dcterms:available>
    <dcterms:issued>2004</dcterms:issued>
    <dc:rights>terms-of-use</dc:rights>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6349/2/text.pdf"/>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen