Sciweavers

134 search results - page 16 / 27
» Using Regular Tree Automata as XML Schemas
Sort
View
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 6 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
BTW
2003
Springer
129views Database» more  BTW 2003»
13 years 12 months ago
Type Checking in XOBE
: XML is the upcoming standard for internet data. Java is the most important programming language for internet applications. Nevertheless, in today’s languages and tools there is...
Martin Kempa, Volker Linnemann
CAV
2004
Springer
130views Hardware» more  CAV 2004»
13 years 10 months ago
Global Model-Checking of Infinite-State Systems
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
Nir Piterman, Moshe Y. Vardi
ICDE
2003
IEEE
209views Database» more  ICDE 2003»
14 years 8 months ago
An Evaluation of Regular Path Expressions with Qualifiers against XML Streams
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
Dan Olteanu, François Bry, Tobias Kiesling
PPDP
2010
Springer
13 years 4 months ago
Rewrite-based verification of XML updates
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
Florent Jacquemard, Michaël Rusinowitch