Sciweavers

182 search results - page 25 / 37
» Comparing XML path expressions
Sort
View
POPL
2007
ACM
14 years 9 months ago
Scrap your boilerplate with XPath-like combinators
XML programming involves idioms for expressing `structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the rela...
Ralf Lämmel
SIGMOD
2004
ACM
124views Database» more  SIGMOD 2004»
14 years 8 months ago
BLAS: An Efficient XPath Processing System
We present BLAS , a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses Plabeling to process queries involving consecutive child ax...
Yi Chen, Susan B. Davidson, Yifeng Zheng
JACM
2007
84views more  JACM 2007»
13 years 8 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
DEXAW
2005
IEEE
176views Database» more  DEXAW 2005»
13 years 10 months ago
Indexes and Path Constraints in Semistructured Data
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
Yves Andre, Anne-Cécile Caron, Denis Debarb...
SIGMOD
2010
ACM
149views Database» more  SIGMOD 2010»
13 years 3 months ago
On models and query languages for probabilistic processes
Probabilistic processes appear naturally in various contexts, with applications to Business Processes, XML data management and more. Many models for specifying and querying such p...
Daniel Deutch, Tova Milo