Efficient aggregation over moving objects

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2003-January, Issue , 2003, Pages 118-127

  Revesz, Peter ^a   Chen, Yi ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOGRAPHIC INFORMATION SYSTEMS;

AGGREGATION QUERIES; MOVING OBJECTS; PIECE-WISE; QUERY POINTS; SEARCH STRUCTURES; SPATIO-TEMPORAL DATABASE;

TEMPORAL LOGIC;

EID: 84944071167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2003.1214887     Document Type: Conference Paper

References (20)

1. P. K. Agarwal, L. Arge, and J. Erickson. Indexing moving points. In Symposium on Principles of Database Systems, pages 175-186, 2000.
2. J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1997.
3. J. L. Bentley. Multidimensional divide-and-conquer. Communications of the ACM, 23(4), 1980.
4. M. Cai, D. Keshwani, and P. Revesz. Parametric rectangles: A model for querying and animating spatiotemporal databases. In Proc. 7th International Conference on Extending Database Technology, volume 1777, pages 430-44. Springer-Verlag, 2000.
5. M. Cai and P. Revesz. Parametric r-tree: An index structure for moving objects. In Proc. 10th COMAD International Converence on Management of Data, pages 57-64, 2000.
6. Y.-J. Choi and C.-W. Chung. Selectivity estimation for spatio-temporal queries to moving object s. In SIGMOD, 2002.
7. J. Chomicki and P. Revesz. A geometric framework for specifying spatiotemporal objects. In Proc. International Workshop on Time Representation and Reasoning, pages 41-6, 1999.
8. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer Verlag, Berlin, 1997.
9. S. Haesevoets and B. Kuijpers. Closure properties of classes of spatio-temporal objects under Boolean set operations. In Proc. International Workshop on Time Representation and Reasoning, pages 79-86, 2000.
10. P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51(1):26-52, 1995.
11. G. Kollios, D. Gunopulos, and V. J. Tsotras. On indexing mobile objects. In ACM Symp. on Principles of Database Systems, pages 261-272, 1999.
12. G. Kuper, L. Libkin, and J. Paredaens. Constraint Databases. Springer Verlag, 2000.
13. L. Lazaridis and S. Mehrotra. Progressive approximate aggregate queries with a multi-resolution t ree structure. In SIGMOD, 2001.
14. J. Matousek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
15. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer Verlag, New York, 1985.
16. P. Revesz. Introduction to Constraint Databases. Springer Verlag, 2002.
17. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. In SIGMOD Conference, pages 331-342, 2000.
18. Y. Tao, J. Sun, and D. Papadias. Selectivity estimation for predictive spatio-temporal queries. In ICDE, 2003.
19. D. Zhang and V. J. Tsotras. Improving min/max aggregation over spatial objects. In ACM-GIS, pages 88-93, 2001.
20. D. Zhang, V. J. Tsotras, and D. Gunopulos. Efficient aggregation over objects with extent. In Symposium on Principles of Database Systems, pages 121-132, 2002.