Hash-based Search
Hash-Based Search is a searching algorithm that uses a hash function to map keys to indices in a data structure, enabling efficient retrieval by directly computing the storage location of an element based on its unique key.
269
Publications
22.5K
Citations
747
Authors
294
Institutions
Publications per year
2017–2026
73
Parents
269
Similarity Search in High Dimensions via Hashing
Aristides Gionis, Piotr Indyk, Rajeev Motwani · 1999 · 3.1K citations
Jingdong Wang, Ting Zhang, Jingkuan Song et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2017 · 996 citations · Full text
SSAHA: A Fast Search Method for Large DNA Databases
Zemin Ning, Anthony J. Cox, James C. Mullikin · Genome Research · 2001 · 971 citations · Full text
1–5 of 269
747
9
h-index
6
h-index
6
h-index
5
h-index
5
h-index
1–5 of 747
294

Chinese Academy of Sciences
Beijing, China
10 h-index
22 publications
767 citations
Microsoft Research Asia (China)
Beijing, China
10 h-index
23 publications
2K citations

Cornell University
Ithaca, United States
10 h-index
13 publications
1K citations

Zhejiang University
Hangzhou, China
7 h-index
22 publications
696 citations
Tsinghua University
Beijing, China
7 h-index
29 publications
1K citations
Columbia University
New York, United States
7 h-index
14 publications
827 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
7 h-index
7 publications
620 citations
University of Science and Technology of China
Hefei, China
6 h-index
6 publications
1.2K citations
1–8 of 294
Repository · 10 publications · 614 citations
10
h-index
8 publications · 2K citations
8
h-index
6 publications · 339 citations
6
h-index
5 publications · 82 citations
5
h-index
5 publications · 96 citations
5
h-index
1–5