Sciweavers

50 search results - page 6 / 10
» Distance join queries on spatial networks
Sort
View
ICDE
2007
IEEE
125views Database» more  ICDE 2007»
14 years 1 months ago
Privacy Protected Query Processing on Spatial Networks
With the proliferation of mobile devices (e.g., PDAs, cell phones, etc.), location-based services have become more and more popular in recent years. However, users have to reveal ...
Wei-Shinn Ku, Roger Zimmermann, Wen-Chih Peng, Sus...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 7 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
ICDE
2011
IEEE
288views Database» more  ICDE 2011»
12 years 11 months ago
Optimal location queries in road network databases
— Optimal location (OL) queries are a type of spatial queries particularly useful for the strategic planning of resources. Given a set of existing facilities and a set of clients...
Xiaokui Xiao, Bin Yao 0002, Feifei Li
VLDB
2004
ACM
187views Database» more  VLDB 2004»
14 years 29 days ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi
MDM
2010
Springer
177views Communications» more  MDM 2010»
14 years 12 days ago
Supporting Continuous Range Queries in Indoor Space
—Range query processing is an important technology in spatial databases. Current studies mainly focus on range queries in outdoor space based on the Euclidean or network distance...
Wenjie Yuan, Markus Schneider