Results 91 to 100 of about 643,283 (231)

The Usefulness of Multilevel Hash Tables with Multiple Hash Functions in Large Databases [PDF]

, 2009
In this work, attempt is made to select three good hash functions which uniformly distribute hash values that permute their internal states and allow the input bits to generate different output bits.
Akinwale, A. T., Ibharalu, F. T.
core   +1 more source

Finding succinct ordered minimal perfect hashing functions [PDF]

, 1992
An ordered minimal perfect hash table is one in which no collisions occur among a predefined set of keys, no space is unused, and the data are placed in the table in order. A new method for creating ordered minimal perfect hashing functions is presented.
Hirschberg, Daniel S., Seiden, Steven S.
core  

Cache-Oblivious Peeling of Random Hypergraphs

, 2013
The computation of a peeling order in a randomly generated hypergraph is the most time-consuming step in a number of constructions, such as perfect hashing schemes, random $r$-SAT solvers, error-correcting codes, and approximate set encodings.
Belazzougui, Djamal, Boldi, Paolo, Ottaviano, Giuseppe, Venturini, Rossano, Vigna, Sebastiano   +4 more
core   +1 more source

The use of reduction filters in distributed query optimization [PDF]

, 1998
A major issue that affects the performance of a distributed database management system is the optimal processing of a query involving data from several sites. The problem of distributed query processing is to determine a sequence of operations, called an
Osborn, Wendy Kathleen
core   +1 more source

RecSplit: Minimal Perfect Hashing via Recursive Splitting [PDF]

arXiv, 2019
A minimal perfect hash function bijectively maps a key set $S$ out of a universe $U$ into the first $|S|$ natural numbers. Minimal perfect hash functions are used, for example, to map irregularly-shaped keys, such as string, in a compact space so that metadata can then be simply stored in an array.
arxiv  

Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing

, 2023
A minimal perfect hash function (MPHF) maps a set of n keys to the first n integers without collisions. Representing this bijection needs at least $\log_2(e) \approx 1.443$ bits per key, and there is a wide range of practical implementations achieving ...
Lehmann, Hans-Peter, Sanders, Peter, Walzer, Stefan   +2 more
core  

On perfect hashing of numbers with sparse digit representation via multiplication by a constant [PDF]

arXiv, 2010
Consider the set of vectors over a field having non-zero coefficients only in a fixed sparse set and multiplication defined by convolution, or the set of integers having non-zero digits (in some base $b$) in a fixed sparse set. We show the existence of an optimal (resp.
arxiv  

Variants of Constrained Longest Common Subsequence

, 2009
In this work, we consider a variant of the classical Longest Common Subsequence problem called Doubly-Constrained Longest Common Subsequence (DC-LCS).
Adi, Alon, Apostolico, Apostolico, Apostolico, Arslan, Bergroth, Bonizzoni, Chin, Cormen, Downey, Fernandes, Gianluca Della Vedova, Gotthilf, Jiang, Maier, Paola Bonizzoni, Pietrzak, Riccardo Dondi, Räihä, Sankoff, Schmidt, Tsai, Yuri Pirola   +23 more
core   +1 more source

Governing the Algorithmic City

Philosophy &Public Affairs, Volume 53, Issue 2, Page 102-168, Spring 2025.
Seth Lazar
wiley   +1 more source

Quantum hashing based on symmetric groups [PDF]

arXiv, 2016
The notion of quantum hashing formalized by F. Ablayev and A. Vasiliev in 2013. F. Ablayev and M. Ablayev in 2014 introduced the notion of quantum hash generator which is convenient technical tool for constructing quantum hash func- tions. M. Ziatdinov in 2014 presented group approach for constructing quantum hash functions.
arxiv