Sciweavers

6 search results - page 1 / 2
» Algorithms for Joining R-Trees and Linear Region Quadtrees
Sort
View
SSD
1999
Springer
99views Database» more  SSD 1999»
13 years 9 months ago
Algorithms for Joining R-Trees and Linear Region Quadtrees
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 ...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...
GIS
1999
ACM
13 years 9 months ago
Improved Bulk-Loading Algorithms for Quadtrees
Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involv...
Gísli R. Hjaltason, Hanan Samet
GEOINFO
2003
13 years 6 months ago
Efficient Query Processing on the Relational Quadtree
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...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
13 years 9 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
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...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 5 months ago
Discrete denoising of heterogenous two-dimensional data
We consider discrete denoising of two-dimensional data with characteristics that may be varying abruptly between regions. Using a quadtree decomposition technique and space-fillin...
Taesup Moon, Tsachy Weissman, Jae-Young Kim