Sciweavers

360 search results - page 16 / 72
» Distributed Network Querying with Bounded Approximate Cachin...
Sort
View
183
Voted
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
15 years 11 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
97
Voted
DMSN
2004
ACM
15 years 2 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
MOBICOM
2010
ACM
14 years 9 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
CIKM
2009
Springer
15 years 1 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
EDBT
2006
ACM
136views Database» more  EDBT 2006»
15 years 9 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen