Sciweavers

58 search results - page 5 / 12
» Surface k-NN Query Processing
Sort
View
ICDE
2005
IEEE
172views Database» more  ICDE 2005»
14 years 28 days ago
Monitoring K-Nearest Neighbor Queries Over Moving Objects
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem...
Xiaohui Yu, Ken Q. Pu, Nick Koudas
DEXA
2007
Springer
173views Database» more  DEXA 2007»
14 years 1 months ago
A P2P Technique for Continuous k-Nearest-Neighbor Query in Road Networks
Due to the high frequency in location updates and the expensive cost of continuous query processing, server computation capacity and wireless communication bandwidth are the two li...
Fuyu Liu, Kien A. Hua, Tai T. Do
GIS
2007
ACM
14 years 8 months ago
Dynamic storage balancing in a distributed spatial index
We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SD-...
Cédric du Mouza, Philippe Rigaux, Witold Li...
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
14 years 8 months ago
SpaceTwist: Managing the Trade-Offs Among Location Privacy, Query Performance, and Query Accuracy in Mobile Services
In a mobile service scenario, users query a server for nearby points of interest but they may not want to disclose their locations to the service. Intuitively, location privacy may...
Man Lung Yiu, Christian S. Jensen, Xuegang Huang, ...
CIKM
2004
Springer
14 years 22 days ago
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Peer-to-peer Data Networks (PDNs) are large-scale, selforganizing, distributed query processing systems. Familiar examples of PDN are peer-to-peer file-sharing networks, which su...
Farnoush Banaei Kashani, Cyrus Shahabi