This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n10http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n15http://purl.org/net/nknouf/ns/bibtex#
n7http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n18http://linked.opendata.cz/ontology/domain/vavai/
n21https://schema.org/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F14%3A10218474%21RIV15-MSM-11320___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n5http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F14%3A10218474%21RIV15-MSM-11320___
rdf:type
skos:Concept n18:Vysledek
rdfs:seeAlso
http://link.springer.com/chapter/10.1007%2F978-3-319-10073-9_25
dcterms:description
It was shown that real-world XML documents often contain errors that make their processing complicated or impossible. Having a potentially invalid XML document, our goal is to find its structural corrections with respect to a provided schema represented in DTD or XSD languages. In this paper we propose several improvements of algorithms we introduced earlier, extend our model to support the full expressive power of regular tree grammars and we still guarantee that all the minimal corrections are found regardless the extent of document invalidity. According to experiments, our new correction algorithm outperforms the existing ones by more than two times, achieves near linear execution times in practice and works successfully on documents of sizes up to two orders of magnitude higher than those assumed so far. It was shown that real-world XML documents often contain errors that make their processing complicated or impossible. Having a potentially invalid XML document, our goal is to find its structural corrections with respect to a provided schema represented in DTD or XSD languages. In this paper we propose several improvements of algorithms we introduced earlier, extend our model to support the full expressive power of regular tree grammars and we still guarantee that all the minimal corrections are found regardless the extent of document invalidity. According to experiments, our new correction algorithm outperforms the existing ones by more than two times, achieves near linear execution times in practice and works successfully on documents of sizes up to two orders of magnitude higher than those assumed so far.
dcterms:title
Refinement Correction Strategy for Invalid XML Documents and Regular Tree Grammars Refinement Correction Strategy for Invalid XML Documents and Regular Tree Grammars
skos:prefLabel
Refinement Correction Strategy for Invalid XML Documents and Regular Tree Grammars Refinement Correction Strategy for Invalid XML Documents and Regular Tree Grammars
skos:notation
RIV/00216208:11320/14:10218474!RIV15-MSM-11320___
n3:aktivita
n8:S
n3:aktivity
S
n3:dodaniDat
n13:2015
n3:domaciTvurceVysledku
n7:1718452 n7:6612806
n3:druhVysledku
n4:D
n3:duvernostUdaju
n11:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
41757
n3:idVysledku
RIV/00216208:11320/14:10218474
n3:jazykVysledku
n20:eng
n3:klicovaSlova
Correction; Validity; Regular Tree Grammars; XML
n3:klicoveSlovo
n6:Validity n6:Correction n6:Regular%20Tree%20Grammars n6:XML
n3:kontrolniKodProRIV
[6068C3F9ABBF]
n3:mistoKonaniAkce
Munich, Germany
n3:mistoVydani
Berlin
n3:nazevZdroje
Lecture Notes in Computer Science
n3:obor
n17:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n13:2014
n3:tvurceVysledku
Holubová, Irena Svoboda, Martin
n3:typAkce
n10:WRD
n3:zahajeniAkce
2014-09-01+02:00
s:issn
0302-9743
s:numberOfPages
9
n5:doi
10.1007/978-3-319-10073-9_25
n15:hasPublisher
Springer International Publishing
n21:isbn
978-3-319-10072-2
n19:organizacniJednotka
11320