Results 241 to 250 of about 168,960 (287)
Some of the next articles are maybe not open access.
Shifting Hash Table: An Efficient Hash Table with Delicate Summary
2019 IEEE Globecom Workshops (GC Wkshps), 2019Hash tables have been broadly used in many security applications. These applications require fast query speed and high memory efficiency. However, the query speed degrades when hash collisions happen. The design goal of this paper is to achieve high load factor as well as fast query at the same time.
Jie Jiang 0008 +7 more
openaire +1 more source
Hash in a flash: Hash tables for flash devices
2013 IEEE International Conference on Big Data, 2013Conservative estimates place the amount of data expected to be created by mankind this year to exceed several thousand exabytes. Given the enormous data deluge, and in spite of recent advances in main memory capacities, there is a clear and present need to move beyond algorithms that assume in-core (main-memory) computation.
Tyler Clemons +4 more
openaire +1 more source
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 ...
openaire +1 more source
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 ...
openaire +1 more source
Journal of Algorithms, 1985
Summary: We consider the operation of permuting in place the records of an open address hash table in order to correspond to a different hashing function. Our emphasis is primarily on minimizing the amount of work space used. Lower and upper bounds are derived on the unrestricted problem, that is, without making any assumptions about the probing ...
openaire +2 more sources
Summary: We consider the operation of permuting in place the records of an open address hash table in order to correspond to a different hashing function. Our emphasis is primarily on minimizing the amount of work space used. Lower and upper bounds are derived on the unrestricted problem, that is, without making any assumptions about the probing ...
openaire +2 more sources
Efficient Ordering of Hash Tables
SIAM Journal on Computing, 1979We discuss the problem of hashing in a full or nearly full table using open addressing. A scheme for reordering the table as new elements are added is presented. Under the assumption of having a reasonable hash function sequence, it is shown that, even with a full table, only about 2.13 probes will be required, on the average, to access an element ...
Gaston H. Gonnet, J. Ian Munro
openaire +2 more sources
Proceedings of the 1977 annual conference on - ACM '77, 1977
This paper investigates a relatively new file structure known as an ordered hash table which combines the flexibility of indexed sequential files with the rapid access of traditional hashing methods. The main results of the paper are: (1) a characterization of optimal hash tables allowing for differing access frequencies among the keys, and (2) an ...
Donald L. Adolphson, Glenn N. Thomas
openaire +1 more source
This paper investigates a relatively new file structure known as an ordered hash table which combines the flexibility of indexed sequential files with the rapid access of traditional hashing methods. The main results of the paper are: (1) a characterization of optimal hash tables allowing for differing access frequencies among the keys, and (2) an ...
Donald L. Adolphson, Glenn N. Thomas
openaire +1 more source
2007 IEEE Wireless Communications and Networking Conference, 2007
This paper presents an architecture called social distributed hash table (SDHT) that combines strengths of distributed hash table (DHT) algorithms and social networks making mobile search fast and context oriented. The paper presents possible implementations of the proposed architecture in the IP multimedia subsystem (IMS) and as a standalone SIP based
Marcin Matuszewski +1 more
openaire +1 more source
This paper presents an architecture called social distributed hash table (SDHT) that combines strengths of distributed hash table (DHT) algorithms and social networks making mobile search fast and context oriented. The paper presents possible implementations of the proposed architecture in the IP multimedia subsystem (IMS) and as a standalone SIP based
Marcin Matuszewski +1 more
openaire +1 more source
Proceedings of the workshop on Memory Systems Performance and Correctness, 2014
From a trace of data accesses, it is possible to calculate an affinity hierarchy that groups related data together. Combining this hierarchy with the extremely common hash table, there is an opportunity to both improve cache performance and enable novel applications.
Brian Gernhardt +2 more
openaire +1 more source
From a trace of data accesses, it is possible to calculate an affinity hierarchy that groups related data together. Combining this hierarchy with the extremely common hash table, there is an opportunity to both improve cache performance and enable novel applications.
Brian Gernhardt +2 more
openaire +1 more source
Concurrent Hash Tables for Haskell
2016This paper presents seven hash table Haskell implementations, ranging from low-level synchronization mechanisms to high-level ones such as transactional memories. The result of the comparison between the algorithms showed that the implementation using the STM Haskell transactional memory library and fine-grain synchronization presented the best ...
Rodrigo Medeiros Duarte +4 more
openaire +1 more source
The reallocation of hash-coded tables
Communications of the ACM, 1973When the space allocation for a hash-coded table is altered, the table entries must be rescattered over the new space. A technique for accomplishing this rescattering is presented. The technique is independent of both the length of the table and the hashing function used, and can be utilized in conjunction with a linear reallocation of the table being ...
openaire +1 more source