Trajectory queries and octagons in moving object databases

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2002, Pages 413-421

  Zhu, Hongjun ^a   Su, Jianwen ^a   Ibarra, Oscar H ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; GEOMETRY; INFORMATION MANAGEMENT; TOPOLOGY;

MOVING OBJECT DATABASES; OCTAGON-PRISM TREE; TRAJECTORY QUERIES;

DATABASE SYSTEMS;

EID: 0037480956     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/584792.584860     Document Type: Conference Paper

References (22)

1. B. Becker, P. G. Franciosa, S. Gschwind, T. Ohler, G. Thiemt, and P. Widmayer. Enclosing many boxes by an optimal pair of boxes. In Proc. STACS. 1992.
2. T. Brinkhoff. Generating network-based moving objects. In Proc. SSDBM, 2000.
3. T. Brinkhoff, H-P. Kriegel, and R. Schneider. Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems. In Proc. ICDE, 1993.
4. D. Dori and M. Ben-Bassat. Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition. Computer Vision, Graphics, and Image Processing, 24, 1983.
5. M. J. Egenhofer and R. Franzosa. Point-set topological spatial relations. Int. Journal of Geo. Info. Systems, 5(2):161-174, 1991.
6. Y. J. Garcia, M. A. Lopez, and S. T. Leutenegger. On optimal node splitting for R-trees. In Proc. VLDB, 1998.
7. O. Günther. The design of the cell tree: An object-oriented index structure for geometric databases. In Proc. ICDE, 1989.
8. M. Hadjieleftherious, G. Kollios, and V. J. Tsotras. Efficient indexing of spatialtemporal objects. In Proc. EDBT, 2002.
9. L. Han, H. Zhu, and J. Su. Experimental evaluation of filter effectiveness. In Proc. ACM GIS, 2000.
10. H. V. Jagadish. Spatial search with polyhedra. In Proc. ICDE, 1990.
11. T. L. Kay and J. T. Kajiya. Ray tracing complex scenes. In Proc. ACM SIGGRAPH, 1986.
12. K. Kim, S. K. Cha, and K. Kwon. Optimizing multidimensional index trees for main memory access. In Proc. ACM SIGMOD, 2001.
13. A. Kumar, V. J. Tsotras, and C. Faloutsos. Designing access methods for bitemporal databases. IEEE Trans. Knowledge and Data Engineering, 10(1), 1998.
14. P. J. M. Oosterom. Reactive Data Structures for Geographic Information Systems. PhD thesis, Dept. of Computer Science, Leiden University, Netherlands, 1990.
15. D. Pfoser, C. Jensen, and Y. Theodoridis. Novel approaches to the indexing of moving object trajectories. In Proc. VLDB, 2000.
16. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.
17. Y. Tao and D. Papadias. Mv3r-tree: a spatio-temporal access method for timestamp and interval queries. In Proc. VLDB, 2001.
18. Y. Theodoridis, J. R. O. Silva, and M. A. Nascimento. On the generation of spatio-temporal datasets. In Proc. SSD, 1999.
19. M. Vazirgiannis and O. Wofson. A spatiotemporal model and language for moving objects on road networks. In Proc. SSTD, 2001.
20. D. White and R. Jain. Similarity indexing with the SS-tree. In Proc. ICDE, 1996.
21. H. Zhu, J. Su, and O. H. Ibarra. Extending rectangle join algorithms for rectilinear polygons. In Proc. WAIM, 2000.
22. H. Zhu, J. Su, and O. H. Ibarra. Towards spatial joins for polygons. In Proc. SSDBM, 2000.