1388 search results - page 183 / 278 » Querying Linguistic Trees |
158
click to vote
AINA
2008
IEEE
16 years 26 days ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
175
click to vote
CIKM
2005
Springer
15 years 12 months ago
2005
Springer
The method of assigning labels to the nodes of the XML tree is called a labeling scheme. Based on the labels only, both ordered and un-ordered queries can be processed without acc...
181
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
227
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
182
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...