On trip planning queries in Spatial Databases

Lecture Notes in Computer Science

Volumn 3633, Issue , 2005, Pages 273-290

  Li, Feifei ^a   Cheng, Dihan ^a   Hadjieleftheriou, Marios ^a   Kollios, George ^a   Teng, Shang Hua ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATABASE SYSTEMS;

EXTERNAL MEMORY; METRIC SPACE; TRIP PLANNING QUERY (TPQ);

QUERY LANGUAGES;

EID: 26444466035     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11535331_16     Document Type: Conference Paper

References (43)

1. S. Arora. Polynomial time approximation schemes for euclidean tsp and other geometric problems. In FOCS, page 2, 1996.
2. S. Arora. Approximation schemes for NP-hard geometric optimization problems: A survey. Mathematical Programming, 2003.
3. N. Bansal, A. Blum, S. Chawla, and A. Meyerson. Approximation algorithms for deadlinetsp and vehicle routing with time-windows. In STOC, pages 166-174, 2004.
4. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In SIGMOD, pages 220-231, 1990.
5. R. Benetis, C. S. Jensen, G. Karciauskas, and S. Saltenis. Nearest neighbor and reverse nearest neighbor queries for moving objects. In IDEAS, pages 44-53, 2002.
6. S. Berchtold, C. Böhm, D. A. Keim, and H.-P. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In PODS, pages 78-86, 1997.
7. C. Böhm. A cost model for query processing in high dimensional data spaces. TODS, 25(2):129-178, 2000.
8. T. Brinkhoff. A framework for generating network-based moving objects. GeoInformatica, 6(2):153-180, 2002.
9. N. Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Computer Science Department,Carnegie Mellon University, 1976.
10. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 1997.
11. A. Dumitrescu and J. S. B. Mitchell. Approximation algorithms for tsp with neighborhoods in the plane. In SODA, pages 38-46, 2001.
12. Max J. Egenhofer. What's special about spatial?: database requirements for vehicle navigation in geographic space. In SIGMOD, pages 398-402, 1993.
13. G. Even and G. Kortsarz. An approximation algorithm for the group steiner problem. In SODA, pages 49-58, 2002.
14. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences, 69(3):485-497, 2004.
15. H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A. E. Abbadi. Constrained nearest neighbor queries. In SSTD, pages 257-278, 2001.
16. N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. Journal of Algorithms, 37(1):66-84, 2000.
17. R. Hartmut Guting, M. H. Bohlen, M. Erwig, C. S. Jensen, N. A. Lorentzos, M. Schneider, and M. Vazirgiannis. A foundation for representing and querying moving objects. TODS, 25(1):1-42, 2000.
18. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
19. G. Hjaltason and H. Samet. Distance Browsing in Spatial Databases. TODS, 24(2):265-318, 1999.
20. E. Ihler. Bounds on the Quality of Approximate Solutions to the Group Steiner Problem. Technical report, Institut fur Informatik,Uiversity Freiburg, 1990.
21. M. R. Kolahdouzan and C. Shahabi. Voronoi-based k nearest neighbor search for spatial network databases. In VLDB, pages 840-851, 2004.
22. F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In SIGMOD, pages 201-212, 2000.
23. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
24. Y. S. Myung, C. H. Lee, and D. W. Tcha. On the Generalized Minimum Spanning Tree Problem. Networks, 26:231-241, 1995.
25. Digital Chart of the World Server, http://www.maproom.psu.edu/dcw/.
26. D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis. Group nearest neighbor queries. In ICDE, pages 301-312, 2004.
27. D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query processing in spatial network databases. In VLDB, pages 802-813, 2003.
28. A. Papadopoulos and Y. Manolopoulos. Performance of nearest neighbor queries in r-trees. In ICDT, pages 394-408, 1997.
29. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In SIGMOD, pages 71-79, 1995.
30. C. Shahabi, M. R. Kolahdouzan, and M. Sharifzadeh. A road network embedding technique for k-nearest neighbor search in moving object databases. In GIS, pages 94-100, 2002.
31. M. Sharifzadeh, M. Kolahdouzan, and C. Shahabi. The Optimal Sequenced Route Query. Technical report, Computer Science Department, University of Southern California, 2005.
32. S. Shekhar and D.-R. Liu. Ccam: A connectivity-clustered access method for networks and network computations. TKDE, 9(1):102-119, 1997.
33. TSP Home Web Site, http://www.tsp.gatech.edu/.
34. D. A. Spielman and S.-H. Teng. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. In STOC, pages 296-305, 2001.
35. U.S. Geological Survey, http://www.usgs.gov/.
36. Y. Tao and D. Papadias. Time-parameterized queries in spatio-temporal databases. In SIGMOD, pages 334-345, 2002.
37. Y. Tao, D. Papadias, and Q. Shen. Continuous nearest neighbor search. In VLDB, pages 287-298, 2002.
38. Y. Tao, J. Zhang, D. Papadias, and N. Mamoulis. An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces. TKDE, 16(10):1169-1184, 2004.
39. Y. Theodoridis, E. Stefanakis, and T. Sellis. Efficient cost models for spatial queries using r-trees. TKDE, 12(1):19-32, 2000.
40. M. Vazirgiannis and O. Wolfson. A spatiotemporal model and language for moving objects on road networks. In SSTD, pages 20-35, 2001.
41. X. Xiong, M. F. Mokbel, and W. G. Aref. Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In ICDE, pages 643-654, 2005.
42. X. Xiong, M. F. Mokbel, W. G. Aref, S. E. Hambrusch, and S. Prabhakar. Scalable spatio-temporal continuous query processing for location-aware services. In SSDBM, pages 317-327, 2004.
43. M. L. Yiu and N. Mamoulis. Clustering objects on a spatial network. In SIGMOD, pages 443-454, 2004.