Updating and querying databases that track mobile units

被引:222
作者
Wolfson, O [1 ]
Sistla, AP
Chamberlain, S
Yesha, Y
机构
[1] Univ Illinois, Dept Elect Engn & Comp Sci, Chicago, IL 60607 USA
[2] USA, Res Lab, Aberdeen Proving Ground, MD USA
[3] NASA, Goddard Space Flight Ctr, Ctr Excellence Space Data & Informat Sci, Greenbelt, MD USA
关键词
Data Structure; Communication Network; Information Theory; Actual Location; Probabilistic Approach;
D O I
10.1023/A:1008782710752
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:257 / 287
页数:31
相关论文
共 24 条
  • [1] Abadi M., 1989, J SYMBOLIC COMPUTATI, V8
  • [2] ABITEBOUL S, 1995, FDN DABATASES
  • [3] ALONSO R, 1993, P 1993 ACM SIGMOD IN
  • [4] [Anonymous], 1975, REPRINTING MONOGRAPH
  • [5] BADRINATH BR, 1992, IEEE GLOBECOM DEC
  • [6] BAUDINET M, 1991, ACM S PRINC DAT SYST
  • [7] BRODSKY A, 1997, UNPUB CCUBE CONSTRAI
  • [8] CHAMBERLAIN S, 1995, 1995 S C2 RES TECHN
  • [9] CHOMICKI J, 1988, ACM S PRINC DAT SYST
  • [10] Feller W., 1966, INTRO PROBABILITY TH