Query Processing in Spatial Databases Containing Obstacles
Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance b...
Saved in:
Main Authors: | ZHANG, Jun, Papadias, Dimitris, Mouratidis, Kyriakos, ZHU, Manli |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/174 https://ink.library.smu.edu.sg/context/sis_research/article/1173/viewcontent/IJGIS05_SODB.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Tree-based Partition Querying: A Methodology for Computing Medoids in Large Spatial Datasets
by: MOURATIDIS, Kyriakos, et al.
Published: (2008) -
Spatial Queries in the Presence of Obstacles
by: ZHANG, Jun, et al.
Published: (2004) -
Aggregate Nearest Neighbor Queries in Spatial Databases
by: PAPADIAS, Dimitris, et al.
Published: (2005) -
Continuous Visible Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2011) -
Medoid Queries in Large Spatial Databases
by: MOURATIDIS, Kyriakos, et al.
Published: (2005)