Sciweavers

295 search results - page 28 / 59
» Tuning query performance in mobile sensor databases
Sort
View
SUTC
2006
IEEE
15 years 3 months ago
Transitive Nearest Neighbor Search in Mobile Environments
Given a query point p, typically the position of a current client, and two datasets S and R, a transitive nearest neighbor (TNN) search returns a pair of objects (s, r) ∈ S × R...
Baihua Zheng, Ken C. K. Lee, Wang-Chien Lee
160
Voted
GIS
2007
ACM
15 years 10 months ago
Where were we: communities for sharing space-time trails
We consider trails to be a document type of growing importance, authored in abundance as locative technologies become embedded in mobile devices carried by billions of humans. As ...
Scott Counts, Marc Smith
94
Voted
SSD
2001
Springer
112views Database» more  SSD 2001»
15 years 1 months ago
K-Nearest Neighbor Search for Moving Query Point
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
Zhexuan Song, Nick Roussopoulos
ICDE
2010
IEEE
401views Database» more  ICDE 2010»
15 years 6 months ago
Continuous Query Evaluation over Distributed Sensor Networks
— In this paper1 we address the problem of processing continuous multi-join queries, over distributed data streams. Our approach makes use of existing work in the field of publi...
Oana Jurca, Sebastian Michel, Alexandre Herrmann, ...
ICC
2008
IEEE
135views Communications» more  ICC 2008»
15 years 4 months ago
Using Soft-Line Recursive Response to Improve Query Aggregation in Wireless Sensor Networks
— In large Wireless Sensor Networks (WSNs), each hop might incur varying delays due to medium access contention, transmission and computation delays. Fast and efficient query re...
Xiaoming Lu, Matt Spear, Karl N. Levitt, Norman S....