Results 11 to 20 of about 1,756,456 (179)
The Usefulness of Multilevel Hash Tables with Multiple Hash Functions in Large Databases [PDF]
Ann. Univ. Tibiscus Comp. Sci. Series VII(2009),11-20, 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.
Akinwale, A. T., Ibharalu, F. T.
core +2 more sources
More Analysis of Double Hashing for Balanced Allocations [PDF]
arXiv, 2015 With double hashing, for a key $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +i g(x)) \bmod n$ for $i=0,1,2,...$ to generate multiple hash values in the range $[0,n-1]$ from the initial two.
Mitzenmacher, Michael
core +2 more sources
A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits [PDF]
arXiv, 2022 This paper considers the basic question of how strong of a probabilistic guarantee can a hash table, storing $n$ $(1 + \Theta(1)) \log n$-bit key/value pairs, offer? Past work on this question has been bottlenecked by limitations of the known families of
Kuszmaul, William
core +1 more source
Accelerating Hash-Based Query Processing Operations on FPGAs by a Hash Table Caching Technique [PDF]
Latin American Conference on High Performance Computing, 2017 Extracting valuable information from the rapidly growing field of Big Data faces serious performance constraints, especially in the software-based database management systems (DBMS).
Arcas-Abella, Oriol +4 more
core +2 more sources
Host Identity Protocol Distributed Hash Table Interface [PDF]
Request for Comments, 2012 This document specifies a common interface for using the Host Identity Protocol (HIP) with a Distributed Hash Table (DHT) service to provide a name-to-Host-Identity-Tag lookup service and a Host- Identity-Tag- to-address lookup service.
Jeff Ahrenholz
openalex +2 more sources
A Distributed Hash Table for Shared Memory [PDF]
Parallel Processing and Applied Mathematics, 2015 Distributed algorithms for graph searching require a high-performance CPU-efficient hash table that supports find-or-put. This operation either inserts data or indicates that it has already been added before.
Dijk, Tom van +2 more
core +4 more sources
Instant neural graphics primitives with a multiresolution hash encoding [PDF]
ACM Transactions on Graphics, 2022 Neural graphics primitives, parameterized by fully connected neural networks, can be costly to train and evaluate. We reduce this cost with a versatile new input encoding that permits the use of a smaller network without sacrificing quality, thus ...
T. Müller +3 more
semanticscholar +1 more source
A new hash function and its use in read mapping on genome [PDF]
AUT Journal of Mathematics and Computing, 2020 Mapping reads onto genomes is an indispensable step in sequencing data analysis. A widely used method to speed up mapping is to index a genome by a hash table, in which genomic positions of $k$-mers are stored in the table.
Farzaneh Salari +2 more
doaj +1 more source
Mathematics, 2023 Chaotic systems, especially hyper-chaotic systems are suitable for digital image encryption because of their complex properties such as pseudo randomness and extreme sensitivity. This paper proposes a new color image encryption algorithm based on a hyper-
Xiaoyuan Wang +5 more
semanticscholar +1 more source
A High Throughput Parallel Hash Table on FPGA using XOR-based Memory [PDF]
IEEE Conference on High Performance Extreme Computing, 2020 Hash table is a fundamental data structure for quick search and retrieval of data. It is a key component in complex graph analytics and AI/ML applications. State-of-the-art parallel hash table implementations either make some simplifying assumptions such
Ruizhi Zhang +4 more
semanticscholar +1 more source