A new method for more equitable comparison of various hash table techniques is presented. It is applied to some popular techniques: open addressing, coalescent chaining and separate chaining. Another method, indexed sub-tables, is also examined with more details and shown to present some interesting features. © 1979 BIT Foundations.SCOPUS: ar.jinfo:eu-repo/semantics/publishe
Given a sorting of the keys stored in a hash table one can guarantee a worst case time complexity fo...
The administrative process carried out continuously produces large data. So the search process takes...
Abstract—Many techniques for text processing are based on efficient data storing and retrieval techn...
Abstract Hash functions are among the oldest and most widely used data structures in computer scienc...
© 2017 ACM. With the rapid development of information storage and networking technologies, quintilli...
In this paper, we conducted empirical experiments to study the performance of hashing with a large s...
The aim of the work is to describe various methods allowing the change of an internal hash table siz...
Hash tables are among the most important data structures known to mankind. Throughhashing, the addre...
Most computer programs or applications need fast data structures. The performance of a data structur...
Hashing is a well-known and widely used technique for providing O(1) access to large files on second...
The administrative process carried out continuously produces large data. So the search process takes...
This study was conducted to compare two minimal perfect hashing method Chang's method and Jaeschke's...
High performance Internet routers require a mechanism for every efficient IP address look-ups. Some ...
Hashing algorithms long have been widely adopted to design a fast address look-up process which invo...
The administrative process carried out continuously produces large data. So the search process takes...
Given a sorting of the keys stored in a hash table one can guarantee a worst case time complexity fo...
The administrative process carried out continuously produces large data. So the search process takes...
Abstract—Many techniques for text processing are based on efficient data storing and retrieval techn...
Abstract Hash functions are among the oldest and most widely used data structures in computer scienc...
© 2017 ACM. With the rapid development of information storage and networking technologies, quintilli...
In this paper, we conducted empirical experiments to study the performance of hashing with a large s...
The aim of the work is to describe various methods allowing the change of an internal hash table siz...
Hash tables are among the most important data structures known to mankind. Throughhashing, the addre...
Most computer programs or applications need fast data structures. The performance of a data structur...
Hashing is a well-known and widely used technique for providing O(1) access to large files on second...
The administrative process carried out continuously produces large data. So the search process takes...
This study was conducted to compare two minimal perfect hashing method Chang's method and Jaeschke's...
High performance Internet routers require a mechanism for every efficient IP address look-ups. Some ...
Hashing algorithms long have been widely adopted to design a fast address look-up process which invo...
The administrative process carried out continuously produces large data. So the search process takes...
Given a sorting of the keys stored in a hash table one can guarantee a worst case time complexity fo...
The administrative process carried out continuously produces large data. So the search process takes...
Abstract—Many techniques for text processing are based on efficient data storing and retrieval techn...
DOI
Add to ORKG