NCO-Tree: A Spatio-temporal Access Method for Segment-Based Tracking of Moving Objects

  • Yuelong Zhu
  • Xiang Ren
  • Jun Feng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4252)


With the continued advances in wireless communications and geo-positioning, an infrastructure is emerging that enables location-based services which rely on the tracking of the continuously changing positions of entire populations of service users, termed moving objects. The main interest of these services is to efficiently store and query the positions of moving objects. To achieve this goal, index structures are required. In this paper we propose a new index structure for moving objects in networks: NCO-Tree. It efficiently supports the Segment-Based tracking approaches and its optimization. We give the structure description, insertion and search algorithms, then evaluate it with experiment.


Road Network Index Structure Tracking Approach Index Object Future Position 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chung, J.D., Paek, O.H., Lee, J.W., Ryu, K.H.: Temporal Pattern Mining of Moving Objects for Location-Based Services. In: Proc. Int’Conf. Database and Expert Systems Applications, pp. 331–340 (2002)Google Scholar
  2. 2.
    CCivilis, A., Jensen, C.S., Nenortaite, J., Pakalnis, S.: Efficient Tracking of Moving Objects with Precision Guarantees. In: Proc. Int’Conf. Mobile and Ubiquitous Systems: Networking and Services, pp. 164–173 (2004)Google Scholar
  3. 3.
    Civilis, A.C., Jensen, C.S., Member, S., Pakalnis, S.: Techniques for Efficient Road-Network-Based Tracking of Moving Objects. IEEE 17(5) (May 2005)Google Scholar
  4. 4.
    Guttman, A.: R-Trees: A Dynamic Structure for Spatial Searching. In: Proc. of ACM SIGMOD 1984, pp. 47–57 (1984)Google Scholar
  5. 5.
    Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. of ACM SIGMOD 1990, pp. 322–331 (1990)Google Scholar
  6. 6.
    Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. In: Proc. of ACM SIGMOD 2000, pp. 46–53 (2000)Google Scholar
  7. 7.
    Saltenis, S., Jensen, C.: Indexing of Moving Objects for Location-Based Services. In: ICDE, pp. 802–813 (2002)Google Scholar
  8. 8.
    Tao, Y.F., Papadias, D., Sun, J.M.: The TPR*-Tree: An Optimized Spatio-temporal Access Method for Predictive Queries. In: Proc. of VLDB 2003, pp. 790–801 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yuelong Zhu
    • 1
  • Xiang Ren
    • 1
  • Jun Feng
    • 1
  1. 1.College of Computer & Information EngineeringHohai UniversityNanjing, JiangsuChina

Personalised recommendations