منابع مشابه
Fast and Compact Hash Tables for Integer Keys
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious array hash table. Although fast with strings, there is currently no information in the research literature on its performance with integer keys. More importantly, we do not know how efficient an integer-based array ha...
متن کاملCuckoo++ Hash Tables: High-Performance Hash Tables for Networking Applications
Hash tables are an essential data-structure for numerous networking applications (e.g., connection tracking, rewalls, 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 bound and each memory access impacts perform...
متن کاملOptimal Decision Trees Generation from OR-Decision Tables
In this paper we present a novel dynamic programming algorithm to synthesize an optimal decision tree from OR-decision tables, an extension of standard decision tables, which allow to choose between several alternative actions in the same rule. Experiments are reported, showing the computational time improvements over state of the art implementations of connected components labeling, using this...
متن کاملDistributed Paged Hash Tables
In this paper we present the design and implementation of DPH, a storage layer for cluster environments. DPH is a Distributed Data Structure (DDS) based on the distribution of a paged hash table. It combines main memory with file system resources across the cluster in order to implement a distributed dictionary that can be used for the storage of very large data sets with key based addressing t...
متن کاملOptimal Dynamic Hash Tables
Hash-based data structures, which use randomization in order to represent efficiently a list of elements, are one of the most-used data structures in networking applications, where both time and fast memory are scarce resources. This paper investigates the realistic scenario in which elements are not only added to the data structure but also deleted. We show that when the memory is bounded, dyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2016
ISSN: 0167-8191
DOI: 10.1016/j.parco.2015.12.003