Time responsive external data structures for moving points

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2125, Issue , 2001, Pages 50-61

  Agarwal, Pankaj K ^a   Arge, Lars ^a   Vahrenhold, Jan ^b  

^a Duke University   (United States)

^b UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY PROCESSING;

DATA SET; LINEAR TRAJECTORY; RANGE QUERY; TWO-DIMENSION;

DATA STRUCTURES;

EID: 84958061289     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_6     Document Type: Conference Paper

References (20)

1. P. K. Agarwal, L. Arge, and J. Erickson, Indexing moving points, Proc. Annu. ACM Sympos. Principles Database Syst., 2000, pp. 175–186.
2. P. K. Agarwal, L. Arge, J. Erickson, P. Franciosa, and J. Vitter, Efficient searching with linear constraints, Journal of Computer and System Sciences, 61 (2000), 194–216.
3. P. K. Agarwal and J. Erickson, Geometric range searching and its relatives, in: Advances in Discrete and Computational Geometry (B. Chazelle, J. E. Goodman, and R. Pollack, eds.), Contemporary Mathematics, Vol. 223, American Mathematical Society, Providence, RI, 1999, pp. 1–56.
4. A. Aggarwal and J. S. Vitter, The Input/Output complexity of sorting and related problems, Communications of the ACM, 31 (1988), 1116–1127.
5. L. Arge, External memory data structures, in: Handbook of Massive Data Sets (J. Abello, P. M. Pardalos, and M. G. C. Resende, eds.), Kluwer Academic Publishers, 2001. (To appear).
6. L. Arge, V. Samoladas, and J. S. Vitter, On two-dimensional indexability and optimal range search indexing, Proc. ACM Symp. Principles of Database Systems, 1999, pp. 346–357.
7. J. Basch, L. J. Guibas, and J. Hershberger, Data structures for mobile data, Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 747–756.
8. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer, An asymptotically optimal multiversion B-tree, VLDB Journal, 5 (1996), 264–275.
9. D. Comer, The ubiquitous B-tree, ACM Computing Surveys, 11 (1979), 121–137.
10. T. K. Dey, Improved bounds on planar k-sets and related problems, Discrete Comput. Geom., 19 (1998), 373–382.
11. H. Edelsbrunner and E. Welzl, Constructing belts in two-dimensional arrangements with applications, SIAM J. Comput., 15 (1986), 271–284.
12. L. J. Guibas, Kinetic data structures—a state of the art report, in: Proc. Workshop Algorithmic Found. Robot. (P. K. Agarwal, L. E. Kavraki, and M. Mason, eds.), A. K. Peters, Wellesley, MA, 1998, pp. 191–209.
13. G. Kollios, D. Gunopulos, and V. J. Tsotras, On indexing mobile objects, Proc. Annu. ACM Sympos. Principles Database Syst., 1999, pp. 261–272.
14. J. Matoušek, Randomized optimal algorithm for slope selection, Inform. Process. Lett., 39 (1991), 183–187.
15. J. Matoušek, Efficient partition trees, Discrete Comput. Geom., 8 (1992), 315–334.
16. D. Pfoser, C. S. Jensen, and Y. Theodoridis, Novel approaches to the indexing of moving objects trajectories, Proc. International Conf. on Very Large Databases, 2000, pp. 395–406.
17. G. Toth, Point sets with many k-sets, Proc. 16th Annu. Symposium on Computational Geometry, 2000, pp. 37–42.
18. P. J. Varman and R. M. Verma, An efficient multiversion access structure, IEEE Transactions on Knowledge and Data Engineering, 9 (1997), 391–409.
19. J. S. Vitter, Online data structures in external memory, Proc. Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, 1999, pp. 119–133.
20. S. šaltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez, Indexing the positions of continuously moving objects, Proc. ACM SIGMOD International Conference on Management of Data, 2000, pp. 331–342.