Sciweavers

1018 search results - page 102 / 204
» On the minimization of XPath queries
Sort
View
PVLDB
2010
225views more  PVLDB 2010»
14 years 8 months ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
122
Voted
SIGMOD
2011
ACM
267views Database» more  SIGMOD 2011»
14 years 4 months ago
A latency and fault-tolerance optimizer for online parallel query plans
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
Prasang Upadhyaya, YongChul Kwon, Magdalena Balazi...
ICDE
2006
IEEE
186views Database» more  ICDE 2006»
16 years 3 months ago
Energy-Efficient Continuous Isoline Queries in Sensor Networks
Environmental monitoring is a promising application for sensor networks. Many scenarios produce geographically correlated readings, making them visually interesting and good targe...
Adam Silberstein, Jun Yang 0001, Rebecca Braynard
ICDE
2004
IEEE
88views Database» more  ICDE 2004»
16 years 3 months ago
Group Nearest Neighbor Queries
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, t...
Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyria...
ICDE
2001
IEEE
141views Database» more  ICDE 2001»
16 years 3 months ago
Processing Queries with Expensive Functions and Large Objects in Distributed Mediator Systems
LeSelect is a mediator system which allows scientists to publish their resources (data and programs) so they can be transparently accessed. The scientists can typically issue quer...
Fabio Porto, Françoise Fabret, Luc Bouganim...