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