1 indexing the positions of continuously moving objects speaker: chia-hsiang hsu date: 2006/10/16
Post on 21-Dec-2015
221 views
TRANSCRIPT
![Page 1: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/1.jpg)
1
Indexing the Positions of Continuously Moving Objects
Speaker: Chia-Hsiang Hsu
Date: 2006/10/16
![Page 2: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/2.jpg)
2
Reference
• Simonas Saltenis, Christian S. Jensen, ScottT. Leutenegger, Mario A. Lopez: Indexing the Positions of Continuously Moving Objects. SIGMOD Conference 2000: 331-342 [DBLP:conf/sigmod/SaltenisJLL00]
![Page 3: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/3.jpg)
3
Outline
• Introduction
• Problem Statement
• Structure and Algorithms
• Performance Experiments
• Conclusion
![Page 4: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/4.jpg)
4
Introduction
• The rapid and continued advances in positioning systems, e.g., GPS, wireless communication technologies, and electronics in general promise to render it increasingly feasible to track and record the changing positions of objects capable of continuous movement.
![Page 5: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/5.jpg)
5
• Continuous movement poses new challenges to database technology.
• Capturing continuous movement with this assumption would entail either performing very frequent updates or recording outdated, inaccurate data, neither of which are attractive alternatives.
![Page 6: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/6.jpg)
6
• We use one linear function per object, with the parameters of a function being the position and velocity vector of the object at the time the function is reported to the database.
• Updates are necessary only when the parameters of the functions change.
![Page 7: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/7.jpg)
7
Problem Statement
1 2
An object's position at some time is
given by ( ) ( ( ), ( ),..., ( )),
where it is assumed that the times are
not before the current.
This position is modeled as a linear function
d
t
x t x t x t x t
t
of time, which is specified by two parameters.
![Page 8: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/8.jpg)
8
1 2
The first is a position for the object at
some specified time , ( ), which
we term the reference position.
The second parameter is a velocity vector
for the object, ( , ,..., )
ref ref
d
t x t
v v v v
.
( ) ( ) ( - ).ref refx t x t v t t
![Page 9: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/9.jpg)
9
Moving Points and Resulting Leaf-Level MBRs
1
2
3
4
5
6
7
![Page 10: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/10.jpg)
10
Query Types
1 timeslice query: ( , ) specifies
a hyper-rectangle located at time point .
2 window query: ( , , ) specifies
a hyper-rectangle that covers the interval [ , ].
Type Q R t
R t
Type Q R t t
R t t
├ ┤
├ ┤
1 2
3 moving query: ( 1, 2, , ) specifies
the ( 1)-dimensional trapezoid obtained by
connecting at time to at time .
Type Q R R t t
d
R t R t
├ ┤
├ ┤
![Page 11: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/11.jpg)
11
Query Examples for One-Dimensional Data
![Page 12: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/12.jpg)
12
Structure and Algorithms
• The position of a moving point is represented by a reference position and a corresponding velocity vector-(x,v) in the one dimensional case, where x=x(tref).
• We let tref be equal to the index creation time,tl.
![Page 13: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/13.jpg)
13
• A tradeoff exists between how tightly a bounding rectangle bounds the enclosed moving points or rectangles across time and the storage needed to capture the bounding rectangle.
• It would be ideal to employ time-parameterized bounding rectangles that are always minimum, but the storage cost appears to be excessive.
![Page 14: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/14.jpg)
14
Minimum Bounding Internals
Following the representation of moving
points, we let and capture a one-
dimensional time-parameterized bounding interval
[ ( ), ( )] [ ( ) ( - ), ( ) ( - )]
as ( , ,
ref l
l l
t t
x t x t x t v t t x t v t t
x x v
├ ┤ ├ ├ ┤ ┤
├ ┤ ├ , ), where
( ) min { . ( )}
( ) max { . ( )}
min { . }
max { . }
i i
i i
i i
i i
v
x x t o x t
x x t o x t
v o v
v o v
┤
├ ├ ├
┤ ┤ ┤
├ ├
┤ ┤
![Page 15: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/15.jpg)
15
A B
Minimum Bounding Internal
![Page 16: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/16.jpg)
16
Update
The following formulas specify the adjustments
to the bounding rectangles that may be made
during updates.
min { . ( )} ( )
max { . ( )} ( )
Here
updi i upd l
i i upd upd l
x o x t v t t
x o x t v t t
├ ├ ├
┤ ┤ ┤
, tupd is the time of the update, and the formulas may
be restricted to apply to the bounding of points rather than
intervals, as before.
![Page 17: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/17.jpg)
17
![Page 18: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/18.jpg)
18
Querying
Answering a timeslice query proceeds as for
the regular R-tree, the only difference being
that all bounding rectangles are computed for the
time specified in the query before intersection qt
is checked.
Thus, a bounding interval specified by ( , , , ) satisfies
a query (([ , ]), ) if and only if ( )
( ).
q ql
ql
x x v v
a a t a x v t t
a x v t t
├ ┤ ├ ┤
├ ┤ ├ ┤ ┤
┤ ├ ├
![Page 19: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/19.jpg)
19
To answer window queries and moving
queries, we need to be able to check if,
in ( , )-space, the trapezoid of a query
intersects with the trapezoid formed by the part
of the trajectory of a
x t
bounding rectangle that is
between the start and end times of the query.
![Page 20: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/20.jpg)
20
The algorithm is based on the observation
that for two moving rectangles to intersect,
there has to be a time point when their extents
intersect in each dimension.
Thus, for each dimension
( 1,2,..., ), the algorithm
computes the time interval [ , ] [ , ] when
the extents of the rectangles intersect in that dimension.
j j j
j j d
I t t t t
├ ┤ ├ ┤
![Page 21: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/21.jpg)
21
1 If , the moving rectangles do
not intersect and an empty result is returned;
otherwise, the algorithm provides the time
interval when the rectangles intersect.
The intervals fo
d
jjI I
I
j j j j if a ( ) a ( ) ( ) a ( ) a ( ) ( )
j 0 otherwise
r each dimension are computed
according to the following formulas.
I j j j jx t t x t x t t x t ├ ┤ ├ ├ ┤ ┤ ┤ ┤ ├ ├ ┤ ┤ ├ ┤
![Page 22: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/22.jpg)
22
![Page 23: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/23.jpg)
23
Performance Experiments
• With the exception of one experiment, the simulated objects in the scenario move in a region of space with dimensions 1000*1000 kilometers.
![Page 24: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/24.jpg)
24
![Page 25: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/25.jpg)
25
![Page 26: 1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16](https://reader035.vdocuments.net/reader035/viewer/2022062320/56649d595503460f94a39b4e/html5/thumbnails/26.jpg)
26
Conclusion