Sciweavers

24 search results - page 2 / 5
» An insertion strategy for a two-dimensional spatial access m...
Sort
View
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 7 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
ADC
2006
Springer
136views Database» more  ADC 2006»
13 years 11 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
TKDE
1998
122views more  TKDE 1998»
13 years 5 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—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...
Ming-Ling Lo, Chinya V. Ravishankar
SPIESR
2000
130views Database» more  SPIESR 2000»
13 years 7 months ago
Compression of large binary images in digital spatial libraries
A method for lossless compression of large binary images is proposed for applications where spatial access to the image is needed. The method utilizes the advantages of (1) variabl...
Eugene I. Ageenko, Pasi Fränti
EDBT
2004
ACM
147views Database» more  EDBT 2004»
13 years 11 months ago
Clustering Multidimensional Extended Objects to Speed Up Execution of Spatial Queries
Abstract. We present a cost-based adaptive clustering method to improve average performance of spatial queries (intersection, containment, enclosure queries) over large collections...
Cristian-Augustin Saita, François Llirbat