Introduction to algorithms
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
What's special about spatial?: database requirements for vehicle navigation in geographic space
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Randomized algorithms
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Influence sets based on reverse nearest neighbor queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A foundation for representing and querying moving objects
ACM Transactions on Database Systems (TODS)
A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
A polylogarithmic approximation algorithm for the group Steiner tree problem
Journal of Algorithms
Approximation algorithms for TSP with neighborhoods in the plane
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An approximation algorithm for the group Steiner problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
A Framework for Generating Network-Based Moving Objects
Geoinformatica
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
Efficient Cost Models for Spatial Queries Using R-Trees
IEEE Transactions on Knowledge and Data Engineering
Performance of Nearest Neighbor Queries in R-Trees
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
A Spatiotemporal Model and Language for Moving Objects on Road Networks
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Constrained Nearest Neighbor Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Bounds on the Quality of Approximate Solutions to the Group Steiner Problem
Bounds on the Quality of Approximate Solutions to the Group Steiner Problem
Group Nearest Neighbor Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Scalable Spatio-temporal Continuous Query Processing for Location-aware Services
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Clustering objects on a spatial network
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
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
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
A fast unified optimal route query evaluation algorithm
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Processing transitive nearest-neighbor queries in multi-channel access environments
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
The optimal sequenced route query
The VLDB Journal — The International Journal on Very Large Data Bases
The multi-rule partial sequenced route query
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Continuous visible nearest neighbor queries
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Monitoring path nearest neighbor in road networks
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Route Search over Probabilistic Geospatial Data
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Finding N-Most Prevalent Colocated Event Sets
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
From trajectories to activities: a spatio-temporal join approach
Proceedings of the 2009 International Workshop on Location Based Social Networks
An efficient pre-computation technique for approximation KNN search in road networks
Proceedings of the 2009 International Workshop on Location Based Social Networks
An interactive approach to route search
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Multi-type nearest neighbor queries in road networks with time window constraints
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Privacy-aware mobile services over road networks
Proceedings of the VLDB Endowment
Towards the next generation of location-based services
W2GIS'07 Proceedings of the 7th international conference on Web and wireless geographical information systems
Approximating corridors and tours via restriction and relaxation techniques
ACM Transactions on Algorithms (TALG)
Efficient best path monitoring in road networks for instant local traffic information
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Best point detour query in road networks
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Interactive route search in the presence of order constraints
Proceedings of the VLDB Endowment
Planning a day trip on mobile phones with Pi-Pe
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
STS: complex spatio-temporal sequence mining in flickr
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
The detection of scene features in Flickr
ICWL'10 Proceedings of the 2010 international conference on New horizons in web-based learning
On multi-type reverse nearest neighbor search
Data & Knowledge Engineering
Coupling or decoupling for KNN search on road networks?: a hybrid framework on user query patterns
Proceedings of the 20th ACM international conference on Information and knowledge management
Subject-oriented top-k hot region queries in spatial dataset
Proceedings of the 20th ACM international conference on Information and knowledge management
Multi-approximate-keyword routing in GIS data
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Mining spatial colocation patterns: a different framework
Data Mining and Knowledge Discovery
Continuous distance-based skyline queries in road networks
Information Systems
Single-Source multi-target a* algorithm for POI queries on road network
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
Traffic aware route planning in dynamic road networks
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Computing shortest heterochromatic monotone routes
Operations Research Letters
Probabilistic planning with non-linear utility functions and worst-case guarantees
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Keyword-aware optimal route search
Proceedings of the VLDB Endowment
SCOUT: prefetching for latent structure following queries
Proceedings of the VLDB Endowment
Finding Alternative Shortest Paths in Spatial Networks
ACM Transactions on Database Systems (TODS)
The exact distance to destination in undirected world
The VLDB Journal — The International Journal on Very Large Data Bases
Interactive traffic-aware route search on smartphones
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Continuous range k-nearest neighbor queries in vehicular ad hoc networks
Journal of Systems and Software
Tour suggestion for outdoor activities
W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Spatial-temporal query homogeneity for KNN object search on road networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Parameterized algorithms for generalized traveling salesman problems in road networks
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Maximizing the number of worker's self-selected tasks in spatial crowdsourcing
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in 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 |
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to a specific category, a starting point S and a destination E, TPQ retrieves the best trip that starts at S, passes through at least one point from each category, and ends at E. For example, a driver traveling from Boston to Providence might want to stop to a gas station, a bank and a post office on his way, and the goal is to provide him with the best possible route (in terms of distance, traffic, road conditions, etc.). The difficulty of this query lies in the existence of multiple choices per category. In this paper, we study fast approximation algorithms for TPQ in a metric space. We provide a number of approximation algorithms with approximation ratios that depend on either the number of categories, the maximum number of points per category or both. Therefore, for different instances of the problem, we can choose the algorithm with the best approximation ratio, since they all run in polynomial time. Furthermore, we use some of the proposed algorithms to derive efficient heuristics for large datasets stored in external memory. Finally, we give an experimental evaluation of the proposed algorithms using both synthetic and real datasets.