146 search results - page 4 / 30 » Medoid Queries in Large Spatial Databases |
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
SSD
1993
Springer
14 years 1 months ago
1993
Springer
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
VLDB
1997
ACM
14 years 1 months ago
1997
ACM
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
APWEB
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Spatial data has now been used extensively in the Web environment, providing online customized maps and supporting map-based applications. The full potential of Web-based...