Sciweavers

194 search results - page 11 / 39
» Peer-to-Peer Similarity Search Based on M-Tree Indexing
Sort
View
CIKM
2010
Springer
14 years 8 months ago
Improved index compression techniques for versioned document collections
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
Jinru He, Junyuan Zeng, Torsten Suel
WEBI
2009
Springer
15 years 4 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
SSDBM
2002
IEEE
100views Database» more  SSDBM 2002»
15 years 2 months ago
Similarity Searching for Multi-Attribute Sequences
We investigate the problem of searching similar multiattribute time sequences. Such sequences arise naturally in a number of medical, financial, video, weather forecast, and stoc...
Tamer Kahveci, Ambuj K. Singh, Aliekber Gürel
EDBT
2009
ACM
184views Database» more  EDBT 2009»
15 years 4 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
DASFAA
2005
IEEE
136views Database» more  DASFAA 2005»
15 years 3 months ago
Indexing DNA Sequences Using q-Grams
We have observed in recent years a growing interest in similarity search on large collections of biological sequences. Contributing to the interest, this paper presents a method fo...
Xia Cao, Shuai Cheng Li, Anthony K. H. Tung