621 search results - page 1 / 125 » Efficient algorithms for minimizing tree pattern queries |
SIGMOD
2002
ACM
14 years 4 months ago
2002
ACM
SIGMOD
2008
ACM
13 years 4 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
VLDB
2002
ACM
14 years 4 months ago
2002
ACM
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...
CIKM
2009
Springer
13 years 9 months ago
2009
Springer
Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patter...
BNCOD
2009
13 years 5 months ago
2009
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...