96 search results - page 3 / 20 » Variations of R-Tree Structure for Indexing of Spatial Objec... |
DEBU
2002
13 years 4 months ago
2002
Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...
DBA
2004
13 years 6 months ago
2004
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
VLDB
1994
ACM
13 years 9 months ago
1994
ACM
A join index hierarchy method is proposed to handle the "goto's on disk" problem in objectoriented query processing. The method constructs a hierarchy of join indic...
MDM
2005
Springer
13 years 10 months ago
2005
Springer
The ever-increasing popularity of mobile applications coupled with the prevalence of spatial data has created the need for efficient processing of spatial queries in mobile enviro...
DASFAA
2004
IEEE
13 years 8 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...