Efficient tradeoff schemes in data structures for querying moving objects

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

Volumn 3221, Issue , 2004, Pages 4-15

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

^a Duke University   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

MOVING OBJECTS; PERFORMANCE MEASURE; PROXIMITY QUERIES; QUERY TIME; SPATIO-TEMPORAL DATABASE;

QUERY PROCESSING;

EID: 35048819975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_3     Document Type: Article

References (24)

1. P. K. Agarwal, L. Arge, and J. Erickson, Indexing moving points, J. Comput. Syst. Sci., 66 (2003), 207-243.
2. P. K. Agarwal, L. Arge, and J. Vahrenhold, Time responsive external data structures for moving points, Proc. 7th Workshop on Algorithms and Data Structures, 2001, pp. 50-61.
3. P. K. Agarwal, J. Erickson, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry (B. Chazelle, J. Goodman, R. Pollack, eds.), American Mathematical Society, Providence, RI, 1999, 1-56.
4. P. K. Agarwal, J. Gao, and L. Guibas, Kinetic medians and fed-trees, Proc. 10th European Symposium on Algorithms, 2002, pp. 5-16.
5. P. K. Agarwal, L. Guibas, J. Hershberg, and E. Veach, Maintaining the extent of a moving point set, Discrete Comput. Geom., 26 (2001), 253-274.
6. P. K. Agarwal, S. Har-Peled, and K. Varadarajan. Approximating extent measure of points. Journal of the ACM, to appear.
7. P. K. Agarwal and C. M. Procopiuc, Advances in indexing for moving objects, IEEE Bulletin of Data Engineering, 25 (2002), 25-34.
8. P. K. Agarwal and M. Sharir, Arrangements and their applications, in Handbook of Computational Geometry (J.-R. Sack and J. Urrutia, eds.), Elsevier Science Publishers, North-Holland, Amsterdam, 2000, 49-119.
9. J. Basch, L. Guibas, and J. Hershberger, Data structures for mobile data, J. Algorithms, 31(1) (1999), 1-28.
10. H. Brönnimann and B. Chazelle, Optimal slope selection via cuttings, Comp. Geom. Theory & Appl., 10(1) (1998), 23-29.
11. T. M. Chan, Fixed-dimensional linear programming queries made easy, Proc. 12th Annu. Sympos. Comput. Geom., 1996, pp. 284-290.
12. T. M. Chan, Faster core-set constructions and data stream algorithms in fixed dimensions, Proc. 20th Annu. Sympos. Comput. Geom., 2004, pp. 152-159.
13. B. Chazelle, Cutting hyperplanes for divide-and-conquer, Discrete Comput. Geom., 9 (1993), 145-158.
14. B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Stolfi, Lines in space: Combinatorics and algorithms, Algorithmica, 15 (1996), 428-447.
15. A. Czumaj and C. Sohler, Soft kinetic data structures, Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, 2001, pp. 865-872.
16. G. Kollios, D. Gunopulos, and V. Tsotras, Nearest neighbor queries in a mobile environment, Proc. Intl. Workshop on Spatiotemporal Database Management, 1999, pp. 119-134.
17. G. Kollios, D. Gunopulos, and V. Tsotras, On indexing mobile objects, Proc. ACM Sympos. Principles Database Syst., 1999, pp. 261-272.
18. J. Matousek, Efficient partition trees, Discrete Comput. Geom., 8 (1992), 315-334.
19. J. Matousek, Linear optimization queries, J. Algorithms, 14 (1993), 432-448.
20. C. M. Procopiuc, P. K. Agarwal, and S. Har-Peled, STAR-tree: an efficient self-adjusting index for moving points, Proc 4th Workshop on Algorithms Engineering and Experiments, 2002, pp. 178-193.
21. E. Ramos, Linear programming queries revisited, Proc. 16th Annu. Sympos. Comput. Geom., 2000, pp. 176-181.
22. S. Saltenis, C. Jensen, S. Leutenegger, and M. López, Indexing the positions of continuously moving objects, Proc. SIGMOD Intl. Conf. Management of Data, 2000, pp. 331-342.
23. N. Sarnak and R. Tarjan, Planar point location using persistent search trees, Communications of the ACM, 29(7) (1986), 669-679.
24. H. Yu, P. K. Agarwal, R. Poreddy, and K. R. Varadarajan, Practical methods for shape fitting and kinetic data structures using core sets, Proc. 20th Annu. Sympos. Comput. Geom., 2004, pp. 263-272.