SEB-tree: An Approach to Index Continuously Moving Objects

  • Zhexuan Song
  • Nick Roussopoulos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2574)


Recently, the requirement for storing the locations of continuously moving objects arises in many applications. The paper extends our previous work on zoning based index updating policy [1]. In the paper, we give the data format of object movement under the policy. Then, we propose the SEB-tree (Start/End time stamp B-tree). This index structure has fast insertion and query algorithm, and it outperforms the existing structures in the experimental evaluations.


History Record Index Structure Time Stamp Range Query Query Performance 
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]
    Song, Z., Roussopoulos, N.: Hashing moving objects. In: Proceedings of 2nd International Conference of Mobile Data Management. (2001) 161–172Google Scholar
  2. [2]
    Tayeb, J., Ulusoy, O., Wolfson, O.: A quadtree based dynamic attribute indexing method. The Computer Journal 41 (1998)Google Scholar
  3. [3]
    Pfoser, D., Jensen, C., Theodoridis, Y.: Novel approaches in query processing for moving objects. In: Proceedings of Very Large Database. (2000) 395–406Google Scholar
  4. [4]
    Tao, Y., Papadias, D.: The mv3r-tree: A spatio-temporal access method for timestamp and interval queries. In: Proceedings of Very Large Database. (2001)Google Scholar
  5. [5]
    Saltenis, S., Jensen, C. S., Leutenegger, S. T., Lopez, M. A.: Indexing the positions of continuously moving objecs. In: Proceedings of ACM SIGMOD International Conference on Management of Data. (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Zhexuan Song
    • 1
  • Nick Roussopoulos
    • 1
  1. 1.Department of Computer ScienceUniversity of MarylandMaryland

Personalised recommendations