Results 101 to 110 of about 3,382,176 (126)

Perfect Hashing for Method Dispatch with Dynamic Typing and Dynamic Compilation

open access: yes, 2012
In static typing, the receiver's static type is the key to efficient implementation of method invocation, and a recently proposed technique, based on perfect hashing of classes, cannot apply to dynamic typing because of the lack of static types. In this article, we propose a new application of perfect hashing to method dispatch in a dynamic typing ...
Ducournau, Roland
core   +6 more sources
Some of the next articles are maybe not open access.

Related searches:

Dynamic Perfect Hashing: Upper and Lower Bounds

SIAM Journal on Computing, 1988
The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a randomized algorithm for the dynamic dictionary problem that takes $O(1)$ worst-case time for lookups and $O(1)$ amortized expected time for insertions and ...
Martin Dietzfelbinger   +5 more
openaire   +6 more sources

Extendible RDMA-Based Remote Memory KV Store with Dynamic Perfect Hashing Index

2025 IEEE 41st International Conference on Data Engineering (ICDE)
Zirui Liu 0002   +10 more
openaire   +4 more sources

Perfect Hashing as an Almost Perfect Subtype Test [PDF]

open access: yesACM Transactions on Programming Languages and Systems, 2008
International audienceSubtype tests are an important issue in the implementation of object-oriented programming languages. Many techniques have been proposed, but none of them perfectly fulfills the five requirements that we have identified: constant ...
Roland Ducournau
exaly   +2 more sources

Dynamic Perfect Hashing with Finite-State Automata

2006
Minimal perfect hashing provides a mapping between a set of n unique words and n consecutive numbers. When implemented with minimal finite-state automata, the mapping is determined only by the (usually alphabetical) order of words in the set. Addition of new words would change the order of words already in the language of the automaton, changing the ...
Jan Daciuk, Denis Maurel, Agata Savary
openaire   +2 more sources

Filter Based Data Deduplication in Cloud Storage Using Dynamic Perfect Hash Functions

International journal of simulation: systems, science & technology, 2018
B. Reddy, M. Rao
openaire   +1 more source

PDPH: A Performant Dynamic Perfect Hash Index with Rehashing Optimizations

2025 IEEE/ACM 33rd International Symposium on Quality of Service (IWQoS)
Jiarui Wang   +5 more
openaire   +2 more sources

Dynamic Perfect Hashing: Upper and Lower Bounds

SIAM Journal on Computing, 1994
Martin Dietzfelbinger   +2 more
exaly  

Perfect Spatial Hashing

ACM Transactions on Graphics, 2006
Sylvain Lefebvre, Hugues Hoppe
exaly  

Home - About - Disclaimer - Privacy