Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Indexing of the Current and Near-Future Positions of Moving Objects

  • Simonas ŠaltenisEmail author
  • Christian S. Jensen
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_201


A scenario is assumed where a large population of objects capable of reporting positional data to a central server exists. Specifically, an object may report its current position but may also report its current velocity vector.

A key challenge is to be able to accommodate the very frequent updates inherent to this scenario. Another important challenge is to contend with, and indeed exploit, all the available positional data so that better query results to near-future queries are enabled.

To address these challenges, the position of an object is typically modeled as a linear function from time to space (typically the two- or three-dimensional Euclidean spaces are assumed). Such functions are readily available, and the positions they return get outdated less frequently than do constant functions, thus reducing the update rate. Further, they enable the computation of more accurate results for near-future queries.

The fundamental types of queries to be supported by an index...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Agarwal PK, Arge L, Erickson J. Indexing moving points. In: Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2000. p. 175–86.Google Scholar
  2. 2.
    Basch J, Guibas LJ, Hershberger J. Data structures for mobile data. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms; 1997. p. 747–56.Google Scholar
  3. 3.
    Chen S, Jensen CS, Lin D. A benchmark for evaluating moving object indexes. Proc VLDB Endowment 2008;1(2):1574–85.CrossRefGoogle Scholar
  4. 4.
    Jensen CS, Lin D, Ooi BC. Query and update efficient B+-tree based indexing of moving objects. In: Proceedings of the 30th International Conference on Very Large Data Bases; 2004. p. 768–79.CrossRefGoogle Scholar
  5. 5.
    Kollios G, Gunopulos D, Tsotras VJ. On indexing mobile objects. In: Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 1999. p. 261–72.Google Scholar
  6. 6.
    Mokbel MF, Ghanem TM, Aref WG. Spatio-temporal access methods. IEEE Data Eng Bull. 2003;26(2):40–9.Google Scholar
  7. 7.
    Patel JM, Chen Y, Chakka VP. STRIPES: an efficient index for predicted trajectories. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2004. p. 637–46.Google Scholar
  8. 8.
    Prabhakar S, Xia Y, Kalashnikov DV, Aref WG, Hambrusch SE. Query indexing and velocity constrained indexing: scalable techniques for continuous queries on moving objects. IEEE Trans Comput. 2002;51(10):1124–40.MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Procopiuc CM, Agarwal PK, Har-Peled S. STAR-tree: an efficient self-adjusting index for moving objects. In: Proceedings of the 4th Workshop on Algorithm Engineering and Experiments; 2002. p. 178–93.CrossRefGoogle Scholar
  10. 10.
    Šaltenis S, Jensen CS. Indexing of moving objects for location-based services. In: Proceedings of the 18th International Conference on Data Engineering; 2002. p. 463–72.Google Scholar
  11. 11.
    Šaltenis S, Jensen CS, Leutenegger ST, Lopez MA. Indexing the positions of continuously moving objects. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2000. p. 331–42.Google Scholar
  12. 12.
    Tao Y, Papadias D, Sun J. The TPR*-tree: an optimized spatio-temporal access method for predictive queries. In: Proceedings of the 29th International Conference on Very Large Data Bases; 2003. p. 790–801.CrossRefGoogle Scholar
  13. 13.
    Tao Y, Xiao X. Primal or dual: which promises faster spatiotemporal search? VLDB J. 2008;17(5): 1253–70.CrossRefGoogle Scholar
  14. 14.
    Tayeb J, Ulusoy Ö, Wolfson O. A quadtree based dynamic attribute indexing method. Computer J. 1998;41(3):185–200.zbMATHCrossRefGoogle Scholar
  15. 15.
    Yiu ML, Tao Y, Mamoulis N. The Bdual-tree: indexing moving objects by space filling curves in the dual space. VLDB J. 2006;17(3):379–400.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Aalborg UniversityAalborgDenmark
  2. 2.Department of Computer ScienceAalborg UniversityAalborgDenmark