20 search results - page 3 / 4 » Tree Automata and XPath on Compressed Trees |
LICS
2005
IEEE
14 years 28 days 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...
LICS
2007
IEEE
14 years 1 months 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 ...
CSL
2003
Springer
14 years 17 days ago
2003
Springer
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...
ADBIS
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
ERCIMDL
2009
Springer
14 years 1 months ago
2009
Springer
This paper presents a structure we call XML Wavelet Tree (XWT) to represent any XML document in a compressed and self-indexed form. Therefore, any query or procedure that could be ...