東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Towards a unified framework for effi...

Chen, Yun.

Linked to FindBook

Google Book

Amazon

博客來

Towards a unified framework for efficient access methods and query operations in spatio-temporal databases.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Towards a unified framework for efficient access methods and query operations in spatio-temporal databases./
Author:	Chen, Yun.
Description:	130 p.
Notes:	Adviser: Jignesh M. Patel.
Contained By:	Dissertation Abstracts International69-03B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3304944
ISBN:	9780549510031

Towards a unified framework for efficient access methods and query operations in spatio-temporal databases.
Chen, Yun.

Towards a unified framework for efficient access methods and query operations in spatio-temporal databases. - 130 p.

Adviser: Jignesh M. Patel.

Thesis (Ph.D.)--University of Michigan, 2008.

Spatio-temporal databases are required to efficiently support queries on large numbers of continuously moving objects. In this thesis we propose three techniques to address this challenge. We develop the STRIPES indexing method, which indexes predicted trajectories in a dual transformed space. Trajectories for objects in d-dimensional space are transformed into points in 2d-dimensional space and are indexed with a hierarchical grid decomposition structure. STRIPES can evaluate a range of queries including time-slice, window, and moving queries. Extensive experimental evaluation shows that STRIPES is significantly faster than leading existing predicted trajectory index (the TPR*-tree) for both updates and queries.

ISBN: 9780549510031Subjects--Topical Terms:

626642
Computer Science.

Towards a unified framework for efficient access methods and query operations in spatio-temporal databases.
LDR:03293nam 2200289 a 45 001 957691
005 20110630
008 110630s2008 ||||||||||||||||| ||eng d
020 $a 9780549510031
035 $a (UMI)AAI3304944
035 $a AAI3304944
040 $a UMI $c UMI
100 1 $a Chen, Yun. $3 1281033
245 1 0 $a Towards a unified framework for efficient access methods and query operations in spatio-temporal databases.
300 $a 130 p.
500 $a Adviser: Jignesh M. Patel.
500 $a Source: Dissertation Abstracts International, Volume: 69-03, Section: B, page: 1729.
502 $a Thesis (Ph.D.)--University of Michigan, 2008.
520 $a Spatio-temporal databases are required to efficiently support queries on large numbers of continuously moving objects. In this thesis we propose three techniques to address this challenge. We develop the STRIPES indexing method, which indexes predicted trajectories in a dual transformed space. Trajectories for objects in d-dimensional space are transformed into points in 2d-dimensional space and are indexed with a hierarchical grid decomposition structure. STRIPES can evaluate a range of queries including time-slice, window, and moving queries. Extensive experimental evaluation shows that STRIPES is significantly faster than leading existing predicted trajectory index (the TPR*-tree) for both updates and queries.
520 $a The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Traditional R*-tree based methods use a pruning metric called MAXMAXDIST, which allows the algorithms to prune nodes in the index that need not be examined during the ANN computation. We introduce a new pruning metric called NXNDIST, and show that this metric is far more effective than MAXMAXDIST. We also propose the MBRQT index structure, and using extensive experimental evaluation show that MBRQT offers better speedup in ANN computation than the commonly used R*-tree index. In addition, we present the MBA algorithm using depth-first index traversal and bi-directional node expansion. Furthermore, we extend our method to evaluate the more general All-k-Nearest-Neighbor (AkNN) operation.
520 $a Traditional spatial and traditional temporal joins have been widely studied in the past, but there is very little work on the more complex problem of trajectory joins. We present a general framework called JiST, that introduces a broad class of trajectory join operations and offers a set of algorithms to efficiently evaluate these operations. We then introduce the notion of Trajectory Privacy, and show the application of the JiST framework in the context of privacy preservation. Finally, we present detailed experimental results that demonstrate the efficiency and scalability of the JiST join algorithms. To the best of our knowledge, JiST is the first comprehensive framework for complex trajectory join operations and paves the foundation for building a complex querying platform for emerging trajectory based applications.
590 $a School code: 0127.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a University of Michigan. $3 777416
773 0 $t Dissertation Abstracts International $g 69-03B.
790 $a 0127
790 1 0 $a Patel, Jignesh M., $e advisor
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3304944