Probabilistic point queries over network-based movements

Authors:
Utku Kalay;Oya Kalıpsız
Affiliations:
Computer Engineering Department, Faculty of Electrical-Electronics Engineering, Yıldız Technical University, Beşiktaş, Istanbul;Computer Engineering Department, Faculty of Electrical-Electronics Engineering, Yıldız Technical University, Beşiktaş, Istanbul
Venue:
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Year:
2005

Citing 3
Cited 0

Updating and Querying Databases that Track Mobile Units

Distributed and Parallel Databases - Special issue on mobile data management and applications
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Querying Imprecise Data in Moving Object Environments

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spatial-temporal environments contain large number of continuously moving objects on which variety of queries are executed, preferably within a real time. In such a dynamic system, processing location-based queries is a challenging problem. In this paper, the dynamic system has objects moving over a road of network. This paper proposes a new uncertainty model for this type of dynamic system. We applied this model on the indexing scheme that has recently been proposed, namely MON-tree. With our uncertainty model, we also explored a probabilistic query execution algorithm. For the purpose of an experimental evaluation, we set up a simulation environment that visualizes the movements and also provides a query processing capability. To achieve a better index storage utilization and query execution performance, we decreased the location update frequency of the dataset.