Skip to main content

Hashing Moving Objects

  • Conference paper
  • First Online:
Mobile Data Management (MDM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1987))

Included in the following conference series:

Abstract

In many real-life applications, objects need to be both spatially and temporally referenced.With the advancements of wireless communication and positioning technologies, the demand for storing and indexing moving objects, which are the objects continuously changing their locations, in database systems rises. However, current static spatial index structures are not well suited for handling large volume of moving objects due to massive and complex database update operations. In this paper, we propose a new idea based on hashing technique: using buckets to hold moving objects. The database does not make any change until an object moves into a new bucket; therefore, the database update cost is greatly reduced. Then, we extend the design of existing system structure by inserting a .lter layer between the position information collectors and the database. Based on the new system structure, we also present two indexing methods. Finally, di.erent aspects of our indexing techniques are evaluated.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Acharya, V. Poosala, S. Ramaswamy. Selectivity Estimation in Spatial Databases Proc. of SIGMOD 1999. 165

    Google Scholar 

  2. Surajit Chaudhuri, Luis Gravano. Evaluating Top-k Selection Queries Proc. of VLDB, 1999. 162

    Google Scholar 

  3. A. Guttman. R-Trees, A Dynamic Index Structure for Spatial Searching Proc. of the ACM SIGMOD, 1984.

    Google Scholar 

  4. G. Kollios, D Gunopulos, V. J. Tsotras. On Indexing Mobile Objects In Proc. of PODS, 1999. 163

    Google Scholar 

  5. M. A. Nascimento, J. R. O. Silva, Y. Theodoridi. Evaluation of Access Structures for Discretely Moving Points Intl. Workshop on Spatio-Temporal Database Management (STDBM’99), Edinburgh, UK, September 1999. 167, 168

    Google Scholar 

  6. V. Poosala, Y. E. Ioannidis, P. J. Haas, E. J. Shekita. Improved Histograms for Selectivity Estimation of Range Predicates Proc. of SIGMOD 1996. 165

    Google Scholar 

  7. D. Pfoser, C. S. Jensen. Capturing the Uncertainty of Moving-Object Representations Advances in Spatial Databases, 6th International Symposium, SSD’99, Hong Kong, China, July 20-23, 1999.

    Google Scholar 

  8. D. Pfoser, Y. Theodoridis, C. S. Jensen. Indexing Trajectories of Moving Point ObjectsChorochronos Technical Report, CH-99-3, October, 1999. 162

    Google Scholar 

  9. D. Pfoser, Y. Theodoridis, C. S. Jensen. Novel Approaches in Query Processing for Moving Objects Chorochronos Technical Report, CH-00-3, February, 2000. 162

    Google Scholar 

  10. H. Samet. The Design and Analysis of Spatial Data Structures Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  11. Thomas Seidl, Hans-Peter Kriegel. Optimal Multi-Step k-Nearest Neighbor Search Proc. of SIGMOD 1998. 162

    Google Scholar 

  12. Zhexuan Song, Nick Roussopoulos. Hashing Moving Objects Technical Report, CS-TR-4143, University of Maryland, 2000.

    Google Scholar 

  13. S. Saltenis, C. S. Jensen, S. T. Leutenegger, M. A. Lopez. Indexing the Positions of Continuously Moving Objects Proc. of SIGMOD 2000. 163

    Google Scholar 

  14. A. P. Sistla, O. Wolfson, S. Chamberlain, S. Dao. Modeling and Querying Moving Objects Proc. of ICDE 1997. 163

    Google Scholar 

  15. Nectaria Tryfona, Christian S. Jensen. A component-Based Conceptual Model for Spatiotemporal Applications Design CHOROCHRONOS project, technical report CH-98-10, 1998.

    Google Scholar 

  16. J. Tayeb, O. Ulusoy, O. Wolfson. A Quadtree Based Dynamic Attribute Indexing Method The Computer Journal, 41(3), 1998. 162

    Google Scholar 

  17. O. Wolfson, S. Chamberlain, S. Dao, L. Jiang, G. Mendex. Cost and Imprecision in Modeling the Position of Moving Objects In Proc. of ICDE, 1998. 163

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Song, Z., Roussopoulos, N. (2001). Hashing Moving Objects. In: Tan, KL., Franklin, M.J., Lui, J.CS. (eds) Mobile Data Management. MDM 2001. Lecture Notes in Computer Science, vol 1987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44498-X_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-44498-X_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41454-4

  • Online ISBN: 978-3-540-44498-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics