| G. Kollios, D. Gunopulos, V.J. Tsotras, A. Delis, M. Hadjieleftheriou, Indexing animated objects using spatiotemporal access methods, IEEE Transactions on Knowledge and Data Engineering 13 (5) (2001) 758-- 777. |
....these nodes do not incur extent changes. The first partially persistent structure, the historical R tree (HR tree) 47] however, still involves considerable data redundancy as analyzed in [62] which led to the development of the multi version R tree (MVR tree) 46] and its subsequent versions [57, 45, 43]. Besides the partially persistent methodology, historical STDB can also be indexed using a 3D R tree by treating time just as an extra dimension (in addition to the two spatial dimensions) Specifically, each record in the 3D R tree [65] represents a 3D box, whose spatial projection corresponds ....
G. Kollios, D. Gunopulos, V. Tsotras, A. Delis, and M. Hadjieleftheriou. Indexing animated objects using spatiotemporal access methods. TKDE, 2001.
....by MBB approximations of trajectories (cf. Section 2.3) by introducing articial object updates. They effectively manipulate the partitioning of a trajectory into segments. A partially persistent tree structure [5, 18] is used to index the data. This approach generalizes a previous work [4] in which it was assumed that the objects move with a linear function of time, whereas in [7] more complex functions are permitted. Porkaew et al. 15, 6] examine the indexing of trajectories in Native Space (cf. Section 2.1) vs. Parametric Space. In Parametric Space, segments of trajectories are ....
G. Kollios, D. Gunopulos, V. Tsotras, A. Delis, and M. Hadjieleftheriou. Indexing animated objects using spatiotemporal access methods. IEEE Transactions on Knowledge and Data Engineering, pages 742--777, September 2001.
....[2] because it turned out to be the fastest implementation available, yet the least versatile as to its usage. We also wanted to include a performance comparison with the Segment R tree (SR tree) 10] which is currently believed to be the fastest adaptive MAM that is suitable for our purposes [9]. Unfortunately, as currently only a (slow) java implementation of the SR tree seems to be available, including it in our benchmarks would be unfair. We collected our benchmarking data from magplot, an application that converts Magic VLSI layout files into a printable PostScript file. The major ....
G. Kollios, D. Gunopulos, V. Tsotras, A. Delis, and M. Hadjieleftheriou. Indexing animated objects using spatiotemporal access methods. IEEE Transactions on Knowledge and Data Engineering, Sept. 2001.
....can be found in [VV97] Several algorithms for processing interval queries and temporal joins with MVB trees, are proposed in [BS96] and [ZTS02] respectively. The multi version framework has also been applied to R trees to obtain various bitemporal and spatio temporal access methods [KTF98, KGT 01, TP01] General cost models for multiversion structures can be found in [TPZ02] 3. THE AGGREGATE POINT TREE (AP TREE) A WA query can be formally defined as follows: given a set of points in the 2D universe [0, M x ] 0, M y ] retrieve the number WA(q) of points contained in a rectangle [x 0 , x 1 ....
Kollios, G., Gunopulos, D., Tsotras, V., Dellis, A., Hadjieleftheriou, M. Indexing Animated Objects Using Spatiotemporal Access Methods. To appear in IEEE TKDE. 19
No context found.
G. Kollios, V. J. Tsotras, D. Gunopulos, A. Delis, and M. Hadjieleftheriou. Indexing animated objects using spatiotemporal access methods. IEEE Transactions on Knowledge and Data Engineering (TKDE), 13(5):758--777, 2001.
....the highway system) satellite and earth change data (evolution of forest boundaries) planetary movements, etc. The common characteristic is that spatiotemporal objects move and or change their extent over time. Recent works that address indexing problems in a spatiotemporal environment include [36, 15, 14, 28, 38, 3, 24, 25, 16, 32, 36]. Two variations of the problem are examined: approaches that optimize queries about the future positions of spatiotemporal objects [15, 28, 3, 25, 27] and those that optimize historical queries [36, 38, 14, 21, 24, 25, 16, 32] i.e. queries about past states of the spatiotemporal evolution) ....
.... indexing problems in a spatiotemporal environment include [36, 15, 14, 28, 38, 3, 24, 25, 16, 32, 36] Two variations of the problem are examined: approaches that optimize queries about the future positions of spatiotemporal objects [15, 28, 3, 25, 27] and those that optimize historical queries [36, 38, 14, 21, 24, 25, 16, 32] (i.e. queries about past states of the spatiotemporal evolution) Here we concentrate on historical queries, so for brevity the term historical is omitted. Furthermore, we assume the off line version of the problem, that is, all data from the spatiotemporal evolution has already been ....
[Article contains additional citation context not shown here]
G. Kollios, D. Gunopulos, V. Tsotras, A. Delis, and M. Hadjieleftheriou. Indexing Animated Objects Using Spatio-Temporal Access Methods. IEEE Trans. Knowledge and Data Engineering, pages 742--777, September 2001.
No context found.
G. Kollios, D. Gunopulos, V.J. Tsotras, A. Delis, M. Hadjieleftheriou, Indexing animated objects using spatiotemporal access methods, IEEE Transactions on Knowledge and Data Engineering 13 (5) (2001) 758-- 777.
No context found.
G. Kollios, D. Gunopoulos, V.J. Tsotras, A.Delis, M. Hadjieleftheriou: "Indexing Animated Objects Using Spatiotemporal Access Methods", IEEE Transactions on Knowledge and Data Engineering, Vol.13, No.5, pp.758-777, 2001.
No context found.
G. Kollios, V.J. Tsotras, D. Gunopulos, A. Delis and M. Hadjieleftheriou: "Indexing Animated Objects Using Spatiotemporal Access Methods", IEEE Transactions on Knowledge and Data Engineering, Vol.13, No.5, pp.758-777, 2001.
No context found.
G. Kollios et al. Indexing Animated Objects Using Spatiotemporal Access Methods. TimeCenter TR-54 (2001).
No context found.
G. Kollios, V. J. Tsotras, D. Gunopulos, A. Delis, and M. Hadjieleftheriou. Indexing Animated Objects Using Spatiotemporal Access Methods. TKDE 13(5): 758--777, 2001.
No context found.
G. Kollios et al. Indexing Animated Objects Using Spatiotemporal Access Methods. TimeCenter Tech. Rep. TR-54 (2001).
No context found.
G. Kollios et al. Indexing animated objects using spatiotemporal access methods. IEEE Trans. on Knowledge and Data Engineering, 13(5):758--777, 2001.
No context found.
G. Kollios, D. Gunopulos, V.J. Tsotras, A. Delis, M. Hadjieleftheriou, Indexing animated objects using spatiotemporal access methods, IEEE Transactions on Knowledge and Data Engineering 13 (5) (2001) 758-- 777.
No context found.
G. Kollios, V. J. Tsotras, D. Gunopulos, A. Delis, and M. Hadjieleftheriou. Indexing Animated Objects Using Spatiotemporal Access Methods. IEEE Trans. on Knowledge and Data Engineering, TKDE, 13(5):758--777, 2001.
No context found.
G. Kollios, D. Gunopoulos, V.J. Tsotras, A.Delis, M. Hadjieleftheriou: "Indexing Animated Objects Using Spatiotemporal Access Methods", IEEE Transactions on Knowledge and Data Engineering, Vol.13, No.5, pp.758-777, 2001.
No context found.
Kollios, G., Gunopulos, D., Tsotras, V., Delis, A., Hadjieleftheriou, M. Indexing Animated Objects Using Spatiotemporal Access Methods. TKDE, 13(5): 758-777, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC