This is an algorithm for finding neighbors for point objects that can freely move and have no predefined position. The query sphere consists of a center location and a given radiu...
This paper introduces the problem of modeling urban transportation systems in a database where certain aspects of the data are probabilistic in nature. The transportation network ...
Joel Booth, A. Prasad Sistla, Ouri Wolfson, Isabel...
In this paper, we aim to develop a framework for continuous query processing in spatio-temporal databases. The proposed framework distinguishes itself from other query processors b...
Answering aggregate queries like sum, count, min, max over regions containing moving objects is often needed for virtual world applications, real-time monitoring systems, etc. Sin...
With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road netw...
Xu Jianqiu, Victor Teixeira de Almeida, Qin Xiaoli...