354 search results - page 15 / 71 » Efficient Processing of Spatial Joins Using R-Trees |
PVLDB
2008
13 years 8 months ago
2008
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA ...
PRIS
2004
13 years 9 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
DATAMINE
2000
13 years 8 months ago
2000
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
SSD
1999
Springer
14 years 21 days ago
1999
Springer
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are ...