Results 131 to 140 of about 447,111 (170)
Some of the next articles are maybe not open access.

EEPH: An Efficient Extendible Perfect Hashing for Hybrid PMem-DRAM

IEEE International Conference on Data Engineering, 2023
In recent years, the performance of hash indexes has been significantly improved by exploiting emerging persistent memory (PMem). However, the performance improvement of hash indexes mainly comes from exploiting the hardware features of PMem.
Qi Chen   +7 more
semanticscholar   +1 more source

MapEmbed: Perfect Hashing with High Load Factor and Fast Update

Knowledge Discovery and Data Mining, 2021
Perfect hashing is a hash function that maps a set of distinct keys to a set of continuous integers without collision. However,most existing perfect hash schemes are static, which means that they cannot support incremental updates, while most datasets in
Yuhan Wu   +8 more
semanticscholar   +1 more source

Perfect hashing functions for hardware applications

[1991] Proceedings. Seventh International Conference on Data Engineering, 1991
Perfect hashing functions are determined that are suitable for hardware implementations. A trial-and-error method of finding perfect hashing functions is proposed using a simple universal/sub 2/ class (H/sub 3/) of hashing functions.
M. Ramakrishna, G. A. Portice
semanticscholar   +1 more source

Perfect class hashing and numbering for object‐oriented implementation

Software, Practice & Experience, 2011
Late binding and subtyping create run‐time overhead for object‐oriented languages, especially in the context of both multiple inheritance and dynamic loading, for instance for JAVA interfaces.
R. Ducournau, Floréal Morandat
semanticscholar   +1 more source

Hashing for dynamic and static internal tables

Computer, 1988
The authors survey the classical hashing-function approach to information retrieval and show how general hashing techniques exchange speed for memory space and flexibility in data manipulation operations such as insert, delete, and overflow.
T. Lewis, C. Cook
semanticscholar   +1 more source

An adaptive constant time hashing scheme for dynamic key set

2004 IEEE Region 10 Conference TENCON 2004., 2004
Hashing is an important tool in randomized algorithms, with applications in such diverse fields including information retrieval, data mining, cryptology and parallel algorithms.
S. Neogy, S. Choudhury, N. Chaki
semanticscholar   +1 more source

SDLB: A Scalable and Dynamic Software Load Balancer for Fog and Mobile Edge Computing

MECOMM@SIGCOMM, 2017
Mobile Edge Computing (MEC) provides computing/storage offloading and resource virtualization to mobile devices at the network edge. A load balancer is a necessary network function to determine the destination MEC host of each packet from a mobile device,
Ye Yu, Xin Li, Chen Qian
semanticscholar   +1 more source

A Fast, Small, and Dynamic Forwarding Information Base

Measurement and Modeling of Computer Systems, 2017
Concise is a Forwarding information base (FIB) design that uses very little memory to support fast query of a large number of dynamic network names or flow IDs.
Ye Yu   +3 more
semanticscholar   +1 more source

Energy scalable universal hashing

IEEE transactions on computers, 2005
Message authentication codes (MACs) are valuable tools for ensuring the integrity of messages. MACs may be built around a universal hash function (NH) which was explored in the construction of UMAC. In this paper, we use a variation on NH called WH.
J. Kaps, Kaan Yüksel, B. Sunar
semanticscholar   +1 more source

Minimal perfect hash functions for reserved word lists

SIGP, 1985
Searching a list of items for a particular item is a ubiquitous task for most computers, whether they are computing the payroll of a small business or compiling student programs in a university.
Robert W. Sebasta, M. A. Taylor
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy