The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Communications of the ACM
Data models in geographic information systems
Communications of the ACM
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Topological sorting of large networks
Communications of the ACM
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Fundamentals of Data Structures in C
Fundamentals of Data Structures in C
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Adaptive nearest neighbor queries in travel time networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Exploiting a page-level upper bound for multi-type nearest neighbor queries
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic 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
Object fusion in geographic information systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The optimal sequenced route query
The VLDB Journal — The International Journal on Very Large Data Bases
Spatio-temporal network databases and routing algorithms: a summary of results
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Constrained shortest path computation
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Route Search over Probabilistic Geospatial Data
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
An interactive approach to route search
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Interactive route search in the presence of order constraints
Proceedings of the VLDB Endowment
On multi-type reverse nearest neighbor search
Data & Knowledge Engineering
Keyword-aware optimal route search
Proceedings of the VLDB Endowment
Interactive traffic-aware route search on smartphones
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Group trip planning queries in spatial databases
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number of constraints. Unfortunately, most of these constrained TPS cannot be directly answered by any of the existing algorithms. By formulating each restriction into rules, we propose a novel form of route query, namely the multi-rule partial sequenced route (MRPSR) query. Our work provides a unified framework that also subsumes the well-known trip planning query (TPQ) and the optimal sequenced route (OSR) query. In this paper, we first prove that MRPSR is NP-hard and then present three heuristic algorithms to search for near-optimal solutions for the MRPSR query. Our extensive simulations show that all of the proposed algorithms can answer the MRPSR query effectively and efficiently. Using both real and synthetic datasets, we investigate the performance of our algorithms with the metrics of the route distance and the response time in terms of the percentage of the constrained points of interest (POI) categories. Compared to the LORD-based brute-force solution, the response times of our algorithms are remarkably reduced while the resulting route length is only slightly longer than the shortest route.