Sciweavers

54 search results - page 6 / 11
» The SR-tree: An Index Structure for High-Dimensional Nearest...
Sort
View
BTW
2007
Springer
183views Database» more  BTW 2007»
13 years 11 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
GEOINFORMATICA
2006
133views more  GEOINFORMATICA 2006»
13 years 7 months ago
Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks
With the rapid advancements in positioning technologies such as the Global Positioning System (GPS) and wireless communications, the tracking of continuously moving objects has bec...
Dan Lin, Rui Zhang 0003, Aoying Zhou
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
14 years 2 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
SAC
2005
ACM
14 years 1 months ago
A pivot-based index structure for combination of feature vectors
We present a novel indexing schema that provides eļ¬ƒcient nearest-neighbor queries in multimedia databases consisting of objects described by multiple feature vectors. The beneļ¬...
Benjamin Bustos, Daniel A. Keim, Tobias Schreck
SSD
1995
Springer
97views Database» more  SSD 1995»
13 years 11 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet