語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Nearest neighbor queries in spatial ...
~
Kolahdouzan, Mohammad R.
FindBook
Google Book
Amazon
博客來
Nearest neighbor queries in spatial network databases.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Nearest neighbor queries in spatial network databases./
作者:
Kolahdouzan, Mohammad R.
面頁冊數:
126 p.
附註:
Source: Dissertation Abstracts International, Volume: 65-09, Section: B, page: 4667.
Contained By:
Dissertation Abstracts International65-09B.
標題:
Computer Science. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3145221
ISBN:
0496047604
Nearest neighbor queries in spatial network databases.
Kolahdouzan, Mohammad R.
Nearest neighbor queries in spatial network databases.
- 126 p.
Source: Dissertation Abstracts International, Volume: 65-09, Section: B, page: 4667.
Thesis (Ph.D.)--University of Southern California, 2004.
A very frequent type of query in Geographical Information Systems is to find the K-nearest neighbors (KNN) of a query object. Majority of the current studies on KNN in spatial databases are aimed at Euclidean spaces/distances. However, the distances between objects in spatial network databases, SNDB (e.g., road networks), are usually defined as the length of the shortest path between them, rendering the current solutions impractical. In this dissertation, we propose solutions for variations of KNN queries in SNDB. We propose two approaches to address regular KNN queries. The first approach is based on transforming the two dimensional (road) networks to a higher dimensional space and utilizing computationally simple Minkowski distance metrics for distance measurement to provide a better approximate result set for a KNN query as compared to the current solutions. This approach is appropriate only where small percentage of false results is tolerable. The second proposed approach, termed VN3, provides an exact result set for the KNN queries by utilizing network Voronoi diagrams (NVD). The solution is based on an iterative process that contains filter and refinement steps. In the filter step, objects are added to a candidate set by utilizing the properties introduced in VN3. In the refinement step, the next nearest neighbor of the query is selected by utilizing some pre-computed shortest path distances. We also propose two solutions for continuous KNN queries of a path. The first solution finds the KNNs of each node on the path and then determines the locations of split points between every two adjacent nodes. The second solution eliminates the need for finding KNN queries of some nodes on the path by determining the minimum distance that the KNNs of a moving query object remain the same. We also address group NN queries by concurrently finding the next NN of all query objects and maintaining a sorted list of the points based on their aggregate distances to the objects. Finally, we show how the properties of VN3 can be utilized to address shortest path queries as well as reverse NN queries in SNDB.
ISBN: 0496047604Subjects--Topical Terms:
626642
Computer Science.
Nearest neighbor queries in spatial network databases.
LDR
:02979nmm 2200265 4500
001
1846848
005
20051103093554.5
008
130614s2004 eng d
020
$a
0496047604
035
$a
(UnM)AAI3145221
035
$a
AAI3145221
040
$a
UnM
$c
UnM
100
1
$a
Kolahdouzan, Mohammad R.
$3
1934941
245
1 0
$a
Nearest neighbor queries in spatial network databases.
300
$a
126 p.
500
$a
Source: Dissertation Abstracts International, Volume: 65-09, Section: B, page: 4667.
500
$a
Adviser: Cyrus Shahabi.
502
$a
Thesis (Ph.D.)--University of Southern California, 2004.
520
$a
A very frequent type of query in Geographical Information Systems is to find the K-nearest neighbors (KNN) of a query object. Majority of the current studies on KNN in spatial databases are aimed at Euclidean spaces/distances. However, the distances between objects in spatial network databases, SNDB (e.g., road networks), are usually defined as the length of the shortest path between them, rendering the current solutions impractical. In this dissertation, we propose solutions for variations of KNN queries in SNDB. We propose two approaches to address regular KNN queries. The first approach is based on transforming the two dimensional (road) networks to a higher dimensional space and utilizing computationally simple Minkowski distance metrics for distance measurement to provide a better approximate result set for a KNN query as compared to the current solutions. This approach is appropriate only where small percentage of false results is tolerable. The second proposed approach, termed VN3, provides an exact result set for the KNN queries by utilizing network Voronoi diagrams (NVD). The solution is based on an iterative process that contains filter and refinement steps. In the filter step, objects are added to a candidate set by utilizing the properties introduced in VN3. In the refinement step, the next nearest neighbor of the query is selected by utilizing some pre-computed shortest path distances. We also propose two solutions for continuous KNN queries of a path. The first solution finds the KNNs of each node on the path and then determines the locations of split points between every two adjacent nodes. The second solution eliminates the need for finding KNN queries of some nodes on the path by determining the minimum distance that the KNNs of a moving query object remain the same. We also address group NN queries by concurrently finding the next NN of all query objects and maintaining a sorted list of the points based on their aggregate distances to the objects. Finally, we show how the properties of VN3 can be utilized to address shortest path queries as well as reverse NN queries in SNDB.
590
$a
School code: 0208.
650
4
$a
Computer Science.
$3
626642
690
$a
0984
710
2 0
$a
University of Southern California.
$3
700129
773
0
$t
Dissertation Abstracts International
$g
65-09B.
790
1 0
$a
Shahabi, Cyrus,
$e
advisor
790
$a
0208
791
$a
Ph.D.
792
$a
2004
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3145221
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9196362
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入