Results 211 to 220 of about 24,134 (254)
Some of the next articles are maybe not open access.
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
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
On the design of special hash functions for multiple hash tables
2012 9th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE), 2012One disadvantage of bitstate hashing, the traditional probabilistic state space analysis method, is the possible large amount of wasted memory for achieving a high probability of no address collision in hashing. We look at tradeoff between hashing speed and memory assigned for hashing. This paper presents a method using multiple hash tables and special
openaire +1 more source
Communications of the ACM
Recent hash table development raises questions about an optimal solution.
openaire +1 more source
Recent hash table development raises questions about an optimal solution.
openaire +1 more source