Star-tree: An efficient self-adjusting index for moving objects

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

Volumn 2409, Issue , 2002, Pages 178-193

  Procopiuc, Cecilia M ^a   Agarwal, Pankaj K ^b   Har Peled, Sariel ^c  

^a AT AND T LABS RESEARCH   (United States)

^b DUKE UNIVERSITY   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; NEAREST NEIGHBOR SEARCH; STARS;

ANSWERING QUERIES; MOVING OBJECTS; NEAREST NEIGHBOR QUERIES; PERFORMANCE STUDY; QUERY PERFORMANCE; RANGE QUERY; SELF-ADJUSTING; TIME SPENT; TIME SLICE;

FORESTRY;

DATA; INDEXING; TREES;

EID: 84929072771     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45643-0_14     Document Type: Conference Paper

References (14)

1. P. K. Agarwal, L. Arge, and J. Erickson, Indexing moving points, Proc. Annu. ACM Sympos. Principles Database Syst., 2000. 175–186.
2. P. K. Agarwal, J. Erickson, and L. J. Guibas, Kinetic BSPs for intersecting segments and disjoint triangles, Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, 1998, pp. 107–116.
3. P. K. Agarwal and S. Har-Peled, Maintaining approximate extent measures of moving points, Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, 2001.
4. L. Arge, R. Barve, D. Hutchinson, O. Procopiuc, L. Toma, D. E. Vengroff, and R. Wickeremesinghe, TPIE User Manual and Reference (edition 0.9.01b). Duke University, 1999. The manual and software distribution are available on the web at http://www.cs.duke.edu/TPIE/.
5. J. Basch, L. J. Guibas, and J. Hershberger, Data structures for mobile data, Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 747–756.
6. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, The R∗-tree: Anefficient and robust access method for points and rectangles, Proc. ACM SIGMOD Conf. on Management of Data, 1990, pp. 322–331.
7. D. H. Douglas and T. K. Peucker, Algorithms for the reduction of the number of points required to represent a digitized line or its caricature, Canadian Cartographer, 10 (1973), pp. 112–122.
8. R. H. Güting, M. H. Böhlen, M. Erwig, C. S. Jensen, N. A. Lorentzos, M. Schneider, and M. Vazirgiannis, A foundation for representing and querying moving objects, ACM Trans. Database Systems, 25 (2000), pp. 1–42.
9. M. I. Karavelas and L. J. Guibas, Static and kinetic geometric spanners with applications, Proc. 12th Annu. ACM-SIAM Sympos. Discrete Algorithms, 2001, pp. 168–176.
10. G. Kollios, D. Gunopulos, and V. J. Tsotras, On indexing mobile objects, Proc. Annu. ACM Sympos. Principles Database Syst., 1999, pp. 261–272.
11. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez, Indexing the posi tions of continuously moving objects, Proc. ACM SIGMOD International Confer ence on Management of Data, 2000, pp. 331–342.
12. A. P. Sistla and O. Wolfson, Temporal conditions and integrity constraints in active database systems, Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 1995, pp. 269–280.
13. A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao, Modeling and querying moving objects, Proc. Intl Conf. Data Engineering, 1997, pp. 422–432.
14. J. Tayeb, O. Ulusoy, and O. Wolfson, A quadtree-based dynamic attribute indexing method, The Computer Journal, (1998), 185–200.