Results 1 to 10 of about 434,920 (171)
Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
BRICS Report Series, 1997 We consider dictionaries of size n over the finite universe U ={0, 1}^w and introduce a new technique for their implementation: error correcting codes. The use of such codes makes it possible to replace the use of strong forms of hashing, such as universal hashing, with much weaker forms, such as clustering.<br />We use our approach to construct,
Peter Bro Miltersen
semanticscholar +7 more sources
Memory-efficient and Ultra-fast Network Lookup and Forwarding using Othello Hashing [PDF]
arXiv, 2016 Network algorithms always prefer low memory cost and fast packet processing speed. Forwarding information base (FIB), as a typical network processing component, requires a scalable and memory-efficient algorithm to support fast lookups. In this paper, we present a new network algorithm, Othello Hashing, and its application of a FIB design called ...
Ye Yu +3 more
arxiv +2 more sources
Distributing hash families with few rows [PDF]
Theoret. Comput. Sci. 800 (2019), 31-41, 2021 Column replacement techniques for creating covering arrays rely on the construction of perfect and distributing hash families with few rows, having as many columns as possible for a specified number of symbols. To construct distributing hash families in which the number of rows is less than the strength, we examine a method due to Blackburn and extend ...
arxiv +1 more source
Simple, compact and robust approximate string dictionary [PDF]
, 2014 This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary $D$ of $d$ strings of total length $n$ over an alphabet of size $\sigma$.
Belazzougui, Djamal, Chegrane, Ibrahim
core +1 more source
Measurement and Modeling of Computer Systems, 2020 Key-value lookup engines running in fast memory are crucial components of many networked and distributed systems such as packet forwarding, virtual network functions, content distribution networks, distributed storage, and cloud/edge computing.
Shouqian Shi, Chen Qian
semanticscholar +1 more source
ACM SIGPLAN Symposium on Scala, 2018 Sparse matrix-matrix multiplication is a critical kernel for several scientific computing applications, especially the setup phase of algebraic multigrid.
James J. Elliott, C. Siefert
semanticscholar +1 more source
Performance analysis of a hardware accelerator of dependence management for taskbased dataflow programming models [PDF]
, 2016 Along with the popularity of multicore and manycore, task-based dataflow programming models obtain great attention for being able to extract high parallelism from applications without exposing the complexity to programmers.
Ayguadé Parra, Eduard +5 more
core +1 more source
Perfect hashing as an almost perfect subtype test
TOPL, 2008 Subtype 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-time, linear-space ...
R. Ducournau
semanticscholar +1 more source
File organization using composite perfect hashing
ACM Transactions on Database Systems, 1989 Perfect hashing refers to hashing with no overflows. We propose and analyze a composite perfect hashing scheme for large external files. The scheme guarantees retrieval of any record in a single disk access.
M. Ramakrishna, P. Larson
semanticscholar +1 more source
A Survey of Hashing Techniques for High Performance Computing [PDF]
, 2016 Hashing is a well-known and widely used technique for providing O(1) access to large files on secondary storage and tables in memory. Hashing techniques were introduced in the early 60s.
, G M Sridevi, M V Ramakrishna
core +2 more sources