Results 31 to 40 of about 169,343 (316)
Trigonometric words ranking model for spam message classification
Abstract The significant increase in the volume of fake (spam) messages has led to an urgent need to develop and implement a robust anti‐spam method. Several of the current anti‐spam systems depend mainly on the word order of the message in determining the spam message, which results in the system's inability to predict the correct type of message when
Suha Mohammed Hadi +7 more
wiley +1 more source
SAHA: A String Adaptive Hash Table for Analytical Databases
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
Hash tables are an essential data-structure for numerous networking applications (e.g., connection tracking, firewalls, network address translators). Among these, cuckoo hash tables provide excellent performance by allowing lookups to be processed with very few memory accesses (2 to 3 per lookup). Yet, for large tables, cuckoo hash tables remain memory
openaire +2 more sources
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)
Amble, O., Knuth, D. E.
openaire +2 more sources
Novel distributed Hash table——BChord
A novel distributed Hash table(DHT) BChord was presented. BChord adopts bi-directional search mechanism of Chord. Though query items of finger table in BChord almost double to Chord, compared with Chord, BChord evi- dently increases speed at searching of
ZHENG Yan1 +3 more
doaj +2 more sources
Research of a Scheduling Optimization algorithm based on Hash Adapter
The performance of hash-based Scheduling optimization algorithm for network flow cannot be bounded under the worst-case because of hash conflicts. To make up for the shortage of the above algorithm, a multiple-hash algorithm based on counting Hash ...
Yang Wenchuan, Fu Zhen, Zuo Wen
doaj +1 more source
ESH: Design and Implementation of an Optimal Hashing Scheme for Persistent Memory
Recent advancements in memory technology have opened up a wealth of possibilities for innovation in data structures. The emergence of byte-addressable persistent memory (PM) with its impressive capacity and low latency has accelerated the adoption of PM ...
Dereje Regassa +2 more
doaj +1 more source
On the Insertion Time of Cuckoo Hashing
Cuckoo hashing is an efficient technique for creating large hash tables with high space utilization and guaranteed constant access times. There, each item can be placed in a location given by any one out of k different hash functions.
Fountoulakis, Nikolaos +2 more
core +1 more source
Accelerating Hash-Based Query Processing Operations on FPGAs by a Hash Table Caching Technique [PDF]
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 +1 more source
The Usefulness of Multilevel Hash Tables with Multiple Hash Functions in Large Databases [PDF]
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 +1 more source

