Sciweavers

582 search results - page 1 / 117
» Performance Comparison of Point and Spatial Access Methods
Sort
View
SSD
1989
Springer
55views Database» more  SSD 1989»
13 years 11 months ago
Performance Comparison of Point and Spatial Access Methods
Hans-Peter Kriegel, Michael Schiwietz
ICDIM
2009
IEEE
14 years 2 months ago
The mqr-tree: Improving upon a 2-dimensional spatial access method
We propose the mqr-tree, a two-dimensional spatial access method that improves upon the 2DR-tree. The 2DRtree uses two-dimensional nodes so that the relationships between all obje...
Marc Moreau, Wendy Osborn, Brad Anderson
ISCI
2007
141views more  ISCI 2007»
13 years 7 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
CSUR
1998
99views more  CSUR 1998»
13 years 7 months ago
Multidimensional Access Methods
Search operations in databases require some special support at the physical level. This is true for conventional databases as well as for spatial databases, where typical search o...
Volker Gaede, Oliver Günther
ICIP
1999
IEEE
13 years 12 months ago
Forward Adaptive Modeling for Context-Based Compression of Large Binary Images in Applications Requiring Spatial Access
A method for compression of large binary images is proposed for applications where spatial access to the image is required. The proposed method is a two-stage combination of forwa...
Eugene I. Ageenko, Pasi Fränti