Distance join queries on spatial networks

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2006, Pages 211-218

  Sankaranarayanan, Jagan ^a   Alborzi, Houman ^a   Samet, Hanan ^a  

^a University of Maryland ^*  (United States)

Author keywords

Location based services; Path coherence; Query processing; SILC framework; Spatial databases; Spatial networks

Indexed keywords

LOCATION-BASED SERVICES; PATH COHERENCE; SPATIAL DATABASES; SPATIAL NETWORKS;

ALGORITHMS; DATABASE SYSTEMS; DISTANCE MEASUREMENT; SET THEORY;

QUERY PROCESSING;

EID: 34547406735     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183471.1183506     Document Type: Conference Paper

References (20)

1. S. N. Bespamyatnikh. An optimal algorithm for closest pair maintenance. In SCG '95: Proceedings of the Annual Symposium on Computational Geometry, pages 152-161, Vancouver, Canada, June 1995.
2. T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient processing of spatial joins using R-trees. In SIGMOD '93: Proceedings of the ACM SIGMOD Conference, pages 237-246, Washington, DC, May 1993.
3. M. J. Carey and D. Kossmann. On saying "enough already!" in SQL. In SIGMOD '97: Proceedings of the International Conference on Management of Data, pages 219-230, Tucson, AZ, May 1997.
4. H.-J. Cho and C-W. Chung. An efficient and scalable approach to CNN queries in a road network. In VLDB'05: Proceedings of the 31th International Conference on Very Large Data Bases, pages 865-876, Trondheim, Norway, Sept. 2005.
5. K. L. Clarkson. Fast algorithm for the all nearest neighbors problem. In FOCS '88: Proceedings of the 24th IEEE Annual Symposium on Foundations of Computer Science, pages 226-232, Tucson, AZ, Nov. 1983.
6. I. Gargantini. An effective way to represent quadtrees. Commun. ACM, 25(12):905-910, Dec. 1982.
7. A. V. Goldberg and R. F. Werneck. Computing point-to-point shortest paths from external memory. In ALENEX '05: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments, Vancouver, Canada, Jan. 2005.
8. A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD '84: Proceedings of the International Conference on Management of Data, pages 47-57, Boston, MA, June 1984.
9. G. R. Hjaltason and H. Samet. Ranking in spatial databases. In SSD '95: Proceedings of the 4th International Symposium on Large Spatial Databases, pages 83-95, Portland, ME, Aug. 1995.
10. G. R. Hjaltason and H. Samet. Incremental distance join algorithms for spatial databases. In SIGMOD '98: Proceedings of the International Conference on Management of Data, pages 237-248, Seattle, WA, June 1998.
11. N. Jing, Y.-W. Huang, and E. A. Rundensteiner. Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation. IEEE Transactions on Knowledge and Data Engineering, 10(3):409-432, May 1998."
12. M. R. Kolahdouzan and C. Shahabi. Voronoi-based k nearest neighbor search for spatial network databases. In VLDB'04: Proceedings of the 30th International Conference on Very Large Data Bases, pages 840-851, Toronto, Canada, Sept. 2004.
13. D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query processing in spatial network databases. In VLDB '03: Proceedings of the 29th International Conference on Very Large Databases, pages 802-813, Berlin, Germany, Sept. 2003.
14. H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann, San Francisco, CA, Aug. 2006.
15. J. Sankaranarayanan, H. Alborzi, and H. Samet. Efficient query processing on spatial networks. In GIS '05: Proceedings of the 18th ACM International Workshop on Geographic Information Systems, pages 200-209, Bremen, Germany, Nov. 2005.
16. C. Shahabi, M. R. Kolahdouzan, and M. Sharifzadeh. A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica, 7(3):255-273, Sept. 2003.
17. S. Shekhar and J. S. Yoo. Processing in-route nearest neighbor queries: a comparison of alternative approaches. In GIS '03: Proceedings of the 11th ACM International Symposium on Advances in Geographic Information Systems, pages 9-16, New Orleans, LA, 2003.
18. H. Shin, B. Moon, and S. Lee. Adaptive multi-stage distance join processing. In SIGMOD '00: Proceedings of the International Conference on Management of Data, pages 343-354, Dallas, TX, May 2000.
19. P. M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbor problem. Discrete & Computational Geometry, 4(2):101-115, 1989.
20. O. Wolfson, P. Sistla, B. Xu, J. Zhou, and S. Chamberlain. Domino: databases for moving objects tracking. In SIGMOD '99: Proceedings of the International Conference on Management of Data, pages 547-549, Philadelphia, PA, June 1999.