662 search results - page 35 / 133 » Trees, Automata and XML |
179
click to vote
ASWEC
2007
IEEE
16 years 13 days ago
2007
IEEE
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
151
click to vote
DASFAA
2004
IEEE
15 years 9 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
190
click to vote
WEBDB
2001
Springer
15 years 10 months ago
2001
Springer
For speed and convenience, applications routinely cache XML data locally, and access it through standard parser (SAX) or tree (DOM) interfaces. When the source of this data is a r...
157
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
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...
173
Voted
LICS
2007
IEEE
16 years 10 days ago
2007
IEEE
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 ...