Results 261 to 270 of about 23,863 (307)
Some of the next articles are maybe not open access.
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
2012
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such as name, are generally removed, these databases can sometimes be joined with other public databases on attributes such as Zip code, Gender, and Age to re-identify individuals ...
Xiaoxun Sun, Min Li
openaire +1 more source
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such as name, are generally removed, these databases can sometimes be joined with other public databases on attributes such as Zip code, Gender, and Age to re-identify individuals ...
Xiaoxun Sun, Min Li
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
Secure Hash Algorithms and the Corresponding FPGA Optimization Techniques
ACM Computing Surveys, 2021Samee U Khan
exaly
Cuckoo Hashing with Three Hash Tables
Journal of the Institute of Electronics and Information Engineers, 2020Saeyoung Jang, Hayoung Byun, Hyesook Lim
openaire +1 more source