481 search results - page 51 / 97 » Approximate XML Query Answers |
EDBT
2008
ACM
15 years 12 months ago
2008
ACM
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
WWW
2008
ACM
16 years 14 days ago
2008
ACM
In this poster, we present the P2P XML data localization layer of XLive, an XQuery mediation system developed at University of Versailles [2]. A major challenge in the evaluation ...
112
click to vote
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
139
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
119
click to vote
TODS
2002
14 years 11 months ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...