565 search results - page 1 / 113 » Multiple Range Query Optimization in Spatial Databases |
ADBIS
1998
Springer
15 years 1 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
DEXA
2006
Springer
15 years 1 months ago
2006
Springer
Moving range queries over mobile objects are important in many location management applications. There have been quite a few research works in this area. However, all existing solu...
DPD
2006
14 years 9 months ago
2006
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
MOBIDE
2005
ACM
15 years 3 months ago
2005
ACM
This work addresses the problem of efficient maintenance of the (correct) answers to the continuous spatio-temporal range queries in Moving Objects Databases (MOD), which represen...
82
Voted
PODS
2004
ACM
15 years 9 months ago
2004
ACM
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...