1. Agarwal PK, Arge L, Erickson J (2000) Indexing moving points. In: Proceedings of the ACM PODS symposium, Dallas, 14–19 May 2000, pp 175–186
2. Basch J, Guibas LJ, Hershberger J (1997) Data structures for mobile data. In: Proceedings of ACM-SIAM SODA, New Orleans, 5–7 Jan 1997, pp 747–756
3. Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD conference, Brisbane, 13–16 Aug 1990, pp 322–331
4. Benetis R, Jensen CS, Karèiauskas G, Šaltenis S: Nearest and reverse nearst neighbor queries for moving objects. VLDB J 15(3):229–249 (2006)
5. Cai M, Revesz PZ (2000) Parametric R-tree: an index structure for moving objects. In: Proceedings of the 10th international conference on management of data, Pune, Dec 2000. McGraw Hill, pp 57–64