Sciweavers

6004 search results - page 454 / 1201
» Parallelizing query optimization
Sort
View
MOBIDE
2010
ACM
15 years 7 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
EOR
2010
178views more  EOR 2010»
15 years 7 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...
SIGMOD
2008
ACM
122views Database» more  SIGMOD 2008»
15 years 7 months ago
UQBE: uncertain query by example for web service mashup
The UQBE is a mashup tool for non-programmers that supports query-by-example (QBE) over a schema made up by the user without knowing the schema of the original sources. Based on a...
Jun'ichi Tatemura, Songting Chen, Fenglin Liao, Ol...
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
14 years 11 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
NIS
1998
131views more  NIS 1998»
15 years 6 months ago
Dynamic Memory Allocation for Large Query Execution
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
Luc Bouganim, Olga Kapitskaia, Patrick Valduriez