Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- posterJune 2023
EHS: An Efficient Hashing Scheme for Persistent Memory
SAC '23: Proceedings of the 38th ACM/SIGAPP Symposium on Applied ComputingPages 301–304https://doi.org/10.1145/3555776.3577850This paper presents an efficient hashing scheme called EHS to improve the performance and space efficiency on PM. In our scheme, we delay expensive rehashing operations by using the free space in buckets maximally. To do this, 1) we search and utilize ...
- ArticleJune 2008
A Dynamic Hashing Approach to Supporting Load Balance in P2P Systems
ICDCSW '08: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems WorkshopsPages 429–434https://doi.org/10.1109/ICDCS.Workshops.2008.109In a structured P2P system, peers maintain information about what resources neighbor peers offer. Chord is one of well-known structured P2P systems to efficiently support resource finding based on the hashing approach. However, in Chord, most of data ...
- research-articleJune 2008
A dictionary implementation based on dynamic perfect hashing
ACM Journal of Experimental Algorithmics (JEA), Volume 12Article No.: 1.11, Pages 1–25https://doi.org/10.1145/1227161.1370602We describe experimental results on an implementation of a dynamic dictionary. The basis of our implementation is “dynamic perfect hashing” as described by Dietzfelbinger et al. (SIAM J. Computing 23, 1994, pp. 738--761), an extension of the storage ...
- articleSeptember 2001
Load-balanced location management for cellular mobile systems using quorums and dynamic hashing
This paper presents a new distributed location management strategy for cellular mobile systems. Its salient features are fast location update and query, load balancing among location servers, and scalability. The strategy employs dynamic hashing ...
- articleMay 1991
A dynamic hash method with signature
ACM Transactions on Database Systems (TODS), Volume 16, Issue 2Pages 309–337https://doi.org/10.1145/114325.103714We present a dynamic external hash method that allows retrieval of a record by only one access to mass storage while maintaining a high load factor. The hash function is based on generalized spiral storage. Both primary and overflow records are allocated ...
- articleJuly 1988
Dynamic hashing schemes
A new type of dynamic file access called dynamic hashing has recently emerged. It promises the flexibility of handling dynamic files while preserving the fast access times expected from hashing. Such a fast, dynamic file access scheme is needed to ...
- research-articleDecember 1981
Tightly controlled linear hashing without separate overflow storage
AbstractA hashing method is presented where the amount of storage required for a file can expand and shrink by very large factors. The performance of this method as measured by lookup time, insertion time and deletion time is very good even when the total ...
- articleMarch 1981
New file organization based on dynamic hashing
ACM Transactions on Database Systems (TODS), Volume 6, Issue 1Pages 194–211https://doi.org/10.1145/319540.319564New file organizations based on hashing and suitable for data whose volume may vary rapidly recently appeared in the literature. In the three schemes which have been independently proposed, rehashing is avoided, storage space is dynamically adjusted to ...