Weak Hashing
Weak Hashing is a content-addressable storage technique that employs a hash function with reduced collision resistance and sensitivity to detect approximate similarities among data objects, distinguishing it from strong hashing methods by prioritizing efficiency and locality preservation over cryptographic security and exact matching.
23
Publications
629
Citations
60
Authors
28
Institutions
Publications per year
2017–2026
6
Parents
23
1–5 of 23
60
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 60
28

University of Duisburg-Essen
Essen, Germany
2 h-index
2 publications
41 citations
University of Catania
Catania, Italy
1 h-index
2 publications
22 citations
Chongqing University of Posts and Telecommunications
Chongqing, China
1 h-index
2 publications
70 citations
COMSATS University Islamabad
Islamabad, Pakistan
1 h-index
1 publications
10 citations

University of Messina
Messina, Italy
1 h-index
1 publications
11 citations
iMinds
Ghent, Belgium
1 h-index
3 publications
75 citations

Technische Universität Darmstadt
Darmstadt, Germany
1 h-index
1 publications
14 citations
National Institute of Standards and Technology
Gaithersburg, United States
1 h-index
3 publications
30 citations
1–8 of 28
5 publications · 95 citations
5
h-index
1 publications · 35 citations
1
h-index
1 publications · 21 citations
1
h-index
JEA · 1 publications · 11 citations
1
h-index
Repository · 1 publications · 12 citations
1
h-index
1–5