19 search results - page 2 / 4 » ssd 2001 |
SSD
2001
Springer
13 years 9 months ago
2001
Springer
Several studies have focused on the efficient processing of simple spatial query types such as selections and spatial joins. Little work, however, has been done towards the optimiz...
SSD
2001
Springer
13 years 9 months ago
2001
Springer
In dynamic spatio-temporal environments where objects may continuously move in space, maintaining consistent information about the location of objects and processing motion-speci...
SSD
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
SSD
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as neare...
SSD
2001
Springer
13 years 9 months ago
2001
Springer
The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, t...