Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
A Taxonomy of Indexing Schemes for Parallel Database Systems
Distributed and Parallel Databases
Global parallel index for multi-processors database systems
Information Sciences: an International Journal
In-Route Nearest Neighbor Queries
Geoinformatica
Research in mobile database query optimization and processing
Mobile Information Systems
K nearest neighbor search in navigation systems
Mobile Information Systems
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A context-aware Tour Guide: User implications
Mobile Information Systems
Hierarchical Route Representation, Indexing, and Search
IEEE Pervasive Computing
Heuristic algorithms for route-search queries over geographical data
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Route Search over Probabilistic Geospatial Data
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
In-Route skyline querying for location-based services
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
Constrained shortest path computation
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Optimized skyline queries on road networks using nearest neighbors
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
Most query searches on road networks are either to find objects within a certain range (range search) or to find k nearest neighbors (kNN) on the actual road network map. In this paper, we propose a novel query, that is, path branch point (PBP). PBP can be defined as given a set of candidate interest objects and a pre-defined path starts from S and end at E, find a path which starts from S, via an interest point P and ends at E. This path should overlap with the user's ad hoc (pre-defined) path as much as possible with an acceptable distance increment. This is a novel query which is motivated by users' common requirements because most users have an ad hoc path in their daily travel and can tolerate a longer driving distance to some extent if they can drive on a familiar path. In this proposed approach, an Adjust Score is calculated for each path which is determined by overlapping distance and increased distance cost. Our experiment verifies the applicability of the proposed approach to solve the queries, which involves finding the optimal path branch points.