Sciweavers

62 search results - page 4 / 13
» Tree Logical Classes for Efficient Evaluation of XQuery
Sort
View
FSTTCS
2007
Springer
14 years 20 days ago
Efficient and Expressive Tree Filters
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
Michael Benedikt, Alan Jeffrey
LICS
2002
IEEE
14 years 1 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
NJC
2006
102views more  NJC 2006»
13 years 8 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
SAC
2010
ACM
14 years 3 months ago
Towards the induction of terminological decision trees
A concept learning framework for terminological representations is introduced. It is grounded on a method for inducing logic decision trees as an adaptation of the classic tree in...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 9 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...