Sciweavers

2608 search results - page 337 / 522
» Inferring Answers to Queries
Sort
View
EDBT
2008
ACM
103views Database» more  EDBT 2008»
16 years 6 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...
ICDE
2010
IEEE
874views Database» more  ICDE 2010»
16 years 6 months ago
UV-Diagram: A Voronoi Diagram for Uncertain Data
The Voronoi diagram is an important technique for answering nearest-neighbor queries for spatial databases. In this paper, we study how the Voronoi diagram can be used on uncertain...
Reynold Cheng, Xike Xie, Man Lung Yiu, Jinchuan Ch...
ICDE
2010
IEEE
208views Database» more  ICDE 2010»
16 years 6 months ago
Intensional Associations in Dataspaces
Dataspace applications necessitate the creation of associations among data items over time. For example, once information about people is extracted from sources on the Web, associa...
Marcos Antonio Vaz Salles, Jens Dittrich, Lukas Bl...
SIGCOMM
2009
ACM
16 years 1 months ago
ROAR: increasing the flexibility and performance of distributed search
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
Costin Raiciu, Felipe Huici, Mark Handley, David S...
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
16 years 22 days 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