Indexing moving points

Journal of Computer and System Sciences

Volumn 66, Issue 1, 2003, Pages 207-243

  Agarwal, Pankaj K ^a   Arge, Lars ^a   Erickson, Jeff ^b  

^a Duke University   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATABASE SYSTEMS; FUNCTIONS; INDEXING (OF INFORMATION);

MOVING POINTS;

SYSTEMS ANALYSIS;

EID: 0037929600     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00035-1     Document Type: Article

References (54)

1. Arcview GIS, arcview tracking analyst, 1998.
2. P.K. Agarwal, L. Arge, J. Erickson, Indexing moving points, in: Proceedings of the 19th Annual ACM Symposium on Principles of Database Systems 2000, pp. 175-186.
3. P.K. Agarwal, L. Arge, J. Erickson, P.G. Franciosa, J.S. Vitter, Efficient searching with linear constraints. J. Comput. System Sci. 61 (2000) 194-216.
4. P.K. Agarwal, L. Arge, J. Vahrenhold, A time responsive indexing scheme for moving points, in: Proceedings of the Seventh Workshop on Algorithms and Data Structures, 2001, pp. 50-61.
5. P.K. Agarwal, J. Erickson, Geometric range searching and its relatives, in: B. Chazelle, J.E. Goodman, R. Pollack (Eds.), Advances in Discrete and Computational Geometry, Contemporary Mathematics, Vol. 223, American Mathematical Society, Providence, RI, 1999. pp. 1-56.
6. P.K. Agarwal, J. Erickson, L. Guibas, Kinetic binary space partitions for intersecting segments and disjoint triangles, in: Proceedings of the ACM Symposium on Computational Geometry, 1998, pp. 107-116.
7. L. Arge, External memory data structures, In: J. Abello, P.M. Pardalos, M.G.C. Resende (Eds.). Handbook of Massive Data Sets, Kluwer Academic Publishers, Dordrecht, 2002, pp. 315-357.
8. L. Arge, V. Samoladas, J.S. Vitter, On two-dimensional indexability and optimal range search indexing, in: Proceedings of the 18th ACM Symposium on Principles of Database Systems, 1999, pp. 346-357.
9. L. Arge, J.S. Vitter, Optimal dynamic interval management in external memory, in: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 560-569.
10. J. Basch, L.J. Guibas, J. Hershberger, Data structures for mobile data, in: Proceedings of the Eighthth ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 747-756.
11. J. Basch, L.J. Guibas, L. Zhang, Proximity problems on moving points, in: Proceedings of the 13th Annual ACM Symposium on Computational Geometry, 1997, pp. 344-351.
12. B. Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer, An asymptotically optimal multiversion B-tree, VLDB J. 5 (4) (1996) 264-275.
13. S. Chamberlain, Model-based battle command: a paradigm whose time has come, in: The First International Symposium on Command and Control Research and Technology. 1995, pp. 31-38.
14. B. Chazelle, J. Friedman, A deterministic view of random sampling and its use in geometry. Combinatorica 10 (3) (1990) 229-249.
15. J. Chomicki, P.Z. Revesz, A geometric framework for specifying spatiotemporal objects, in: Proceedings of the Sixth International Workshop on Time Representation and Reasoning, 1999, pp. 41-46.
16. K.L. Clarkson, An algorithm for approximate closest-point queries, in: Proceedings of the 10th Annual ACM Symposium on Computational Geometry, 1994, pp. 160-164.
17. K.L. Clarkson, P.W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989) 387-421.
18. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer, Berlin, 1997.
19. O. Devillers, M. Golin, K. Kedem, S. Schirra, Queries on Voronoi diagrams of moving points, Comput. Geom. Theory Appl. 6 (1996) 315-327.
20. J.R. Driscoll, N. Sarnak, D.D. Sleator, R. Tarjan, Making data structures persistent, J. Comput. System Sci. 38 (1989) 86-124.
21. R.M. Dudley, Metric entropy of some classes of sets with differentiable boundaries, J. Approx. Theory 10 (1974) 227-236.
22. M. Erwig, R.H. Güting, M. Schneider, M. Vazirgiannis, Abstract and discrete modeling of spatiotemporal data types, in: ACM GIS Symposium, 1998, pp. 131-136.
23. M. Erwig, M. Schneider, Developments in spatio-temporal query languages, DEXA Workshop, 1999.
24. L. Forlizzi, R. Güting, E. Nardelli, M. Schneider, A data model and data structures for moving objects databases, in: Proceedings of the SIGMOD International Conference on Management of Data, 2000, pp. 319-330.
25. V. Gaede, O. Günther, Multidimensional access methods, ACM Comput. Surveys 30 (2) (1998) 170-231.
26. M.T. Goodrich, J.-J. Tsay, D.E. Vengroff, J.S. Vitter, External-memory computational geometry, in: Proceedings of the 34th Annual IEEE Symposium on Foundations in Computer Sciences, 1993, pp. 714-723.
27. P.C. Kanellakis, S. Ramaswamy, D.E. Vengroff, J.S. Vitter, Indexing for data models with constraints and classes, J. Comput. System Sci. 52 (3) (1996) 589-612.
28. G. Kollios, D. Gunopulos, V.J. Tsotras, Nearest neighbor queries in a mobile environment, in: Proceedings of the International Workshop on Spatio-Temporal Database Management, Lecture Notes in Computer Science, Vol. 1678, Springer, Berlin, 1999, pp. 119-134.
29. G. Kollios, D. Gunopulos, V.J. Tsotras, On indexing mobile objects, in: Proceedings of the ACM Symposium on Principles of Database Systems, 1999, pp. 261-272.
30. M. Koubarakis, The complexity of query evaluation in indefinite temporal constraint databases, Theor. Comput. Sci. 171 (1997) 25-60.
31. M. Koubarakis, S. Skiadopoulos, Tractable query answering in indefinite constraint databases: basic results and applications to querying spatiotemporal information, in: Proceedings of the International Workshop on Spatio-Temporal Database Management, 1999, pp. 204-223.
32. J. Matoušek, Randomized optimal algorithm for slope selection, Inform. Process. Lett. 39 (1991) 183-187.
33. J. Matoušek, Efficient partition trees, Discrete Comput. Geom. 8 (1992) 315-334.
34. E.M. McCreight, Priority search trees, SIAM J. Comput. 14 (2) (1985) 257-276.
35. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, New York, NY, 1995.
36. J. Nievergelt, P. Widmayer, Spatial data structures: concepts and design choices, in: M. van Kreveld, J. Nievergelt, T. Roos, P. Widmayer (Eds.), Algorithmic Foundations of GIS, Lecture Notes in Computer Science, Vol. 1340, Springer, Berlin, 1997, pp. 153-197.
37. M.H. Overmars, The Design of Dynamic Data Structures, in: Lecture Notes in Computer Science, Vol. 156, Springer, Berlin, 1983.
38. M.H. Overmars, J. van Leeuwen, Maintenance of configurations in the plane, J. Comput. System Sci. 23 (1981) 166-204.
39. D. Pfoser, C.S. Jensen, Y. Theodoridis, Novel approaches in query processing for moving objects, in; Proceedings of the International Conference on Very Large Databases, 2000.
40. C.M. Procopiuc, P.K. Agarwal, S. Har-Peled, Star-tree: an efficient self-adjusting index for moving points, in: Proceedings of the Fourth Workshop on Algorithm Engineering and Experiments, 2002.
41. S. Ramaswamy, S. Subramanian, Path caching: a technique for optimal external searching, in: Proceedings of the ACM Symposium on Principles of Database Systems, 1994, pp. 25-35.
42. B. Salzberg, V.J. Tsotras, Comparison of access methods for time-evolving data, ACM Comput. Surveys 31 (2) (1999) 158-221.
43. H. Samet, Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.
44. M. Sharir, P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
45. A.P. Sistla, O. Wolfson, Temporal conditions and integrity constraints in active database systems, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1995, pp. 269-280.
46. A.P. Sistla, O. Wolfson, S. Chamberlain, S. Dao, Modeling and querying moving objects, in: Proceedings of the IEEE International Conference on Data Engineering. 1997, pp. 422-432.
47. J. Tayeb, O. Ulusoy, O. Wolfson, A quadtree-based dynamic attribute indexing method, Comput. J. 41 (3) (1998) 185-200.
48. P.J. Varman, R.M. Verma, An efficient multiversion access structure, IEEE Trans. Knowledge Data Eng. 9 (3) (1997) 391-409.
49. S. Šaltenis, C.S. Jensen, S.T. Leutenegger, M.A. Lopez, Indexing the positions of continuously moving objects, in: Proceedings of the International Conference on SIGMOD Management of Data. 2000, pp. 331-342.
50. O. Wolfson, S. Chamberlain, L. Jiang, G. Mendez, Cost and imprecision in modeling the position of moving objects, in: Proceedings of the IEEE International Conference on Data Engineering, 1998, pp. 588-596.
51. O. Wolfson, L. Jiang, A.P. Sistla, S. Chamberlain, M. Deng, Databases for tracking mobile units in real time, in: Proceedings of the International Conference on Database Theory, 1999, pp. 169-186.
52. O. Wolfson, A.P. Sistla, S. Chamberlain, Y. Yesha, Updating and querying databases that track mobile units, Distrib. and Parallel Databases 7 (3) (1999) 257-287.
53. O. Wolfson, A.P. Sistla, B. Xu, S.J. Zhou, S. Chamberlain, DOMINO: databases for moving objects tracking, in: Proceedings of the SIGMOD International Conference on Management of Data, 1999, pp. 547-549.
54. O. Wolfson, B. Xu, S. Chamberlain, L. Jiang, Moving objects databases: issues and solutions, in: International Conference on Scientific and Statistical Database Management, 1998, pp. 111-122.