Sciweavers

44 search results - page 8 / 9
» Anonymous Query Processing in Road Networks
Sort
View
DASFAA
2010
IEEE
224views Database» more  DASFAA 2010»
13 years 10 months ago
Dynamic Skyline Queries in Large Graphs
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
12 years 9 months ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
SUTC
2008
IEEE
13 years 11 months ago
A Cloaking Algorithm Based on Spatial Networks for Location Privacy
Most of research efforts have elaborated on k-anonymity for location privacy. The general architecture for implementing k-anonymity is that there is one trusted server (referred t...
Po-Yi Li, Wen-Chih Peng, Tsung-Wei Wang, Wei-Shinn...
PVLDB
2008
154views more  PVLDB 2008»
13 years 4 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
13 years 10 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...