2011
DOI: 10.1007/978-3-642-23088-2_7
|View full text |Cite
|
Sign up to set email alerts
|

Attribute Grammar for XML Integrity Constraint Validation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…Bouchou et al proposed the validation of integrity rules in XML using attribute grammars. They reported on experiments showing that the method allows for an effective and efficient validation of XML documents.…”
Section: Related Workmentioning
confidence: 99%
“…Bouchou et al proposed the validation of integrity rules in XML using attribute grammars. They reported on experiments showing that the method allows for an effective and efficient validation of XML documents.…”
Section: Related Workmentioning
confidence: 99%
“…Our approach performance is comparable to implementations in Vincent and Liu (2005), Shahriar and Liu (2009), but contrary to them, it intends to be a generic model for XML constraints validation. The ideas guiding this work are the ones outlined in Bouchou et al (2011). An incremental validation method for keys is defined in Bouchou et al (2007), using the generic model considering multiple updates in an XML tree.…”
Section: Related Workmentioning
confidence: 99%
“…A path expression defines a way of navigating XML trees and is fundamental for the specification of integrity constraints in an XML context. In this way, we want to express conditional functional dependencies (XCFD) based on path expressions using a homogeneous formalism for their verification, introduced in Bouchou et al (2011), founded on attribute grammar and finite state automata. The validation of an XML document is done in one tree traversal, in the document reading order, going top-down until leaf nodes are reached and then, bottom-up, to finish each node visit, until the root node.…”
Section: Introductionmentioning
confidence: 99%