Sciweavers

137 search results - page 11 / 28
» Efficient Processing of Top-k Spatial Preference Queries
Sort
View
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 7 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
DEXAW
2005
IEEE
193views Database» more  DEXAW 2005»
14 years 10 days ago
Adaptive Distributed Indexing for Spatial Queries in Sensor Networks
Sensor networks have opened new horizons and opportunities for a variety of environmental monitoring, surveillance and healthcare applications. One of the major tasks of sensor ne...
Vladimir Dyo, Cecilia Mascolo
ICDE
2003
IEEE
157views Database» more  ICDE 2003»
14 years 8 months ago
Energy Efficient Index for Querying Location-Dependent Data in Mobile Broadcast Environments
We are witnessing in recent years growing interest for location-dependent information services among mobile users. This paper examines the issue of processing locationdependent qu...
Jianliang Xu, Baihua Zheng, Wang-Chien Lee, Dik Lu...
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 8 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei
MDM
2010
Springer
281views Communications» more  MDM 2010»
13 years 8 months ago
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
Jie Bao 0003, Chi-Yin Chow, Mohamed F. Mokbel, Wei...