Results 1 to 10 of about 1,365,594 (253)
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once [PDF]
Journal of the ACM, 2023 Despite being one of the oldest data structures in computer science, hash tables continue to be the focus of a great deal of both theoretical and empirical research. A central reason for this is that many of the fundamental properties that one desires from a hash table are difficult to achieve simultaneously; thus many variants offering different trade-
Michael A. Bender +4 more
openaire +5 more sources
Hyperdimensional hashing [PDF]
Proceedings 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.
Heddes, Mike +4 more
openaire +3 more sources
FASTHash: FPGA-Based High Throughput Parallel Hash Table [PDF]
High Performance Computing35th International Conference, 2020 Hash table is a fundamental data structure that provides efficient data store and access. It is a key component in AI applications which rely on building a model of the environment using observations and performing lookups on the model for newer ...
Yang Y +4 more
europepmc +2 more sources
ACM 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
Authenticated hash tables [PDF]
Proceedings of the 15th ACM conference on Computer and communications security, 2008 Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so that the client can save space or achieve load balancing. Authenticating the hash table functionality, i.e., verifying the correctness of queries answered by the server and ...
Charalampos Papamanthou +2 more
openaire +1 more source
Distributed Paged Hash Tables [PDF]
, 2003 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 ...
Rufino, José +3 more
openaire +2 more sources
Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems, 2018 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
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)
Amble, O., Knuth, D. E.
openaire +2 more sources
, 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 +3 more sources
POSITION-BASED DISTRIBUTED HASH TABLES
, 2006 In this thesis we want to create scalable, fault-tolerant and self-configuring dictionaries that can be deployed in a wide range of networks, including highly dynamic networks with frequent membership changes, like peer-to-peer overlay networks or wireless ad hoc networks.
openaire +2 more sources