Sciweavers

190 search results - page 5 / 38
» Providing Diversity in K-Nearest Neighbor Query Results
Sort
View
DASFAA
2011
IEEE
221views Database» more  DASFAA 2011»
12 years 10 months ago
A Unified Algorithm for Continuous Monitoring of Spatial Queries
Continuous monitoring of spatial queries has gained significant research attention in the past few years. Although numerous algorithms have been proposed to solve specific queries...
Mahady Hasan, Muhammad Aamir Cheema, Xuemin Lin, W...
VLDB
2009
ACM
381views Database» more  VLDB 2009»
14 years 8 months ago
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive...
Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei...
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
14 years 8 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...
GIS
2010
ACM
13 years 7 months ago
Verifying spatial queries using Voronoi neighbors
With the popularity of location-based services and the abundant usage of smart phones and GPS enabled devices, the necessity of outsourcing spatial data has grown rapidly over the...
Ling Hu, Wei-Shinn Ku, Spiridon Bakiras, Cyrus Sha...
EDBT
2008
ACM
99views Database» more  EDBT 2008»
14 years 8 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan