Abstract:

Distributed moving object database servers are a feasible solution to the scalability problems of centralized database systems. In this paper we propose a distributed indexing method, using the Distributed Hash Table (DHT) paradigm, devised to efficiently support complex spatio temporal queries. We assume a setting in which there is a large number of database servers that keep track of events associated with a highly dynamic system of moving objects deployed in a spatial area. We present a technique for properly keeping the index up to date and efficient processing algorithms for range and top-k queries for moving object databases. We evaluated our system using event-driven simulators with demanding spatio temporal workloads and the results show good performance in terms of response time and network traffic.