This is a preview of subscription content, log in via an institution to check access.
References
Agarwal P, Har-Peled S (2001) Maintaining approximate exten measures of moving points. In: Proceedings of the 12th ACM-SIAM symposium on discrete algorithms, Washington, DC, 7–9 Jan 2001, pp 148–157
Agarwal PK, Arge L, Erickson J (2000) Indexing moving points. In: Proceedings of the 19th ACM symposium on principles of database systems, Dallas, 15–17 May 2000, pp 175–186
Beckmann N, Kriegel H, Schneider R, Seeger B (1998) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD, Atlantic City, May 1998, pp 322–331
Chon HD, Agrawal D, Abbadi AE (2002) Query processing for moving objects with space-time grid storage model. In: Proceedings of the 3rd international conference on mobile data management, Singapore, 8–11 Jan 2002, pp 121–126
Elbassioni K, Elmasry A, Kamel I (2003) An efficient indexing scheme for multidimensional moving objects. In: Proceedings of the 9th international conference on ICDT, Siena, 8–10 2003, pp 425–439
Goldstein J, Ramakrishnan R, Shaft U, Yu J (1997) Processing queries by linear constraints. In: Proceedings of the 16th ACM PODS symposium on principles of database systems, Tucson, 13–15 May 1997, pp 257–267
Jensen CS, Lin D, Ooi BC (2004) Query and update efficient B+-tree based indexing of moving objects. In: VLDB, Toronto, 29 Aug–3 Sept 2004, pp 768–779
Kollios G, Gunopulos D, Tsotras V (1999) On indexing mobile objects. In: Proceedings of the 18th ACM symposium on principles of database systems, Philadelphia, 1–3 June 1999, pp 261–272
Matousek J (1992) Efficient partition trees. Discret Comput Geom 8:432–448
Overmars MH (1983) The design of dynamic data strucutures. Vol 156 of LNCS. Springer, Heidelberg
Patel J, Chen Y, Chakka V (2004) STRIPES: an efficient index for predicted trajectories. In: Proceedings of the 2004 ACM SIGMOD, Paris, 13–18 June 2004, pp 637–646
Procopiuc CM, Agarwal PK, Har-Peled S (2002) Star-tree: an efficient selfadjusting index for moving objects. In: Proceedings of the 4th workshop on algorithm engineering and experiments, San Francisco, 4–5 Jan 2002, pp 178–193
Saltenis S, Jensen C, Leutenegger S, Lopez MA (2000) Indexing the positions of continuously moving objects. In: Proceedings of the 2000 ACM SIGMOD, Dallas, 16–18 May 2000, pp 331–342
Tao Y, Papadias D, Sun J (2003) The TPR*-tree: an optimized spatiotemporal access method for predictive queries. In: Proceedings of the 29th international conference on very large data bases, Berlin, 9–12 Sept 2003, pp 790–801
Tayeb J, Olusoy O, Wolfson O (1998) A quadtree-based dynamic attribute indexing method. Comput J 41(3):185–200
Wolfson O, Xu B, Chamberlain S, Jiang L (1998) Moving objects databases: issues and solutions. In: Proceedings of the 10th international conference on scientific and statistical database management, Capri, 1–3 July 1998, pp 111–122
Yiu ML, Tao Y, Mamoulis N (To appear) The Bdual-tree: indexing moving objects by space-filling curves in the dual space. VLDB J
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this entry
Cite this entry
Kollios, G., Tsotras, V.J., Gunopulos, D. (2016). Mobile Object Indexing. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-23519-6_793-2
Download citation
DOI: https://doi.org/10.1007/978-3-319-23519-6_793-2
Received:
Accepted:
Published:
Publisher Name: Springer, Cham
Online ISBN: 978-3-319-23519-6
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering