## Databases for Tracking Mobile Units in Real Time (1999)

Venue: | Proc. Int. Conf. Database Theory |

Citations: | 18 - 2 self |

### BibTeX

@INPROCEEDINGS{Wolfson99databasesfor,

author = {Ouri Wolfson and Liqin Jiang and A. Prasad Sistla and A. Prasadsistla and Sam Chamberlain and Naphtali Rishe and Minglin Deng},

title = {Databases for Tracking Mobile Units in Real Time},

booktitle = {Proc. Int. Conf. Database Theory},

year = {1999},

pages = {169--186},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### 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. Then we consider the problem of processing range queries in the database, and we propose a probabilistic algorithm to solve the problem.

### Citations

1535 |
Foundations of Databases
- Abiteboul, Hull, et al.
- 1994
(Show Context)
Citation Context ...lity that it satisfies q using the formula given in theorem 3. 7 Relevant Work One research area to which this paper is related is uncertainty and incomplete information in databases (see for example =-=[9,1]-=- for surveys). However, as far as we know this area has so far addressed complementary issues to the ones in this paper. Our current work on location update policies addresses the question: what uncer... |

1467 |
An Introduction to Probability Theory and
- FELLER
- 1950
(Show Context)
Citation Context ...dicated, we assume that all the objects are traveling on routes. Since the actual location is not exactly known, we assume that the location of an object o on its route at time t is a random variable =-=[3]-=-. We let fo(x) denote the density function of this random variable. More specifically, for small values of dx, fo(x)dx denotes the probability that o is at some point in the interval [x, x+dx] attimet... |

283 | Temporal databases
- Snodgrass, Ahn
- 1986
(Show Context)
Citation Context ...ibute; thus at any point in time L.starttime is also the time of the last location-update. We assume in this paper that the database updates are instantaneous, i.e. valid- and transaction- times (see =-=[11]-=-) are equal. Therefore, L.starttime is the time at which the update occurred in the real world system being modeled, and also the time when the database installs the update. L.direction is a binary in... |

257 | Modeling and querying moving objects
- Sistla, Wolfson, et al.
- 1997
(Show Context)
Citation Context ...as the speed v of the object. Thus the database location of m can be computed by the DBMS at any subsequent point in time. 1 This method of modeling the database location was originally introduced in =-=[5,6]-=- via the concept of a dynamic attribute; the method is modified here in order to handle uncertainty. The actual location of a moving object m deviates from its database location due to the fact that m... |

85 | Cost and imprecision in modeling the position of moving objects
- Wolfson, Chamberlain, et al.
- 2002
(Show Context)
Citation Context ...as the speed v of the object. Thus the database location of m can be computed by the DBMS at any subsequent point in time. 1 This method of modeling the database location was originally introduced in =-=[5,6]-=- via the concept of a dynamic attribute; the method is modified here in order to handle uncertainty. The actual location of a moving object m deviates from its database location due to the fact that m... |

83 | Towards a theory of spatial database queries. Extended abstract
- Paredaens, Bussche, et al.
- 1994
(Show Context)
Citation Context ...such that the tuples satisfying the constraint are considered to be in the database. Constraint databases have been separately applied to the temporal (see [2]) domain, and to the spatial domain (see =-=[10]-=-). Constraint databases can be used as a framework in which to implement the proposed update policies and query processing algorithm. Finally, the present paper extends the work on which we initially ... |

66 |
Statistical Inference
- Silvey
- 1970
(Show Context)
Citation Context ... terrain. This comment holds for the other policies discussed in this section.sDatabases for Tracking Mobile Units in Real Time 179 immediately preceding update to time pi, by a linear function6 (see =-=[14]-=-) with slope 2Ii t2 t. Observe that at time pi this linear function has the same deviation i cost (namely Ii) as the actual current deviation 7 . Based on the locality principle, adr predicts that aft... |

54 |
Local Anchor Scheme for Reducing Location Tracking Expense in PCNs
- Ho, Akyildiz
- 1995
(Show Context)
Citation Context ...bile user. The record is updated when the user moves from one cell to another, and it is reads184 Ouri Wolfson et al. when the user is called. Existing works on location management (see, for example, =-=[15,4,7]-=-) address the problem of allocating and distributing the location database such that the lookup time and update overhead are minimized. Location management in the cellular architecture can be viewed a... |

45 |
Mobile Computing
- Imielinski, Korth
- 1996
(Show Context)
Citation Context ...bile user. The record is updated when the user moves from one cell to another, and it is reads184 Ouri Wolfson et al. when the user is called. Existing works on location management (see, for example, =-=[15,4,7]-=-) address the problem of allocating and distributing the location database such that the lookup time and update overhead are minimized. Location management in the cellular architecture can be viewed a... |

29 |
Vianu V. Foundations of databases
- Abiteboul, Hull
- 1995
(Show Context)
Citation Context ...lity that it satisfies q using the formula given in theorem 3. 7 Relevant Work One research area to which this paper is related is uncertainty and incomplete information in databases (see for example =-=[9,1]-=- for surveys). However, as far as we know this area has so far addressed complementary issues to the ones in this paper. Our current work on location update policies addresses the question: what uncer... |

25 | Peruser profile replication in mobile environments: Algorithms, analysis, and simulation results,” ACM/Baltzer
- Shivakumar, Jannink, et al.
- 1997
(Show Context)
Citation Context ...bile user. The record is updated when the user moves from one cell to another, and it is reads184 Ouri Wolfson et al. when the user is called. Existing works on location management (see, for example, =-=[15,4,7]-=-) address the problem of allocating and distributing the location database such that the lookup time and update overhead are minimized. Location management in the cellular architecture can be viewed a... |

24 |
Tutorial: Constraint programming and database languages
- Kanellakis
- 1995
(Show Context)
Citation Context ...the cell granularity is insufficient. For example, in satellite networks the diameter of a cell ranges from hundreds to thousands of miles. Another relevant research area is constraint databases (see =-=[8]-=- for a survey). In this sense, our location attributes can be viewed as a constraint, or a generalized tuple, such that the tuples satisfying the constraint are considered to be in the database. Const... |

17 |
Model-based battle command: A paradigm whose time has come
- Chamberlain
- 1995
(Show Context)
Citation Context ...ll refer to the above applications as MOtion-Database (MOD) applications or movingobjects-database applications. In the military, MOD applications arise in the context of the digital battlefield (see =-=[13,12]), and-=- in the civilian industry they arise in transportation systems. Catriel Beeri, Peter Buneman (Eds.): ICDT’99, LNCS 1540, pp. 169–186, 1998. c○ Springer-Verlag Berlin Heidelberg 1998s170 Ouri Wol... |

10 |
Towards a theory of spatial database queries
- Paradaens, Bussche, et al.
- 1994
(Show Context)
Citation Context ...such that the tuples satisfying the constraint are considered to be in the database. Constraint databases have been separately applied to the temporal (see [2]) domain, and to the spatial domain (see =-=[10]-=-). Constraint databases can be used as a framework in which to implement the proposed update policies and query processing algorithm. Finally, the present paper extends the work on which we initially ... |

6 |
On the representation of infinite data and queries
- Baudinet, Niezette, et al.
- 1991
(Show Context)
Citation Context ...ed as a constraint, or a generalized tuple, such that the tuples satisfying the constraint are considered to be in the database. Constraint databases have been separately applied to the temporal (see =-=[2]-=-) domain, and to the spatial domain (see [10]). Constraint databases can be used as a framework in which to implement the proposed update policies and query processing algorithm. Finally, the present ... |

3 |
Automated Information Distribution
- Chamberlain
- 1994
(Show Context)
Citation Context ...ll refer to the above applications as MOtion-Database (MOD) applications or movingobjects-database applications. In the military, MOD applications arise in the context of the digital battlefield (see =-=[13,12]), and-=- in the civilian industry they arise in transportation systems. Catriel Beeri, Peter Buneman (Eds.): ICDT’99, LNCS 1540, pp. 169–186, 1998. c○ Springer-Verlag Berlin Heidelberg 1998s170 Ouri Wol... |

1 |
Motro : Management of Uncertainty in Database Systems
- unknown authors
- 1995
(Show Context)
Citation Context ...lity that it satisfies q using the formula given in theorem 3. 7 Relevant Work One research area to which this paper is related is uncertainty and incomplete information in databases (see for example =-=[9,1]-=- for surveys). However, as far as we know this area has so far addressed complementary issues to the ones in this paper. Our current work on location update policies addresses the question: what uncer... |