Results 1 to 10 of about 1,500,333 (340)
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
Communications of the ACM, 1988 Linear hashing and spiral storage are two dynamic hashing schemes originally designed for external files. This paper shows how to adapt these two methods for hash tables stored in main memory. The necessary data structures and algorithms are described, the expected performance is analyzed mathematically, and actual execution times are obtained and ...
Per-Åke Larson
openalex +3 more sources
Authentication in stealth distributed hash tables [PDF]
Journal of Systems Architecture, 2008 Most existing DHT algorithms assume that all nodes have equal capabilities. This assumption has previously been shown to be untrue in real deployments, where the heterogeneity of nodes can actually have a detrimental effect upon performance. In this paper, we acknowledge that nodes on the same overlay may also differ in terms of their trustworthiness ...
Andrew MacQuire +4 more
openalex +6 more sources
Efficient hash tables for network applications [PDF]
SpringerPlus, 2015 Hashing has yet to be widely accepted as a component of hard real-time systems and hardware implementations, due to still existing prejudices concerning the unpredictability of space and time requirements resulting from collisions. While in theory perfect hashing can provide optimal mapping, in practice, finding a perfect hash function is too expensive,
Thomas Zink, Marcel Waldvogel
openalex +6 more sources
International Journal of Engineering and Advanced Technology, 2019 Randomized computations must work. Following a long time of awful examination into transformative programming, we check the generation of XML, which exemplifies the fitting gauges of frameworks organization. We use perfect epistemologies to disconfirm that red-dull trees [2] and neighborhood can scheme to comprehend this desire [4].
S. Pothumani, R. K. Kavitha, R Velvizhi
openalex +2 more sources
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
DHT- and blockchain-based smart identification for video conferencing
Blockchain: Research and Applications, 2022 Video conferencing applications help people communicate via the Internet and provide a significant and consistent basis for virtual meetings. However, integrity, security, identification, and authentication problems are still universal.
Morteza Alizadeh +2 more
doaj +1 more source
The Computer Journal, 1974 Abstract : Some variants of the traditional hash method, making use of the numerical or alphabetical order of the keys, lead to faster searching at the expense of a little extra work when items are inserted. The paper presents the new algorithms and analyzes their average running time. (Author)
Ole Amble, Donald E. Knuth
openaire +2 more sources
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 +1 more source
Hash Tables for a Digital Lexicon [PDF]
Revista de Informática Teórica e Aplicada, 2021 This paper deals with the construction of digital lexicons within the scope of Natural Language Processing. Data Structures called Hash Tables have demonstrated to generate good results for Natural Language Interface for Databases and have data dispersion, response speed and programming simplicity as main features.
Fábio Carlos Moreno +2 more
openaire +2 more sources