araştırma dizini · static table

perfect_hashing

1980'den 2024'e minimal perfect hashing literatürünün kronolojik izleği. Cichelli'nin ilk denemesinden FKS, CHM, BDZ, RecSplit, PTHash ve ShockHash'e — 44 yılın en etkili 30 makalesinin Türkçeye çevrilmiş sürümleri. On yıllara bölünmüş statik bir dizin.

keys

dönem

1980–2024

buckets

collisions

$ tree perfect_hashing/ --groupby=decade

perfect_hashing/

├── bucket[1980s] · 5 kayıt

│ ├── [00] 1980 Minimal Perfect Hash Functions Made SimpleR. J. Cichelli #6AA │ ├── [01] 1984 Storing a Sparse Table with O(1) Worst-Case Access TimeFredman, Komlós, Szemerédi (FKS) #C7C │ ├── [02] 1986 Finding Minimal Perfect Hash FunctionsT. J. Sager #18A │ ├── [03] 1987 A Versatile Graph Structure for Edge-Oriented Graph AlgorithmsJ. Ebert #B66 │ └── [04] 1989 An Informal Analysis of Perfect Hash Function SearchG. Jaeschke et al. #5DF

├── bucket[1990s] · 6 kayıt

│ ├── [05] 1990 gperf — A Perfect Hash Function GeneratorDouglas C. Schmidt #7C8 │ ├── [06] 1992 An Optimal Algorithm for Generating Minimal Perfect Hash FunctionsCzech, Havas, Majewski (CHM) #940 │ ├── [07] 1994 Graph-Theoretic Obstacles to Perfect HashingCzech, Majewski #A81 │ ├── [08] 1994 Graphs, Hypergraphs and HashingMajewski, Wormald, Havas, Czech #D27 │ ├── [09] 1996 A Family of Perfect Hashing MethodsMajewski, Czech, Havas, Wormald #467 │ └── [10] 1999 Hash and Displace: Efficient Evaluation of Minimum Perfect Hash FunctionsRasmus Pagh #6F2

├── bucket[2000s] · 6 kayıt

│ ├── [11] 2004 The Bloomier Filter: An Efficient Data Structure for Static Support Lookup TablesChazelle, Kilian, Rubinfeld, Tal #051 │ ├── [12] 2005 A Practical Minimal Perfect Hashing MethodBotelho, Kohayakawa, Ziviani #F8A │ ├── [13] 2006 An Approach for Minimal Perfect Hash Functions for Very Large DatabasesBotelho, Pagh, Ziviani #3F3 │ ├── [14] 2007 Balanced Families of Perfect Hash Functions and Their ApplicationsAlon, Gutner #BB4 │ ├── [15] 2007 Simple and Space-Efficient Minimal Perfect Hash FunctionsBotelho, Pagh, Ziviani (BPZ) #AA7 │ └── [16] 2009 Hash, Displace, and CompressBelazzougui, Botelho, Dietzfelbinger, Fischer #0BC

├── bucket[2010s] · 9 kayıt

│ ├── [17] 2010 Perfect Hash Families in Polynomial Time (slides)— #564 │ ├── [18] 2013 Cache-Oblivious Peeling of Random HypergraphsBelazzougui, Boldi, Ottaviano, Venturini, Vigna #04D │ ├── [19] 2014 Monotone Minimal Perfect Hashing: Searching a Sorted Table with O(1) AccessesBelazzougui, Boldi, Pagh, Vigna #C6F │ ├── [20] 2016 Fast Scalable Construction of Minimal Perfect Hash Functions (v2)Limasset, Rizk, Chikhi #C8E │ ├── [21] 2016 Fast Scalable Construction of Minimal Perfect Hash FunctionsLimasset, Rizk, Chikhi #DE6 │ ├── [22] 2017 Fast and Scalable Minimal Perfect Hashing for Massive Key Sets (BBHash)Limasset, Rizk, Chikhi #B6A │ ├── [23] 2018 Efficient Hashing with Lookups in Two Memory AccessesAzar, Broder, Karlin, Upfal #7BD │ ├── [24] 2019 Constructing Minimal Perfect Hash Functions Using SAT TechnologyWeaver, Heule #AF7 │ └── [25] 2019 RecSplit: Minimal Perfect Hashing via Recursive SplittingEsposito, Graf, Vigna #191

└── bucket[2020s] · 4 kayıt

├── [26] 2021 PTHash: Revisiting FCH Minimal Perfect HashingPibiri, Trani #48A ├── [27] 2022 An Efficient Parallel Implementation of a Perfect Hashing Method for HypergraphsSingh, Ucar #BE6 ├── [28] 2022 Perfect Hash Function Generation on the GPU with RecSplitLehmann, Sanders, Walzer #70F └── [29] 2024 ShockHash: Near-Optimal Space Minimal Perfect Hashing Beyond Brute ForceLehmann, Sanders, Walzer #77E

[NN] global dizin YYYY yayın yılı #XXX fnv1a(slug) ├── ağaç kenarı