Updating XML documents submitted to schema constraints requires incremental validation, i.e. checking the parts of document concerned by updates. We propose correct subtrees for which re-validation fails: if validator fails at node p, a correction routine is called in order compute corrections subtree rooted within given threshold. Then validation continues. In process, we limit ourselves single typed tree language. The uses edit distance matrices. Different versions are proposed user.

XML constraints are either schema representing rules about document structure (e.g. a DTD, an Schema definition or specification in Relax-NG), integrity constraints, which the values contained documents primary keys, foreign etc.). We address problem of incrementally verifying these when modified by updates. The is tree, whose nodes element (or attribute) names and leaves associated to document. Considered updates insertion, deletion replacement any subtree tree. represented tree automata...

PEWS (Predicate Path Expression for Web Services) is a programming language the definition of web service behavioral interfaces. programs can be used description both simple and composite services. Simple services built from scratch, by combination operations defined in WSDL file. Composite are constructed existing services, accessed using their descriptions. operators help to define order which will performed.

Given a regular expression E and word w belonging to the language associated (i.e. /spl isin/ L(E)), we consider following problem: Let w' be obtained from by adding or removing one symbol. In this case, are interested in building new expressions E' such similar that L(E) cup/ {w'} sube/ L(E'). The computed an algorithm called GREC performs changes on finite state automaton accepting L(E), order derive E'. Our method consists proposing different choices, permitting evolution of data...

A temporal data warehouse can be defined as a set V of materialized views over non-temporal sources. We present self-maintainable that, besides V, has two kinds auxiliary views: T relations containing only information necessary to maintain the and C complements allowing maintenance without consulting source databases. Several features our approach make it especially attractive method for warehouses: entire history databases is not stored in warehouse; keeps enough its self-maintenance;...

Journal Article Update Rules in Datalog Programs Get access MíRIAN HALFELD FERRARI ALVES, ALVES Universidade Federal do Paraná, Departamento de Informática, Centro Politécnico, Jardim das AméricasCaixa Postal 19081, Curitiba, 81531-990, Brazil E-mail: mirian@inf.ufpr.br Search for other works by this author on: Oxford Academic Google Scholar DOMINIQUE LAURENT, LAURENT Université Tours, LI/ESI - IUP GEII Info. & Telecom3, Place J. Jaures, F-41000 Blois, France laurent@univ-tours.fr NICOLS...

Recent proposals in the domain of interface description languages for web services stress importance specifying dynamic, behavioral aspects services. The goal this paper is to introduce a new language, called PEWS, that uses predicate path expressions define service behaviours. Our proposal represents simple but expressive way describe order and conditional constraints over operations. PEWS aims be used not only speci- fication also tool describing composition. In paper, we use Action...

PEWS is an interface description language for both individual and composed Web services. Individual services are expressions over WSDL-defined operations while PEWS-defined This paper distinguishes two dimensions of PEWS. The control dimension describes the workflow service, i.e. order in which service will be executed. No data constraints imposed. adds information flow to dimension. In analyse composability substitutability services, we introduce a trace-theoretical presentation constructs....