Results 21 to 30 of about 24,187 (260)

Scalable Hash Tables

open access: yes, 2022
The term scalability with regards to this dissertation has two meanings: It means taking the best possible advantage of the provided resources (both computational and memory resources) and it also means scaling data structures in the literal sense, i.e., growing the capacity, by “rescaling” the table.
openaire   +4 more sources

Concurrent Hash Tables

open access: yesACM Transactions on Parallel Computing, 2016
Concurrent hash tables are one of the most important concurrent data structures, which are used in numerous applications. For some applications, it is common that hash table accesses dominate the execution time. To efficiently solve these problems in parallel, we need implementations that achieve speedups in highly concurrent scenarios.
Maier, T., Sanders, P., Dementiev, R.
openaire   +4 more sources

Image Encryption Based on Hash Table Scrambling and DNA Substitution

open access: yesIEEE 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   +1 more source

Hyperdimensional hashing

open access: yesProceedings of the 59th ACM/IEEE Design Automation Conference, 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 key remapping as the hash table resizes.
Mike Heddes   +4 more
openaire   +2 more sources

An Improved Algorithm of Philips Audio Fingerprint Retrieval [PDF]

open access: yesJisuanji gongcheng, 2018
In the Philips audio fingerprint retrieval algorithm,the construction of a query table as an index,which limits the application due to excessive memory consumption.For this reason,an improved algorithm is proposed based on Philips audio fingerprint ...
SUN Ning,ZHAO Weiping,HEN Mei,LI Chao
doaj  

Semi-supervised hash learning method with consistency-based dimensionality reduction

open access: yesAdvances in Mechanical Engineering, 2019
With the explosive growth of surveillance data, exact match queries become much more difficult for its high dimension and high volume. Owing to its good balance between the retrieval performance and the computational cost, hash learning technique is ...
Fang Lv   +3 more
doaj   +1 more source

On the Scalability of the GPUexplore Explicit-State Model Checker [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2017
The use of graphics processors (GPUs) is a promising approach to speed up model checking to such an extent that it becomes feasible to instantly verify software systems during development.
Nathan Cassee, Thomas Neele, Anton Wijs
doaj   +1 more source

Better GPU Hash Tables

open access: yesCoRR, 2021
We revisit the problem of building static hash tables on the GPU and design and build three bucketed hash tables that use different probing schemes. Our implementations are lock-free and offer efficient memory access patterns; thus, only the probing scheme is the factor affecting the performance of the hash table's different operations.
Muhammad A. Awad   +4 more
openaire   +2 more sources

Synonym‐based multi‐keyword ranked search with secure k‐NN in 6G network

open access: yesIET Networks, EarlyView., 2022
Abstract Sixth Generation (6G) integrates the next generation communication systems such as maritime, terrestrial, and aerial to offer robust network and massive device connectivity with ultra‐low latency requirement. The cutting edge technologies such as artificial intelligence, quantum machine learning, and millimetre enable hyper‐connectivity to ...
Deebak Bakkiam David, Fadi Al‐Turjman
wiley   +1 more source

SAHA: A String Adaptive Hash Table for Analytical Databases

open access: yesApplied 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   +1 more source

Home - About - Disclaimer - Privacy