Sciweavers

481 search results - page 51 / 97
» Approximate XML Query Answers
Sort
View
EDBT
2008
ACM
103views Database» more  EDBT 2008»
14 years 8 months ago
A stratified approach to progressive approximate joins
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)...
Wee Hyong Tok, Stéphane Bressan, Mong-Li Le...
WWW
2008
ACM
14 years 8 months ago
A semantic layer for publishing and localizing xml data for a p2p xquery mediator
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 ...
Florin Dragan, Georges Gardarin, Laurent Yeh
FSTTCS
2004
Springer
14 years 1 months ago
Approximate Range Searching Using Binary Space Partitions
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, ...
Mark de Berg, Micha Streppel
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
14 years 1 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
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...
Laurent Flindt Muller, Martin Zachariasen
TODS
2002
92views more  TODS 2002»
13 years 7 months ago
Searching in metric spaces with user-defined and approximate distances
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...
Paolo Ciaccia, Marco Patella