Sciweavers

134 search results - page 15 / 27
» Using Regular Tree Automata as XML Schemas
Sort
View
ICALP
2000
Springer
13 years 10 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
DSOM
2004
Springer
14 years 3 days ago
A Formal Validation Model for the Netconf Protocol
Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate...
Sylvain Hallé, Rudy Deca, Omar Cherkaoui, R...
ICDE
2010
IEEE
263views Database» more  ICDE 2010»
14 years 6 months ago
Managing Uncertainty of XML Schema Matching
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
Reynold Cheng, Jian Gong, David W. Cheung
ADC
2003
Springer
139views Database» more  ADC 2003»
13 years 12 months ago
Deriving Relation Keys from XML Keys
Much work on XML data was around storage and querying and did not consider constraints of XML, especially keys. Since constraints have been proposed in many papers for XML, much r...
Qing Wang, Hongwei Wu, Jianchang Xiao, Aoying Zhou...
VLDB
2001
ACM
148views Database» more  VLDB 2001»
13 years 11 months ago
Indexing and Querying XML Data for Regular Path Expressions
With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query languag...
Quanzhong Li, Bongki Moon