東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Modeling and processing directional ...

Liu, Xuan.

Linked to FindBook

Google Book

Amazon

博客來

Modeling and processing directional relationships in spatial databases.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Modeling and processing directional relationships in spatial databases./
Author:	Liu, Xuan.
Description:	152 p.
Notes:	Adviser: Shashi Shekhar.
Contained By:	Dissertation Abstracts International61-07B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9980322
ISBN:	0599864389

Modeling and processing directional relationships in spatial databases.
Liu, Xuan.

Modeling and processing directional relationships in spatial databases. - 152 p.

Adviser: Shashi Shekhar.

Thesis (Ph.D.)--University of Minnesota, 2000.

Direction based spatial relationships are critical in many domains including geographic information systems (GIS) and image interpretation. They are also frequently used as selection conditions in spatial queries. Previous work modeled directions as binary boolean relationships and performed qualitative reasoning by enumerating a large number of inference rules without an independent interpretation model. The research of query processing in previous work has focused on processing absolute directions using range query strategies. However, many direction queries depend on the orientation of reference objects (or the viewer), which may change due to motion. Classical methods are inefficient when the orientation of the reference object is different from that of the global reference system.

ISBN: 0599864389Subjects--Topical Terms:

626642
Computer Science.

Modeling and processing directional relationships in spatial databases.
LDR:03083nam 2200277 a 45 001 929526
005 20110427
008 110427s2000 ||||||||||||||||| ||eng d
020 $a 0599864389
035 $a (UnM)AAI9980322
035 $a AAI9980322
040 $a UnM $c UnM
100 1 $a Liu, Xuan. $3 1253013
245 1 0 $a Modeling and processing directional relationships in spatial databases.
300 $a 152 p.
500 $a Adviser: Shashi Shekhar.
500 $a Source: Dissertation Abstracts International, Volume: 61-07, Section: B, page: 3693.
502 $a Thesis (Ph.D.)--University of Minnesota, 2000.
520 $a Direction based spatial relationships are critical in many domains including geographic information systems (GIS) and image interpretation. They are also frequently used as selection conditions in spatial queries. Previous work modeled directions as binary boolean relationships and performed qualitative reasoning by enumerating a large number of inference rules without an independent interpretation model. The research of query processing in previous work has focused on processing absolute directions using range query strategies. However, many direction queries depend on the orientation of reference objects (or the viewer), which may change due to motion. Classical methods are inefficient when the orientation of the reference object is different from that of the global reference system.
520 $a The goal of this research is to define and explore new direction models and new processing strategies for direction queries. As a departure from traditional methods, we propose a vector-based framework to model direction as a spatial object. This object view of direction enables the definition of new spatial level. By extending to equivalence classes of direction objects, we can unify spatial reasoning with different direction predicate sets. The equivalence classes together with the algebra defined on them provide an independent interpretation model for qualitative direction reasoning. We also propose a new, efficient and scalable algorithm, namely open shape-based strategy (OSS), to process direction queries in spatial databases. OSS converts the processing of the directional queries to the processing of topological operations between open shapes and objects. It eliminates false hits at the earliest opportunity while recursively searching hierarchical indices like R-tree. Since OSS models the direction region as an open shape, it also eliminates the computation related to the embedding world boundary. We explore the behavior of OSS in detail by performing algebraic analysis and experimental evaluation on different datasets. The results show that OSS consistently outperforms classical range query strategies in terms of both I/O and CPU cost. OSS also shows better scalability for large data sets.
590 $a School code: 0130.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Minnesota. $3 676231
773 0 $t Dissertation Abstracts International $g 61-07B.
790 $a 0130
790 1 0 $a Shekhar, Shashi, $e advisor
791 $a Ph.D.
792 $a 2000
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9980322