Results 1 to 10 of about 1,752,502 (329)
Analysing the Performance of GPU Hash Tables for State Space Exploration [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In the past few years, General Purpose Graphics Processors (GPUs) have been used to significantly speed up numerous applications. One of the areas in which GPUs have recently led to a significant speed-up is model checking.
Nathan Cassee, Anton Wijs
doaj +15 more sources
An Efficient Wait-free Resizable Hash Table [PDF]
Proceedings of the 30th on Symposium on Parallelism in Algorithms
and Architectures (2018) 111-120, 2018 This paper presents an efficient wait-free resizable hash table. To achieve high throughput at large core counts, our algorithm is specifically designed to retain the natural parallelism of concurrent hashing, while providing wait-free resizing.
Panagiota Fatourou +2 more
semanticscholar +4 more sources
The Usefulness of Multilevel Hash Tables with Multiple Hash Functions in Large Databases [PDF]
Anale: Seria Informatică, 2009 In this work, attempt is made to select three good hash functions which uniformly distribute hash values that permute their internal states and allow the input bits to generate different output bits.
A.T. Akinwale, F.T. Ibharalu
doaj +4 more sources
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once [PDF]
arXiv, 2021 Despite being one of the oldest data structures in computer science, hash tables continue to be the focus of a great deal of both theoretical and empirical research.
M. A. Bender +4 more
semanticscholar +2 more sources
Hyperdimensional hashing: a robust and efficient dynamic hash table [PDF]
arXiv, 2022 Most cloud services and distributed applications rely on hashing algorithms that allow dynamic scaling of a robust and efficient hash table. Examples include AWS, Google Cloud and BitTorrent. Consistent and rendezvous hashing are algorithms that minimize
Mike Heddes +4 more
semanticscholar +2 more sources
Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time [PDF]
arXiv, 2006 In this paper, the author proposes a series of multilevel double hashing schemes called cascade hash tables. They use several levels of hash tables. In each table, we use the common double hashing scheme. Higher level hash tables work as fail-safes of lower level hash tables.
Shaohua Li
openalex +3 more sources
Comparison on Search Failure between Hash Tables and a Functional Bloom Filter [PDF]
Applied Sciences, 2020 Hash-based data structures have been widely used in many applications. An intrinsic problem of hashing is collision, in which two or more elements are hashed to the same value. If a hash table is heavily loaded, more collisions would occur. Elements that
Hayoung Byun, Hyesook Lim
doaj +2 more sources
Image Encryption Based on Hash Table Scrambling and DNA Substitution
IEEE Access, 2020 This paper proposes an image encryption algorithm based on hash table structure scrambling and DNA substitution. The algorithm uses the classical `scrambling-diffusion' process, and the pseudo-random sequence used in each process is generated by the ...
Xingyuan Wang, Lin Liu
doaj +2 more sources
MIHash: Online Hashing with Mutual Information [PDF]
arXiv, 2017 Learning-based hashing methods are widely used for nearest neighbor retrieval, and recently, online hashing methods have demonstrated good performance-complexity trade-offs by learning hash functions from streaming data. In this paper, we first address a
Bargal, Sarah Adel +3 more
core +2 more sources
SAHA: A String Adaptive Hash Table for Analytical Databases
Applied Sciences, 2020 Hash tables are the fundamental data structure for analytical database workloads, such as aggregation, joining, set filtering and records deduplication. The performance aspects of hash tables differ drastically with respect to what kind of data are being
Tianqi Zheng, Zhibin Zhang, Xueqi Cheng
doaj +2 more sources