69 search results - page 3 / 14 » Efficient evaluation of radial queries using the target tree |
BNCOD
2009
13 years 7 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, ...
DAWAK
2000
Springer
13 years 10 months ago
2000
Springer
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalize...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
ICDE
2006
IEEE
14 years 7 months ago
2006
IEEE
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...