Skip to main content
SpringerLink
Log in

Main Memory Evaluation of Monitoring Queries Over Moving Objects

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

In this paper we evaluate several in-memory algorithms for efficient and scalable processing of continuous range queries over collections of moving objects. Constant updates to the index are avoided by query indexing. No constraints are imposed on the speed or path of moving objects or fraction of objects that move at any moment in time. We present a detailed analysis of a grid approach which shows the best results for both skewed and uniform data. A sorting based optimization is developed for significantly improving the cache hit-rate. Experimental evaluation establishes that indexing queries using the grid index yields orders of magnitude better performance than other index structures such as R*-trees.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Acharya, R. Alonso, M.J. Franklin, and S.B. Zdonik, “Broadcast disks: Data management for asymmetric communications environments,” in Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 22–25 May, 1995, pp. 199–210.

  2. P.K. Agarwal, L. Arge, and J. Erickson, “Indexing moving points.” in Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, Texas, USA, May 15–17, 2000.

  3. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer, “An asymptotically optimal multiversion B-tree,” The VLDB Journal, vol. 5, no. 4, pp. 264–275, 1996.

    Google Scholar 

  4. P. Bernstein et al., “The asilomar report on database research,” SIGMOD Record, vol. 27, no. 4, pp. 74–80, 1998.

    Google Scholar 

  5. R. Cheng, D.V. Kalashnikov, and S. Prabhakar, “Querying imprecise data in moving object environments,” TKDE, IEEE Transactions on Knowledge and Data Engineering, 2003 (conditionally accepted).

  6. R. Cheng, S. Prabhakar, and D.V. Kalashnikov, “Querying imprecise data in moving object environments,” in ICDE'03, Proc. of the 19th IEEE International Conference on Data Engineering, Bangalore, India, March 5–8, 2003.

  7. L. Forlizzi, R.H. Guting, E. Nardelli, and M. Scheider, “A data model and data structures for moving objects databases,” in Proc. of ACM SIGMOD Conf., Dallas, Texas, May 2000.

  8. R.H. Guting, M.H. Bohlen, M. Erwig, C.S. Jensen, N.A. Lorentzos, M. Schneider, and M. Vazirgiannis, “A foundation for representing and querying moving objects,” ACM Transactions on Database Systems, 2000 (to appear).

  9. S.E. Hambrusch, C.-M. Liu, W. Aref, and S. Prabhakar, “Minimizing broadcast costs under edge reductions in tree networks,” in 7th International Symposium on Spatial and Temporal Databases (SSTD 2001), July 2001.

  10. Q. Hu,W.-C. Lee, and D.L. Lee, “Power conservative multi-attribute queries on data broadcast,” in Proceedings of the International Conference on Data Engineering (ICDE), 2000, pp. 157–166.

  11. T. Imieli?ski, S. Viswanathan, and B.R. Badrinath, “Energy efficient indexing on air,” in Proceedings of the International Conference on Management of Data, Richard T. Snodgrass and Marianne Winslett (Ed.), ACM Press, May 1994, pp. 25–36.

  12. D.V. Kalashnikov and S. Prabhakar, “Similarity join for low-and high-dimensional data,” in DASFAA'03, Proc. of the 8th International Conference on Database Systems for Advanced Applications, Kyoto, Japan: IEEE Computer Society Press, March 26–28, 2003.

    Google Scholar 

  13. D.V. Kalashnikov, S. Prabhakar, W. Aref, and S. Hambrusch, “Efficient evaluation of continuous range queries on moving objects,” Technical Report TR 02–015, Department of Computer Science, Purdue University, West Lafayette, IN 47907, June 2002.

    Google Scholar 

  14. K. Kim, S.K. Cha, and K. Kwon, “Optimizing multidimensional index trees for main memory access,” in SIGMOD'01, Proc. of ACM SIGMOD Int. Conf. on Management of Data, Santa Barbara, CA, USA, May 21–24, 2001.

  15. G. Kollios, D. Gunopulos, and V.J. Tsotras, “On indexing mobile objects,” in Proc. 1999 ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Philadelphia, June 1999.

  16. H. Koshima and J. Hoshen, “Personal locator services emerge,” IEEE Spectrum, vol. 37, no. 2, pp. 41–48, 2000.

    Google Scholar 

  17. A. Kumar, V.J. Tsotras, and C. Faloutsos, “Designing access methods for bitemporal databases,” IEEE Transactions on Knowledge and Data Engineering (TKDE), vol. 10, no. 1, pp. 1–20, 1998.

    Google Scholar 

  18. D. Pfoser and C.S. Jensen, “Capturing the uncertainty of moving-objects representations,” in Proceedings of the SSDBM Conf., 1999, pp. 123–132.

  19. D. Pfoser, C.S. Jensen, and Y. Theodoridis, “Novel approaches in query processing for moving objects,” in Proceedings of the 26th International Conference on Very Large Databases (VLDB), Cairo, Egypt, Sept. 2000.

  20. D. Pfoser, Y. Theodoridis, and C.S. Jensen, “Indexing trajectories of moving point objects,” Technical Report CH–99–3, Chorochronos Technical Reprot, June 1999.

  21. S. Prabhakar, Y. Xia, D. Kalashnikov, W. Aref, and S. Hambrusch, “Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects,” IEEE Transactions on Computers, vol. 51, no. 10, pp. 1124–1140, 2002.

    Google Scholar 

  22. J. Rao and K.A. Ross, “Making B+-trees cache conscious in main memory,“ in Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Weidong Chen, Jeffrey F. Naughton, and Philip A. Bernstein (Eds.), Dallas, Texas, USA, May 2000, pp. 475–486.

  23. S. Saltenis, C. Jensen, S. Leutenegger, and M. Lopez, “Indexing the position of continuously moving objects,” in Proceedings of ACM SIGMOD Conference, Dallas, Texas, May 2000.

  24. A.Y. Seydim, M.H. Dunham, and V. Kumar, “Location dependent query processing,” in MobiDEí01, Second ACM International Workshop on Data Engineering for Mobile and Wireless Access, Santa Barbara, California, USA, May 2001.

  25. A.P. Sistla, O.Wolfson, S. Chamberlain, and S. Dao, “Modeling and querying moving objects,” in Proceedings of the Fourteenth International Conference on Data Engineering (ICDE'97), 1997, pp. 422–432.

  26. J. Tayeb, Ö. Ulusoy, and O. Wolfson, “A quadtree-based dynamic attribute indexing method,” The Computer Journal, vol. 41, no. 3, pp. 185–200, 1998.

    Google Scholar 

  27. US Wireless Corp, “The market potential of the wireless location industry,” http://www.uswcorp.com/USWCMainPages/laby.htm.

  28. O. Wolfson, S. Chamberlain, S. Dao, L. Jiang, and G. Mendez, “Cost and imprecision in modeling the position of moving objects,” in Proceedings of the Fourteenth International Conference on Data Engineering (ICDE'98), Orlando, FL, February 1998.

  29. O. Wolfson, P.A. Sistla, S. Chamberlain, and Y. Yesha, “Updating and querying databases that track mobile units,” Distributed and Parallel Databases, vol. 7, no. 3, pp. 257–387, 1999.

    Google Scholar 

  30. O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang, “Moving objects databases: Issues and solutions,” in Proceedings of the SSDBM Conf., 1998, pp. 111–122.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, Purdue University, West Lafayette, Indiana, 47907, USA

    Dmitri V. Kalashnikov, Sunil Prabhakar & Susanne E. Hambrusch

Authors
  1. Dmitri V. Kalashnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sunil Prabhakar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Susanne E. Hambrusch
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kalashnikov, D.V., Prabhakar, S. & Hambrusch, S.E. Main Memory Evaluation of Monitoring Queries Over Moving Objects. Distributed and Parallel Databases 15, 117–135 (2004). https://doi.org/10.1023/B:DAPD.0000013068.25976.88

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:DAPD.0000013068.25976.88

Search

Navigation