Sciweavers

3420 search results - page 265 / 684
» Proximity Search in Databases
Sort
View
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
15 years 11 months ago
The Quality vs. Time Trade-off for Approximate Image Descriptor Search
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
Rut Siguroardottir, Björn Þór J&...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 7 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 5 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
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, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
ICDE
2010
IEEE
217views Database» more  ICDE 2010»
16 years 10 days ago
Toward industrial-strength keyword search systems over relational data
– Keyword search (KWS) over relational data, where the answers are multiple tuples connected via joins, has received significant attention in the past decade. Numerous solutions ...
Akanksha Baid, Ian Rae, AnHai Doan, Jeffrey F. Nau...
EDBT
2009
ACM
120views Database» more  EDBT 2009»
16 years 7 days ago
Retrieving meaningful relaxed tightest fragments for XML keyword search
Adapting keyword search to XML data has been attractive recently, generalized as XML keyword search (XKS). One of its key tasks is to return the meaningful fragments as the result...
Lingbo Kong, Rémi Gilleron, Aurélien...