Results 311 to 320 of about 1,648,250 (343)
Some of the next articles are maybe not open access.
Revisiting hash table design for phase change memory
INFLOW '15, 2015Phase Change Memory (PCM) is emerging as an attractive alternative to Dynamic Random Access Memory (DRAM) in building data-intensive computing systems. PCM offers read/write performance asymmetry that makes it necessary to revisit the design of in-memory
Biplob K. Debnath +4 more
semanticscholar +1 more source
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 ...
Glenn N. Thomas, Donald L. Adolphson
openaire +2 more sources
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 ...
Glenn N. Thomas, Donald L. Adolphson
openaire +2 more sources
Journal of Intelligent & Fuzzy Systems, 2014
In this paper, a fault tolerance based QoS (Quality of Services) scheduling using HTF (Hash Table Functionality) in Social Grid Computing (SGC) is introduced, where HTF is used as the underlying mechanism in SGC to logically manage the locations of the ...
N. Rathore, Inderveer Chana
semanticscholar +1 more source
In this paper, a fault tolerance based QoS (Quality of Services) scheduling using HTF (Hash Table Functionality) in Social Grid Computing (SGC) is introduced, where HTF is used as the underlying mechanism in SGC to logically manage the locations of the ...
N. Rathore, Inderveer Chana
semanticscholar +1 more source
A hash table construction algorithm for spatial hashing based on linear memory
Advances in Computer Entertainment, 2014Spatial hashing is an efficient technique to speed up proximity queries on moving objects in the space domain, suitable for computer entertainment applications and simulations.
C. Pozzer +2 more
semanticscholar +1 more source
An empirical study on the performance of hash table
International Conference on Interaction Sciences, 2014Hash table is a valuable data structure that is expected to provide constant amortized access time. Although there are a lot of researches on hashing, it seems there is no enough practical study on its stability with large data set.
Dapeng Liu +3 more
semanticscholar +1 more source
Enhancing Security of Medical Images Using Deep Learning, Chaotic Map, and Hash Table
Journal on spesial topics in mobile networks and applications, 2023Piyush Kumar +3 more
semanticscholar +1 more source
GHT: a geographic hash table for data-centric storage
ACM International Conference on Wireless Sensor Networks and Applications, 2002Making effective use of the vast amounts of data gathered by large-scale sensor networks will require scalable, self-organizing, and energy-efficient data dissemination algorithms. Previous work has identified data-centric routing as one such method.
Sylvia Ratnasamy +6 more
semanticscholar +1 more source
A flexible hash table design for 10GBPS key-value stores on FPGAS
International Conference on Field-Programmable Logic and Applications, 2013Common web infrastructure relies on distributed main memory key-value stores to reduce access load on databases, thereby improving both performance and scalability of web sites.
Z. István +3 more
semanticscholar +1 more source
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 ...
J. Ian Munro, Gaston H. Gonnet
openaire +1 more source
Resource Search Method of Mobile Intelligent Education System Based on Distributed Hash Table
Journal on spesial topics in mobile networks and applications, 2022Yu Shen, T. Gadekallu
semanticscholar +1 more source