Advertisement

Distributed and Parallel Databases

, Volume 7, Issue 3, pp 257–387 | Cite as

Updating and Querying Databases that Track Mobile Units

  • Ouri Wolfson
  • A. Prasad Sistla
  • Sam Chamberlain
  • Yelena Yesha
Article

Abstract

In this paper, we consider databases representing information about moving objects (e.g., vehicles), particularly their location. We address the problems of updating and querying such databases. Specifically, the update problem is to determine when the location of a moving object in the database (namely its database location) should be updated. We answer this question by proposing an information cost model that captures uncertainty, deviation, and communication. Then we analyze dead-reckoning policies, namely policies that update the database location whenever the distance between the actual location and the database location exceeds a given threshold, x. Dead-reckoning is the prevalent approach in military applications, and our cost model enables us to determine the threshold x. We propose several dead-reckoning policies and we compare their performance by simulation.

Then we consider the problem of processing range queries in the database. An example of a range query is 'retrieve the objects that are currently inside a given polygon P′. We propose a probabilistic approach to solve the problem. Namely, the DBMS will answer such a query with a set of objects, each of which is associated with a probability that the object is inside P.

Keywords

Data Structure Communication Network Information Theory Actual Location Probabilistic Approach 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, Addison Wesley, 1995.Google Scholar
  2. 2.
    R. Alonso and H.F. Korth, “Database system issues in nomadic computing,” in Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington DC, May 1993.Google Scholar
  3. 3.
    M. Abadi and Z. Manna, “Temporal logic programming,” Journal of Symbolic Computation, vol. 8, 1989.Google Scholar
  4. 4.
    B.R. Badrinath, T. Imielinski, and A. Virmani, “Locating strategies for personal communication networks,” Workshop on Networking for Personal Communications Applications, IEEE GLOBECOM, December 1992.Google Scholar
  5. 5.
    M. Baudinet, M. Niezette, and P. Wolper, “On the representation of infinite data and queries,” ACM Symposium on Principles of Database Systems, May 1991.Google Scholar
  6. 6.
    A. Brodsky, V.E. Segal, J. Chen, and R.A. Exarkhopoulo, “The CCUBE constraint object-oriented database system,” manuscript, 1997.Google Scholar
  7. 7.
    J. Chomicki and T. Imielinski, “Temporal deductive databases and infinite objects,” ACM Symposium on Principles of Database Systems, March 1988.Google Scholar
  8. 8.
    W. Feller, An Introduction to Probability Theory, John Wiley and Sons, 1966.Google Scholar
  9. 9.
    M. Goodchild and S. Gopal (Eds.), Accuracy of Spatial Databases, Taylor and Francis, 1989.Google Scholar
  10. 10.
    J.S.M. Ho and I.F. Akyildiz, “Local anchor scheme for reducing location tracking costs in PCN,” first ACM International Conference on Mobile Computing and Networking (MOBICOM'95), Berkeley, California, November 1995.Google Scholar
  11. 11.
    P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao, “Modeling and querying moving objects,” in Proceedings of the Thirteenth International Conference on Data Engineering (ICDE13), Birmingham, UK, April 1997.Google Scholar
  12. 12.
    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 (ICDE14), 1998.Google Scholar
  13. 13.
    S. Grumbach, P. Rigaux, M. Scholl, and L. Segoufin, “DEDALE: A spatial constraint database,” manuscript, 1997.Google Scholar
  14. 14.
    T. Imielinski and H. Korth, Mobile Computing, Kluwer Academic Publishers, 1996.Google Scholar
  15. 15.
    R. Jain, Y.-B. Lin, C. Lo, and S. Mohan, “A caching strategy to reduce network impacts of PCS,” IEEE Journal on Selected Areas in Communications, vol. 12, October 1994.Google Scholar
  16. 16.
    P. Kanellakis, “Constraint programming and database languages,” ACM Symposium on Principles of Database Systems, May 1995.Google Scholar
  17. 17.
    D. Lazoff, B. Stephens and Y. Yesha, “Optimal location of broadcast sources in unreliable tree networks,” IEEE International Conference on Computers and Communications Networks, Rockville, Maryland, 1996.Google Scholar
  18. 18.
    A. Motro, “Management of uncertainty in database systems,” in Modern Database Systems, Won Kim (Ed.), Addison Wesley, 1995.Google Scholar
  19. 19.
    OmniTRACS, “Communicating without limits,” http://www.qualcomm.com/ProdTech/Omni/prodtech/omnisys.html.Google Scholar
  20. 20.
    J. Paradaens, J. van den Bussche, and D. Van Gucht, “Towards a theory of spatial database queries,” ACM Symposium on Principles of Database Systems, May 1994.Google Scholar
  21. 21.
    R. Snodgrass and I. Ahn, The temporal databases, IEEE Computer, Sept. 1986.Google Scholar
  22. 22.
    S. Chamberlain, “Model-based battle command: A paradigm whose time has come,” 1995 Symposium on C2 Research & Technology, NDU, June 1995.Google Scholar
  23. 23.
    S. Chamberlain, “Automated information distribution in bandwidth-constrained environments,” MILCOM-94 conference, 1994.Google Scholar
  24. 24.
    S.D. Silvey, Statistical Inference, Chapman and Hall, 1975.Google Scholar
  25. 25.
    N. Shivakumar, J. Jannink, and J. Widom, “Per-user profile replication in mobile environments: algorithms, analysis, and simulation results,” ACM/Baltzer Journal on Special Topics in Mobile Networks and Applications, special issue on Data Management, 1997.Google Scholar
  26. 26.
    Y. Yesha, K. Humenik, P. Matthews, and B. Stephens, “Minimizing message complexity in partially replicated databases on hypercube networks,” accepted for publication in Networks, in press.Google Scholar

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • Ouri Wolfson
    • 1
  • A. Prasad Sistla
    • 1
  • Sam Chamberlain
    • 2
  • Yelena Yesha
    • 3
  1. 1.Department of Electrical Engineering and Computer ScienceUniversity of IllinoisChicago
  2. 2.Army Research Laboratory, Aberdeen Proving GroundMD
  3. 3.Center of Excellence in Space Data and Information Sciences at NASA, Goddard Space Flight CenterGreenbeltMD

Personalised recommendations