Skip navigation
Skip navigation

Updates, Schema Updates and Validation of XML Documents - Using Abstract State Machines with Automata-Defined States

Schewe, Klaus-Dieter; Thalheim, Bernhard; Wang, Qing (Ms)

Description

The exact validation of streaming XML documents can be realised by using visibly push-down automata (VPA) that are defined by Extended Document Type Definitions (EDTD). It is straightforward to represent such an automaton as an Abstract State Machine (ASM). In doing so we enable computations on abstract states that are defined by a certain class of automata, in this case VPAs. In this paper we elaborate on this approach by taking also updates of XML documents into account. In this way the...[Show more]

dc.contributor.authorSchewe, Klaus-Dieter
dc.contributor.authorThalheim, Bernhard
dc.contributor.authorWang, Qing (Ms)
dc.date.accessioned2015-12-10T23:23:16Z
dc.identifier.issn0948-6958
dc.identifier.urihttp://hdl.handle.net/1885/66884
dc.description.abstractThe exact validation of streaming XML documents can be realised by using visibly push-down automata (VPA) that are defined by Extended Document Type Definitions (EDTD). It is straightforward to represent such an automaton as an Abstract State Machine (ASM). In doing so we enable computations on abstract states that are defined by a certain class of automata, in this case VPAs. In this paper we elaborate on this approach by taking also updates of XML documents into account. In this way the ASM-approach combines vertical refinements, which first make states explicit and then instantiate by a specific EDTD, with horizontal refinements, which replace streaming XML documents by stored ones and then add updates. Furthermore, as the EDTD appears as part of the abstract state, updating it is another natural extension by horizontal refinement. In this way we obtain consistently integrated updates and schema updates for XML documents, which can even be extended to become fault-tolerant by taking at most k errors in the document into consideration. It further provides an example of ASM-based computation with automata-defined states.
dc.publisherSpringer
dc.sourceJournal of Universal Computer Science
dc.subjectKeywords: Abstract state machines; Validation; XML
dc.titleUpdates, Schema Updates and Validation of XML Documents - Using Abstract State Machines with Automata-Defined States
dc.typeJournal article
local.description.notesImported from ARIES
local.identifier.citationvolume15
dc.date.issued2009
local.identifier.absfor080600 - INFORMATION SYSTEMS
local.identifier.ariespublicationu4334215xPUB1361
local.type.statusPublished Version
local.contributor.affiliationSchewe, Klaus-Dieter, Information Science Research Centre
local.contributor.affiliationThalheim, Bernhard, Christian-Albrechts University Kiel
local.contributor.affiliationWang, Qing (Ms), College of Engineering and Computer Science, ANU
local.description.embargo2037-12-31
local.bibliographicCitation.issue10
local.bibliographicCitation.startpage2028
local.bibliographicCitation.lastpage2057
local.identifier.doi10.3217/jucs-017-08-1183
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
dc.date.updated2016-02-24T10:58:21Z
local.identifier.scopusID2-s2.0-71749087282
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Schewe_Updates,_Schema_Updates_and_2009.pdf216.14 kBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator