11 search results - page 1 / 3 » The Design and Implementation of Seeded Trees: An Efficient ... |
TKDE
1998
13 years 4 months ago
1998
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
SIGMOD
2004
ACM
14 years 4 months ago
2004
ACM
The increasing use of temporal and spatial data in presentday relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms...
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...
GIS
2010
ACM
13 years 2 months ago
2010
ACM
Spatial Alarms are reminders for mobile users upon their arrival of certain spatial location of interest. Spatial alarm processing requires meeting two demanding objectives: high ...
GEOINFO
2003
13 years 6 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...