We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Efficient evaluation of continuous spatio-temporal queries on moving objects with uncertain velocity.
- Authors
Yuan-Ko Huang; Chiang Lee
- Abstract
Continuous Range (CR) query and Continuous K-Nearest Neighbor (C KNN) query are two important types of spatio-temporal queries. Given a time interval [ t s, t e] and a moving query object q, a CR query is to find the moving objects whose Euclidean distances to q are within a user-given distance at each time instant within [ t s, t e]. A C KNN query is to retrieve the K-Nearest Neighbors ( KNNs) of this query object q at each time instant within [ t s, t e]. In this paper, we investigate how to process these spatio-temporal queries efficiently under the situation that the velocity of each object is not fixed. This uncertainty on the velocity of object inevitably results in high complexity in processing spatio-temporal queries. We will discuss the complications incurred by this uncertainty and propose two algorithms, namely the Possibility-based possible within objects searching algorithm and the Possibility-based possible KNN searching algorithm, for the CR query and the C KNN query, respectively. A Possibility-based model is designed accordingly to quantify the possibility of each object being the result of a CR query or a C KNN query. Comprehensive experiments are performed to demonstrate the effectiveness and the efficiency of the proposed approaches.
- Subjects
SPEED; ALGORITHMS; POSSIBILITY; DATABASE searching; SEARCH algorithms
- Publication
GeoInformatica, 2010, Vol 14, Issue 2, p163
- ISSN
1384-6175
- Publication type
Article
- DOI
10.1007/s10707-009-0081-8