1 |
Y. Theodoridis, M. Vazirgiannis, and T. K. Sellis, 'Spatio-temporal indexing for large multimedia applications,' IEEE Int'l Conf. on Multimedia Computing and Systems, pp. 441-448, 1996
|
2 |
A. Guttman, 'R-trees: A dynamic index structure for spatial searching,' Proc. of the ACM SIGMOD ConE. , pp. 47-54, 1984
|
3 |
M. A. Nascimento and J. R. O. Silva, 'Towards historical R-trees,' ACM symposium on Applied Computing, pp. 235-240, 1998
|
4 |
Y. Theodoridis, J. R. O Silva, and M.A Nascimento, 'On the generation of spatiotemporal datasets,' Proc. of Int'l Symposium on Spatial Databases, pp. 147-164, 1999
|
5 |
D. Pfoser, C. S. Jensen, and Y. Theodoridis, 'Novel approaches in query processing for moving objects,' Proc. of Inn Conf. on Very Large Data Bases, pp. 395-406, 2000
|
6 |
J. T. Robinson, 'The K-D-B-tree: A search structure for large multidimensional dynamic indexes,' Proc. of the ACM SIGMOD Conf. , pp. 10-18, 1981
|
7 |
N. Beckmann and H. P. Kriegel, 'The R*-tree: An efficient and robust access method for points and rectangles,' Proc. of the ACM SIGMOD Int'l Conf. , pp. 332-331, 1990
|
8 |
H. Samet, The Design and Analysis of Spatial Data Structures, Addision-Wesley, Reading, MA, 1990
|
9 |
R. Bliujute, C. S. Jensen, S. Saltenis, and G. Slivinskas, 'R-tree based indexing of now-relative bitemporal data,' Proc. of Inn ConE. on Very Large Data Bases, pp. 345-356, 1998
|