Sciweavers

57 search results - page 3 / 12
» Prefix Tree Indexing for Similarity Search and Similarity Jo...
Sort
View
VLDB
1999
ACM
118views Database» more  VLDB 1999»
13 years 9 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
IPPS
2007
IEEE
13 years 11 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
13 years 11 months ago
Compact Similarity Joins
— Similarity joins have attracted significant interest, with applications in Geographical Information Systems, astronomy, marketing analyzes, and anomaly detection. However, all...
Brent Bryan, Frederick Eberhardt, Christos Falouts...
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
13 years 8 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
14 years 6 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain