Sciweavers

93 search results - page 10 / 19
» XPath: (P)DL on Trees
Sort
View
WEBDB
2009
Springer
185views Database» more  WEBDB 2009»
14 years 3 months ago
Efficient and Scalable Sequence-Based XML Filtering
The ubiquitous adoption of XML as the standard of data exchange over the web has led to increased interest in building efficient and scalable XML publish-subscribe (pub-sub) syste...
Mariam Salloum, Vassilis J. Tsotras
LICS
2005
IEEE
14 years 2 months ago
Looping Caterpillars
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
Evan Goris, Maarten Marx
PODS
2008
ACM
120views Database» more  PODS 2008»
14 years 9 months ago
Effective characterizations of tree logics
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
Mikolaj Bojanzyk
LICS
2002
IEEE
14 years 1 months ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
LICS
2007
IEEE
14 years 3 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic