Bulkloading Updates for Moving Objects

  • Xiaoyuan Wang
  • Weiwei Sun
  • Wei Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4016)


Supporting frequent updates is a key challenge in moving object indexing. Most of the existing work regards the update as an individual process for each object, and a large number of separate updates are issued respectively in update-intensive environments. In this paper, we propose the bulkloading updates for moving objects (BLU). Based on a common framework, we propose three bulkloading schemes of different spatial biases. By grouping the objects with near positions, BLU prefetches the nodes accessed on the shared update path and combines multiple disk accesses to the same node into one, which avoids I/O overhead for objects within the same group. We also propose a novel MBR-driven flushing algorithm, which utilizes the dynamic spatial correlation and improves the buffer hit ratio. The theoretical analysis and experimental evaluation demonstrate that BLU achieves the good update performance and does not affect the query performance.


Leaf Node Index Structure Memory Size Query Performance Disk Access 
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.
    Arge, L., Hinrichs, K., Vahrenhold, J., Vitter, J.: Efficient Bulk Operations on Dynamic R-trees. In: Proc. of Workshop on Algorithm Engineering and Experimentation (1999)Google Scholar
  2. 2.
    Cheng, R., Xia, Y., Prabhakar, S., Shah, R.: Change Tolerant Indexing for Constantly Evolving Data. In: Proc. of ICDE (2005)Google Scholar
  3. 3.
    Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of SIGMOD (1984)Google Scholar
  4. 4.
    Jensen, C.S., Lin, D., Ooi, B.C.: Query and Update Efficient B  + -Tree Based Indexing of Moving Objects. In: Proc. of VLDB (2004)Google Scholar
  5. 5.
    Kamel, I., Faloutsos, C.: On Packing R-trees. In: Proc. of CIKM (1993)Google Scholar
  6. 6.
    Kwon, D., Lee, S., Lee, S.: Indexing the Current Positions of Moving Objects Using the Lazy Update R-Tree. In: Proc. of MDM (2002)Google Scholar
  7. 7.
    Leutenegger, S.T., Lopez, M.A., Edgington, J.: STR: A Simple and Efficient Algorithm for R-tree Packing. In: Proc. of ICDE (1997)Google Scholar
  8. 8.
    Lin, B., Su, J.: Handling Frequent Updates of Moving Objects. In: CIKM (2005)Google Scholar
  9. 9.
    Lee, M.L., Hsu, W., Jensen, C.S., Cui, B., Teo, K.L.: Supporting Frequent Updates in R-trees: A Bottom-Up Approach. In: Proc. of VLDB (2003)Google Scholar
  10. 10.
    Malmi, L., Soininen, E.S.: Group Updates for relaxed height-balanced trees. In: Proc. of PODS (1999)Google Scholar
  11. 11.
    Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches in Query Processing for Moving Object Trajectories. In: Proc. of VLDB (2001)Google Scholar
  12. 12.
    Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. In: Proc. of SIGMOD (2000)Google Scholar
  13. 13.
    Tao, Y., Papadias, D.: The MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In: Proc. of VLDB (2001)Google Scholar
  14. 14.
    Theodoridis, Y., Silva, J.R.O., Nascimento, M.A.: On the Generation of Spatiotemporal Datasets. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, p. 147. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  15. 15.
    van den Bercken, J., Seeger, B.: An Evaluation of Generic Bulk Loading Techniques. In: Proc. of VLDB (2001)Google Scholar
  16. 16.
    Xia, Y., Prabhakar, S.: Q+Rtree: Efficient Indexing for Moving Object Databases. In: Proc. of DASFAA (2003)Google Scholar
  17. 17.
    Xiong, X., Aref, W.G.: R-trees with Update Memos. In: Proc. of ICDE (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xiaoyuan Wang
    • 1
  • Weiwei Sun
    • 1
  • Wei Wang
    • 1
  1. 1.Department of Computing and Information TechnologyFudan UniversityShanghaiChina

Personalised recommendations