Sciweavers

444 search results - page 27 / 89
» Instance optimal query processing in spatial networks
Sort
View
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
14 years 9 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 2 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
JGTOOLS
2008
100views more  JGTOOLS 2008»
13 years 8 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
AINA
2009
IEEE
14 years 2 months ago
Multi-node Processing for Asymmetrical Communications in Underwater Acoustic Networks
— Underwater acoustic communication networks have attracted attention for its applications in many areas such as mine warfare, rapid environmental assessment or search and rescue...
Antonio Silva, Julien Huillery, Sergio M. Jesus
PVLDB
2008
104views more  PVLDB 2008»
13 years 7 months ago
Scalable multi-query optimization for exploratory queries over federated scientific databases
The diversity and large volumes of data processed in the Natural Sciences today has led to a proliferation of highlyspecialized and autonomous scientific databases with inherent a...
Anastasios Kementsietsidis, Frank Neven, Dieter Va...