Skip to main content

The Self-relocating Index Scheme for Telematics GIS

  • Conference paper
  • 502 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3833))

Abstract

The history management of vehicles is important in telematics applications. To process queries for history data, trajectories, we generally use trajectory-preserving index schemes based on the trajectory preservation property. This property means that a leaf node only contains segments belonging to a particular trajectory, regardless of the spatiotemporal locality of segments. The sacrifice of spatiotemporal locality, however, causes the index to increase the dead space of MBBs of non-leaf nodes and the overlap between the MBBs of nodes. Therefore, an index scheme for trajectories shows good performance with trajectory-based queries, but not with coordinate-based queries, such as range queries. We propose a new index scheme that improves the performance of range queries without reducing performance with trajectory-based queries. In the new index scheme using the entry relocation strategy, two entries in different nodes are exchanged to minimize the dead spaces of the MBBs of the corresponding nodes.

This work was supported by the Regional Research Centers Program(Research Center for Logistics Information Technology), granted by the Korean Ministry of Education & Human Resources Development.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zhu, H., Su, J., Ibarra, O.H.: Trajectory queries and octagons in moving object databases. In: Proc. of CIKM, pp. 413–421 (2002)

    Google Scholar 

  2. Tao, Y., Papadias, D.: MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In: Proc. of VLDB, pp. 431–440 (2001)

    Google Scholar 

  3. Kumar, A., Tsotras, V.J., Faloutsos, C.: Designing Access Methods for Bitemporal Databases. TKDE 10(1), 1–20 (1998)

    Google Scholar 

  4. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of SIGMOD, pp. 47–57 (1984)

    Google Scholar 

  5. Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches in Query Processing for Moving Object Trajectories. In: Proc. of VLDB, pp. 395–406 (2000)

    Google Scholar 

  6. Beckmann, N., Kriegel, H.P.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. of ACM SIGMOD, pp. 332–331 (1990)

    Google Scholar 

  7. Theodoridis, Y., Silva, R., Nascimento, M.: On the Generation of Spatiotemporal Datasets. In: Proc. of the 6th Int’l Symposium on Spatial Databases, pp. 147–164 (1999)

    Google Scholar 

  8. Worboys, M.F.: GIS: A Computing Perspective. Taylor & Francis, Abington (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lim, D., Hong, B., Cho, D. (2005). The Self-relocating Index Scheme for Telematics GIS. In: Li, KJ., Vangenot, C. (eds) Web and Wireless Geographical Information Systems. W2GIS 2005. Lecture Notes in Computer Science, vol 3833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599289_9

Download citation

  • DOI: https://doi.org/10.1007/11599289_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30848-5

  • Online ISBN: 978-3-540-32423-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics